%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC418+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n011.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 02:44:20 PM UTC 2026
% Result : Theorem 0.61s 0.51s
% Output : CNFRefutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 11
% Syntax : Number of formulae : 63 ( 13 unt; 0 def)
% Number of atoms : 295 ( 109 equ)
% Maximal formula atoms : 26 ( 4 avg)
% Number of connectives : 379 ( 147 ~; 136 |; 58 &)
% ( 2 <=>; 36 =>; 0 <=; 0 <~>)
% Maximal formula depth : 30 ( 6 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 102 ( 0 sgn 50 !; 21 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( neq(X4,nil)
& ? [X8] :
( ? [X9] :
( ? [X10] :
( neq(nil,X4)
& ? [X11] :
( neq(nil,X4)
& hd(X4) = X11
& cons(X11,nil) = X10
& ssItem(X11) )
& app(X9,X10) = X8
& tl(X4) = X9
& ssList(X10) )
& ssList(X9) )
& X3 != X8
& ssList(X8) ) )
| ( nil = X4
& nil != X3 )
| ? [X5] :
( ? [X6] :
( ? [X7] :
( app(app(X7,cons(X5,nil)),X6) = X1
& app(app(X6,cons(X5,nil)),X7) = X2
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
| ~ neq(X2,nil)
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(ax78,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax78) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax24,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax24) ).
fof(ax22,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax22) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(c_0_11,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( neq(X4,nil)
& ? [X8] :
( ? [X9] :
( ? [X10] :
( neq(nil,X4)
& ? [X11] :
( neq(nil,X4)
& hd(X4) = X11
& cons(X11,nil) = X10
& ssItem(X11) )
& app(X9,X10) = X8
& tl(X4) = X9
& ssList(X10) )
& ssList(X9) )
& X3 != X8
& ssList(X8) ) )
| ( nil = X4
& nil != X3 )
| ? [X5] :
( ? [X6] :
( ? [X7] :
( app(app(X7,cons(X5,nil)),X6) = X1
& app(app(X6,cons(X5,nil)),X7) = X2
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
| ~ neq(X2,nil)
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_12,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( neq(X4,nil)
& ? [X8] :
( ? [X9] :
( ? [X10] :
( neq(nil,X4)
& ? [X11] :
( neq(nil,X4)
& hd(X4) = X11
& cons(X11,nil) = X10
& ssItem(X11) )
& app(X9,X10) = X8
& tl(X4) = X9
& ssList(X10) )
& ssList(X9) )
& X3 != X8
& ssList(X8) ) )
| ( nil = X4
& nil != X3 )
| ? [X5] :
( ? [X6] :
( ? [X7] :
( app(app(X7,cons(X5,nil)),X6) = X1
& app(app(X6,cons(X5,nil)),X7) = X2
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
| ~ neq(X2,nil)
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_13,negated_conjecture,
! [X260,X261,X262,X263,X264,X265,X266] :
( ( ~ neq(esk51_0,nil)
| ~ neq(nil,esk51_0)
| ~ neq(nil,esk51_0)
| hd(esk51_0) != X266
| cons(X266,nil) != X265
| ~ ssItem(X266)
| app(X264,X265) != X263
| tl(esk51_0) != X264
| ~ ssList(X265)
| ~ ssList(X264)
| esk50_0 = X263
| ~ ssList(X263) )
& ( nil != esk51_0
| nil = esk50_0 )
& ( app(app(X262,cons(X260,nil)),X261) != esk48_0
| app(app(X261,cons(X260,nil)),X262) != esk49_0
| ~ ssList(X262)
| ~ ssList(X261)
| ~ ssItem(X260) )
& neq(esk49_0,nil)
& esk48_0 = esk50_0
& esk49_0 = esk51_0
& ssList(esk51_0)
& ssList(esk50_0)
& ssList(esk49_0)
& ssList(esk48_0) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])])]) ).
cnf(c_0_14,negated_conjecture,
( ~ neq(esk51_0,nil)
| ~ neq(nil,esk51_0)
| ~ neq(nil,esk51_0)
| hd(esk51_0) != X4
| cons(X4,nil) != X3
| ~ ssItem(X4)
| app(X2,X3) != X1
| tl(esk51_0) != X2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| esk50_0 = X1 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_15,negated_conjecture,
neq(esk49_0,nil),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_17,plain,
! [X135,X136] :
( ssList(app(X135,X136))
| ~ ssList(X136)
| ~ ssList(X135) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
cnf(c_0_18,negated_conjecture,
( app(app(X3,cons(X1,nil)),X2) != esk48_0
| app(app(X2,cons(X1,nil)),X3) != esk49_0
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,negated_conjecture,
( ~ neq(esk51_0,nil)
| ~ neq(nil,esk51_0)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssItem(X4)
| cons(X4,nil) != X3
| app(X2,X3) != X1
| tl(esk51_0) != X2
| hd(esk51_0) != X4
| esk50_0 = X1 ),
inference(cn,[status(thm)],[c_0_14]) ).
cnf(c_0_21,negated_conjecture,
neq(esk51_0,nil),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,negated_conjecture,
( ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| app(app(X3,cons(X2,nil)),X1) != esk51_0
| app(app(X1,cons(X2,nil)),X3) != esk50_0 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19]),c_0_16]) ).
cnf(c_0_24,negated_conjecture,
( ~ ssItem(hd(esk51_0))
| ~ neq(nil,esk51_0)
| ~ ssList(tl(esk51_0))
| ~ ssList(cons(hd(esk51_0),nil))
| app(tl(esk51_0),cons(hd(esk51_0),nil)) = esk50_0 ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])])])])])]),c_0_22]) ).
fof(c_0_25,plain,
! [X140] :
( app(nil,X140) = X140
| ~ ssList(X140) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
cnf(c_0_26,negated_conjecture,
( ~ ssItem(hd(esk51_0))
| ~ neq(nil,esk51_0)
| ~ ssList(X1)
| ~ ssList(tl(esk51_0))
| ~ ssList(cons(hd(esk51_0),nil))
| app(esk50_0,X1) != esk50_0
| app(app(X1,cons(hd(esk51_0),nil)),tl(esk51_0)) != esk51_0 ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_28,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
fof(c_0_29,plain,
! [X225,X226] :
( cons(X226,X225) = app(cons(X226,nil),X225)
| ~ ssItem(X226)
| ~ ssList(X225) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
fof(c_0_30,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
inference(fof_simplification,[status(thm)],[ax78]) ).
cnf(c_0_31,negated_conjecture,
( ~ ssItem(hd(esk51_0))
| ~ neq(nil,esk51_0)
| ~ ssList(tl(esk51_0))
| ~ ssList(cons(hd(esk51_0),nil))
| app(esk50_0,nil) != esk50_0
| app(cons(hd(esk51_0),nil),tl(esk51_0)) != esk51_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]) ).
cnf(c_0_32,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| cons(X2,X1) = app(cons(X2,nil),X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
fof(c_0_33,plain,
! [X218] :
( cons(hd(X218),tl(X218)) = X218
| nil = X218
| ~ ssList(X218) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_30])])]) ).
cnf(c_0_34,negated_conjecture,
ssList(esk49_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_35,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
cnf(c_0_36,negated_conjecture,
( ~ ssItem(hd(esk51_0))
| ~ neq(nil,esk51_0)
| ~ ssList(tl(esk51_0))
| ~ ssList(cons(hd(esk51_0),nil))
| app(esk50_0,nil) != esk50_0
| cons(hd(esk51_0),tl(esk51_0)) != esk51_0 ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,plain,
( ~ ssList(X1)
| cons(hd(X1),tl(X1)) = X1
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_38,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_34,c_0_16]) ).
fof(c_0_39,plain,
! [X114,X115] :
( ( ~ ssList(X114)
| ~ ssList(X115)
| neq(X114,X115)
| X114 = X115 )
& ( ~ ssList(X114)
| ~ ssList(X115)
| X114 != X115
| ~ neq(X114,X115) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_35])])])])]) ).
cnf(c_0_40,negated_conjecture,
( ~ ssItem(hd(esk51_0))
| ~ neq(nil,esk51_0)
| ~ ssList(tl(esk51_0))
| ~ ssList(cons(hd(esk51_0),nil))
| app(esk50_0,nil) != esk50_0
| esk51_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38])]) ).
cnf(c_0_41,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| neq(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
fof(c_0_42,plain,
! [X116,X117] :
( ssList(cons(X117,X116))
| ~ ssItem(X117)
| ~ ssList(X116) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
fof(c_0_43,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
inference(fof_simplification,[status(thm)],[ax24]) ).
cnf(c_0_44,negated_conjecture,
( ~ ssItem(hd(esk51_0))
| ~ ssList(tl(esk51_0))
| ~ ssList(cons(hd(esk51_0),nil))
| app(esk50_0,nil) != esk50_0
| esk51_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_38]),c_0_28])]) ).
cnf(c_0_45,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ssList(cons(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
fof(c_0_46,plain,
! [X132] :
( ssList(tl(X132))
| nil = X132
| ~ ssList(X132) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_43])])]) ).
fof(c_0_47,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
inference(fof_simplification,[status(thm)],[ax22]) ).
cnf(c_0_48,negated_conjecture,
( ~ ssItem(hd(esk51_0))
| ~ ssList(tl(esk51_0))
| app(esk50_0,nil) != esk50_0
| esk51_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_28])]) ).
cnf(c_0_49,plain,
( ~ ssList(X1)
| ssList(tl(X1))
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
fof(c_0_50,plain,
! [X129] :
( ssItem(hd(X129))
| nil = X129
| ~ ssList(X129) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_47])])]) ).
cnf(c_0_51,negated_conjecture,
( ~ ssItem(hd(esk51_0))
| app(esk50_0,nil) != esk50_0
| esk51_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_38])]) ).
cnf(c_0_52,plain,
( ~ ssList(X1)
| ssItem(hd(X1))
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
fof(c_0_53,plain,
! [X232] :
( app(X232,nil) = X232
| ~ ssList(X232) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])])]) ).
cnf(c_0_54,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_55,negated_conjecture,
( app(esk50_0,nil) != esk50_0
| esk51_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_38])]) ).
cnf(c_0_56,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_57,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_54,c_0_19]) ).
cnf(c_0_58,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| X1 != X2
| ~ neq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_59,negated_conjecture,
esk51_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57])]) ).
cnf(c_0_60,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_58]) ).
cnf(c_0_61,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[c_0_21,c_0_59]) ).
cnf(c_0_62,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC418+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n011.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 08:23:10 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.40 Running first-order theorem proving
% 0.09/0.40 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.61/0.51 % Version: 3.5.1
% 0.61/0.51 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.61/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.61/0.51 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.61/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.61/0.51 % Starting new_bool_1 with 300s (1) cores
% 0.61/0.51 % Starting sh5l with 300s (1) cores
% 0.61/0.51 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1449299 completed with status 0
% 0.61/0.51 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.61/0.51 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.61/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.61/0.51 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.61/0.51 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.61/0.51 % No SInE strategy applied
% 0.61/0.51 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.61/0.51 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.61/0.51 % Starting SubtermCWHack with 136s (1) cores
% 0.61/0.51 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.61/0.51 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 0.61/0.51 % Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.61/0.51 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.61/0.51 % G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with pid 1449309 completed with status 0
% 0.61/0.51 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y
% 0.61/0.51 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.61/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.61/0.51 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.61/0.51 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.61/0.51 % No SInE strategy applied
% 0.61/0.51 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.61/0.51 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.61/0.51 % Starting SubtermCWHack with 136s (1) cores
% 0.61/0.51 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.61/0.51 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 0.61/0.51 % Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.61/0.51 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.61/0.51 % Preprocessing time : 0.002 s
% 0.61/0.51 % Presaturation interreduction done
% 0.61/0.51
% 0.61/0.51 % Proof found!
% 0.61/0.51 % SZS status Theorem
% 0.61/0.51 % SZS output start CNFRefutation
% See solution above
% 0.61/0.51 % Parsed axioms : 96
% 0.61/0.51 % Removed by relevancy pruning/SinE : 0
% 0.61/0.51 % Initial clauses : 200
% 0.61/0.51 % Removed in clause preprocessing : 2
% 0.61/0.51 % Initial clauses in saturation : 198
% 0.61/0.51 % Processed clauses : 961
% 0.61/0.51 % ...of these trivial : 9
% 0.61/0.51 % ...subsumed : 295
% 0.61/0.51 % ...remaining for further processing : 657
% 0.61/0.51 % Other redundant clauses eliminated : 128
% 0.61/0.51 % Clauses deleted for lack of memory : 0
% 0.61/0.51 % Backward-subsumed : 83
% 0.61/0.51 % Backward-rewritten : 74
% 0.61/0.51 % Generated clauses : 3343
% 0.61/0.51 % ...of the previous two non-redundant : 2855
% 0.61/0.51 % ...aggressively subsumed : 0
% 0.61/0.51 % Contextual simplify-reflections : 102
% 0.61/0.51 % Paramodulations : 3214
% 0.61/0.51 % Factorizations : 0
% 0.61/0.51 % NegExts : 0
% 0.61/0.51 % Equation resolutions : 134
% 0.61/0.51 % Disequality decompositions : 0
% 0.61/0.51 % Total rewrite steps : 1565
% 0.61/0.51 % ...of those cached : 1545
% 0.61/0.51 % Propositional unsat checks : 0
% 0.61/0.51 % Propositional check models : 0
% 0.61/0.51 % Propositional check unsatisfiable : 0
% 0.61/0.51 % Propositional clauses : 0
% 0.61/0.51 % Propositional clauses after purity: 0
% 0.61/0.51 % Propositional unsat core size : 0
% 0.61/0.51 % Propositional preprocessing time : 0.000
% 0.61/0.51 % Propositional encoding time : 0.000
% 0.61/0.51 % Propositional solver time : 0.000
% 0.61/0.51 % Success case prop preproc time : 0.000
% 0.61/0.51 % Success case prop encoding time : 0.000
% 0.61/0.51 % Success case prop solver time : 0.000
% 0.61/0.51 % Current number of processed clauses : 284
% 0.61/0.51 % Positive orientable unit clauses : 21
% 0.61/0.51 % Positive unorientable unit clauses: 0
% 0.61/0.51 % Negative unit clauses : 2
% 0.61/0.51 % Non-unit-clauses : 261
% 0.61/0.51 % Current number of unprocessed clauses: 2222
% 0.61/0.51 % ...number of literals in the above : 17851
% 0.61/0.51 % Current number of archived formulas : 0
% 0.61/0.51 % Current number of archived clauses : 349
% 0.61/0.51 % Clause-clause subsumption calls (NU) : 54668
% 0.61/0.51 % Rec. Clause-clause subsumption calls : 7809
% 0.61/0.51 % Non-unit clause-clause subsumptions : 437
% 0.61/0.51 % Unit Clause-clause subsumption calls : 191
% 0.61/0.51 % Rewrite failures with RHS unbound : 0
% 0.61/0.51 % BW rewrite match attempts : 4
% 0.61/0.51 % BW rewrite match successes : 4
% 0.61/0.51 % Condensation attempts : 0
% 0.61/0.51 % Condensation successes : 0
% 0.61/0.51 % Termbank termtop insertions : 87529
% 0.61/0.51 % Search garbage collected termcells : 4426
% 0.61/0.51
% 0.61/0.51 % -------------------------------------------------
% 0.61/0.51 % User time : 0.085 s
% 0.61/0.51 % System time : 0.007 s
% 0.61/0.51 % Total time : 0.092 s
% 0.61/0.51 % Maximum resident set size: 4276 pages
% 0.61/0.51
% 0.61/0.51 % -------------------------------------------------
% 0.61/0.51 % User time : 0.399 s
% 0.61/0.51 % System time : 0.024 s
% 0.61/0.51 % Total time : 0.423 s
% 0.61/0.51 % Maximum resident set size: 4608 pages
% 0.61/0.51 % E exiting
%------------------------------------------------------------------------------