↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SWW429-1 : TPTP v9.3.1. Released v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n017.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 03:10:30 PM UTC 2026

% Result   : Unsatisfiable 9.03s 6.89s
% Output   : CNFRefutation 9.03s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   23
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   63 (  32 unt;  28 nHn;  57 RR)
%            Number of literals    :  108 (  76 equ;  27 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :   13 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   13 (  13 usr;  11 con; 0-2 aty)
%            Number of variables   :   80 (  15 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(wellformedness_5,axiom,
    ( ~ heap(sep(lseg(X1,X2),sep(lseg(X1,X3),X4)))
    | X1 = X3
    | X1 = X2 ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV013-0.ax',wellformedness_5) ).

cnf(premise_6,hypothesis,
    heap(sep(lseg(x5,x1),sep(lseg(x7,x12),sep(lseg(x7,x8),sep(lseg(x3,x5),sep(lseg(x3,x12),sep(lseg(x4,x12),sep(lseg(x4,x7),sep(lseg(x1,x6),sep(lseg(x6,x9),sep(lseg(x6,x7),sep(lseg(x8,x11),emp)))))))))))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',premise_6) ).

cnf(associative_commutative,axiom,
    sep(X1,sep(X2,X3)) = sep(X2,sep(X1,X3)),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV013-0.ax',associative_commutative) ).

cnf(normalization,axiom,
    sep(lseg(X1,X1),X2) = X2,
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV013-0.ax',normalization) ).

cnf(premise_1,hypothesis,
    x4 != x7,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',premise_1) ).

cnf(unfolding_5,axiom,
    ( ~ heap(sep(lseg(X1,X2),sep(lseg(X2,X3),sep(lseg(X3,X4),X5))))
    | heap(sep(lseg(X1,X3),sep(lseg(X3,X4),X5)))
    | X3 = X4 ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV013-0.ax',unfolding_5) ).

cnf(premise_3,hypothesis,
    x3 != x8,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',premise_3) ).

cnf(premise_5,hypothesis,
    x5 != x9,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',premise_5) ).

cnf(c_0_8,plain,
    ( ~ heap(sep(lseg(X1,X2),sep(lseg(X1,X3),X4)))
    | X1 = X3
    | X1 = X2 ),
    inference(fof_simplification,[status(thm)],[wellformedness_5]) ).

cnf(c_0_9,hypothesis,
    heap(sep(lseg(x5,x1),sep(lseg(x7,x12),sep(lseg(x7,x8),sep(lseg(x3,x5),sep(lseg(x3,x12),sep(lseg(x4,x12),sep(lseg(x4,x7),sep(lseg(x1,x6),sep(lseg(x6,x9),sep(lseg(x6,x7),sep(lseg(x8,x11),emp)))))))))))),
    premise_6 ).

cnf(c_0_10,axiom,
    sep(X1,sep(X2,X3)) = sep(X2,sep(X1,X3)),
    associative_commutative ).

cnf(c_0_11,plain,
    ( ~ heap(sep(lseg(X1,X2),sep(lseg(X1,X3),X4)))
    | X1 = X3
    | X1 = X2 ),
    c_0_8 ).

cnf(c_0_12,hypothesis,
    heap(sep(lseg(x7,x12),sep(lseg(x7,x8),sep(lseg(x4,x7),sep(lseg(x4,x12),sep(lseg(x5,x1),sep(lseg(x8,x11),sep(lseg(x3,x5),sep(lseg(x3,x12),sep(lseg(x6,x7),sep(lseg(x6,x9),sep(lseg(x1,x6),emp)))))))))))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]) ).

cnf(c_0_13,hypothesis,
    ( x12 = x7
    | x8 = x7 ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_14,axiom,
    sep(lseg(X1,X1),X2) = X2,
    normalization ).

cnf(c_0_15,hypothesis,
    ( heap(sep(lseg(x7,x12),sep(lseg(x7,x11),sep(lseg(x4,x7),sep(lseg(x4,x12),sep(lseg(x5,x1),sep(lseg(x3,x5),sep(lseg(x3,x12),sep(lseg(x6,x7),sep(lseg(x6,x9),sep(lseg(x1,x6),emp)))))))))))
    | x12 = x7 ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_10]),c_0_10]),c_0_10]) ).

cnf(c_0_16,plain,
    sep(X1,sep(X2,sep(X3,X4))) = sep(X3,sep(X1,sep(X2,X4))),
    inference(spm,[status(thm)],[c_0_10,c_0_10]) ).

cnf(c_0_17,hypothesis,
    ( x12 = x7
    | x11 = x7 ),
    inference(spm,[status(thm)],[c_0_11,c_0_15]) ).

cnf(c_0_18,hypothesis,
    x4 != x7,
    inference(fof_simplification,[status(thm)],[premise_1]) ).

cnf(c_0_19,plain,
    ( ~ heap(sep(X4,sep(lseg(X1,X3),sep(lseg(X1,X2),X5))))
    | X1 = X3
    | X1 = X2 ),
    inference(spm,[status(thm)],[c_0_11,c_0_16]) ).

cnf(c_0_20,hypothesis,
    ( heap(sep(lseg(x7,x12),sep(lseg(x4,x7),sep(lseg(x4,x12),sep(lseg(x5,x1),sep(lseg(x3,x5),sep(lseg(x3,x12),sep(lseg(x6,x7),sep(lseg(x6,x9),sep(lseg(x1,x6),emp))))))))))
    | x12 = x7 ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_17]),c_0_14]) ).

cnf(c_0_21,hypothesis,
    x4 != x7,
    c_0_18 ).

cnf(c_0_22,hypothesis,
    ( x12 = x4
    | x12 = x7 ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).

cnf(c_0_23,plain,
    ( ~ heap(sep(X4,sep(X5,sep(lseg(X1,X2),sep(lseg(X1,X3),X6)))))
    | X1 = X3
    | X1 = X2 ),
    inference(spm,[status(thm)],[c_0_19,c_0_16]) ).

cnf(c_0_24,plain,
    ( ~ heap(sep(lseg(X1,X2),sep(lseg(X2,X3),sep(lseg(X3,X4),X5))))
    | heap(sep(lseg(X1,X3),sep(lseg(X3,X4),X5)))
    | X3 = X4 ),
    inference(fof_simplification,[status(thm)],[unfolding_5]) ).

cnf(c_0_25,plain,
    ( ~ heap(sep(X4,sep(lseg(X1,X2),sep(X5,sep(lseg(X1,X3),X6)))))
    | X1 = X3
    | X1 = X2 ),
    inference(spm,[status(thm)],[c_0_19,c_0_10]) ).

cnf(c_0_26,plain,
    sep(X1,sep(X2,sep(X3,sep(X4,X5)))) = sep(X3,sep(X2,sep(X4,sep(X1,X5)))),
    inference(spm,[status(thm)],[c_0_16,c_0_16]) ).

cnf(c_0_27,hypothesis,
    ( heap(sep(lseg(x7,x4),sep(lseg(x4,x7),sep(lseg(x5,x1),sep(lseg(x3,x4),sep(lseg(x3,x5),sep(lseg(x6,x7),sep(lseg(x6,x9),sep(lseg(x1,x6),emp)))))))))
    | x12 = x7 ),
    inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_22]),c_0_14]),c_0_21]),c_0_10]) ).

