%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC245+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n026.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:43:37 PM UTC 2026
% Result : Theorem 3.11s 0.95s
% Output : CNFRefutation 3.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 11
% Syntax : Number of formulae : 53 ( 7 unt; 0 def)
% Number of atoms : 298 ( 90 equ)
% Maximal formula atoms : 42 ( 5 avg)
% Number of connectives : 405 ( 160 ~; 159 |; 54 &)
% ( 3 <=>; 29 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-3 aty)
% Number of variables : 127 ( 0 sgn 62 !; 20 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X1
& nil = X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax83) ).
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ( nil = X3
& nil != X4 )
| ! [X9] :
( ? [X10] :
( ? [X11] :
( ? [X12] :
( app(X12,cons(X10,nil)) = X3
& ssList(X12) )
& app(cons(X10,nil),X11) = X9
& ssList(X11) )
& ssItem(X10) )
| ~ equalelemsP(X3)
| app(X3,X9) != X4
| ~ ssList(X9) )
| ? [X5] :
( ? [X6] :
( ? [X7] :
( ! [X8] :
( leq(X5,X8)
| ~ lt(X5,X8)
| ~ memberP(X7,X8)
| ~ memberP(X6,X8)
| ~ ssItem(X8) )
& app(app(X6,cons(X5,nil)),X7) = X1
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
| nil = X1
| X1 != X3
| X2 != X4
| ~ ssList(X4) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax27,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssItem(X3)
=> cons(X3,app(X2,X1)) = app(cons(X3,X2),X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax27) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax93,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
<=> ( leq(X1,X2)
& X1 != X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax93) ).
fof(ax82,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> app(app(X1,X2),X3) = app(X1,app(X2,X3)) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax82) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(ax20,axiom,
! [X1] :
( ssList(X1)
=> ( ? [X2] :
( ? [X3] :
( cons(X3,X2) = X1
& ssItem(X3) )
& ssList(X2) )
| nil = X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax20) ).
fof(c_0_11,plain,
! [X47,X48] :
( ( ~ ssList(X47)
| ~ ssList(X48)
| nil = app(X47,X48)
| nil != X47
| nil != X48 )
& ( ~ ssList(X47)
| ~ ssList(X48)
| nil != app(X47,X48)
| nil = X47 )
& ( ~ ssList(X47)
| ~ ssList(X48)
| nil != app(X47,X48)
| nil = X48 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax83])])])])]) ).
fof(c_0_12,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ( nil = X3
& nil != X4 )
| ! [X9] :
( ? [X10] :
( ? [X11] :
( ? [X12] :
( app(X12,cons(X10,nil)) = X3
& ssList(X12) )
& app(cons(X10,nil),X11) = X9
& ssList(X11) )
& ssItem(X10) )
| ~ equalelemsP(X3)
| app(X3,X9) != X4
| ~ ssList(X9) )
| ? [X5] :
( ? [X6] :
( ? [X7] :
( ! [X8] :
( leq(X5,X8)
| ~ lt(X5,X8)
| ~ memberP(X7,X8)
| ~ memberP(X6,X8)
| ~ ssItem(X8) )
& app(app(X6,cons(X5,nil)),X7) = X1
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
| nil = X1
| X1 != X3
| X2 != X4
| ~ ssList(X4) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_13,plain,
! [X50,X51] :
( ssList(cons(X51,X50))
| ~ ssItem(X51)
| ~ ssList(X50) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
fof(c_0_14,plain,
! [X32,X33,X34] :
( cons(X34,app(X33,X32)) = app(cons(X34,X33),X32)
| ~ ssItem(X34)
| ~ ssList(X33)
| ~ ssList(X32) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax27])])])]) ).
fof(c_0_15,plain,
! [X30,X31] :
( ssList(app(X30,X31))
| ~ ssList(X31)
| ~ ssList(X30) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
cnf(c_0_16,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| nil != X2
| nil != X1
| nil = app(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
fof(c_0_18,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ( nil = X3
& nil != X4 )
| ! [X9] :
( ? [X10] :
( ? [X11] :
( ? [X12] :
( app(X12,cons(X10,nil)) = X3
& ssList(X12) )
& app(cons(X10,nil),X11) = X9
& ssList(X11) )
& ssItem(X10) )
| ~ equalelemsP(X3)
| app(X3,X9) != X4
| ~ ssList(X9) )
| ? [X5] :
( ? [X6] :
( ? [X7] :
( ! [X8] :
( leq(X5,X8)
| ~ lt(X5,X8)
| ~ memberP(X7,X8)
| ~ memberP(X6,X8)
| ~ ssItem(X8) )
& app(app(X6,cons(X5,nil)),X7) = X1
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
| nil = X1
| X1 != X3
| X2 != X4
| ~ ssList(X4) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_12]) ).
fof(c_0_19,plain,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
<=> ( leq(X1,X2)
& X1 != X2 ) ) ) ),
inference(fof_simplification,[status(thm)],[ax93]) ).
fof(c_0_20,plain,
! [X44,X45,X46] :
( app(app(X44,X45),X46) = app(X44,app(X45,X46))
| ~ ssList(X46)
| ~ ssList(X45)
| ~ ssList(X44) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])])]) ).
fof(c_0_21,plain,
! [X35] :
( app(nil,X35) = X35
| ~ ssList(X35) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
cnf(c_0_22,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ssList(cons(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_23,plain,
( ~ ssItem(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| cons(X3,app(X2,X1)) = app(cons(X3,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_24,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_25,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_16])]),c_0_17])]) ).
fof(c_0_26,negated_conjecture,
! [X17,X18,X19,X22,X23,X24] :
( ( nil != esk3_0
| nil = esk4_0 )
& ( app(X24,cons(X22,nil)) != esk3_0
| ~ ssList(X24)
| app(cons(X22,nil),X23) != esk6_0
| ~ ssList(X23)
| ~ ssItem(X22) )
& equalelemsP(esk3_0)
& app(esk3_0,esk6_0) = esk4_0
& ssList(esk6_0)
& ( ~ ssItem(X17)
| ~ ssList(X18)
| app(app(X18,cons(X17,nil)),X19) != esk1_0
| ~ ssList(X19)
| ~ leq(X17,esk5_3(X17,X18,X19)) )
& ( ~ ssItem(X17)
| ~ ssList(X18)
| app(app(X18,cons(X17,nil)),X19) != esk1_0
| ~ ssList(X19)
| lt(X17,esk5_3(X17,X18,X19)) )
& ( ~ ssItem(X17)
| ~ ssList(X18)
| app(app(X18,cons(X17,nil)),X19) != esk1_0
| ~ ssList(X19)
| memberP(X19,esk5_3(X17,X18,X19)) )
& ( ~ ssItem(X17)
| ~ ssList(X18)
| app(app(X18,cons(X17,nil)),X19) != esk1_0
| ~ ssList(X19)
| memberP(X18,esk5_3(X17,X18,X19)) )
& ( ~ ssItem(X17)
| ~ ssList(X18)
| app(app(X18,cons(X17,nil)),X19) != esk1_0
| ~ ssList(X19)
| ssItem(esk5_3(X17,X18,X19)) )
& nil != esk1_0
& esk1_0 = esk3_0
& esk2_0 = esk4_0
& ssList(esk4_0)
& ssList(esk3_0)
& ssList(esk2_0)
& ssList(esk1_0) ),
inference(distribute,[status(thm)],[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_18])])])])])]) ).
fof(c_0_27,plain,
! [X81,X82] :
( ( ~ ssItem(X81)
| ~ ssItem(X82)
| lt(X81,X82)
| ~ leq(X81,X82)
| X81 = X82 )
& ( ~ ssItem(X81)
| ~ ssItem(X82)
| ~ lt(X81,X82)
| leq(X81,X82) )
& ( ~ ssItem(X81)
| ~ ssItem(X82)
| ~ lt(X81,X82)
| X81 != X82 ) ),
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_19])])])])]) ).
cnf(c_0_28,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X1,X2),X3) = app(X1,app(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_29,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_30,plain,
! [X42,X43] :
( cons(X43,X42) = app(cons(X43,nil),X42)
| ~ ssItem(X43)
| ~ ssList(X42) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
cnf(c_0_31,plain,
( ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ssList(app(cons(X1,X2),X3)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
cnf(c_0_32,plain,
( ~ ssItem(X1)
| app(cons(X1,nil),nil) = cons(X1,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_25]),c_0_17])]) ).
cnf(c_0_33,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| app(app(X2,cons(X1,nil)),X3) != esk1_0
| ~ ssList(X3)
| ~ leq(X1,esk5_3(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_34,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ lt(X1,X2)
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_35,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| app(app(X2,cons(X1,nil)),X3) != esk1_0
| ~ ssList(X3)
| ssItem(esk5_3(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_36,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| app(app(X2,cons(X1,nil)),X3) != esk1_0
| ~ ssList(X3)
| lt(X1,esk5_3(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_37,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(nil,app(X1,X2)) = app(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_17])]) ).
cnf(c_0_38,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| cons(X2,X1) = app(cons(X2,nil),X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_39,plain,
( ~ ssItem(X1)
| ssList(cons(X1,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_17])]) ).
cnf(c_0_40,negated_conjecture,
( ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(app(X1,cons(X2,nil)),X3) != esk1_0 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),c_0_36]) ).
cnf(c_0_41,plain,
( ~ ssItem(X1)
| ~ ssList(X2)
| app(nil,cons(X1,X2)) = cons(X1,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]) ).
cnf(c_0_42,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| app(cons(X1,nil),X2) != esk1_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_17])]) ).
fof(c_0_43,plain,
! [X25] :
( ( ~ ssList(X25)
| nil = X25
| cons(esk8_1(X25),esk7_1(X25)) = X25 )
& ( ~ ssList(X25)
| nil = X25
| ssItem(esk8_1(X25)) )
& ( ~ ssList(X25)
| nil = X25
| ssList(esk7_1(X25)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax20])])])])]) ).
cnf(c_0_44,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| cons(X1,X2) != esk1_0 ),
inference(spm,[status(thm)],[c_0_42,c_0_38]) ).
cnf(c_0_45,plain,
( ~ ssList(X1)
| nil = X1
| cons(esk8_1(X1),esk7_1(X1)) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_46,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_47,negated_conjecture,
nil != esk1_0,
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_48,negated_conjecture,
( ~ ssItem(esk8_1(esk1_0))
| ~ ssList(esk7_1(esk1_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45])]),c_0_46])]),c_0_47]) ).
cnf(c_0_49,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(esk8_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_50,negated_conjecture,
~ ssList(esk7_1(esk1_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_46])]),c_0_47]) ).
cnf(c_0_51,plain,
( ~ ssList(X1)
| nil = X1
| ssList(esk7_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_52,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_46])]),c_0_47]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC245+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n026.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 08:10:53 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.44 Running first-order theorem proving
% 0.14/0.44 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
% 3.11/0.94 % Version: 3.5.1
% 3.11/0.94 % Preprocessing class: FSLSSMSSSSSNFFN.
% 3.11/0.94 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.11/0.94 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 3.11/0.94 % Starting new_bool_3 with 300s (1) cores
% 3.11/0.94 % Starting new_bool_1 with 300s (1) cores
% 3.11/0.94 % Starting sh5l with 300s (1) cores
% 3.11/0.94 % new_bool_3 with pid 1804249 completed with status 0
% 3.11/0.94 % Result found by new_bool_3
% 3.11/0.94 % Preprocessing class: FSLSSMSSSSSNFFN.
% 3.11/0.94 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.11/0.94 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 3.11/0.94 % Starting new_bool_3 with 300s (1) cores
% 3.11/0.94 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 3.11/0.94 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.11/0.94 % Search class: FGHSF-FFMM31-MFFFFFNN
% 3.11/0.94 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 3.11/0.94 % Starting SubtermCWHack with 31s (1) cores
% 3.11/0.94 % SubtermCWHack with pid 1804253 completed with status 0
% 3.11/0.94 % Result found by SubtermCWHack
% 3.11/0.95 % Preprocessing class: FSLSSMSSSSSNFFN.
% 3.11/0.95 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.11/0.95 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 3.11/0.95 % Starting new_bool_3 with 300s (1) cores
% 3.11/0.95 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 3.11/0.95 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.11/0.95 % Search class: FGHSF-FFMM31-MFFFFFNN
% 3.11/0.95 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 3.11/0.95 % Starting SubtermCWHack with 31s (1) cores
% 3.11/0.95 % Preprocessing time : 0.003 s
% 3.11/0.95
% 3.11/0.95 % Proof found!
% 3.11/0.95 % SZS status Theorem
% 3.11/0.95 % SZS output start CNFRefutation
% See solution above
% 3.11/0.95 % Parsed axioms : 96
% 3.11/0.95 % Removed by relevancy pruning/SinE : 63
% 3.11/0.95 % Initial clauses : 71
% 3.11/0.95 % Removed in clause preprocessing : 0
% 3.11/0.95 % Initial clauses in saturation : 71
% 3.11/0.95 % Processed clauses : 3270
% 3.11/0.95 % ...of these trivial : 135
% 3.11/0.95 % ...subsumed : 2480
% 3.11/0.95 % ...remaining for further processing : 655
% 3.11/0.95 % Other redundant clauses eliminated : 73
% 3.11/0.95 % Clauses deleted for lack of memory : 0
% 3.11/0.95 % Backward-subsumed : 67
% 3.11/0.95 % Backward-rewritten : 18
% 3.11/0.95 % Generated clauses : 13904
% 3.11/0.95 % ...of the previous two non-redundant : 11559
% 3.11/0.95 % ...aggressively subsumed : 0
% 3.11/0.95 % Contextual simplify-reflections : 171
% 3.11/0.95 % Paramodulations : 13818
% 3.11/0.95 % Factorizations : 0
% 3.11/0.95 % NegExts : 0
% 3.11/0.95 % Equation resolutions : 87
% 3.11/0.95 % Disequality decompositions : 0
% 3.11/0.95 % Total rewrite steps : 15598
% 3.11/0.95 % ...of those cached : 15563
% 3.11/0.95 % Propositional unsat checks : 0
% 3.11/0.95 % Propositional check models : 0
% 3.11/0.95 % Propositional check unsatisfiable : 0
% 3.11/0.95 % Propositional clauses : 0
% 3.11/0.95 % Propositional clauses after purity: 0
% 3.11/0.95 % Propositional unsat core size : 0
% 3.11/0.95 % Propositional preprocessing time : 0.000
% 3.11/0.95 % Propositional encoding time : 0.000
% 3.11/0.95 % Propositional solver time : 0.000
% 3.11/0.95 % Success case prop preproc time : 0.000
% 3.11/0.95 % Success case prop encoding time : 0.000
% 3.11/0.95 % Success case prop solver time : 0.000
% 3.11/0.95 % Current number of processed clauses : 565
% 3.11/0.95 % Positive orientable unit clauses : 36
% 3.11/0.95 % Positive unorientable unit clauses: 0
% 3.11/0.95 % Negative unit clauses : 31
% 3.11/0.95 % Non-unit-clauses : 498
% 3.11/0.95 % Current number of unprocessed clauses: 8326
% 3.11/0.95 % ...number of literals in the above : 44490
% 3.11/0.95 % Current number of archived formulas : 0
% 3.11/0.95 % Current number of archived clauses : 85
% 3.11/0.95 % Clause-clause subsumption calls (NU) : 52645
% 3.11/0.95 % Rec. Clause-clause subsumption calls : 15705
% 3.11/0.95 % Non-unit clause-clause subsumptions : 1984
% 3.11/0.95 % Unit Clause-clause subsumption calls : 1339
% 3.11/0.95 % Rewrite failures with RHS unbound : 0
% 3.11/0.95 % BW rewrite match attempts : 24
% 3.11/0.95 % BW rewrite match successes : 8
% 3.11/0.95 % Condensation attempts : 0
% 3.11/0.95 % Condensation successes : 0
% 3.11/0.95 % Termbank termtop insertions : 239860
% 3.11/0.95 % Search garbage collected termcells : 2021
% 3.11/0.95
% 3.11/0.95 % -------------------------------------------------
% 3.11/0.95 % User time : 0.416 s
% 3.11/0.95 % System time : 0.027 s
% 3.11/0.95 % Total time : 0.443 s
% 3.11/0.95 % Maximum resident set size: 4024 pages
% 3.11/0.95
% 3.11/0.95 % -------------------------------------------------
% 3.11/0.95 % User time : 0.421 s
% 3.11/0.95 % System time : 0.034 s
% 3.11/0.95 % Total time : 0.455 s
% 3.11/0.95 % Maximum resident set size: 4864 pages
% 3.11/0.95 % E exiting
%------------------------------------------------------------------------------