%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC300+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 : n020.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:50 PM UTC 2026
% Result : Theorem 0.20s 0.64s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 10
% Syntax : Number of formulae : 59 ( 23 unt; 0 def)
% Number of atoms : 239 ( 42 equ)
% Maximal formula atoms : 30 ( 4 avg)
% Number of connectives : 283 ( 103 ~; 96 |; 25 &)
% ( 3 <=>; 56 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 5 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 10 con; 0-2 aty)
% Number of variables : 95 ( 0 sgn 73 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ( ~ lt(X6,X5)
| app(app(app(app(X7,cons(X5,nil)),X8),cons(X6,nil)),X9) != X1 ) ) ) ) ) )
| ~ totalorderedP(X3)
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
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(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(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
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(ax11,axiom,
! [X1] :
( ssList(X1)
=> ( totalorderedP(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
=> leq(X2,X3) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax11) ).
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(ax29,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( ( leq(X2,X1)
& leq(X1,X2) )
=> X1 = X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax29) ).
fof(c_0_10,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ( ~ lt(X6,X5)
| app(app(app(app(X7,cons(X5,nil)),X8),cons(X6,nil)),X9) != X1 ) ) ) ) ) )
| ~ totalorderedP(X3)
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_11,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ( ~ lt(X6,X5)
| app(app(app(app(X7,cons(X5,nil)),X8),cons(X6,nil)),X9) != X1 ) ) ) ) ) )
| ~ totalorderedP(X3)
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_10]) ).
fof(c_0_12,negated_conjecture,
( lt(esk53_0,esk52_0)
& app(app(app(app(esk54_0,cons(esk52_0,nil)),esk55_0),cons(esk53_0,nil)),esk56_0) = esk48_0
& ssList(esk56_0)
& ssList(esk55_0)
& ssList(esk54_0)
& ssItem(esk53_0)
& ssItem(esk52_0)
& totalorderedP(esk50_0)
& esk48_0 = esk50_0
& esk49_0 = esk51_0
& ssList(esk51_0)
& ssList(esk50_0)
& ssList(esk49_0)
& ssList(esk48_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])]) ).
fof(c_0_13,plain,
! [X225,X226,X227] :
( app(app(X225,X226),X227) = app(X225,app(X226,X227))
| ~ ssList(X227)
| ~ ssList(X226)
| ~ ssList(X225) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])])]) ).
cnf(c_0_14,negated_conjecture,
app(app(app(app(esk54_0,cons(esk52_0,nil)),esk55_0),cons(esk53_0,nil)),esk56_0) = esk48_0,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X1,X2),X3) = app(X1,app(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,negated_conjecture,
ssList(esk55_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
ssList(esk54_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_18,plain,
! [X114,X115] :
( ssList(cons(X115,X114))
| ~ ssItem(X115)
| ~ ssList(X114) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
cnf(c_0_19,negated_conjecture,
( ~ ssList(cons(esk52_0,nil))
| app(app(app(esk54_0,app(cons(esk52_0,nil),esk55_0)),cons(esk53_0,nil)),esk56_0) = esk48_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17])]) ).
cnf(c_0_20,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ssList(cons(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_21,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_22,negated_conjecture,
ssItem(esk52_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_23,plain,
! [X223,X224] :
( cons(X224,X223) = app(cons(X224,nil),X223)
| ~ ssItem(X224)
| ~ ssList(X223) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
cnf(c_0_24,negated_conjecture,
app(app(app(esk54_0,app(cons(esk52_0,nil),esk55_0)),cons(esk53_0,nil)),esk56_0) = esk48_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22])]) ).
cnf(c_0_25,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| cons(X2,X1) = app(cons(X2,nil),X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_26,negated_conjecture,
app(app(app(esk54_0,cons(esk52_0,esk55_0)),cons(esk53_0,nil)),esk56_0) = esk48_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_16]),c_0_22])]) ).
cnf(c_0_27,negated_conjecture,
ssList(esk56_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_28,negated_conjecture,
( ~ ssList(cons(esk53_0,nil))
| ~ ssList(app(esk54_0,cons(esk52_0,esk55_0)))
| app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0)) = esk48_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_26]),c_0_27])]) ).
cnf(c_0_29,negated_conjecture,
ssItem(esk53_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_30,plain,
! [X133,X134] :
( ssList(app(X133,X134))
| ~ ssList(X134)
| ~ ssList(X133) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
cnf(c_0_31,negated_conjecture,
( ~ ssList(app(esk54_0,cons(esk52_0,esk55_0)))
| app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0)) = esk48_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_20]),c_0_21]),c_0_29])]) ).
cnf(c_0_32,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
fof(c_0_33,plain,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
<=> ( leq(X1,X2)
& X1 != X2 ) ) ) ),
inference(fof_simplification,[status(thm)],[ax93]) ).
cnf(c_0_34,negated_conjecture,
( ~ ssList(cons(esk52_0,esk55_0))
| app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0)) = esk48_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_17])]) ).
fof(c_0_35,plain,
! [X247,X248] :
( ( ~ ssItem(X247)
| ~ ssItem(X248)
| lt(X247,X248)
| ~ leq(X247,X248)
| X247 = X248 )
& ( ~ ssItem(X247)
| ~ ssItem(X248)
| ~ lt(X247,X248)
| leq(X247,X248) )
& ( ~ ssItem(X247)
| ~ ssItem(X248)
| ~ lt(X247,X248)
| X247 != X248 ) ),
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_33])])])])]) ).
fof(c_0_36,plain,
! [X70,X71,X72,X73,X74,X75] :
( ( ~ ssList(X70)
| totalorderedP(X70)
| ~ leq(esk25_1(X70),esk26_1(X70)) )
& ( ~ ssList(X70)
| totalorderedP(X70)
| app(app(esk27_1(X70),cons(esk25_1(X70),esk28_1(X70))),cons(esk26_1(X70),esk29_1(X70))) = X70 )
& ( ~ ssList(X70)
| totalorderedP(X70)
| ssList(esk29_1(X70)) )
& ( ~ ssList(X70)
| totalorderedP(X70)
| ssList(esk28_1(X70)) )
& ( ~ ssList(X70)
| totalorderedP(X70)
| ssList(esk27_1(X70)) )
& ( ~ ssList(X70)
| totalorderedP(X70)
| ssItem(esk26_1(X70)) )
& ( ~ ssList(X70)
| totalorderedP(X70)
| ssItem(esk25_1(X70)) )
& ( ~ ssList(X70)
| leq(X71,X72)
| app(app(X73,cons(X71,X74)),cons(X72,X75)) != X70
| ~ ssList(X75)
| ~ ssList(X74)
| ~ ssList(X73)
| ~ ssItem(X72)
| ~ ssItem(X71)
| ~ totalorderedP(X70) ) ),
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)],[ax11])])])])])]) ).
cnf(c_0_37,negated_conjecture,
app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0)) = esk48_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_20]),c_0_16]),c_0_22])]) ).
fof(c_0_38,plain,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
=> ~ lt(X2,X1) ) ) ),
inference(fof_simplification,[status(thm)],[ax33]) ).
fof(c_0_39,plain,
! [X139,X140] :
( X139 = X140
| ~ leq(X140,X139)
| ~ leq(X139,X140)
| ~ ssItem(X140)
| ~ ssItem(X139) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax29])])])]) ).
cnf(c_0_40,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ lt(X1,X2)
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_41,negated_conjecture,
lt(esk53_0,esk52_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_42,plain,
( ~ ssList(X1)
| app(app(X4,cons(X2,X5)),cons(X3,X6)) != X1
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssItem(X3)
| ~ ssItem(X2)
| ~ totalorderedP(X1)
| leq(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_43,negated_conjecture,
app(app(esk54_0,cons(esk52_0,esk55_0)),cons(esk53_0,esk56_0)) = esk48_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_25]),c_0_27]),c_0_29])]) ).
cnf(c_0_44,negated_conjecture,
totalorderedP(esk50_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_45,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_46,plain,
! [X147,X148] :
( ~ lt(X148,X147)
| ~ lt(X147,X148)
| ~ ssItem(X148)
| ~ ssItem(X147) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_38])])])]) ).
cnf(c_0_47,plain,
( ~ leq(X2,X1)
| ~ leq(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_48,negated_conjecture,
leq(esk53_0,esk52_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_22]),c_0_29])]) ).
cnf(c_0_49,negated_conjecture,
( ~ ssList(X1)
| ~ totalorderedP(X1)
| esk48_0 != X1
| leq(esk52_0,esk53_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(spm,[status(thm)],[c_0_42,c_0_43]),c_0_27]),c_0_16]),c_0_17]),c_0_29]),c_0_22])]) ).
cnf(c_0_50,negated_conjecture,
totalorderedP(esk48_0),
inference(rw,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_51,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_52,plain,
( ~ lt(X2,X1)
| ~ lt(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_53,negated_conjecture,
( ~ leq(esk52_0,esk53_0)
| esk53_0 = esk52_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_29]),c_0_22])]) ).
cnf(c_0_54,negated_conjecture,
leq(esk52_0,esk53_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_49]),c_0_50]),c_0_51])]) ).
cnf(c_0_55,negated_conjecture,
~ lt(esk52_0,esk53_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_41]),c_0_29]),c_0_22])]) ).
cnf(c_0_56,negated_conjecture,
esk53_0 = esk52_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_54])]) ).
cnf(c_0_57,negated_conjecture,
~ lt(esk52_0,esk52_0),
inference(rw,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_58,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_56]),c_0_57]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC300+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.09/0.37 % Computer : n020.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Mon Sep 21 08:14:17 UTC 2026
% 0.09/0.38 % CPUTime :
% 0.09/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.45 Running first-order theorem proving
% 0.14/0.45 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.20/0.64 % Version: 3.5.1
% 0.20/0.64 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.64 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.64 % Starting new_bool_3 with 300s (1) cores
% 0.20/0.64 % Starting new_bool_1 with 300s (1) cores
% 0.20/0.64 % Starting sh5l with 300s (1) cores
% 0.20/0.64 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2462132 completed with status 0
% 0.20/0.64 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.20/0.64 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.64 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.64 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.20/0.64 % No SInE strategy applied
% 0.20/0.64 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.20/0.64 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.64 % Starting SubtermCWHack with 136s (1) cores
% 0.20/0.64 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.20/0.64 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 0.20/0.64 % Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.20/0.64 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.20/0.64 % G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with pid 2462141 completed with status 0
% 0.20/0.64 % Result found by G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d
% 0.20/0.64 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.64 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.64 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.20/0.64 % No SInE strategy applied
% 0.20/0.64 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.20/0.64 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.64 % Starting SubtermCWHack with 136s (1) cores
% 0.20/0.64 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.20/0.64 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 0.20/0.64 % Preprocessing time : 0.003 s
% 0.20/0.64
% 0.20/0.64 % Proof found!
% 0.20/0.64 % SZS status Theorem
% 0.20/0.64 % SZS output start CNFRefutation
% See solution above
% 0.20/0.64 % Parsed axioms : 96
% 0.20/0.64 % Removed by relevancy pruning/SinE : 0
% 0.20/0.64 % Initial clauses : 204
% 0.20/0.64 % Removed in clause preprocessing : 2
% 0.20/0.64 % Initial clauses in saturation : 202
% 0.20/0.64 % Processed clauses : 629
% 0.20/0.64 % ...of these trivial : 28
% 0.20/0.64 % ...subsumed : 55
% 0.20/0.64 % ...remaining for further processing : 545
% 0.20/0.64 % Other redundant clauses eliminated : 69
% 0.20/0.64 % Clauses deleted for lack of memory : 0
% 0.20/0.64 % Backward-subsumed : 38
% 0.20/0.64 % Backward-rewritten : 88
% 0.20/0.64 % Generated clauses : 2122
% 0.20/0.64 % ...of the previous two non-redundant : 1852
% 0.20/0.64 % ...aggressively subsumed : 0
% 0.20/0.64 % Contextual simplify-reflections : 24
% 0.20/0.64 % Paramodulations : 2027
% 0.20/0.64 % Factorizations : 0
% 0.20/0.64 % NegExts : 0
% 0.20/0.64 % Equation resolutions : 95
% 0.20/0.64 % Disequality decompositions : 0
% 0.20/0.64 % Total rewrite steps : 1939
% 0.20/0.64 % ...of those cached : 1861
% 0.20/0.64 % Propositional unsat checks : 0
% 0.20/0.64 % Propositional check models : 0
% 0.20/0.64 % Propositional check unsatisfiable : 0
% 0.20/0.64 % Propositional clauses : 0
% 0.20/0.64 % Propositional clauses after purity: 0
% 0.20/0.64 % Propositional unsat core size : 0
% 0.20/0.64 % Propositional preprocessing time : 0.000
% 0.20/0.64 % Propositional encoding time : 0.000
% 0.20/0.64 % Propositional solver time : 0.000
% 0.20/0.64 % Success case prop preproc time : 0.000
% 0.20/0.64 % Success case prop encoding time : 0.000
% 0.20/0.64 % Success case prop solver time : 0.000
% 0.20/0.64 % Current number of processed clauses : 413
% 0.20/0.64 % Positive orientable unit clauses : 89
% 0.20/0.64 % Positive unorientable unit clauses: 0
% 0.20/0.64 % Negative unit clauses : 4
% 0.20/0.64 % Non-unit-clauses : 320
% 0.20/0.64 % Current number of unprocessed clauses: 1415
% 0.20/0.64 % ...number of literals in the above : 8034
% 0.20/0.64 % Current number of archived formulas : 0
% 0.20/0.64 % Current number of archived clauses : 126
% 0.20/0.64 % Clause-clause subsumption calls (NU) : 20284
% 0.20/0.64 % Rec. Clause-clause subsumption calls : 11069
% 0.20/0.64 % Non-unit clause-clause subsumptions : 116
% 0.20/0.64 % Unit Clause-clause subsumption calls : 472
% 0.20/0.64 % Rewrite failures with RHS unbound : 0
% 0.20/0.64 % BW rewrite match attempts : 229
% 0.20/0.64 % BW rewrite match successes : 44
% 0.20/0.64 % Condensation attempts : 0
% 0.20/0.64 % Condensation successes : 0
% 0.20/0.64 % Termbank termtop insertions : 67045
% 0.20/0.64 % Search garbage collected termcells : 4292
% 0.20/0.64
% 0.20/0.64 % -------------------------------------------------
% 0.20/0.64 % User time : 0.089 s
% 0.20/0.64 % System time : 0.012 s
% 0.20/0.64 % Total time : 0.101 s
% 0.20/0.64 % Maximum resident set size: 4224 pages
% 0.20/0.64
% 0.20/0.64 % -------------------------------------------------
% 0.20/0.64 % User time : 0.291 s
% 0.20/0.64 % System time : 0.034 s
% 0.20/0.64 % Total time : 0.325 s
% 0.20/0.64 % Maximum resident set size: 4608 pages
% 0.20/0.64 % E exiting
%------------------------------------------------------------------------------