cnf(c_0_28,hypothesis,
    x12 = x4,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_12]),c_0_21]) ).

cnf(c_0_29,plain,
    ( ~ heap(sep(lseg(X1,X2),sep(lseg(X2,X3),sep(lseg(X3,X4),X5))))
    | heap(sep(lseg(X1,X3),sep(lseg(X3,X4),X5)))
    | X3 = X4 ),
    c_0_24 ).

cnf(c_0_30,plain,
    ( ~ heap(sep(X4,sep(X5,sep(X6,sep(lseg(X1,X3),sep(lseg(X1,X2),X7))))))
    | X1 = X3
    | X1 = X2 ),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_31,hypothesis,
    heap(sep(lseg(x7,x4),sep(lseg(x4,x7),sep(lseg(x5,x1),sep(lseg(x3,x4),sep(lseg(x3,x5),sep(lseg(x6,x7),sep(lseg(x6,x9),sep(lseg(x1,x6),emp))))))))),
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28]),c_0_21]) ).

cnf(c_0_32,plain,
    ( ~ heap(sep(lseg(X3,X5),sep(lseg(X1,X2),sep(lseg(X5,X1),X4))))
    | heap(sep(lseg(X3,X1),sep(lseg(X1,X2),X4)))
    | X1 = X2 ),
    inference(spm,[status(thm)],[c_0_29,c_0_10]) ).

cnf(c_0_33,hypothesis,
    ( x3 = x5
    | x3 = x4 ),
    inference(spm,[status(thm)],[c_0_30,c_0_31]) ).

cnf(c_0_34,hypothesis,
    x8 = x7,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_28]),c_0_21]) ).

