%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC237+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 : n009.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:35 PM UTC 2026
% Result : Theorem 196.79s 29.74s
% Output : CNFRefutation 196.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 11
% Syntax : Number of formulae : 59 ( 16 unt; 0 def)
% Number of atoms : 278 ( 96 equ)
% Maximal formula atoms : 44 ( 4 avg)
% Number of connectives : 360 ( 141 ~; 130 |; 52 &)
% ( 1 <=>; 36 =>; 0 <=; 0 <~>)
% Maximal formula depth : 31 ( 6 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 : 107 ( 0 sgn 57 !; 21 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ( nil = X3
& nil != X4 )
| ! [X9] :
( ? [X10] :
( ? [X11] :
( ? [X12] :
( ? [X13] :
( lt(X12,X10)
& app(X13,cons(X12,nil)) = X3
& ssList(X13) )
& ssItem(X12) )
& app(cons(X10,nil),X11) = X9
& ssList(X11) )
& ssItem(X10) )
| ~ strictorderedP(X3)
| app(X3,X9) != X4
| ~ ssList(X9) )
| ? [X5] :
( ? [X6] :
( ? [X7] :
( ! [X8] :
( lt(X5,X8)
| ~ leq(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(ax38,axiom,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax38) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(ax85,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil != X1
=> hd(app(X1,X2)) = hd(X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax85) ).
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(ax22,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax22) ).
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(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax78,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax78) ).
fof(ax24,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax24) ).
fof(c_0_11,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ( nil = X3
& nil != X4 )
| ! [X9] :
( ? [X10] :
( ? [X11] :
( ? [X12] :
( ? [X13] :
( lt(X12,X10)
& app(X13,cons(X12,nil)) = X3
& ssList(X13) )
& ssItem(X12) )
& app(cons(X10,nil),X11) = X9
& ssList(X11) )
& ssItem(X10) )
| ~ strictorderedP(X3)
| app(X3,X9) != X4
| ~ ssList(X9) )
| ? [X5] :
( ? [X6] :
( ? [X7] :
( ! [X8] :
( lt(X5,X8)
| ~ leq(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_12,plain,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
inference(fof_simplification,[status(thm)],[ax38]) ).
fof(c_0_13,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ( nil = X3
& nil != X4 )
| ! [X9] :
( ? [X10] :
( ? [X11] :
( ? [X12] :
( ? [X13] :
( lt(X12,X10)
& app(X13,cons(X12,nil)) = X3
& ssList(X13) )
& ssItem(X12) )
& app(cons(X10,nil),X11) = X9
& ssList(X11) )
& ssItem(X10) )
| ~ strictorderedP(X3)
| app(X3,X9) != X4
| ~ ssList(X9) )
| ? [X5] :
( ? [X6] :
( ? [X7] :
( ! [X8] :
( lt(X5,X8)
| ~ leq(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_11]) ).
fof(c_0_14,plain,
! [X191] :
( ~ memberP(nil,X191)
| ~ ssItem(X191) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])]) ).
fof(c_0_15,negated_conjecture,
! [X18,X19,X20,X23,X24,X25,X26] :
( ( nil != esk3_0
| nil = esk4_0 )
& ( ~ lt(X25,X23)
| app(X26,cons(X25,nil)) != esk3_0
| ~ ssList(X26)
| ~ ssItem(X25)
| app(cons(X23,nil),X24) != esk6_0
| ~ ssList(X24)
| ~ ssItem(X23) )
& strictorderedP(esk3_0)
& app(esk3_0,esk6_0) = esk4_0
& ssList(esk6_0)
& ( ~ ssItem(X18)
| ~ ssList(X19)
| app(app(X19,cons(X18,nil)),X20) != esk1_0
| ~ ssList(X20)
| ~ lt(X18,esk5_3(X18,X19,X20)) )
& ( ~ ssItem(X18)
| ~ ssList(X19)
| app(app(X19,cons(X18,nil)),X20) != esk1_0
| ~ ssList(X20)
| leq(X18,esk5_3(X18,X19,X20)) )
& ( ~ ssItem(X18)
| ~ ssList(X19)
| app(app(X19,cons(X18,nil)),X20) != esk1_0
| ~ ssList(X20)
| memberP(X20,esk5_3(X18,X19,X20)) )
& ( ~ ssItem(X18)
| ~ ssList(X19)
| app(app(X19,cons(X18,nil)),X20) != esk1_0
| ~ ssList(X20)
| memberP(X19,esk5_3(X18,X19,X20)) )
& ( ~ ssItem(X18)
| ~ ssList(X19)
| app(app(X19,cons(X18,nil)),X20) != esk1_0
| ~ ssList(X20)
| ssItem(esk5_3(X18,X19,X20)) )
& 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_13])])])])])]) ).
cnf(c_0_16,plain,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_17,negated_conjecture,
( ~ ssItem(X2)
| ~ ssList(X1)
| app(app(X1,cons(X2,nil)),X3) != esk1_0
| ~ ssList(X3)
| memberP(X1,esk5_3(X2,X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_18,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_19,negated_conjecture,
( ~ ssItem(X1)
| ~ ssItem(esk5_3(X1,nil,X2))
| ~ ssList(X2)
| app(app(nil,cons(X1,nil)),X2) != esk1_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
cnf(c_0_20,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_15]) ).
fof(c_0_21,plain,
! [X32] :
( app(nil,X32) = X32
| ~ ssList(X32) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
fof(c_0_22,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil != X1
=> hd(app(X1,X2)) = hd(X1) ) ) ),
inference(fof_simplification,[status(thm)],[ax85]) ).
cnf(c_0_23,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| app(app(nil,cons(X1,nil)),X2) != esk1_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_18])]) ).
cnf(c_0_24,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_25,plain,
! [X33,X34] :
( cons(X34,X33) = app(cons(X34,nil),X33)
| ~ ssItem(X34)
| ~ ssList(X33) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
fof(c_0_26,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
inference(fof_simplification,[status(thm)],[ax22]) ).
fof(c_0_27,plain,
! [X115,X116] :
( hd(app(X115,X116)) = hd(X115)
| nil = X115
| ~ ssList(X116)
| ~ ssList(X115) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])])])]) ).
cnf(c_0_28,negated_conjecture,
app(esk3_0,esk6_0) = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_29,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_30,plain,
! [X35,X36] :
( ( ~ ssList(X35)
| ~ ssList(X36)
| nil = app(X35,X36)
| nil != X35
| nil != X36 )
& ( ~ ssList(X35)
| ~ ssList(X36)
| nil != app(X35,X36)
| nil = X35 )
& ( ~ ssList(X35)
| ~ ssList(X36)
| nil != app(X35,X36)
| nil = X36 ) ),
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])])])])]) ).
cnf(c_0_31,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(cons(X1,nil))
| app(cons(X1,nil),X2) != esk1_0 ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_32,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| cons(X2,X1) = app(cons(X2,nil),X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_33,plain,
! [X119,X120] :
( ssList(cons(X120,X119))
| ~ ssItem(X120)
| ~ ssList(X119) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
fof(c_0_34,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
inference(fof_simplification,[status(thm)],[ax78]) ).
fof(c_0_35,plain,
! [X198] :
( ssItem(hd(X198))
| nil = X198
| ~ ssList(X198) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_26])])]) ).
cnf(c_0_36,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| hd(app(X1,X2)) = hd(X1)
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_37,negated_conjecture,
app(esk1_0,esk6_0) = esk4_0,
inference(rw,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_38,negated_conjecture,
ssList(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_39,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_40,negated_conjecture,
nil != esk1_0,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_41,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_42,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_43,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != app(X1,X2)
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_44,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(cons(X1,nil))
| cons(X1,X2) != esk1_0 ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_45,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ssList(cons(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
fof(c_0_46,plain,
! [X203] :
( cons(hd(X203),tl(X203)) = X203
| nil = X203
| ~ ssList(X203) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_34])])]) ).
cnf(c_0_47,plain,
( ~ ssList(X1)
| ssItem(hd(X1))
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_48,negated_conjecture,
hd(esk4_0) = hd(esk1_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]),c_0_39])]),c_0_40]) ).
cnf(c_0_49,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_50,negated_conjecture,
esk4_0 != nil,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_37]),c_0_38]),c_0_39])]),c_0_40]) ).
fof(c_0_51,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
inference(fof_simplification,[status(thm)],[ax24]) ).
cnf(c_0_52,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| cons(X1,X2) != esk1_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_18])]) ).
cnf(c_0_53,plain,
( ~ ssList(X1)
| cons(hd(X1),tl(X1)) = X1
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_54,negated_conjecture,
ssItem(hd(esk1_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49])]),c_0_50]) ).
fof(c_0_55,plain,
! [X228] :
( ssList(tl(X228))
| nil = X228
| ~ ssList(X228) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_51])])]) ).
cnf(c_0_56,negated_conjecture,
~ ssList(tl(esk1_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53])]),c_0_54]),c_0_39])]),c_0_40]) ).
cnf(c_0_57,plain,
( ~ ssList(X1)
| ssList(tl(X1))
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_58,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_39])]),c_0_40]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC237+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.44 % Computer : n009.cluster.edu
% 0.16/0.44 % Model : x86_64 x86_64
% 0.16/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.44 % Memory : 8046.5625MB
% 0.16/0.44 % OS : Linux 6.8.0-71-generic
% 0.16/0.44 % CPULimit : 300
% 0.16/0.44 % WCLimit : 300
% 0.16/0.44 % DateTime : Mon Sep 21 08:07:27 UTC 2026
% 0.16/0.45 % CPUTime :
% 0.16/0.45 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/0.53 Running first-order theorem proving
% 0.23/0.53 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
% 196.79/29.74 % Version: 3.5.1
% 196.79/29.74 % Preprocessing class: FSLSSMSSSSSNFFN.
% 196.79/29.74 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 196.79/29.74 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 196.79/29.74 % Starting new_bool_3 with 300s (1) cores
% 196.79/29.74 % Starting new_bool_1 with 300s (1) cores
% 196.79/29.74 % Starting sh5l with 300s (1) cores
% 196.79/29.74 % sh5l with pid 1274631 completed with status 0
% 196.79/29.74 % Result found by sh5l
% 196.79/29.74 % Preprocessing class: FSLSSMSSSSSNFFN.
% 196.79/29.74 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 196.79/29.74 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 196.79/29.74 % Starting new_bool_3 with 300s (1) cores
% 196.79/29.74 % Starting new_bool_1 with 300s (1) cores
% 196.79/29.74 % Starting sh5l with 300s (1) cores
% 196.79/29.74 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 196.79/29.74 % SinE strategy is gf500_gu_R04_F100_L20000
% 196.79/29.74 % Search class: FGHSF-FSLM31-MFFFFFNN
% 196.79/29.74 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 196.79/29.74 % Starting SubtermCWHack with 28s (1) cores
% 196.79/29.74 % SubtermCWHack with pid 1274634 completed with status 8
% 196.79/29.74 % Starting sh5l with 31s (1) cores
% 196.79/29.74 % sh5l with pid 1275046 completed with status 0
% 196.79/29.74 % Result found by sh5l
% 196.79/29.74 % Preprocessing class: FSLSSMSSSSSNFFN.
% 196.79/29.74 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 196.79/29.74 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 196.79/29.74 % Starting new_bool_3 with 300s (1) cores
% 196.79/29.74 % Starting new_bool_1 with 300s (1) cores
% 196.79/29.74 % Starting sh5l with 300s (1) cores
% 196.79/29.74 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 196.79/29.74 % SinE strategy is gf500_gu_R04_F100_L20000
% 196.79/29.74 % Search class: FGHSF-FSLM31-MFFFFFNN
% 196.79/29.74 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 196.79/29.74 % Starting SubtermCWHack with 28s (1) cores
% 196.79/29.74 % SubtermCWHack with pid 1274634 completed with status 8
% 196.79/29.74 % Starting sh5l with 31s (1) cores
% 196.79/29.74 % Preprocessing time : 0.006 s
% 196.79/29.74 % Presaturation interreduction done
% 196.79/29.74
% 196.79/29.74 % Proof found!
% 196.79/29.74 % SZS status Theorem
% 196.79/29.74 % SZS output start CNFRefutation
% See solution above
% 196.79/29.74 % Parsed axioms : 96
% 196.79/29.74 % Removed by relevancy pruning/SinE : 10
% 196.79/29.74 % Initial clauses : 180
% 196.79/29.74 % Removed in clause preprocessing : 2
% 196.79/29.74 % Initial clauses in saturation : 178
% 196.79/29.74 % Processed clauses : 772
% 196.79/29.74 % ...of these trivial : 23
% 196.79/29.74 % ...subsumed : 186
% 196.79/29.74 % ...remaining for further processing : 563
% 196.79/29.74 % Other redundant clauses eliminated : 80
% 196.79/29.74 % Clauses deleted for lack of memory : 0
% 196.79/29.74 % Backward-subsumed : 55
% 196.79/29.74 % Backward-rewritten : 16
% 196.79/29.74 % Generated clauses : 1343
% 196.79/29.74 % ...of the previous two non-redundant : 1099
% 196.79/29.74 % ...aggressively subsumed : 0
% 196.79/29.74 % Contextual simplify-reflections : 11
% 196.79/29.74 % Paramodulations : 1259
% 196.79/29.74 % Factorizations : 0
% 196.79/29.74 % NegExts : 0
% 196.79/29.74 % Equation resolutions : 85
% 196.79/29.74 % Disequality decompositions : 0
% 196.79/29.74 % Total rewrite steps : 1203
% 196.79/29.74 % ...of those cached : 1171
% 196.79/29.74 % Propositional unsat checks : 0
% 196.79/29.74 % Propositional check models : 0
% 196.79/29.74 % Propositional check unsatisfiable : 0
% 196.79/29.74 % Propositional clauses : 0
% 196.79/29.74 % Propositional clauses after purity: 0
% 196.79/29.74 % Propositional unsat core size : 0
% 196.79/29.74 % Propositional preprocessing time : 0.000
% 196.79/29.74 % Propositional encoding time : 0.000
% 196.79/29.74 % Propositional solver time : 0.000
% 196.79/29.74 % Success case prop preproc time : 0.000
% 196.79/29.74 % Success case prop encoding time : 0.000
% 196.79/29.74 % Success case prop solver time : 0.000
% 196.79/29.74 % Current number of processed clauses : 303
% 196.79/29.74 % Positive orientable unit clauses : 42
% 196.79/29.74 % Positive unorientable unit clauses: 0
% 196.79/29.74 % Negative unit clauses : 12
% 196.79/29.74 % Non-unit-clauses : 249
% 196.79/29.74 % Current number of unprocessed clauses: 659
% 196.79/29.74 % ...number of literals in the above : 3653
% 196.79/29.74 % Current number of archived formulas : 0
% 196.79/29.74 % Current number of archived clauses : 242
% 196.79/29.74 % Clause-clause subsumption calls (NU) : 17628
% 196.79/29.74 % Rec. Clause-clause subsumption calls : 5168
% 196.79/29.74 % Non-unit clause-clause subsumptions : 173
% 196.79/29.74 % Unit Clause-clause subsumption calls : 1012
% 196.79/29.74 % Rewrite failures with RHS unbound : 0
% 196.79/29.74 % BW rewrite match attempts : 14
% 196.79/29.74 % BW rewrite match successes : 14
% 196.79/29.74 % Condensation attempts : 772
% 196.79/29.74 % Condensation successes : 0
% 196.79/29.74 % Termbank termtop insertions : 44471
% 196.79/29.74 % Search garbage collected termcells : 4012
% 196.79/29.74
% 196.79/29.74 % -------------------------------------------------
% 196.79/29.74 % User time : 27.534 s
% 196.79/29.74 % System time : 0.710 s
% 196.79/29.74 % Total time : 28.244 s
% 196.79/29.74 % Maximum resident set size: 3972 pages
% 196.79/29.74
% 196.79/29.74 % -------------------------------------------------
% 196.79/29.74 % User time : 27.540 s
% 196.79/29.74 % System time : 0.720 s
% 196.79/29.74 % Total time : 28.260 s
% 196.79/29.74 % Maximum resident set size: 4608 pages
% 196.79/29.74 % E exiting
%------------------------------------------------------------------------------