%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC176+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 : n006.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:20 PM UTC 2026
% Result : Theorem 0.31s 0.78s
% Output : CNFRefutation 0.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of formulae : 49 ( 18 unt; 0 def)
% Number of atoms : 284 ( 64 equ)
% Maximal formula atoms : 32 ( 5 avg)
% Number of connectives : 354 ( 119 ~; 120 |; 65 &)
% ( 3 <=>; 47 =>; 0 <=; 0 <~>)
% Maximal formula depth : 30 ( 6 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 11 con; 0-2 aty)
% Number of variables : 128 ( 0 sgn 80 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ( nil = X3
& nil != X4 )
| ! [X15] :
( ssItem(X15)
=> ! [X16] :
( neq(X15,X16)
| ! [X17] :
( ssList(X17)
=> ! [X18] :
( ssList(X18)
=> app(app(app(X17,cons(X15,nil)),cons(X16,nil)),X18) != X1 ) )
| ~ ssItem(X16) ) )
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( ? [X11] :
( ? [X12] :
( ? [X13] :
( ? [X14] :
( lt(X13,X11)
& app(X14,cons(X13,nil)) = X3
& ssList(X14) )
& ssItem(X13) )
& app(cons(X11,nil),X12) = X6
& ssList(X12) )
& ssItem(X11) )
| ? [X7] :
( ? [X8] :
( ? [X9] :
( ? [X10] :
( lt(X7,X9)
& app(cons(X9,nil),X10) = X3
& ssList(X10) )
& ssItem(X9) )
& app(X8,cons(X7,nil)) = X5
& ssList(X8) )
& ssItem(X7) )
| ~ strictorderedP(X3)
| app(app(X5,X3),X6) != X4
| ~ ssList(X6) ) )
| X1 != X3
| X2 != X4
| ~ ssList(X4) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax1,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax1) ).
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(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax12,axiom,
! [X1] :
( ssList(X1)
=> ( strictorderedP(X1)
<=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssItem(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(app(X4,cons(X2,X5)),cons(X3,X6)) = X1
=> lt(X2,X3) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax12) ).
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(ax33,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
=> ~ lt(X2,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax33) ).
fof(c_0_9,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ( nil = X3
& nil != X4 )
| ! [X15] :
( ssItem(X15)
=> ! [X16] :
( neq(X15,X16)
| ! [X17] :
( ssList(X17)
=> ! [X18] :
( ssList(X18)
=> app(app(app(X17,cons(X15,nil)),cons(X16,nil)),X18) != X1 ) )
| ~ ssItem(X16) ) )
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( ? [X11] :
( ? [X12] :
( ? [X13] :
( ? [X14] :
( lt(X13,X11)
& app(X14,cons(X13,nil)) = X3
& ssList(X14) )
& ssItem(X13) )
& app(cons(X11,nil),X12) = X6
& ssList(X12) )
& ssItem(X11) )
| ? [X7] :
( ? [X8] :
( ? [X9] :
( ? [X10] :
( lt(X7,X9)
& app(cons(X9,nil),X10) = X3
& ssList(X10) )
& ssItem(X9) )
& app(X8,cons(X7,nil)) = X5
& ssList(X8) )
& ssItem(X7) )
| ~ strictorderedP(X3)
| app(app(X5,X3),X6) != X4
| ~ ssList(X6) ) )
| X1 != X3
| X2 != X4
| ~ ssList(X4) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_10,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ( nil = X3
& nil != X4 )
| ! [X15] :
( ssItem(X15)
=> ! [X16] :
( neq(X15,X16)
| ! [X17] :
( ssList(X17)
=> ! [X18] :
( ssList(X18)
=> app(app(app(X17,cons(X15,nil)),cons(X16,nil)),X18) != X1 ) )
| ~ ssItem(X16) ) )
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( ? [X11] :
( ? [X12] :
( ? [X13] :
( ? [X14] :
( lt(X13,X11)
& app(X14,cons(X13,nil)) = X3
& ssList(X14) )
& ssItem(X13) )
& app(cons(X11,nil),X12) = X6
& ssList(X12) )
& ssItem(X11) )
| ? [X7] :
( ? [X8] :
( ? [X9] :
( ? [X10] :
( lt(X7,X9)
& app(cons(X9,nil),X10) = X3
& ssList(X10) )
& ssItem(X9) )
& app(X8,cons(X7,nil)) = X5
& ssList(X8) )
& ssItem(X7) )
| ~ strictorderedP(X3)
| app(app(X5,X3),X6) != X4
| ~ ssList(X6) ) )
| X1 != X3
| X2 != X4
| ~ ssList(X4) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_11,plain,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax1]) ).
fof(c_0_12,negated_conjecture,
! [X269,X270,X271,X272,X273,X274,X275,X276] :
( ( nil != esk50_0
| nil = esk51_0 )
& ~ neq(esk54_0,esk55_0)
& app(app(app(esk56_0,cons(esk54_0,nil)),cons(esk55_0,nil)),esk57_0) = esk48_0
& ssList(esk57_0)
& ssList(esk56_0)
& ssItem(esk55_0)
& ssItem(esk54_0)
& ( ~ lt(X275,X273)
| app(X276,cons(X275,nil)) != esk50_0
| ~ ssList(X276)
| ~ ssItem(X275)
| app(cons(X273,nil),X274) != esk53_0
| ~ ssList(X274)
| ~ ssItem(X273) )
& ( ~ lt(X269,X271)
| app(cons(X271,nil),X272) != esk50_0
| ~ ssList(X272)
| ~ ssItem(X271)
| app(X270,cons(X269,nil)) != esk52_0
| ~ ssList(X270)
| ~ ssItem(X269) )
& strictorderedP(esk50_0)
& app(app(esk52_0,esk50_0),esk53_0) = esk51_0
& ssList(esk53_0)
& ssList(esk52_0)
& 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_10])])])])]) ).
fof(c_0_13,plain,
! [X19,X20] :
( ( ~ ssItem(X19)
| ~ ssItem(X20)
| neq(X19,X20)
| X19 = X20 )
& ( ~ ssItem(X19)
| ~ ssItem(X20)
| X19 != X20
| ~ neq(X19,X20) ) ),
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_11])])])])]) ).
cnf(c_0_14,negated_conjecture,
app(app(app(esk56_0,cons(esk54_0,nil)),cons(esk55_0,nil)),esk57_0) = esk48_0,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_16,plain,
! [X234,X235,X236] :
( app(app(X234,X235),X236) = app(X234,app(X235,X236))
| ~ ssList(X236)
| ~ ssList(X235)
| ~ ssList(X234) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])])]) ).
cnf(c_0_17,negated_conjecture,
~ neq(esk54_0,esk55_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| neq(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,negated_conjecture,
ssItem(esk55_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,negated_conjecture,
ssItem(esk54_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21,negated_conjecture,
app(app(app(esk56_0,cons(esk54_0,nil)),cons(esk55_0,nil)),esk57_0) = esk50_0,
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_22,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X1,X2),X3) = app(X1,app(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,negated_conjecture,
ssList(esk57_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_24,negated_conjecture,
esk55_0 = esk54_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20])]) ).
fof(c_0_25,plain,
! [X123,X124] :
( ssList(cons(X124,X123))
| ~ ssItem(X124)
| ~ ssList(X123) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
cnf(c_0_26,negated_conjecture,
( ~ ssList(cons(esk54_0,nil))
| ~ ssList(app(esk56_0,cons(esk54_0,nil)))
| app(app(esk56_0,cons(esk54_0,nil)),app(cons(esk54_0,nil),esk57_0)) = esk50_0 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]),c_0_24]),c_0_24]) ).
cnf(c_0_27,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ssList(cons(X2,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,
! [X142,X143] :
( ssList(app(X142,X143))
| ~ ssList(X143)
| ~ ssList(X142) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
cnf(c_0_30,negated_conjecture,
( ~ ssList(app(esk56_0,cons(esk54_0,nil)))
| app(app(esk56_0,cons(esk54_0,nil)),app(cons(esk54_0,nil),esk57_0)) = esk50_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_20])]) ).
cnf(c_0_31,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_32,negated_conjecture,
ssList(esk56_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_33,plain,
! [X90,X91,X92,X93,X94,X95] :
( ( ~ ssList(X90)
| strictorderedP(X90)
| ~ lt(esk30_1(X90),esk31_1(X90)) )
& ( ~ ssList(X90)
| strictorderedP(X90)
| app(app(esk32_1(X90),cons(esk30_1(X90),esk33_1(X90))),cons(esk31_1(X90),esk34_1(X90))) = X90 )
& ( ~ ssList(X90)
| strictorderedP(X90)
| ssList(esk34_1(X90)) )
& ( ~ ssList(X90)
| strictorderedP(X90)
| ssList(esk33_1(X90)) )
& ( ~ ssList(X90)
| strictorderedP(X90)
| ssList(esk32_1(X90)) )
& ( ~ ssList(X90)
| strictorderedP(X90)
| ssItem(esk31_1(X90)) )
& ( ~ ssList(X90)
| strictorderedP(X90)
| ssItem(esk30_1(X90)) )
& ( ~ ssList(X90)
| lt(X91,X92)
| app(app(X93,cons(X91,X94)),cons(X92,X95)) != X90
| ~ ssList(X95)
| ~ ssList(X94)
| ~ ssList(X93)
| ~ ssItem(X92)
| ~ ssItem(X91)
| ~ strictorderedP(X90) ) ),
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)],[ax12])])])])])]) ).
cnf(c_0_34,negated_conjecture,
( ~ ssList(cons(esk54_0,nil))
| app(app(esk56_0,cons(esk54_0,nil)),app(cons(esk54_0,nil),esk57_0)) = esk50_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]) ).
fof(c_0_35,plain,
! [X232,X233] :
( cons(X233,X232) = app(cons(X233,nil),X232)
| ~ ssItem(X233)
| ~ ssList(X232) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
fof(c_0_36,plain,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
=> ~ lt(X2,X1) ) ) ),
inference(fof_simplification,[status(thm)],[ax33]) ).
cnf(c_0_37,plain,
( ~ ssList(X1)
| app(app(X4,cons(X2,X5)),cons(X3,X6)) != X1
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssItem(X3)
| ~ ssItem(X2)
| ~ strictorderedP(X1)
| lt(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_38,negated_conjecture,
app(app(esk56_0,cons(esk54_0,nil)),app(cons(esk54_0,nil),esk57_0)) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_27]),c_0_28]),c_0_20])]) ).
cnf(c_0_39,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| cons(X2,X1) = app(cons(X2,nil),X1) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_40,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_41,plain,
! [X156,X157] :
( ~ lt(X157,X156)
| ~ lt(X156,X157)
| ~ ssItem(X157)
| ~ ssItem(X156) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_36])])])]) ).
cnf(c_0_42,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X5)
| ~ ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ strictorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| lt(X1,X2) ),
inference(er,[status(thm)],[c_0_37]) ).
cnf(c_0_43,negated_conjecture,
app(app(esk56_0,cons(esk54_0,nil)),cons(esk54_0,esk57_0)) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_23]),c_0_20])]) ).
cnf(c_0_44,negated_conjecture,
strictorderedP(esk50_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_45,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_40,c_0_15]) ).
cnf(c_0_46,plain,
( ~ lt(X2,X1)
| ~ lt(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_47,negated_conjecture,
lt(esk54_0,esk54_0),
inference(cn,[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_42,c_0_43]),c_0_44]),c_0_45]),c_0_23]),c_0_28]),c_0_32]),c_0_20])]) ).
cnf(c_0_48,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_47]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC176+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.45 % Computer : n006.cluster.edu
% 0.18/0.45 % Model : x86_64 x86_64
% 0.18/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.45 % Memory : 8046.5625MB
% 0.18/0.45 % OS : Linux 6.8.0-71-generic
% 0.18/0.45 % CPULimit : 300
% 0.18/0.45 % WCLimit : 300
% 0.18/0.45 % DateTime : Mon Sep 21 08:01:42 UTC 2026
% 0.18/0.46 % CPUTime :
% 0.18/0.46 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
% 0.31/0.78 % Version: 3.5.1
% 0.31/0.78 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.31/0.78 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.31/0.78 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.31/0.78 % Starting new_bool_3 with 300s (1) cores
% 0.31/0.78 % Starting new_bool_1 with 300s (1) cores
% 0.31/0.78 % Starting sh5l with 300s (1) cores
% 0.31/0.78 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2375529 completed with status 0
% 0.31/0.78 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.31/0.78 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.31/0.78 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.31/0.78 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.31/0.78 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.31/0.78 % No SInE strategy applied
% 0.31/0.78 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.31/0.78 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.31/0.78 % Starting SubtermCWHack with 136s (1) cores
% 0.31/0.78 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.31/0.78 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 0.31/0.78 % Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.31/0.78 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.31/0.78 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2375537 completed with status 0
% 0.31/0.78 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.31/0.78 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.31/0.78 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.31/0.78 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.31/0.78 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.31/0.78 % No SInE strategy applied
% 0.31/0.78 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.31/0.78 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.31/0.78 % Starting SubtermCWHack with 136s (1) cores
% 0.31/0.78 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.31/0.78 % Preprocessing time : 0.006 s
% 0.31/0.78 % Presaturation interreduction done
% 0.31/0.78
% 0.31/0.78 % Proof found!
% 0.31/0.78 % SZS status Theorem
% 0.31/0.78 % SZS output start CNFRefutation
% See solution above
% 0.31/0.78 % Parsed axioms : 96
% 0.31/0.78 % Removed by relevancy pruning/SinE : 0
% 0.31/0.78 % Initial clauses : 209
% 0.31/0.78 % Removed in clause preprocessing : 2
% 0.31/0.78 % Initial clauses in saturation : 207
% 0.31/0.78 % Processed clauses : 750
% 0.31/0.78 % ...of these trivial : 11
% 0.31/0.78 % ...subsumed : 72
% 0.31/0.78 % ...remaining for further processing : 667
% 0.31/0.78 % Other redundant clauses eliminated : 70
% 0.31/0.78 % Clauses deleted for lack of memory : 0
% 0.31/0.78 % Backward-subsumed : 17
% 0.31/0.78 % Backward-rewritten : 47
% 0.31/0.78 % Generated clauses : 1621
% 0.31/0.78 % ...of the previous two non-redundant : 1425
% 0.31/0.78 % ...aggressively subsumed : 0
% 0.31/0.78 % Contextual simplify-reflections : 22
% 0.31/0.78 % Paramodulations : 1548
% 0.31/0.78 % Factorizations : 0
% 0.31/0.78 % NegExts : 0
% 0.31/0.78 % Equation resolutions : 75
% 0.31/0.78 % Disequality decompositions : 0
% 0.31/0.78 % Total rewrite steps : 1510
% 0.31/0.78 % ...of those cached : 1445
% 0.31/0.78 % Propositional unsat checks : 0
% 0.31/0.78 % Propositional check models : 0
% 0.31/0.78 % Propositional check unsatisfiable : 0
% 0.31/0.78 % Propositional clauses : 0
% 0.31/0.78 % Propositional clauses after purity: 0
% 0.31/0.78 % Propositional unsat core size : 0
% 0.31/0.78 % Propositional preprocessing time : 0.000
% 0.31/0.78 % Propositional encoding time : 0.000
% 0.31/0.78 % Propositional solver time : 0.000
% 0.31/0.78 % Success case prop preproc time : 0.000
% 0.31/0.78 % Success case prop encoding time : 0.000
% 0.31/0.78 % Success case prop solver time : 0.000
% 0.31/0.78 % Current number of processed clauses : 379
% 0.31/0.78 % Positive orientable unit clauses : 86
% 0.31/0.78 % Positive unorientable unit clauses: 0
% 0.31/0.78 % Negative unit clauses : 3
% 0.31/0.78 % Non-unit-clauses : 290
% 0.31/0.78 % Current number of unprocessed clauses: 1076
% 0.31/0.78 % ...number of literals in the above : 5781
% 0.31/0.78 % Current number of archived formulas : 0
% 0.31/0.78 % Current number of archived clauses : 265
% 0.31/0.78 % Clause-clause subsumption calls (NU) : 22291
% 0.31/0.78 % Rec. Clause-clause subsumption calls : 8450
% 0.31/0.78 % Non-unit clause-clause subsumptions : 103
% 0.31/0.78 % Unit Clause-clause subsumption calls : 1298
% 0.31/0.78 % Rewrite failures with RHS unbound : 0
% 0.31/0.78 % BW rewrite match attempts : 48
% 0.31/0.78 % BW rewrite match successes : 23
% 0.31/0.78 % Condensation attempts : 0
% 0.31/0.78 % Condensation successes : 0
% 0.31/0.78 % Termbank termtop insertions : 54535
% 0.31/0.78 % Search garbage collected termcells : 4522
% 0.31/0.78
% 0.31/0.78 % -------------------------------------------------
% 0.31/0.78 % User time : 0.142 s
% 0.31/0.78 % System time : 0.013 s
% 0.31/0.78 % Total time : 0.155 s
% 0.31/0.78 % Maximum resident set size: 4028 pages
% 0.31/0.78
% 0.31/0.78 % -------------------------------------------------
% 0.31/0.78 % User time : 0.598 s
% 0.31/0.78 % System time : 0.052 s
% 0.31/0.78 % Total time : 0.650 s
% 0.31/0.78 % Maximum resident set size: 4864 pages
% 0.31/0.78 % E exiting
%------------------------------------------------------------------------------