%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC167+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 : n011.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:17 PM UTC 2026
% Result : Theorem 0.13s 0.48s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 9
% Syntax : Number of formulae : 49 ( 18 unt; 0 def)
% Number of atoms : 248 ( 57 equ)
% Maximal formula atoms : 30 ( 5 avg)
% Number of connectives : 298 ( 99 ~; 98 |; 45 &)
% ( 3 <=>; 53 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 6 avg)
% Maximal term depth : 5 ( 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 : 105 ( 0 sgn 73 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( nil = X3
& nil != X4 )
| ! [X10] :
( ssItem(X10)
=> ! [X11] :
( ssItem(X11)
=> ! [X12] :
( ssList(X12)
=> ! [X13] :
( ssList(X13)
=> ( neq(X10,X11)
| app(app(app(X12,cons(X10,nil)),cons(X11,nil)),X13) != X1 ) ) ) ) )
| ! [X5] :
( ssList(X5)
=> ( ? [X6] :
( ? [X7] :
( ? [X8] :
( ? [X9] :
( lt(X8,X6)
& app(X9,cons(X8,nil)) = X3
& ssList(X9) )
& ssItem(X8) )
& app(cons(X6,nil),X7) = X5
& ssList(X7) )
& ssItem(X6) )
| ~ strictorderedP(X3)
| app(X3,X5) != X4 ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax1,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox/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/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(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
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(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/sandbox/benchmark/Axioms/SWC001+0.ax',ax12) ).
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(c_0_9,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( nil = X3
& nil != X4 )
| ! [X10] :
( ssItem(X10)
=> ! [X11] :
( ssItem(X11)
=> ! [X12] :
( ssList(X12)
=> ! [X13] :
( ssList(X13)
=> ( neq(X10,X11)
| app(app(app(X12,cons(X10,nil)),cons(X11,nil)),X13) != X1 ) ) ) ) )
| ! [X5] :
( ssList(X5)
=> ( ? [X6] :
( ? [X7] :
( ? [X8] :
( ? [X9] :
( lt(X8,X6)
& app(X9,cons(X8,nil)) = X3
& ssList(X9) )
& ssItem(X8) )
& app(cons(X6,nil),X7) = X5
& ssList(X7) )
& ssItem(X6) )
| ~ strictorderedP(X3)
| app(X3,X5) != X4 ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_10,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( nil = X3
& nil != X4 )
| ! [X10] :
( ssItem(X10)
=> ! [X11] :
( ssItem(X11)
=> ! [X12] :
( ssList(X12)
=> ! [X13] :
( ssList(X13)
=> ( neq(X10,X11)
| app(app(app(X12,cons(X10,nil)),cons(X11,nil)),X13) != X1 ) ) ) ) )
| ! [X5] :
( ssList(X5)
=> ( ? [X6] :
( ? [X7] :
( ? [X8] :
( ? [X9] :
( lt(X8,X6)
& app(X9,cons(X8,nil)) = X3
& ssList(X9) )
& ssItem(X8) )
& app(cons(X6,nil),X7) = X5
& ssList(X7) )
& ssItem(X6) )
| ~ strictorderedP(X3)
| app(X3,X5) != X4 ) )
| X1 != X3
| X2 != 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,
! [X263,X264,X265,X266] :
( ( nil != esk50_0
| nil = esk51_0 )
& ~ neq(esk53_0,esk54_0)
& app(app(app(esk55_0,cons(esk53_0,nil)),cons(esk54_0,nil)),esk56_0) = esk48_0
& ssList(esk56_0)
& ssList(esk55_0)
& ssItem(esk54_0)
& ssItem(esk53_0)
& ( ~ lt(X265,X263)
| app(X266,cons(X265,nil)) != esk50_0
| ~ ssList(X266)
| ~ ssItem(X265)
| app(cons(X263,nil),X264) != esk52_0
| ~ ssList(X264)
| ~ ssItem(X263) )
& strictorderedP(esk50_0)
& app(esk50_0,esk52_0) = esk51_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,
! [X14,X15] :
( ( ~ ssItem(X14)
| ~ ssItem(X15)
| neq(X14,X15)
| X14 = X15 )
& ( ~ ssItem(X14)
| ~ ssItem(X15)
| X14 != X15
| ~ neq(X14,X15) ) ),
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(esk55_0,cons(esk53_0,nil)),cons(esk54_0,nil)),esk56_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,
! [X229,X230,X231] :
( app(app(X229,X230),X231) = app(X229,app(X230,X231))
| ~ ssList(X231)
| ~ ssList(X230)
| ~ ssList(X229) ),
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(esk53_0,esk54_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(esk54_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,negated_conjecture,
ssItem(esk53_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21,negated_conjecture,
app(app(app(esk55_0,cons(esk53_0,nil)),cons(esk54_0,nil)),esk56_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(esk56_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_24,negated_conjecture,
esk54_0 = esk53_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,
! [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])])])]) ).
cnf(c_0_26,negated_conjecture,
( ~ ssList(cons(esk53_0,nil))
| ~ ssList(app(esk55_0,cons(esk53_0,nil)))
| app(app(esk55_0,cons(esk53_0,nil)),app(cons(esk53_0,nil),esk56_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,
! [X137,X138] :
( ssList(app(X137,X138))
| ~ ssList(X138)
| ~ ssList(X137) ),
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(esk55_0,cons(esk53_0,nil)))
| app(app(esk55_0,cons(esk53_0,nil)),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_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(esk55_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_33,negated_conjecture,
( ~ ssList(cons(esk53_0,nil))
| app(app(esk55_0,cons(esk53_0,nil)),app(cons(esk53_0,nil),esk56_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_34,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_35,plain,
! [X85,X86,X87,X88,X89,X90] :
( ( ~ ssList(X85)
| strictorderedP(X85)
| ~ lt(esk30_1(X85),esk31_1(X85)) )
& ( ~ ssList(X85)
| strictorderedP(X85)
| app(app(esk32_1(X85),cons(esk30_1(X85),esk33_1(X85))),cons(esk31_1(X85),esk34_1(X85))) = X85 )
& ( ~ ssList(X85)
| strictorderedP(X85)
| ssList(esk34_1(X85)) )
& ( ~ ssList(X85)
| strictorderedP(X85)
| ssList(esk33_1(X85)) )
& ( ~ ssList(X85)
| strictorderedP(X85)
| ssList(esk32_1(X85)) )
& ( ~ ssList(X85)
| strictorderedP(X85)
| ssItem(esk31_1(X85)) )
& ( ~ ssList(X85)
| strictorderedP(X85)
| ssItem(esk30_1(X85)) )
& ( ~ ssList(X85)
| lt(X86,X87)
| app(app(X88,cons(X86,X89)),cons(X87,X90)) != X85
| ~ ssList(X90)
| ~ ssList(X89)
| ~ ssList(X88)
| ~ ssItem(X87)
| ~ ssItem(X86)
| ~ strictorderedP(X85) ) ),
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_36,negated_conjecture,
app(app(esk55_0,cons(esk53_0,nil)),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_33,c_0_27]),c_0_28]),c_0_20])]) ).
cnf(c_0_37,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| cons(X2,X1) = app(cons(X2,nil),X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
fof(c_0_38,plain,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
=> ~ lt(X2,X1) ) ) ),
inference(fof_simplification,[status(thm)],[ax33]) ).
cnf(c_0_39,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_35]) ).
cnf(c_0_40,negated_conjecture,
app(app(esk55_0,cons(esk53_0,nil)),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_36,c_0_37]),c_0_23]),c_0_20])]) ).
cnf(c_0_41,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_42,plain,
! [X151,X152] :
( ~ lt(X152,X151)
| ~ lt(X151,X152)
| ~ ssItem(X152)
| ~ ssItem(X151) ),
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_43,negated_conjecture,
( ~ ssList(X1)
| ~ strictorderedP(X1)
| esk50_0 != X1
| lt(esk53_0,esk53_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_23]),c_0_28]),c_0_32]),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_41,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_42]) ).
cnf(c_0_47,negated_conjecture,
lt(esk53_0,esk53_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_43]),c_0_44]),c_0_45])]) ).
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.02 % Problem : SWC167+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n011.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 08:01:41 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.41 Running first-order theorem proving
% 0.13/0.41 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.13/0.48 % Version: 3.5.1
% 0.13/0.48 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.48 % Starting sh5l with 300s (1) cores
% 0.13/0.48 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1410725 completed with status 0
% 0.13/0.48 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.13/0.48 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.48 % No SInE strategy applied
% 0.13/0.48 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.13/0.48 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.13/0.48 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 0.13/0.48 % Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.13/0.48 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.13/0.48 % G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with pid 1410734 completed with status 0
% 0.13/0.48 % Result found by G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d
% 0.13/0.48 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.48 % No SInE strategy applied
% 0.13/0.48 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.13/0.48 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.13/0.48 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 0.13/0.48 % Preprocessing time : 0.004 s
% 0.13/0.48
% 0.13/0.48 % Proof found!
% 0.13/0.48 % SZS status Theorem
% 0.13/0.48 % SZS output start CNFRefutation
% See solution above
% 0.13/0.49 % Parsed axioms : 96
% 0.13/0.49 % Removed by relevancy pruning/SinE : 0
% 0.13/0.49 % Initial clauses : 207
% 0.13/0.49 % Removed in clause preprocessing : 2
% 0.13/0.49 % Initial clauses in saturation : 205
% 0.13/0.49 % Processed clauses : 347
% 0.13/0.49 % ...of these trivial : 7
% 0.13/0.49 % ...subsumed : 22
% 0.13/0.49 % ...remaining for further processing : 318
% 0.13/0.49 % Other redundant clauses eliminated : 69
% 0.13/0.49 % Clauses deleted for lack of memory : 0
% 0.13/0.49 % Backward-subsumed : 14
% 0.13/0.49 % Backward-rewritten : 23
% 0.13/0.49 % Generated clauses : 1057
% 0.13/0.49 % ...of the previous two non-redundant : 903
% 0.13/0.49 % ...aggressively subsumed : 0
% 0.13/0.49 % Contextual simplify-reflections : 4
% 0.13/0.49 % Paramodulations : 963
% 0.13/0.49 % Factorizations : 0
% 0.13/0.49 % NegExts : 0
% 0.13/0.49 % Equation resolutions : 94
% 0.13/0.49 % Disequality decompositions : 0
% 0.13/0.49 % Total rewrite steps : 796
% 0.13/0.49 % ...of those cached : 760
% 0.13/0.49 % Propositional unsat checks : 0
% 0.13/0.49 % Propositional check models : 0
% 0.13/0.49 % Propositional check unsatisfiable : 0
% 0.13/0.49 % Propositional clauses : 0
% 0.13/0.49 % Propositional clauses after purity: 0
% 0.13/0.49 % Propositional unsat core size : 0
% 0.13/0.49 % Propositional preprocessing time : 0.000
% 0.13/0.49 % Propositional encoding time : 0.000
% 0.13/0.49 % Propositional solver time : 0.000
% 0.13/0.49 % Success case prop preproc time : 0.000
% 0.13/0.49 % Success case prop encoding time : 0.000
% 0.13/0.49 % Success case prop solver time : 0.000
% 0.13/0.49 % Current number of processed clauses : 275
% 0.13/0.49 % Positive orientable unit clauses : 51
% 0.13/0.49 % Positive unorientable unit clauses: 0
% 0.13/0.49 % Negative unit clauses : 3
% 0.13/0.49 % Non-unit-clauses : 221
% 0.13/0.49 % Current number of unprocessed clauses: 751
% 0.13/0.49 % ...number of literals in the above : 4653
% 0.13/0.49 % Current number of archived formulas : 0
% 0.13/0.49 % Current number of archived clauses : 37
% 0.13/0.49 % Clause-clause subsumption calls (NU) : 9138
% 0.13/0.49 % Rec. Clause-clause subsumption calls : 3370
% 0.13/0.49 % Non-unit clause-clause subsumptions : 39
% 0.13/0.49 % Unit Clause-clause subsumption calls : 387
% 0.13/0.49 % Rewrite failures with RHS unbound : 0
% 0.13/0.49 % BW rewrite match attempts : 40
% 0.13/0.49 % BW rewrite match successes : 16
% 0.13/0.49 % Condensation attempts : 0
% 0.13/0.49 % Condensation successes : 0
% 0.13/0.49 % Termbank termtop insertions : 40680
% 0.13/0.49 % Search garbage collected termcells : 4445
% 0.13/0.49
% 0.13/0.49 % -------------------------------------------------
% 0.13/0.49 % User time : 0.057 s
% 0.13/0.49 % System time : 0.004 s
% 0.13/0.49 % Total time : 0.061 s
% 0.13/0.49 % Maximum resident set size: 4280 pages
% 0.13/0.49
% 0.13/0.49 % -------------------------------------------------
% 0.13/0.49 % User time : 0.223 s
% 0.13/0.49 % System time : 0.022 s
% 0.13/0.49 % Total time : 0.245 s
% 0.13/0.49 % Maximum resident set size: 4608 pages
% 0.13/0.49 % E exiting
%------------------------------------------------------------------------------