%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC302+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 : n014.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:51 PM UTC 2026
% Result : Theorem 0.33s 0.77s
% Output : CNFRefutation 0.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 10
% Syntax : Number of formulae : 60 ( 24 unt; 0 def)
% Number of atoms : 244 ( 43 equ)
% Maximal formula atoms : 30 ( 4 avg)
% Number of connectives : 290 ( 106 ~; 99 |; 26 &)
% ( 3 <=>; 56 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 5 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 8 ( 6 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)
| ~ segmentP(X4,X3)
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/SWC001+0.ax',ax82) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
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(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/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/sandbox/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/sandbox/benchmark/Axioms/SWC001+0.ax',ax11) ).
fof(ax33,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
=> ~ lt(X2,X1) ) ) ),
file('/export/starexec/sandbox/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/sandbox/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)
| ~ segmentP(X4,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)
| ~ segmentP(X4,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)
& segmentP(esk51_0,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])])]) ).
cnf(c_0_13,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_14,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_15,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_16,negated_conjecture,
app(app(app(app(esk54_0,cons(esk52_0,nil)),esk55_0),cons(esk53_0,nil)),esk56_0) = esk50_0,
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X1,X2),X3) = app(X1,app(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_18,negated_conjecture,
ssList(esk55_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,negated_conjecture,
ssList(esk54_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_20,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_21,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) = esk50_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_19])]) ).
cnf(c_0_22,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ssList(cons(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_23,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_24,negated_conjecture,
ssItem(esk52_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_25,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_26,negated_conjecture,
app(app(app(esk54_0,app(cons(esk52_0,nil),esk55_0)),cons(esk53_0,nil)),esk56_0) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24])]) ).
cnf(c_0_27,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| cons(X2,X1) = app(cons(X2,nil),X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_28,negated_conjecture,
app(app(app(esk54_0,cons(esk52_0,esk55_0)),cons(esk53_0,nil)),esk56_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_18]),c_0_24])]) ).
cnf(c_0_29,negated_conjecture,
ssList(esk56_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_30,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)) = esk50_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_28]),c_0_29])]) ).
cnf(c_0_31,negated_conjecture,
ssItem(esk53_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_32,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_33,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)) = esk50_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_22]),c_0_23]),c_0_31])]) ).
cnf(c_0_34,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
fof(c_0_35,plain,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
<=> ( leq(X1,X2)
& X1 != X2 ) ) ) ),
inference(fof_simplification,[status(thm)],[ax93]) ).
cnf(c_0_36,negated_conjecture,
( ~ ssList(cons(esk52_0,esk55_0))
| app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0)) = esk50_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_19])]) ).
fof(c_0_37,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_35])])])])]) ).
fof(c_0_38,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_39,negated_conjecture,
app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0)) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_22]),c_0_18]),c_0_24])]) ).
fof(c_0_40,plain,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
=> ~ lt(X2,X1) ) ) ),
inference(fof_simplification,[status(thm)],[ax33]) ).
fof(c_0_41,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_42,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ lt(X1,X2)
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_43,negated_conjecture,
lt(esk53_0,esk52_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_44,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_38]) ).
cnf(c_0_45,negated_conjecture,
app(app(esk54_0,cons(esk52_0,esk55_0)),cons(esk53_0,esk56_0)) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_27]),c_0_29]),c_0_31])]) ).
cnf(c_0_46,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_47,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_40])])])]) ).
cnf(c_0_48,plain,
( ~ leq(X2,X1)
| ~ leq(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_49,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_42,c_0_43]),c_0_24]),c_0_31])]) ).
cnf(c_0_50,negated_conjecture,
( ~ ssList(X1)
| ~ totalorderedP(X1)
| esk50_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_44,c_0_45]),c_0_29]),c_0_18]),c_0_19]),c_0_31]),c_0_24])]) ).
cnf(c_0_51,negated_conjecture,
totalorderedP(esk50_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_52,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_46,c_0_14]) ).
cnf(c_0_53,plain,
( ~ lt(X2,X1)
| ~ lt(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_54,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_48,c_0_49]),c_0_31]),c_0_24])]) ).
cnf(c_0_55,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_50]),c_0_51]),c_0_52])]) ).
cnf(c_0_56,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_53,c_0_43]),c_0_31]),c_0_24])]) ).
cnf(c_0_57,negated_conjecture,
esk53_0 = esk52_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_55])]) ).
cnf(c_0_58,negated_conjecture,
~ lt(esk52_0,esk52_0),
inference(rw,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_59,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_57]),c_0_58]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC302+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.46 % Computer : n014.cluster.edu
% 0.19/0.46 % Model : x86_64 x86_64
% 0.19/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.46 % Memory : 8046.5625MB
% 0.19/0.46 % OS : Linux 6.8.0-71-generic
% 0.19/0.46 % CPULimit : 300
% 0.19/0.46 % WCLimit : 300
% 0.19/0.46 % DateTime : Mon Sep 21 08:13:35 UTC 2026
% 0.19/0.47 % CPUTime :
% 0.19/0.47 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/0.55 Running first-order theorem proving
% 0.23/0.55 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.33/0.77 % Version: 3.5.1
% 0.33/0.77 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.33/0.77 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.33/0.77 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.33/0.77 % Starting new_bool_3 with 300s (1) cores
% 0.33/0.77 % Starting new_bool_1 with 300s (1) cores
% 0.33/0.77 % Starting sh5l with 300s (1) cores
% 0.33/0.77 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 3613433 completed with status 0
% 0.33/0.77 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.33/0.77 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.33/0.77 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.33/0.77 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.33/0.77 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.33/0.77 % No SInE strategy applied
% 0.33/0.77 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.33/0.77 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.33/0.77 % Starting SubtermCWHack with 136s (1) cores
% 0.33/0.77 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.33/0.77 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 0.33/0.77 % Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.33/0.77 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.33/0.77 % G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with pid 3613439 completed with status 0
% 0.33/0.77 % Result found by G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d
% 0.33/0.77 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.33/0.77 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.33/0.77 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.33/0.77 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.33/0.77 % No SInE strategy applied
% 0.33/0.77 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.33/0.77 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.33/0.77 % Starting SubtermCWHack with 136s (1) cores
% 0.33/0.77 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.33/0.77 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 0.33/0.77 % Preprocessing time : 0.005 s
% 0.33/0.77
% 0.33/0.77 % Proof found!
% 0.33/0.77 % SZS status Theorem
% 0.33/0.77 % SZS output start CNFRefutation
% See solution above
% 0.33/0.78 % Parsed axioms : 96
% 0.33/0.78 % Removed by relevancy pruning/SinE : 0
% 0.33/0.78 % Initial clauses : 205
% 0.33/0.78 % Removed in clause preprocessing : 2
% 0.33/0.78 % Initial clauses in saturation : 203
% 0.33/0.78 % Processed clauses : 648
% 0.33/0.78 % ...of these trivial : 28
% 0.33/0.78 % ...subsumed : 56
% 0.33/0.78 % ...remaining for further processing : 563
% 0.33/0.78 % Other redundant clauses eliminated : 69
% 0.33/0.78 % Clauses deleted for lack of memory : 0
% 0.33/0.78 % Backward-subsumed : 39
% 0.33/0.78 % Backward-rewritten : 90
% 0.33/0.78 % Generated clauses : 2145
% 0.33/0.78 % ...of the previous two non-redundant : 1875
% 0.33/0.78 % ...aggressively subsumed : 0
% 0.33/0.78 % Contextual simplify-reflections : 24
% 0.33/0.78 % Paramodulations : 2049
% 0.33/0.78 % Factorizations : 0
% 0.33/0.78 % NegExts : 0
% 0.33/0.78 % Equation resolutions : 96
% 0.33/0.78 % Disequality decompositions : 0
% 0.33/0.78 % Total rewrite steps : 1984
% 0.33/0.78 % ...of those cached : 1903
% 0.33/0.78 % Propositional unsat checks : 0
% 0.33/0.78 % Propositional check models : 0
% 0.33/0.78 % Propositional check unsatisfiable : 0
% 0.33/0.78 % Propositional clauses : 0
% 0.33/0.78 % Propositional clauses after purity: 0
% 0.33/0.78 % Propositional unsat core size : 0
% 0.33/0.78 % Propositional preprocessing time : 0.000
% 0.33/0.78 % Propositional encoding time : 0.000
% 0.33/0.78 % Propositional solver time : 0.000
% 0.33/0.78 % Success case prop preproc time : 0.000
% 0.33/0.78 % Success case prop encoding time : 0.000
% 0.33/0.78 % Success case prop solver time : 0.000
% 0.33/0.78 % Current number of processed clauses : 428
% 0.33/0.78 % Positive orientable unit clauses : 98
% 0.33/0.78 % Positive unorientable unit clauses: 0
% 0.33/0.78 % Negative unit clauses : 4
% 0.33/0.78 % Non-unit-clauses : 326
% 0.33/0.78 % Current number of unprocessed clauses: 1420
% 0.33/0.78 % ...number of literals in the above : 8040
% 0.33/0.78 % Current number of archived formulas : 0
% 0.33/0.78 % Current number of archived clauses : 129
% 0.33/0.78 % Clause-clause subsumption calls (NU) : 21148
% 0.33/0.78 % Rec. Clause-clause subsumption calls : 11620
% 0.33/0.78 % Non-unit clause-clause subsumptions : 118
% 0.33/0.78 % Unit Clause-clause subsumption calls : 650
% 0.33/0.78 % Rewrite failures with RHS unbound : 0
% 0.33/0.78 % BW rewrite match attempts : 230
% 0.33/0.78 % BW rewrite match successes : 45
% 0.33/0.78 % Condensation attempts : 0
% 0.33/0.78 % Condensation successes : 0
% 0.33/0.78 % Termbank termtop insertions : 67453
% 0.33/0.78 % Search garbage collected termcells : 4300
% 0.33/0.78
% 0.33/0.78 % -------------------------------------------------
% 0.33/0.78 % User time : 0.148 s
% 0.33/0.78 % System time : 0.011 s
% 0.33/0.78 % Total time : 0.159 s
% 0.33/0.78 % Maximum resident set size: 4020 pages
% 0.33/0.78
% 0.33/0.78 % -------------------------------------------------
% 0.33/0.78 % User time : 0.648 s
% 0.33/0.78 % System time : 0.048 s
% 0.33/0.78 % Total time : 0.696 s
% 0.33/0.78 % Maximum resident set size: 4864 pages
% 0.33/0.78 % E exiting
%------------------------------------------------------------------------------