%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC002+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 : n026.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:42:33 PM UTC 2026
% Result : Theorem 3.73s 0.98s
% Output : CNFRefutation 3.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 1
% Syntax : Number of formulae : 37 ( 13 unt; 0 def)
% Number of atoms : 275 ( 82 equ)
% Maximal formula atoms : 96 ( 7 avg)
% Number of connectives : 393 ( 155 ~; 160 |; 54 &)
% ( 0 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 37 ( 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; 8 con; 0-3 aty)
% Number of variables : 70 ( 0 sgn 28 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( neq(X4,nil)
| ~ neq(X2,nil) )
& ( ! [X9] :
( ssItem(X9)
=> ! [X10] :
( ssList(X10)
=> ! [X11] :
( ssList(X11)
=> ( ? [X12] :
( geq(X12,X9)
& memberP(X4,X12)
& X9 != X12
& ssItem(X12) )
| app(X10,X11) != X3
| app(app(X10,cons(X9,nil)),X11) != X4 ) ) ) )
| ? [X5] :
( ? [X6] :
( ? [X7] :
( ! [X8] :
( ssItem(X8)
=> ( X5 = X8
| ~ geq(X8,X5)
| ~ memberP(X2,X8) ) )
& app(X6,X7) = X1
& app(app(X6,cons(X5,nil)),X7) = X2
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
| ~ neq(X2,nil) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(c_0_1,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( neq(X4,nil)
| ~ neq(X2,nil) )
& ( ! [X9] :
( ssItem(X9)
=> ! [X10] :
( ssList(X10)
=> ! [X11] :
( ssList(X11)
=> ( ? [X12] :
( geq(X12,X9)
& memberP(X4,X12)
& X9 != X12
& ssItem(X12) )
| app(X10,X11) != X3
| app(app(X10,cons(X9,nil)),X11) != X4 ) ) ) )
| ? [X5] :
( ? [X6] :
( ? [X7] :
( ! [X8] :
( ssItem(X8)
=> ( X5 = X8
| ~ geq(X8,X5)
| ~ memberP(X2,X8) ) )
& app(X6,X7) = X1
& app(app(X6,cons(X5,nil)),X7) = X2
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
| ~ neq(X2,nil) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_2,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( neq(X4,nil)
| ~ neq(X2,nil) )
& ( ! [X9] :
( ssItem(X9)
=> ! [X10] :
( ssList(X10)
=> ! [X11] :
( ssList(X11)
=> ( ? [X12] :
( geq(X12,X9)
& memberP(X4,X12)
& X9 != X12
& ssItem(X12) )
| app(X10,X11) != X3
| app(app(X10,cons(X9,nil)),X11) != X4 ) ) ) )
| ? [X5] :
( ? [X6] :
( ? [X7] :
( ! [X8] :
( ssItem(X8)
=> ( X5 = X8
| ~ geq(X8,X5)
| ~ memberP(X2,X8) ) )
& app(X6,X7) = X1
& app(app(X6,cons(X5,nil)),X7) = X2
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
| ~ neq(X2,nil) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_3,negated_conjecture,
! [X261,X262,X263,X268] :
( ( ~ geq(X268,esk53_0)
| ~ memberP(esk51_0,X268)
| esk53_0 = X268
| ~ ssItem(X268)
| ~ neq(esk51_0,nil) )
& ( ~ geq(X268,esk53_0)
| ~ memberP(esk51_0,X268)
| esk53_0 = X268
| ~ ssItem(X268)
| neq(esk49_0,nil) )
& ( app(esk54_0,esk55_0) = esk50_0
| ~ neq(esk51_0,nil) )
& ( app(esk54_0,esk55_0) = esk50_0
| neq(esk49_0,nil) )
& ( app(app(esk54_0,cons(esk53_0,nil)),esk55_0) = esk51_0
| ~ neq(esk51_0,nil) )
& ( app(app(esk54_0,cons(esk53_0,nil)),esk55_0) = esk51_0
| neq(esk49_0,nil) )
& ( ssList(esk55_0)
| ~ neq(esk51_0,nil) )
& ( ssList(esk55_0)
| neq(esk49_0,nil) )
& ( ssList(esk54_0)
| ~ neq(esk51_0,nil) )
& ( ssList(esk54_0)
| neq(esk49_0,nil) )
& ( ssItem(esk53_0)
| ~ neq(esk51_0,nil) )
& ( ssItem(esk53_0)
| neq(esk49_0,nil) )
& ( ~ ssItem(X261)
| ~ ssList(X262)
| app(X262,X263) != esk48_0
| app(app(X262,cons(X261,nil)),X263) != esk49_0
| ~ ssList(X263)
| X261 != esk52_3(X261,X262,X263)
| ~ neq(esk51_0,nil) )
& ( ~ ssItem(X261)
| ~ ssList(X262)
| app(X262,X263) != esk48_0
| app(app(X262,cons(X261,nil)),X263) != esk49_0
| ~ ssList(X263)
| X261 != esk52_3(X261,X262,X263)
| neq(esk49_0,nil) )
& ( ~ ssItem(X261)
| ~ ssList(X262)
| app(X262,X263) != esk48_0
| app(app(X262,cons(X261,nil)),X263) != esk49_0
| ~ ssList(X263)
| geq(esk52_3(X261,X262,X263),X261)
| ~ neq(esk51_0,nil) )
& ( ~ ssItem(X261)
| ~ ssList(X262)
| app(X262,X263) != esk48_0
| app(app(X262,cons(X261,nil)),X263) != esk49_0
| ~ ssList(X263)
| geq(esk52_3(X261,X262,X263),X261)
| neq(esk49_0,nil) )
& ( ~ ssItem(X261)
| ~ ssList(X262)
| app(X262,X263) != esk48_0
| app(app(X262,cons(X261,nil)),X263) != esk49_0
| ~ ssList(X263)
| memberP(esk49_0,esk52_3(X261,X262,X263))
| ~ neq(esk51_0,nil) )
& ( ~ ssItem(X261)
| ~ ssList(X262)
| app(X262,X263) != esk48_0
| app(app(X262,cons(X261,nil)),X263) != esk49_0
| ~ ssList(X263)
| memberP(esk49_0,esk52_3(X261,X262,X263))
| neq(esk49_0,nil) )
& ( ~ ssItem(X261)
| ~ ssList(X262)
| app(X262,X263) != esk48_0
| app(app(X262,cons(X261,nil)),X263) != esk49_0
| ~ ssList(X263)
| ssItem(esk52_3(X261,X262,X263))
| ~ neq(esk51_0,nil) )
& ( ~ ssItem(X261)
| ~ ssList(X262)
| app(X262,X263) != esk48_0
| app(app(X262,cons(X261,nil)),X263) != esk49_0
| ~ ssList(X263)
| ssItem(esk52_3(X261,X262,X263))
| neq(esk49_0,nil) )
& ( neq(esk49_0,nil)
| ~ neq(esk51_0,nil) )
& ( neq(esk49_0,nil)
| neq(esk49_0,nil) )
& 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_2])])])])])]) ).
cnf(c_0_4,negated_conjecture,
( neq(esk49_0,nil)
| neq(esk49_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_5,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| app(X2,X3) != esk48_0
| app(app(X2,cons(X1,nil)),X3) != esk49_0
| ~ ssList(X3)
| ~ neq(esk51_0,nil)
| geq(esk52_3(X1,X2,X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_7,negated_conjecture,
neq(esk49_0,nil),
inference(cn,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
( ~ neq(esk51_0,nil)
| app(esk54_0,esk55_0) = esk50_0 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_9,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_10,negated_conjecture,
( ~ neq(esk51_0,nil)
| ssList(esk55_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_11,negated_conjecture,
( ~ neq(esk51_0,nil)
| ssList(esk54_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_12,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| app(X2,X3) != esk48_0
| app(app(X2,cons(X1,nil)),X3) != esk49_0
| ~ ssList(X3)
| ~ neq(esk51_0,nil)
| memberP(esk49_0,esk52_3(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_13,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| app(X2,X3) != esk48_0
| app(app(X2,cons(X1,nil)),X3) != esk49_0
| ~ ssList(X3)
| ~ neq(esk51_0,nil)
| ssItem(esk52_3(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_14,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(X2,X3) != esk48_0
| app(app(X2,cons(X1,nil)),X3) != esk49_0
| geq(esk52_3(X1,X2,X3),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6]),c_0_7])]) ).
cnf(c_0_15,negated_conjecture,
app(esk54_0,esk55_0) = esk48_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9]),c_0_6]),c_0_7])]) ).
cnf(c_0_16,negated_conjecture,
ssList(esk55_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_6]),c_0_7])]) ).
cnf(c_0_17,negated_conjecture,
ssList(esk54_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_6]),c_0_7])]) ).
cnf(c_0_18,negated_conjecture,
( ~ neq(esk51_0,nil)
| app(app(esk54_0,cons(esk53_0,nil)),esk55_0) = esk51_0 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_19,negated_conjecture,
( ~ neq(esk51_0,nil)
| ssItem(esk53_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_20,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(X2,X3) != esk48_0
| app(app(X2,cons(X1,nil)),X3) != esk49_0
| memberP(esk49_0,esk52_3(X1,X2,X3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_6]),c_0_7])]) ).
cnf(c_0_21,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(X2,X3) != esk48_0
| app(app(X2,cons(X1,nil)),X3) != esk49_0
| ssItem(esk52_3(X1,X2,X3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_6]),c_0_7])]) ).
cnf(c_0_22,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| app(X2,X3) != esk48_0
| app(app(X2,cons(X1,nil)),X3) != esk49_0
| ~ ssList(X3)
| X1 != esk52_3(X1,X2,X3)
| ~ neq(esk51_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_23,negated_conjecture,
( ~ geq(X1,esk53_0)
| ~ memberP(esk51_0,X1)
| ~ ssItem(X1)
| ~ neq(esk51_0,nil)
| esk53_0 = X1 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_24,negated_conjecture,
( ~ ssItem(X1)
| app(app(esk54_0,cons(X1,nil)),esk55_0) != esk49_0
| geq(esk52_3(X1,esk54_0,esk55_0),X1) ),
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_25,negated_conjecture,
app(app(esk54_0,cons(esk53_0,nil)),esk55_0) = esk49_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_6]),c_0_6]),c_0_7])]) ).
cnf(c_0_26,negated_conjecture,
ssItem(esk53_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_6]),c_0_7])]) ).
cnf(c_0_27,negated_conjecture,
( ~ ssItem(X1)
| app(app(esk54_0,cons(X1,nil)),esk55_0) != esk49_0
| memberP(esk49_0,esk52_3(X1,esk54_0,esk55_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_15]),c_0_16]),c_0_17])]) ).
cnf(c_0_28,negated_conjecture,
( ~ ssItem(X1)
| app(app(esk54_0,cons(X1,nil)),esk55_0) != esk49_0
| ssItem(esk52_3(X1,esk54_0,esk55_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_15]),c_0_16]),c_0_17])]) ).
cnf(c_0_29,negated_conjecture,
( ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(X1,X3) != esk48_0
| esk52_3(X2,X1,X3) != X2
| app(app(X1,cons(X2,nil)),X3) != esk49_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_6]),c_0_7])]) ).
cnf(c_0_30,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(esk49_0,X1)
| ~ geq(X1,esk53_0)
| esk53_0 = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_6]),c_0_6]),c_0_7])]) ).
cnf(c_0_31,negated_conjecture,
geq(esk52_3(esk53_0,esk54_0,esk55_0),esk53_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
cnf(c_0_32,negated_conjecture,
memberP(esk49_0,esk52_3(esk53_0,esk54_0,esk55_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_25]),c_0_26])]) ).
cnf(c_0_33,negated_conjecture,
ssItem(esk52_3(esk53_0,esk54_0,esk55_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_25]),c_0_26])]) ).
cnf(c_0_34,negated_conjecture,
( ~ ssItem(X1)
| esk52_3(X1,esk54_0,esk55_0) != X1
| app(app(esk54_0,cons(X1,nil)),esk55_0) != esk49_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_15]),c_0_16]),c_0_17])]) ).
cnf(c_0_35,negated_conjecture,
esk52_3(esk53_0,esk54_0,esk55_0) = esk53_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),c_0_33])]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_25]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC002+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.08/0.36 % Computer : n026.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Mon Sep 21 07:51:22 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.41 Running first-order theorem proving
% 0.08/0.41 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
% 3.73/0.98 % Version: 3.5.1
% 3.73/0.98 % Preprocessing class: FSLSSMSSSSSNFFN.
% 3.73/0.98 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.73/0.98 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 3.73/0.98 % Starting new_bool_3 with 300s (1) cores
% 3.73/0.98 % Starting new_bool_1 with 300s (1) cores
% 3.73/0.98 % Starting sh5l with 300s (1) cores
% 3.73/0.98 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1768209 completed with status 0
% 3.73/0.98 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 3.73/0.98 % Preprocessing class: FSLSSMSSSSSNFFN.
% 3.73/0.98 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.73/0.98 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 3.73/0.98 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.73/0.98 % No SInE strategy applied
% 3.73/0.98 % Search class: FGHSF-FSLM31-MFFFFFNN
% 3.73/0.98 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 3.73/0.98 % Starting SubtermCWHack with 136s (1) cores
% 3.73/0.98 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 3.73/0.98 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 3.73/0.98 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 3.73/0.98 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 3.73/0.98 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1768222 completed with status 0
% 3.73/0.98 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 3.73/0.98 % Preprocessing class: FSLSSMSSSSSNFFN.
% 3.73/0.98 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.73/0.98 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 3.73/0.98 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.73/0.98 % No SInE strategy applied
% 3.73/0.98 % Search class: FGHSF-FSLM31-MFFFFFNN
% 3.73/0.98 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 3.73/0.98 % Starting SubtermCWHack with 136s (1) cores
% 3.73/0.98 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 3.73/0.98 % Preprocessing time : 0.004 s
% 3.73/0.98 % Presaturation interreduction done
% 3.73/0.98
% 3.73/0.98 % Proof found!
% 3.73/0.98 % SZS status Theorem
% 3.73/0.98 % SZS output start CNFRefutation
% See solution above
% 3.73/0.98 % Parsed axioms : 96
% 3.73/0.98 % Removed by relevancy pruning/SinE : 0
% 3.73/0.98 % Initial clauses : 218
% 3.73/0.98 % Removed in clause preprocessing : 2
% 3.73/0.98 % Initial clauses in saturation : 216
% 3.73/0.98 % Processed clauses : 3148
% 3.73/0.98 % ...of these trivial : 59
% 3.73/0.98 % ...subsumed : 1495
% 3.73/0.98 % ...remaining for further processing : 1594
% 3.73/0.98 % Other redundant clauses eliminated : 204
% 3.73/0.98 % Clauses deleted for lack of memory : 0
% 3.73/0.98 % Backward-subsumed : 157
% 3.73/0.98 % Backward-rewritten : 221
% 3.73/0.98 % Generated clauses : 13614
% 3.73/0.98 % ...of the previous two non-redundant : 12100
% 3.73/0.98 % ...aggressively subsumed : 0
% 3.73/0.98 % Contextual simplify-reflections : 333
% 3.73/0.98 % Paramodulations : 13401
% 3.73/0.98 % Factorizations : 0
% 3.73/0.98 % NegExts : 0
% 3.73/0.98 % Equation resolutions : 215
% 3.73/0.98 % Disequality decompositions : 0
% 3.73/0.98 % Total rewrite steps : 13429
% 3.73/0.98 % ...of those cached : 13237
% 3.73/0.98 % Propositional unsat checks : 0
% 3.73/0.98 % Propositional check models : 0
% 3.73/0.98 % Propositional check unsatisfiable : 0
% 3.73/0.98 % Propositional clauses : 0
% 3.73/0.98 % Propositional clauses after purity: 0
% 3.73/0.98 % Propositional unsat core size : 0
% 3.73/0.98 % Propositional preprocessing time : 0.000
% 3.73/0.98 % Propositional encoding time : 0.000
% 3.73/0.98 % Propositional solver time : 0.000
% 3.73/0.98 % Success case prop preproc time : 0.000
% 3.73/0.98 % Success case prop encoding time : 0.000
% 3.73/0.98 % Success case prop solver time : 0.000
% 3.73/0.98 % Current number of processed clauses : 994
% 3.73/0.98 % Positive orientable unit clauses : 194
% 3.73/0.98 % Positive unorientable unit clauses: 0
% 3.73/0.98 % Negative unit clauses : 23
% 3.73/0.98 % Non-unit-clauses : 777
% 3.73/0.98 % Current number of unprocessed clauses: 8903
% 3.73/0.98 % ...number of literals in the above : 48249
% 3.73/0.98 % Current number of archived formulas : 0
% 3.73/0.98 % Current number of archived clauses : 577
% 3.73/0.98 % Clause-clause subsumption calls (NU) : 107225
% 3.73/0.98 % Rec. Clause-clause subsumption calls : 35346
% 3.73/0.98 % Non-unit clause-clause subsumptions : 1496
% 3.73/0.98 % Unit Clause-clause subsumption calls : 8541
% 3.73/0.98 % Rewrite failures with RHS unbound : 0
% 3.73/0.98 % BW rewrite match attempts : 95
% 3.73/0.98 % BW rewrite match successes : 87
% 3.73/0.98 % Condensation attempts : 0
% 3.73/0.98 % Condensation successes : 0
% 3.73/0.98 % Termbank termtop insertions : 278963
% 3.73/0.98 % Search garbage collected termcells : 4552
% 3.73/0.98
% 3.73/0.98 % -------------------------------------------------
% 3.73/0.98 % User time : 0.464 s
% 3.73/0.98 % System time : 0.022 s
% 3.73/0.98 % Total time : 0.486 s
% 3.73/0.98 % Maximum resident set size: 4024 pages
% 3.73/0.98
% 3.73/0.98 % -------------------------------------------------
% 3.73/0.98 % User time : 2.446 s
% 3.73/0.98 % System time : 0.085 s
% 3.73/0.98 % Total time : 2.531 s
% 3.73/0.98 % Maximum resident set size: 4608 pages
% 3.73/0.98 % E exiting
%------------------------------------------------------------------------------