%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC166+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 : n015.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.30s 0.53s
% Output : CNFRefutation 0.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 11
% Syntax : Number of formulae : 56 ( 18 unt; 0 def)
% Number of atoms : 229 ( 40 equ)
% Maximal formula atoms : 34 ( 4 avg)
% Number of connectives : 272 ( 99 ~; 97 |; 25 &)
% ( 4 <=>; 47 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 9 con; 0-2 aty)
% Number of variables : 91 ( 0 sgn 67 !; 1 ?)
% 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)
=> ( neq(X5,X6)
| app(app(app(X7,cons(X5,nil)),cons(X6,nil)),X8) != X1 ) ) ) ) )
| ~ singletonP(X3)
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax1,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/SWC001+0.ax',ax82) ).
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(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(ax59,axiom,
! [X1] :
( ssItem(X1)
=> cyclefreeP(cons(X1,nil)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax59) ).
fof(ax4,axiom,
! [X1] :
( ssList(X1)
=> ( singletonP(X1)
<=> ? [X2] :
( cons(X2,nil) = X1
& ssItem(X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax4) ).
fof(ax8,axiom,
! [X1] :
( ssList(X1)
=> ( cyclefreeP(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(X3,X2)
& leq(X2,X3) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax8) ).
fof(ax31,axiom,
! [X1] :
( ssItem(X1)
=> leq(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax31) ).
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)
=> ( neq(X5,X6)
| app(app(app(X7,cons(X5,nil)),cons(X6,nil)),X8) != X1 ) ) ) ) )
| ~ singletonP(X3)
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_12,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)
=> ( neq(X5,X6)
| app(app(app(X7,cons(X5,nil)),cons(X6,nil)),X8) != X1 ) ) ) ) )
| ~ singletonP(X3)
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_13,plain,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax1]) ).
fof(c_0_14,negated_conjecture,
( ~ neq(esk52_0,esk53_0)
& app(app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)),esk55_0) = esk48_0
& ssList(esk55_0)
& ssList(esk54_0)
& ssItem(esk53_0)
& ssItem(esk52_0)
& singletonP(esk50_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(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])]) ).
fof(c_0_15,plain,
! [X9,X10] :
( ( ~ ssItem(X9)
| ~ ssItem(X10)
| neq(X9,X10)
| X9 = X10 )
& ( ~ ssItem(X9)
| ~ ssItem(X10)
| X9 != X10
| ~ neq(X9,X10) ) ),
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_13])])])])]) ).
fof(c_0_16,plain,
! [X224,X225,X226] :
( app(app(X224,X225),X226) = app(X224,app(X225,X226))
| ~ ssList(X226)
| ~ ssList(X225)
| ~ ssList(X224) ),
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(esk52_0,esk53_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| neq(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,negated_conjecture,
ssItem(esk53_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,negated_conjecture,
ssItem(esk52_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,negated_conjecture,
app(app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)),esk55_0) = esk48_0,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
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(esk55_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_24,negated_conjecture,
esk53_0 = esk52_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,
! [X113,X114] :
( ssList(cons(X114,X113))
| ~ ssItem(X114)
| ~ ssList(X113) ),
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(esk52_0,nil))
| ~ ssList(app(esk54_0,cons(esk52_0,nil)))
| app(app(esk54_0,cons(esk52_0,nil)),app(cons(esk52_0,nil),esk55_0)) = esk48_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,
! [X132,X133] :
( ssList(app(X132,X133))
| ~ ssList(X133)
| ~ ssList(X132) ),
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(esk54_0,cons(esk52_0,nil)))
| app(app(esk54_0,cons(esk52_0,nil)),app(cons(esk52_0,nil),esk55_0)) = esk48_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(esk54_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_33,negated_conjecture,
( ~ ssList(cons(esk52_0,nil))
| app(app(esk54_0,cons(esk52_0,nil)),app(cons(esk52_0,nil),esk55_0)) = esk48_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,
! [X222,X223] :
( cons(X223,X222) = app(cons(X223,nil),X222)
| ~ ssItem(X223)
| ~ ssList(X222) ),
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,
! [X198] :
( cyclefreeP(cons(X198,nil))
| ~ ssItem(X198) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax59])])]) ).
fof(c_0_36,plain,
! [X19,X21] :
( ( ~ ssList(X19)
| singletonP(X19)
| cons(X21,nil) != X19
| ~ ssItem(X21) )
& ( ~ ssList(X19)
| ~ singletonP(X19)
| cons(esk5_1(X19),nil) = X19 )
& ( ~ ssList(X19)
| ~ singletonP(X19)
| ssItem(esk5_1(X19)) ) ),
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)],[ax4])])])])])]) ).
fof(c_0_37,plain,
! [X36,X37,X38,X39,X40,X41] :
( ( ~ ssList(X36)
| cyclefreeP(X36)
| leq(esk11_1(X36),esk10_1(X36)) )
& ( ~ ssList(X36)
| cyclefreeP(X36)
| leq(esk10_1(X36),esk11_1(X36)) )
& ( ~ ssList(X36)
| cyclefreeP(X36)
| app(app(esk12_1(X36),cons(esk10_1(X36),esk13_1(X36))),cons(esk11_1(X36),esk14_1(X36))) = X36 )
& ( ~ ssList(X36)
| cyclefreeP(X36)
| ssList(esk14_1(X36)) )
& ( ~ ssList(X36)
| cyclefreeP(X36)
| ssList(esk13_1(X36)) )
& ( ~ ssList(X36)
| cyclefreeP(X36)
| ssList(esk12_1(X36)) )
& ( ~ ssList(X36)
| cyclefreeP(X36)
| ssItem(esk11_1(X36)) )
& ( ~ ssList(X36)
| cyclefreeP(X36)
| ssItem(esk10_1(X36)) )
& ( ~ ssList(X36)
| ~ leq(X38,X37)
| ~ leq(X37,X38)
| app(app(X39,cons(X37,X40)),cons(X38,X41)) != X36
| ~ ssList(X41)
| ~ ssList(X40)
| ~ ssList(X39)
| ~ ssItem(X38)
| ~ ssItem(X37)
| ~ cyclefreeP(X36) ) ),
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)],[ax8])])])])])]) ).
cnf(c_0_38,negated_conjecture,
app(app(esk54_0,cons(esk52_0,nil)),app(cons(esk52_0,nil),esk55_0)) = esk48_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_39,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| cons(X2,X1) = app(cons(X2,nil),X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_40,plain,
( ~ ssItem(X1)
| cyclefreeP(cons(X1,nil)) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_41,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(esk5_1(X1),nil) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_42,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| ssItem(esk5_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_43,negated_conjecture,
singletonP(esk50_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_44,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_45,plain,
( ~ ssList(X1)
| ~ leq(X3,X2)
| ~ leq(X2,X3)
| app(app(X4,cons(X2,X5)),cons(X3,X6)) != X1
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssItem(X3)
| ~ ssItem(X2)
| ~ cyclefreeP(X1) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_46,negated_conjecture,
app(app(esk54_0,cons(esk52_0,nil)),cons(esk52_0,esk55_0)) = esk48_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_23]),c_0_20])]) ).
cnf(c_0_47,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| cyclefreeP(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]) ).
cnf(c_0_48,negated_conjecture,
singletonP(esk48_0),
inference(rw,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_49,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_50,negated_conjecture,
( ~ ssList(X1)
| ~ cyclefreeP(X1)
| ~ leq(esk52_0,esk52_0)
| esk48_0 != X1 ),
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_45,c_0_46]),c_0_23]),c_0_28]),c_0_32]),c_0_20])]) ).
cnf(c_0_51,negated_conjecture,
cyclefreeP(esk48_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49])]) ).
fof(c_0_52,plain,
! [X143] :
( leq(X143,X143)
| ~ ssItem(X143) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax31])])]) ).
cnf(c_0_53,negated_conjecture,
~ leq(esk52_0,esk52_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_49])]) ).
cnf(c_0_54,plain,
( ~ ssItem(X1)
| leq(X1,X1) ),
inference(split_conjunct,[status(thm)],[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_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC166+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.11/0.36 % Computer : n015.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 21 08:04:52 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/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
% 0.30/0.53 % Version: 3.5.1
% 0.30/0.53 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.30/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.53 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.30/0.53 % Starting new_bool_3 with 300s (1) cores
% 0.30/0.53 % Starting new_bool_1 with 300s (1) cores
% 0.30/0.53 % Starting sh5l with 300s (1) cores
% 0.30/0.53 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 991581 completed with status 0
% 0.30/0.53 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.30/0.53 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.30/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.53 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.30/0.53 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.30/0.53 % No SInE strategy applied
% 0.30/0.53 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.30/0.53 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.30/0.53 % Starting SubtermCWHack with 136s (1) cores
% 0.30/0.53 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.30/0.53 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 0.30/0.53 % Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.30/0.53 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.30/0.53 % G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with pid 991590 completed with status 0
% 0.30/0.53 % Result found by G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d
% 0.30/0.53 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.30/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.53 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.30/0.53 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.30/0.53 % No SInE strategy applied
% 0.30/0.53 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.30/0.53 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.30/0.53 % Starting SubtermCWHack with 136s (1) cores
% 0.30/0.53 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.30/0.53 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 0.30/0.53 % Preprocessing time : 0.004 s
% 0.30/0.53
% 0.30/0.53 % Proof found!
% 0.30/0.53 % SZS status Theorem
% 0.30/0.53 % SZS output start CNFRefutation
% See solution above
% 0.30/0.53 % Parsed axioms : 96
% 0.30/0.53 % Removed by relevancy pruning/SinE : 0
% 0.30/0.53 % Initial clauses : 203
% 0.30/0.53 % Removed in clause preprocessing : 2
% 0.30/0.53 % Initial clauses in saturation : 201
% 0.30/0.53 % Processed clauses : 702
% 0.30/0.53 % ...of these trivial : 16
% 0.30/0.53 % ...subsumed : 148
% 0.30/0.53 % ...remaining for further processing : 538
% 0.30/0.53 % Other redundant clauses eliminated : 69
% 0.30/0.53 % Clauses deleted for lack of memory : 0
% 0.30/0.53 % Backward-subsumed : 79
% 0.30/0.53 % Backward-rewritten : 103
% 0.30/0.53 % Generated clauses : 2093
% 0.30/0.53 % ...of the previous two non-redundant : 1841
% 0.30/0.53 % ...aggressively subsumed : 0
% 0.30/0.53 % Contextual simplify-reflections : 37
% 0.30/0.53 % Paramodulations : 1995
% 0.30/0.53 % Factorizations : 0
% 0.30/0.53 % NegExts : 0
% 0.30/0.53 % Equation resolutions : 98
% 0.30/0.53 % Disequality decompositions : 0
% 0.30/0.53 % Total rewrite steps : 1949
% 0.30/0.53 % ...of those cached : 1882
% 0.30/0.53 % Propositional unsat checks : 0
% 0.30/0.53 % Propositional check models : 0
% 0.30/0.53 % Propositional check unsatisfiable : 0
% 0.30/0.53 % Propositional clauses : 0
% 0.30/0.53 % Propositional clauses after purity: 0
% 0.30/0.53 % Propositional unsat core size : 0
% 0.30/0.53 % Propositional preprocessing time : 0.000
% 0.30/0.53 % Propositional encoding time : 0.000
% 0.30/0.53 % Propositional solver time : 0.000
% 0.30/0.53 % Success case prop preproc time : 0.000
% 0.30/0.53 % Success case prop encoding time : 0.000
% 0.30/0.53 % Success case prop solver time : 0.000
% 0.30/0.53 % Current number of processed clauses : 350
% 0.30/0.53 % Positive orientable unit clauses : 66
% 0.30/0.53 % Positive unorientable unit clauses: 0
% 0.30/0.53 % Negative unit clauses : 10
% 0.30/0.53 % Non-unit-clauses : 274
% 0.30/0.53 % Current number of unprocessed clauses: 1275
% 0.30/0.53 % ...number of literals in the above : 7959
% 0.30/0.53 % Current number of archived formulas : 0
% 0.30/0.53 % Current number of archived clauses : 182
% 0.30/0.53 % Clause-clause subsumption calls (NU) : 15616
% 0.30/0.53 % Rec. Clause-clause subsumption calls : 7494
% 0.30/0.53 % Non-unit clause-clause subsumptions : 200
% 0.30/0.53 % Unit Clause-clause subsumption calls : 1010
% 0.30/0.53 % Rewrite failures with RHS unbound : 0
% 0.30/0.53 % BW rewrite match attempts : 64
% 0.30/0.53 % BW rewrite match successes : 36
% 0.30/0.53 % Condensation attempts : 0
% 0.30/0.53 % Condensation successes : 0
% 0.30/0.53 % Termbank termtop insertions : 62981
% 0.30/0.53 % Search garbage collected termcells : 4286
% 0.30/0.53
% 0.30/0.53 % -------------------------------------------------
% 0.30/0.53 % User time : 0.091 s
% 0.30/0.53 % System time : 0.010 s
% 0.30/0.53 % Total time : 0.101 s
% 0.30/0.53 % Maximum resident set size: 4272 pages
% 0.30/0.53
% 0.30/0.53 % -------------------------------------------------
% 0.30/0.53 % User time : 0.418 s
% 0.30/0.53 % System time : 0.035 s
% 0.30/0.53 % Total time : 0.452 s
% 0.30/0.53 % Maximum resident set size: 4608 pages
% 0.30/0.53 % E exiting
%------------------------------------------------------------------------------