cnf(c_0_35,hypothesis,
    x11 = x7,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_28]),c_0_21]) ).

cnf(c_0_36,hypothesis,
    x3 != x8,
    inference(fof_simplification,[status(thm)],[premise_3]) ).

cnf(c_0_37,plain,
    ( ~ heap(sep(lseg(X1,X2),sep(lseg(X5,X1),sep(lseg(X3,X5),X4))))
    | heap(sep(lseg(X3,X1),sep(lseg(X1,X2),X4)))
    | X1 = X2 ),
    inference(spm,[status(thm)],[c_0_32,c_0_16]) ).

cnf(c_0_38,hypothesis,
    ( heap(sep(lseg(x7,x4),sep(lseg(x4,x7),sep(lseg(x5,x4),sep(lseg(x5,x1),sep(lseg(x6,x7),sep(lseg(x6,x9),sep(lseg(x1,x6),emp))))))))
    | x3 = x4 ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_33]),c_0_28]),c_0_34]),c_0_28]),c_0_34]),c_0_35]),c_0_28]),c_0_14]),c_0_14]),c_0_14]),c_0_14]),c_0_10]) ).

cnf(c_0_39,hypothesis,
    ( x5 != x4
    | x3 = x4 ),
    inference(ef,[status(thm)],[c_0_33]) ).

cnf(c_0_40,hypothesis,
    x3 != x8,
    c_0_36 ).

cnf(c_0_41,hypothesis,
    x5 != x9,
    inference(fof_simplification,[status(thm)],[premise_5]) ).

cnf(c_0_42,hypothesis,
    ( heap(sep(lseg(x7,x4),sep(lseg(x5,x7),sep(lseg(x5,x1),sep(lseg(x6,x7),sep(lseg(x6,x9),sep(lseg(x1,x6),emp)))))))
    | x3 = x4 ),
    inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_21]),c_0_10]) ).

cnf(c_0_43,hypothesis,
    ( x1 = x5
    | x3 = x4 ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_38]),c_0_39]) ).

cnf(c_0_44,hypothesis,
    x3 != x7,
    inference(rw,[status(thm)],[c_0_40,c_0_34]) ).

cnf(c_0_45,hypothesis,
    x5 != x9,
    c_0_41 ).

cnf(c_0_46,hypothesis,
    ( x9 = x6
    | x6 = x7
    | x3 = x4 ),
    inference(spm,[status(thm)],[c_0_30,c_0_42]) ).

cnf(c_0_47,hypothesis,
    ( heap(sep(lseg(x7,x4),sep(lseg(x5,x7),sep(lseg(x5,x6),sep(lseg(x6,x7),sep(lseg(x6,x9),emp))))))
    | x3 = x4 ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_14]),c_0_10]),c_0_10]) ).

cnf(c_0_48,hypothesis,
    ( x5 != x7
    | x3 = x4 ),
    inference(spm,[status(thm)],[c_0_44,c_0_33]) ).

cnf(c_0_49,hypothesis,
    ( x6 != x5
    | x3 = x4
    | x6 = x7 ),
    inference(spm,[status(thm)],[c_0_45,c_0_46]) ).

cnf(c_0_50,hypothesis,
    ( x6 = x5
    | x3 = x4 ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_47]),c_0_48]) ).

cnf(c_0_51,hypothesis,
    x3 = x4,
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_48]) ).

cnf(c_0_52,hypothesis,
    heap(sep(lseg(x7,x4),sep(lseg(x4,x7),sep(lseg(x4,x5),sep(lseg(x5,x1),sep(lseg(x6,x7),sep(lseg(x6,x9),sep(lseg(x1,x6),emp)))))))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_51]),c_0_28]),c_0_34]),c_0_28]),c_0_34]),c_0_35]),c_0_28]),c_0_14]),c_0_14]),c_0_14]),c_0_14]),c_0_10]) ).

cnf(c_0_53,hypothesis,
    x5 = x4,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_52]),c_0_21]) ).

cnf(c_0_54,hypothesis,
    heap(sep(lseg(x7,x4),sep(lseg(x4,x7),sep(lseg(x4,x1),sep(lseg(x6,x7),sep(lseg(x6,x9),sep(lseg(x1,x6),emp))))))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_53]),c_0_28]),c_0_34]),c_0_28]),c_0_34]),c_0_35]),c_0_51]),c_0_51]),c_0_28]),c_0_14]),c_0_14]),c_0_14]),c_0_14]),c_0_14]) ).

