%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC226+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 : n016.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:32 PM UTC 2026
% Result : Theorem 2.43s 0.86s
% Output : CNFRefutation 2.43s
% 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 : 351 ( 132 ~; 121 |; 52 &)
% ( 1 <=>; 45 =>; 0 <=; 0 <~>)
% Maximal formula depth : 31 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 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] :
( ssList(X4)
=> ( ( nil = X3
& nil != X4 )
| ! [X9] :
( ssList(X9)
=> ( ? [X10] :
( ? [X11] :
( ? [X12] :
( ? [X13] :
( leq(X12,X10)
& app(X13,cons(X12,nil)) = X3
& ssList(X13) )
& ssItem(X12) )
& app(cons(X10,nil),X11) = X9
& ssList(X11) )
& ssItem(X10) )
| ~ totalorderedP(X3)
| app(X3,X9) != X4 ) )
| ? [X5] :
( ? [X6] :
( ? [X7] :
( ! [X8] :
( ssItem(X8)
=> ( leq(X8,X5)
| ~ leq(X5,X8)
| ~ memberP(X7,X8)
| ~ memberP(X6,X8) ) )
& app(app(X6,cons(X5,nil)),X7) = X1
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
| nil = X1
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax38,axiom,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax38) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox/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/sandbox/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/sandbox/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(ax22,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/SWC001+0.ax',ax83) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax78,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax78) ).
fof(ax24,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax24) ).
fof(c_0_11,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( nil = X3
& nil != X4 )
| ! [X9] :
( ssList(X9)
=> ( ? [X10] :
( ? [X11] :
( ? [X12] :
( ? [X13] :
( leq(X12,X10)
& app(X13,cons(X12,nil)) = X3
& ssList(X13) )
& ssItem(X12) )
& app(cons(X10,nil),X11) = X9
& ssList(X11) )
& ssItem(X10) )
| ~ totalorderedP(X3)
| app(X3,X9) != X4 ) )
| ? [X5] :
( ? [X6] :
( ? [X7] :
( ! [X8] :
( ssItem(X8)
=> ( leq(X8,X5)
| ~ leq(X5,X8)
| ~ memberP(X7,X8)
| ~ memberP(X6,X8) ) )
& app(app(X6,cons(X5,nil)),X7) = X1
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
| nil = X1
| X1 != X3
| X2 != 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] :
( ssList(X4)
=> ( ( nil = X3
& nil != X4 )
| ! [X9] :
( ssList(X9)
=> ( ? [X10] :
( ? [X11] :
( ? [X12] :
( ? [X13] :
( leq(X12,X10)
& app(X13,cons(X12,nil)) = X3
& ssList(X13) )
& ssItem(X12) )
& app(cons(X10,nil),X11) = X9
& ssList(X11) )
& ssItem(X10) )
| ~ totalorderedP(X3)
| app(X3,X9) != X4 ) )
| ? [X5] :
( ? [X6] :
( ? [X7] :
( ! [X8] :
( ssItem(X8)
=> ( leq(X8,X5)
| ~ leq(X5,X8)
| ~ memberP(X7,X8)
| ~ memberP(X6,X8) ) )
& app(app(X6,cons(X5,nil)),X7) = X1
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
| nil = X1
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_14,plain,
! [X164] :
( ~ memberP(nil,X164)
| ~ ssItem(X164) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])]) ).
fof(c_0_15,negated_conjecture,
! [X262,X263,X264,X267,X268,X269,X270] :
( ( nil != esk50_0
| nil = esk51_0 )
& ( ~ leq(X269,X267)
| app(X270,cons(X269,nil)) != esk50_0
| ~ ssList(X270)
| ~ ssItem(X269)
| app(cons(X267,nil),X268) != esk53_0
| ~ ssList(X268)
| ~ ssItem(X267) )
& totalorderedP(esk50_0)
& app(esk50_0,esk53_0) = esk51_0
& ssList(esk53_0)
& ( ~ ssItem(X262)
| ~ ssList(X263)
| app(app(X263,cons(X262,nil)),X264) != esk48_0
| ~ ssList(X264)
| ~ leq(esk52_3(X262,X263,X264),X262) )
& ( ~ ssItem(X262)
| ~ ssList(X263)
| app(app(X263,cons(X262,nil)),X264) != esk48_0
| ~ ssList(X264)
| leq(X262,esk52_3(X262,X263,X264)) )
& ( ~ ssItem(X262)
| ~ ssList(X263)
| app(app(X263,cons(X262,nil)),X264) != esk48_0
| ~ ssList(X264)
| memberP(X264,esk52_3(X262,X263,X264)) )
& ( ~ ssItem(X262)
| ~ ssList(X263)
| app(app(X263,cons(X262,nil)),X264) != esk48_0
| ~ ssList(X264)
| memberP(X263,esk52_3(X262,X263,X264)) )
& ( ~ ssItem(X262)
| ~ ssList(X263)
| app(app(X263,cons(X262,nil)),X264) != esk48_0
| ~ ssList(X264)
| ssItem(esk52_3(X262,X263,X264)) )
& nil != esk48_0
& esk48_0 = esk50_0
& esk49_0 = esk51_0
& ssList(esk51_0)
& ssList(esk50_0)
& ssList(esk49_0)
& ssList(esk48_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) != esk48_0
| ~ ssList(X3)
| memberP(X1,esk52_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(esk52_3(X1,nil,X2))
| ~ ssList(X2)
| app(app(nil,cons(X1,nil)),X2) != esk48_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) != esk48_0
| ~ ssList(X3)
| ssItem(esk52_3(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_21,plain,
! [X142] :
( app(nil,X142) = X142
| ~ ssList(X142) ),
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) != esk48_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,
! [X227,X228] :
( cons(X228,X227) = app(cons(X228,nil),X227)
| ~ ssItem(X228)
| ~ ssList(X227) ),
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,
! [X235,X236] :
( hd(app(X235,X236)) = hd(X235)
| nil = X235
| ~ ssList(X236)
| ~ ssList(X235) ),
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(esk50_0,esk53_0) = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_29,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_30,plain,
! [X232,X233] :
( ( ~ ssList(X232)
| ~ ssList(X233)
| nil = app(X232,X233)
| nil != X232
| nil != X233 )
& ( ~ ssList(X232)
| ~ ssList(X233)
| nil != app(X232,X233)
| nil = X232 )
& ( ~ ssList(X232)
| ~ ssList(X233)
| nil != app(X232,X233)
| nil = X233 ) ),
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) != esk48_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,
! [X118,X119] :
( ssList(cons(X119,X118))
| ~ ssItem(X119)
| ~ ssList(X118) ),
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,
! [X131] :
( ssItem(hd(X131))
| nil = X131
| ~ ssList(X131) ),
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(esk48_0,esk53_0) = esk51_0,
inference(rw,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_38,negated_conjecture,
ssList(esk53_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_39,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_40,negated_conjecture,
nil != esk48_0,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_41,negated_conjecture,
ssList(esk49_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_42,negated_conjecture,
esk49_0 = esk51_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) != esk48_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,
! [X220] :
( cons(hd(X220),tl(X220)) = X220
| nil = X220
| ~ ssList(X220) ),
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(esk51_0) = hd(esk48_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(esk51_0),
inference(rw,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_50,negated_conjecture,
esk51_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) != esk48_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(esk48_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,
! [X134] :
( ssList(tl(X134))
| nil = X134
| ~ ssList(X134) ),
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(esk48_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.04 % Problem : SWC226+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.41 % Computer : n016.cluster.edu
% 0.17/0.41 % Model : x86_64 x86_64
% 0.17/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.41 % Memory : 8046.5625MB
% 0.17/0.41 % OS : Linux 6.8.0-71-generic
% 0.17/0.41 % CPULimit : 300
% 0.17/0.41 % WCLimit : 300
% 0.17/0.41 % DateTime : Mon Sep 21 08:10:37 UTC 2026
% 0.17/0.42 % CPUTime :
% 0.17/0.42 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.49 Running first-order theorem proving
% 0.17/0.49 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
% 2.43/0.86 % Version: 3.5.1
% 2.43/0.86 % Preprocessing class: FSLSSMSSSSSNFFN.
% 2.43/0.86 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.43/0.86 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 2.43/0.86 % Starting new_bool_3 with 300s (1) cores
% 2.43/0.86 % Starting new_bool_1 with 300s (1) cores
% 2.43/0.86 % Starting sh5l with 300s (1) cores
% 2.43/0.86 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1977775 completed with status 0
% 2.43/0.86 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 2.43/0.86 % Preprocessing class: FSLSSMSSSSSNFFN.
% 2.43/0.86 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.43/0.86 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 2.43/0.86 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.43/0.86 % No SInE strategy applied
% 2.43/0.86 % Search class: FGHSF-FSLM31-MFFFFFNN
% 2.43/0.86 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.43/0.86 % Starting SubtermCWHack with 136s (1) cores
% 2.43/0.86 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 2.43/0.86 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 2.43/0.86 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 2.43/0.86 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 2.43/0.86 % SAT001_MinMin_p005000_rr_RG with pid 1977785 completed with status 0
% 2.43/0.86 % Result found by SAT001_MinMin_p005000_rr_RG
% 2.43/0.86 % Preprocessing class: FSLSSMSSSSSNFFN.
% 2.43/0.86 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.43/0.86 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 2.43/0.86 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.43/0.86 % No SInE strategy applied
% 2.43/0.86 % Search class: FGHSF-FSLM31-MFFFFFNN
% 2.43/0.86 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.43/0.86 % Starting SubtermCWHack with 136s (1) cores
% 2.43/0.86 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 2.43/0.86 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 2.43/0.86 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 2.43/0.86 % Preprocessing time : 0.006 s
% 2.43/0.86 % Presaturation interreduction done
% 2.43/0.86
% 2.43/0.86 % Proof found!
% 2.43/0.86 % SZS status Theorem
% 2.43/0.86 % SZS output start CNFRefutation
% See solution above
% 2.43/0.86 % Parsed axioms : 96
% 2.43/0.86 % Removed by relevancy pruning/SinE : 0
% 2.43/0.86 % Initial clauses : 207
% 2.43/0.86 % Removed in clause preprocessing : 2
% 2.43/0.86 % Initial clauses in saturation : 205
% 2.43/0.86 % Processed clauses : 1747
% 2.43/0.86 % ...of these trivial : 30
% 2.43/0.86 % ...subsumed : 758
% 2.43/0.86 % ...remaining for further processing : 959
% 2.43/0.86 % Other redundant clauses eliminated : 166
% 2.43/0.86 % Clauses deleted for lack of memory : 0
% 2.43/0.86 % Backward-subsumed : 170
% 2.43/0.86 % Backward-rewritten : 14
% 2.43/0.86 % Generated clauses : 4394
% 2.43/0.86 % ...of the previous two non-redundant : 3878
% 2.43/0.86 % ...aggressively subsumed : 0
% 2.43/0.86 % Contextual simplify-reflections : 143
% 2.43/0.86 % Paramodulations : 4225
% 2.43/0.86 % Factorizations : 0
% 2.43/0.86 % NegExts : 0
% 2.43/0.86 % Equation resolutions : 171
% 2.43/0.86 % Disequality decompositions : 0
% 2.43/0.86 % Total rewrite steps : 3311
% 2.43/0.86 % ...of those cached : 3269
% 2.43/0.86 % Propositional unsat checks : 0
% 2.43/0.86 % Propositional check models : 0
% 2.43/0.86 % Propositional check unsatisfiable : 0
% 2.43/0.86 % Propositional clauses : 0
% 2.43/0.86 % Propositional clauses after purity: 0
% 2.43/0.86 % Propositional unsat core size : 0
% 2.43/0.86 % Propositional preprocessing time : 0.000
% 2.43/0.86 % Propositional encoding time : 0.000
% 2.43/0.86 % Propositional solver time : 0.000
% 2.43/0.86 % Success case prop preproc time : 0.000
% 2.43/0.86 % Success case prop encoding time : 0.000
% 2.43/0.86 % Success case prop solver time : 0.000
% 2.43/0.86 % Current number of processed clauses : 554
% 2.43/0.86 % Positive orientable unit clauses : 45
% 2.43/0.86 % Positive unorientable unit clauses: 0
% 2.43/0.86 % Negative unit clauses : 15
% 2.43/0.86 % Non-unit-clauses : 494
% 2.43/0.86 % Current number of unprocessed clauses: 2476
% 2.43/0.86 % ...number of literals in the above : 15700
% 2.43/0.86 % Current number of archived formulas : 0
% 2.43/0.86 % Current number of archived clauses : 382
% 2.43/0.86 % Clause-clause subsumption calls (NU) : 71073
% 2.43/0.86 % Rec. Clause-clause subsumption calls : 16252
% 2.43/0.86 % Non-unit clause-clause subsumptions : 739
% 2.43/0.86 % Unit Clause-clause subsumption calls : 1741
% 2.43/0.86 % Rewrite failures with RHS unbound : 0
% 2.43/0.86 % BW rewrite match attempts : 13
% 2.43/0.86 % BW rewrite match successes : 13
% 2.43/0.86 % Condensation attempts : 0
% 2.43/0.86 % Condensation successes : 0
% 2.43/0.86 % Termbank termtop insertions : 101296
% 2.43/0.86 % Search garbage collected termcells : 4514
% 2.43/0.86
% 2.43/0.86 % -------------------------------------------------
% 2.43/0.86 % User time : 0.314 s
% 2.43/0.86 % System time : 0.022 s
% 2.43/0.86 % Total time : 0.336 s
% 2.43/0.86 % Maximum resident set size: 4280 pages
% 2.43/0.86
% 2.43/0.86 % -------------------------------------------------
% 2.43/0.86 % User time : 1.553 s
% 2.43/0.86 % System time : 0.064 s
% 2.43/0.86 % Total time : 1.617 s
% 2.43/0.86 % Maximum resident set size: 4864 pages
% 2.43/0.86 % E exiting
%------------------------------------------------------------------------------