%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC420+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 : n010.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:44:21 PM UTC 2026
% Result : Theorem 0.20s 0.56s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 8
% Syntax : Number of formulae : 56 ( 11 unt; 0 def)
% Number of atoms : 233 ( 97 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 294 ( 117 ~; 115 |; 38 &)
% ( 2 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 91 ( 0 sgn 41 !; 17 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ( nil = X4
& nil != X3 )
| ? [X8] :
( ? [X9] :
( app(cons(X8,nil),X9) = X4
& app(X9,cons(X8,nil)) != X3
& ssList(X9) )
& ssItem(X8) )
| ? [X5] :
( ? [X6] :
( ? [X7] :
( app(app(X7,cons(X5,nil)),X6) = X1
& app(app(X6,cons(X5,nil)),X7) = X2
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
| ~ neq(X2,nil)
| X1 != X3
| X2 != X4
| ~ ssList(X4) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
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(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(ax20,axiom,
! [X1] :
( ssList(X1)
=> ( ? [X2] :
( ? [X3] :
( cons(X3,X2) = X1
& ssItem(X3) )
& ssList(X2) )
| nil = X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax20) ).
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(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(c_0_8,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ( nil = X4
& nil != X3 )
| ? [X8] :
( ? [X9] :
( app(cons(X8,nil),X9) = X4
& app(X9,cons(X8,nil)) != X3
& ssList(X9) )
& ssItem(X8) )
| ? [X5] :
( ? [X6] :
( ? [X7] :
( app(app(X7,cons(X5,nil)),X6) = X1
& app(app(X6,cons(X5,nil)),X7) = X2
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
| ~ neq(X2,nil)
| X1 != X3
| X2 != X4
| ~ ssList(X4) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_9,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ( nil = X4
& nil != X3 )
| ? [X8] :
( ? [X9] :
( app(cons(X8,nil),X9) = X4
& app(X9,cons(X8,nil)) != X3
& ssList(X9) )
& ssItem(X8) )
| ? [X5] :
( ? [X6] :
( ? [X7] :
( app(app(X7,cons(X5,nil)),X6) = X1
& app(app(X6,cons(X5,nil)),X7) = X2
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
| ~ neq(X2,nil)
| X1 != X3
| X2 != X4
| ~ ssList(X4) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_10,negated_conjecture,
! [X258,X259,X260,X261,X262] :
( ( nil != esk51_0
| nil = esk50_0 )
& ( app(cons(X261,nil),X262) != esk51_0
| app(X262,cons(X261,nil)) = esk50_0
| ~ ssList(X262)
| ~ ssItem(X261) )
& ( app(app(X260,cons(X258,nil)),X259) != esk48_0
| app(app(X259,cons(X258,nil)),X260) != esk49_0
| ~ ssList(X260)
| ~ ssList(X259)
| ~ ssItem(X258) )
& 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(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_9])])])])]) ).
fof(c_0_11,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_12,negated_conjecture,
( app(app(X3,cons(X1,nil)),X2) != esk48_0
| app(app(X2,cons(X1,nil)),X3) != esk49_0
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
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(cons(X1,nil),X2) != esk51_0
| ~ ssList(X2)
| ~ ssItem(X1)
| app(X2,cons(X1,nil)) = esk50_0 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| cons(X2,X1) = app(cons(X2,nil),X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_18,plain,
! [X122] :
( ( ~ ssList(X122)
| nil = X122
| cons(esk45_1(X122),esk44_1(X122)) = X122 )
& ( ~ ssList(X122)
| nil = X122
| ssItem(esk45_1(X122)) )
& ( ~ ssList(X122)
| nil = X122
| ssList(esk44_1(X122)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax20])])])])]) ).
cnf(c_0_19,negated_conjecture,
ssList(esk49_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_20,negated_conjecture,
( ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| app(app(X3,cons(X2,nil)),X1) != esk51_0
| app(app(X1,cons(X2,nil)),X3) != esk50_0 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_21,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]) ).
fof(c_0_22,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_23,negated_conjecture,
( ~ ssItem(X2)
| ~ ssList(X1)
| cons(X2,X1) != esk51_0
| app(X1,cons(X2,nil)) = esk50_0 ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_24,plain,
( ~ ssList(X1)
| nil = X1
| cons(esk45_1(X1),esk44_1(X1)) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_19,c_0_14]) ).
cnf(c_0_26,negated_conjecture,
( ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(cons(X2,nil))
| app(app(X3,cons(X2,nil)),X1) != esk51_0
| app(X1,app(cons(X2,nil),X3)) != esk50_0 ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ssList(cons(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_29,negated_conjecture,
( ~ ssItem(esk45_1(esk51_0))
| ~ ssList(esk44_1(esk51_0))
| esk51_0 = nil
| app(esk44_1(esk51_0),cons(esk45_1(esk51_0),nil)) = esk50_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24])]),c_0_25])]) ).
cnf(c_0_30,plain,
( ~ ssList(X1)
| nil = X1
| ssList(esk44_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_31,negated_conjecture,
( ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| app(app(X3,cons(X2,nil)),X1) != esk51_0
| app(X1,app(cons(X2,nil),X3)) != esk50_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]) ).
cnf(c_0_32,negated_conjecture,
( ~ ssItem(esk45_1(esk51_0))
| esk51_0 = nil
| app(esk44_1(esk51_0),cons(esk45_1(esk51_0),nil)) = esk50_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_25])]) ).
cnf(c_0_33,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(esk45_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_34,negated_conjecture,
( ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(X3,cons(X2,X1)) != esk50_0
| app(app(X1,cons(X2,nil)),X3) != esk51_0 ),
inference(spm,[status(thm)],[c_0_31,c_0_17]) ).
cnf(c_0_35,negated_conjecture,
( esk51_0 = nil
| app(esk44_1(esk51_0),cons(esk45_1(esk51_0),nil)) = esk50_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_25])]) ).
cnf(c_0_36,negated_conjecture,
( ~ ssItem(esk45_1(esk51_0))
| ~ ssList(esk44_1(esk51_0))
| app(app(nil,cons(esk45_1(esk51_0),nil)),esk44_1(esk51_0)) != esk51_0
| esk51_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_28])]) ).
cnf(c_0_37,negated_conjecture,
( ~ ssItem(esk45_1(esk51_0))
| app(app(nil,cons(esk45_1(esk51_0),nil)),esk44_1(esk51_0)) != esk51_0
| esk51_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_30]),c_0_25])]) ).
fof(c_0_38,plain,
! [X138] :
( app(nil,X138) = X138
| ~ ssList(X138) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
cnf(c_0_39,negated_conjecture,
( app(app(nil,cons(esk45_1(esk51_0),nil)),esk44_1(esk51_0)) != esk51_0
| esk51_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_33]),c_0_25])]) ).
cnf(c_0_40,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_41,negated_conjecture,
( ~ ssList(cons(esk45_1(esk51_0),nil))
| app(cons(esk45_1(esk51_0),nil),esk44_1(esk51_0)) != esk51_0
| esk51_0 = nil ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_42,negated_conjecture,
( ~ ssItem(esk45_1(esk51_0))
| app(cons(esk45_1(esk51_0),nil),esk44_1(esk51_0)) != esk51_0
| esk51_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_27]),c_0_28])]) ).
cnf(c_0_43,negated_conjecture,
( app(cons(esk45_1(esk51_0),nil),esk44_1(esk51_0)) != esk51_0
| esk51_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_33]),c_0_25])]) ).
cnf(c_0_44,negated_conjecture,
( ~ ssItem(esk45_1(esk51_0))
| ~ ssList(esk44_1(esk51_0))
| cons(esk45_1(esk51_0),esk44_1(esk51_0)) != esk51_0
| esk51_0 = nil ),
inference(spm,[status(thm)],[c_0_43,c_0_17]) ).
fof(c_0_45,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
cnf(c_0_46,negated_conjecture,
( ~ ssItem(esk45_1(esk51_0))
| cons(esk45_1(esk51_0),esk44_1(esk51_0)) != esk51_0
| esk51_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_30]),c_0_25])]) ).
fof(c_0_47,plain,
! [X112,X113] :
( ( ~ ssList(X112)
| ~ ssList(X113)
| neq(X112,X113)
| X112 = X113 )
& ( ~ ssList(X112)
| ~ ssList(X113)
| X112 != X113
| ~ neq(X112,X113) ) ),
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_45])])])])]) ).
cnf(c_0_48,negated_conjecture,
neq(esk49_0,nil),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_49,negated_conjecture,
( cons(esk45_1(esk51_0),esk44_1(esk51_0)) != esk51_0
| esk51_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_33]),c_0_25])]) ).
cnf(c_0_50,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| X1 != X2
| ~ neq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_51,negated_conjecture,
neq(esk51_0,nil),
inference(rw,[status(thm)],[c_0_48,c_0_14]) ).
cnf(c_0_52,negated_conjecture,
esk51_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_24]),c_0_25])]) ).
cnf(c_0_53,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_50]) ).
cnf(c_0_54,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_55,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC420+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n010.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Mon Sep 21 08:23:40 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.44 Running first-order theorem proving
% 0.16/0.44 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.56 % Version: 3.5.1
% 0.20/0.56 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.56 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.20/0.56 % Starting new_bool_1 with 300s (1) cores
% 0.20/0.56 % Starting sh5l with 300s (1) cores
% 0.20/0.56 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 464887 completed with status 0
% 0.20/0.56 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.20/0.56 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.56 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.56 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.20/0.56 % No SInE strategy applied
% 0.20/0.56 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.20/0.56 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.56 % Starting SubtermCWHack with 136s (1) cores
% 0.20/0.56 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.20/0.56 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 0.20/0.56 % Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.20/0.56 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.20/0.56 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 464895 completed with status 0
% 0.20/0.56 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.20/0.56 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.56 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.56 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.20/0.56 % No SInE strategy applied
% 0.20/0.56 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.20/0.56 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.56 % Starting SubtermCWHack with 136s (1) cores
% 0.20/0.56 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.20/0.56 % Preprocessing time : 0.004 s
% 0.20/0.56 % Presaturation interreduction done
% 0.20/0.56
% 0.20/0.56 % Proof found!
% 0.20/0.56 % SZS status Theorem
% 0.20/0.56 % SZS output start CNFRefutation
% See solution above
% 0.20/0.56 % Parsed axioms : 96
% 0.20/0.56 % Removed by relevancy pruning/SinE : 0
% 0.20/0.56 % Initial clauses : 200
% 0.20/0.56 % Removed in clause preprocessing : 2
% 0.20/0.56 % Initial clauses in saturation : 198
% 0.20/0.56 % Processed clauses : 720
% 0.20/0.56 % ...of these trivial : 2
% 0.20/0.56 % ...subsumed : 161
% 0.20/0.56 % ...remaining for further processing : 557
% 0.20/0.56 % Other redundant clauses eliminated : 159
% 0.20/0.56 % Clauses deleted for lack of memory : 0
% 0.20/0.56 % Backward-subsumed : 33
% 0.20/0.56 % Backward-rewritten : 64
% 0.20/0.56 % Generated clauses : 1516
% 0.20/0.56 % ...of the previous two non-redundant : 1283
% 0.20/0.56 % ...aggressively subsumed : 0
% 0.20/0.56 % Contextual simplify-reflections : 35
% 0.20/0.56 % Paramodulations : 1354
% 0.20/0.56 % Factorizations : 0
% 0.20/0.56 % NegExts : 0
% 0.20/0.56 % Equation resolutions : 164
% 0.20/0.56 % Disequality decompositions : 0
% 0.20/0.56 % Total rewrite steps : 933
% 0.20/0.56 % ...of those cached : 906
% 0.20/0.56 % Propositional unsat checks : 0
% 0.20/0.56 % Propositional check models : 0
% 0.20/0.56 % Propositional check unsatisfiable : 0
% 0.20/0.56 % Propositional clauses : 0
% 0.20/0.56 % Propositional clauses after purity: 0
% 0.20/0.56 % Propositional unsat core size : 0
% 0.20/0.56 % Propositional preprocessing time : 0.000
% 0.20/0.56 % Propositional encoding time : 0.000
% 0.20/0.56 % Propositional solver time : 0.000
% 0.20/0.56 % Success case prop preproc time : 0.000
% 0.20/0.56 % Success case prop encoding time : 0.000
% 0.20/0.56 % Success case prop solver time : 0.000
% 0.20/0.56 % Current number of processed clauses : 245
% 0.20/0.56 % Positive orientable unit clauses : 23
% 0.20/0.56 % Positive unorientable unit clauses: 0
% 0.20/0.56 % Negative unit clauses : 2
% 0.20/0.56 % Non-unit-clauses : 220
% 0.20/0.56 % Current number of unprocessed clauses: 911
% 0.20/0.56 % ...number of literals in the above : 5860
% 0.20/0.56 % Current number of archived formulas : 0
% 0.20/0.56 % Current number of archived clauses : 289
% 0.20/0.56 % Clause-clause subsumption calls (NU) : 24823
% 0.20/0.56 % Rec. Clause-clause subsumption calls : 6554
% 0.20/0.56 % Non-unit clause-clause subsumptions : 176
% 0.20/0.56 % Unit Clause-clause subsumption calls : 124
% 0.20/0.56 % Rewrite failures with RHS unbound : 0
% 0.20/0.56 % BW rewrite match attempts : 7
% 0.20/0.56 % BW rewrite match successes : 7
% 0.20/0.56 % Condensation attempts : 0
% 0.20/0.56 % Condensation successes : 0
% 0.20/0.56 % Termbank termtop insertions : 49658
% 0.20/0.56 % Search garbage collected termcells : 4314
% 0.20/0.56
% 0.20/0.56 % -------------------------------------------------
% 0.20/0.56 % User time : 0.086 s
% 0.20/0.56 % System time : 0.007 s
% 0.20/0.56 % Total time : 0.093 s
% 0.20/0.56 % Maximum resident set size: 4272 pages
% 0.20/0.56
% 0.20/0.56 % -------------------------------------------------
% 0.20/0.56 % User time : 0.349 s
% 0.20/0.56 % System time : 0.032 s
% 0.20/0.56 % Total time : 0.381 s
% 0.20/0.56 % Maximum resident set size: 4864 pages
% 0.20/0.56 % E exiting
%------------------------------------------------------------------------------