cnf(c_0_55,hypothesis,
    ( x9 = x6
    | x6 = x7 ),
    inference(spm,[status(thm)],[c_0_30,c_0_54]) ).

cnf(c_0_56,hypothesis,
    x1 = x4,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_54]),c_0_21]) ).

cnf(c_0_57,hypothesis,
    x9 != x4,
    inference(rw,[status(thm)],[c_0_45,c_0_53]) ).

cnf(c_0_58,hypothesis,
    ( heap(sep(lseg(x7,x4),sep(lseg(x4,x7),sep(lseg(x4,x6),sep(lseg(x6,x7),emp)))))
    | x6 = x7 ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_55]),c_0_28]),c_0_34]),c_0_28]),c_0_53]),c_0_56]),c_0_34]),c_0_35]),c_0_51]),c_0_53]),c_0_51]),c_0_28]),c_0_14]),c_0_56]),c_0_14]),c_0_14]),c_0_14]),c_0_14]),c_0_14]),c_0_14]),c_0_10]) ).

cnf(c_0_59,hypothesis,
    ( x6 != x4
    | x6 = x7 ),
    inference(spm,[status(thm)],[c_0_57,c_0_55]) ).

cnf(c_0_60,hypothesis,
    x6 = x7,
    inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_58]),c_0_21]),c_0_59]) ).

cnf(c_0_61,hypothesis,
    heap(sep(lseg(x7,x4),sep(lseg(x7,x9),sep(lseg(x4,x7),sep(lseg(x4,x7),emp))))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_60]),c_0_28]),c_0_34]),c_0_28]),c_0_53]),c_0_56]),c_0_34]),c_0_35]),c_0_51]),c_0_53]),c_0_51]),c_0_28]),c_0_56]),c_0_14]),c_0_14]),c_0_14]),c_0_14]),c_0_14]),c_0_14]),c_0_14]),c_0_10]) ).

cnf(c_0_62,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_61]),c_0_21]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SWW429-1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.07  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/5.44  % Computer : n017.cluster.edu
% 0.17/5.44  % Model    : x86_64 x86_64
% 0.17/5.44  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/5.44  % Memory   : 8046.5625MB
% 0.17/5.44  % OS       : Linux 6.8.0-71-generic
% 0.17/5.44  % CPULimit : 300
% 0.17/5.44  % WCLimit  : 300
% 0.17/5.44  % DateTime : Mon Sep 21 09:47:32 UTC 2026
% 0.17/5.44  % CPUTime  : 
% 0.17/5.44  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/5.49  Running first-order theorem proving
% 0.17/5.49  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.03/6.89  % Version: 3.5.1
% 9.03/6.89  % Preprocessing class: FSMSSMSMSSSNFFN.
% 9.03/6.89  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 9.03/6.89  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 9.03/6.89  % Starting new_bool_3 with 300s (1) cores
% 9.03/6.89  % Starting new_bool_1 with 300s (1) cores
% 9.03/6.89  % Starting sh5l with 300s (1) cores
% 9.03/6.89  % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 2027122 completed with status 0
% 9.03/6.89  % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 9.03/6.89  % Preprocessing class: FSMSSMSMSSSNFFN.
% 9.03/6.89  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 9.03/6.89  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 9.03/6.89  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 9.03/6.89  % No SInE strategy applied
% 9.03/6.89  % Search class: FGUSS-FFMF22-DFFFFFNN
% 9.03/6.89  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 9.03/6.89  % Starting SubtermCWHack with 136s (1) cores
% 9.03/6.89  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 9.03/6.89  % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 303s (1) cores
% 9.03/6.89  % Starting new_bool_3 with 298s (1) cores
% 9.03/6.89  % Starting new_bool_1 with 291s (1) cores
% 9.03/6.89  % G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with pid 2027130 completed with status 0
% 9.03/6.89  % Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN
% 9.03/6.89  % Preprocessing class: FSMSSMSMSSSNFFN.
% 9.03/6.89  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 9.03/6.89  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 9.03/6.89  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 9.03/6.89  % No SInE strategy applied
% 9.03/6.89  % Search class: FGUSS-FFMF22-DFFFFFNN
% 9.03/6.89  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 9.03/6.89  % Starting SubtermCWHack with 136s (1) cores
% 9.03/6.89  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 9.03/6.89  % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 303s (1) cores
% 9.03/6.89  % Preprocessing time       : 0.002 s
% 9.03/6.89  
% 9.03/6.89  % Proof found!
% 9.03/6.89  % SZS status Unsatisfiable
% 9.03/6.89  % SZS output start CNFRefutation
% See solution above
% 9.03/6.89  % Parsed axioms                        : 18
% 9.03/6.89  % Removed by relevancy pruning/SinE    : 0
% 9.03/6.89  % Initial clauses                      : 18
% 9.03/6.89  % Removed in clause preprocessing      : 1
% 9.03/6.89  % Initial clauses in saturation        : 17
% 9.03/6.89  % Processed clauses                    : 2768
% 9.03/6.89  % ...of these trivial                  : 20
% 9.03/6.89  % ...subsumed                          : 2465
% 9.03/6.89  % ...remaining for further processing  : 283
% 9.03/6.89  % Other redundant clauses eliminated   : 22
% 9.03/6.89  % Clauses deleted for lack of memory   : 0
% 9.03/6.89  % Backward-subsumed                    : 2
% 9.03/6.89  % Backward-rewritten                   : 25
% 9.03/6.89  % Generated clauses                    : 35638
% 9.03/6.89  % ...of the previous two non-redundant : 35454
% 9.03/6.89  % ...aggressively subsumed             : 0
% 9.03/6.89  % Contextual simplify-reflections      : 4
% 9.03/6.89  % Paramodulations                      : 35526
% 9.03/6.89  % Factorizations                       : 90
% 9.03/6.89  % NegExts                              : 0
% 9.03/6.89  % Equation resolutions                 : 22
% 9.03/6.89  % Disequality decompositions           : 0
% 9.03/6.89  % Total rewrite steps                  : 947
% 9.03/6.89  % ...of those cached                   : 631
% 9.03/6.89  % Propositional unsat checks           : 0
% 9.03/6.89  %    Propositional check models        : 0
% 9.03/6.89  %    Propositional check unsatisfiable : 0
% 9.03/6.89  %    Propositional clauses             : 0
% 9.03/6.89  %    Propositional clauses after purity: 0
% 9.03/6.89  %    Propositional unsat core size     : 0
% 9.03/6.89  %    Propositional preprocessing time  : 0.000
% 9.03/6.89  %    Propositional encoding time       : 0.000
% 9.03/6.89  %    Propositional solver time         : 0.000
% 9.03/6.89  %    Success case prop preproc time    : 0.000
% 9.03/6.89  %    Success case prop encoding time   : 0.000
% 9.03/6.89  %    Success case prop solver time     : 0.000
% 9.03/6.89  % Current number of processed clauses  : 256
% 9.03/6.89  %    Positive orientable unit clauses  : 13
% 9.03/6.89  %    Positive unorientable unit clauses: 13
% 9.03/6.89  %    Negative unit clauses             : 37
% 9.03/6.89  %    Non-unit-clauses                  : 193
% 9.03/6.89  % Current number of unprocessed clauses: 32682
% 9.03/6.89  % ...number of literals in the above   : 79665
% 9.03/6.89  % Current number of archived formulas  : 0
% 9.03/6.89  % Current number of archived clauses   : 27
% 9.03/6.89  % Clause-clause subsumption calls (NU) : 20785
% 9.03/6.89  % Rec. Clause-clause subsumption calls : 20782
% 9.03/6.89  % Non-unit clause-clause subsumptions  : 843
% 9.03/6.89  % Unit Clause-clause subsumption calls : 479
% 9.03/6.89  % Rewrite failures with RHS unbound    : 0
% 9.03/6.89  % BW rewrite match attempts            : 2373
% 9.03/6.89  % BW rewrite match successes           : 895
% 9.03/6.89  % Condensation attempts                : 0
% 9.03/6.89  % Condensation successes               : 0
% 9.03/6.89  % Termbank termtop insertions          : 585868
% 9.03/6.89  % Search garbage collected termcells   : 38
% 9.03/6.89  
% 9.03/6.89  % -------------------------------------------------
% 9.03/6.89  % User time                : 1.226 s
% 9.03/6.89  % System time              : 0.057 s
% 9.03/6.89  % Total time               : 1.283 s
% 9.03/6.89  % Maximum resident set size: 3664 pages
% 9.03/6.89  
% 9.03/6.89  % -------------------------------------------------
% 9.03/6.89  % User time                : 5.581 s
% 9.03/6.89  % System time              : 0.201 s
% 9.03/6.89  % Total time               : 5.782 s
% 9.03/6.89  % Maximum resident set size: 4864 pages
% 9.03/6.89  % E exiting
%------------------------------------------------------------------------------