%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC005+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 : n003.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:34 PM UTC 2026
% Result : Theorem 0.13s 0.48s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 11
% Syntax : Number of formulae : 67 ( 12 unt; 0 def)
% Number of atoms : 270 ( 95 equ)
% Maximal formula atoms : 34 ( 4 avg)
% Number of connectives : 330 ( 127 ~; 122 |; 39 &)
% ( 2 <=>; 40 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 5 avg)
% Maximal term depth : 3 ( 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 : 96 ( 0 sgn 53 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( neq(X4,nil)
| ~ neq(X2,nil) )
& ( ? [X8] :
( neq(nil,X4)
& tl(X4) = X8
& X3 != X8
& ssList(X8) )
| ? [X5] :
( ? [X6] :
( ? [X7] :
( neq(X6,nil)
& app(X5,X7) = X1
& app(app(X5,X6),X7) = X2
& ssList(X7) )
& ssList(X6) )
& ssList(X5) )
| ~ neq(X2,nil) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
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(ax24,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax24) ).
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(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(ax22,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax22) ).
fof(ax21,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax21) ).
fof(c_0_11,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( neq(X4,nil)
| ~ neq(X2,nil) )
& ( ? [X8] :
( neq(nil,X4)
& tl(X4) = X8
& X3 != X8
& ssList(X8) )
| ? [X5] :
( ? [X6] :
( ? [X7] :
( neq(X6,nil)
& app(X5,X7) = X1
& app(app(X5,X6),X7) = X2
& ssList(X7) )
& ssList(X6) )
& ssList(X5) )
| ~ neq(X2,nil) ) )
| 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)
=> ( ( ( neq(X4,nil)
| ~ neq(X2,nil) )
& ( ? [X8] :
( neq(nil,X4)
& tl(X4) = X8
& X3 != X8
& ssList(X8) )
| ? [X5] :
( ? [X6] :
( ? [X7] :
( neq(X6,nil)
& app(X5,X7) = X1
& app(app(X5,X6),X7) = X2
& ssList(X7) )
& ssList(X6) )
& ssList(X5) )
| ~ neq(X2,nil) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_13,negated_conjecture,
! [X257,X258,X259,X260] :
( ( ~ neq(nil,esk51_0)
| tl(esk51_0) != X260
| esk50_0 = X260
| ~ ssList(X260)
| ~ neq(esk51_0,nil) )
& ( ~ neq(nil,esk51_0)
| tl(esk51_0) != X260
| esk50_0 = X260
| ~ ssList(X260)
| neq(esk49_0,nil) )
& ( ~ neq(X258,nil)
| app(X257,X259) != esk48_0
| app(app(X257,X258),X259) != esk49_0
| ~ ssList(X259)
| ~ ssList(X258)
| ~ ssList(X257)
| ~ neq(esk51_0,nil) )
& ( ~ neq(X258,nil)
| app(X257,X259) != esk48_0
| app(app(X257,X258),X259) != esk49_0
| ~ ssList(X259)
| ~ ssList(X258)
| ~ ssList(X257)
| 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_12])])])])])]) ).
cnf(c_0_14,negated_conjecture,
( neq(esk49_0,nil)
| neq(esk49_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_15,negated_conjecture,
neq(esk49_0,nil),
inference(cn,[status(thm)],[c_0_14]) ).
cnf(c_0_16,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,negated_conjecture,
( ~ neq(X2,nil)
| app(X1,X3) != esk48_0
| app(app(X1,X2),X3) != esk49_0
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(esk51_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,negated_conjecture,
neq(esk51_0,nil),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
fof(c_0_19,plain,
! [X137] :
( app(nil,X137) = X137
| ~ ssList(X137) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
fof(c_0_20,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
cnf(c_0_21,negated_conjecture,
( ~ neq(X2,nil)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(X1,X3) != esk48_0
| app(app(X1,X2),X3) != esk51_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_16]),c_0_18])]) ).
cnf(c_0_22,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_23,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_24,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_25,plain,
! [X111,X112] :
( ( ~ ssList(X111)
| ~ ssList(X112)
| neq(X111,X112)
| X111 = X112 )
& ( ~ ssList(X111)
| ~ ssList(X112)
| X111 != X112
| ~ neq(X111,X112) ) ),
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_20])])])])]) ).
cnf(c_0_26,negated_conjecture,
( ~ neq(X1,nil)
| ~ ssList(X1)
| app(app(nil,X1),esk48_0) != esk51_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[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])]) ).
cnf(c_0_27,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| neq(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_28,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])])])]) ).
fof(c_0_29,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
inference(fof_simplification,[status(thm)],[ax24]) ).
cnf(c_0_30,negated_conjecture,
( ~ ssList(X1)
| app(app(nil,X1),esk48_0) != esk51_0
| X1 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_23])]) ).
cnf(c_0_31,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X1,X2),X3) = app(X1,app(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
fof(c_0_32,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])])])]) ).
cnf(c_0_33,negated_conjecture,
( ~ neq(nil,esk51_0)
| tl(esk51_0) != X1
| ~ ssList(X1)
| ~ neq(esk51_0,nil)
| esk50_0 = X1 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_34,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_35,plain,
! [X129] :
( ssList(tl(X129))
| nil = X129
| ~ ssList(X129) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_29])])]) ).
cnf(c_0_36,negated_conjecture,
ssList(esk49_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_37,negated_conjecture,
( ~ ssList(X1)
| app(nil,app(X1,esk48_0)) != esk51_0
| X1 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_24]),c_0_23])]) ).
cnf(c_0_38,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| cons(X2,X1) = app(cons(X2,nil),X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
fof(c_0_39,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])])])]) ).
fof(c_0_40,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
inference(fof_simplification,[status(thm)],[ax78]) ).
cnf(c_0_41,negated_conjecture,
( ~ neq(nil,esk51_0)
| ~ ssList(tl(esk51_0))
| tl(esk51_0) = esk48_0 ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34]),c_0_18])])]) ).
cnf(c_0_42,plain,
( ~ ssList(X1)
| ssList(tl(X1))
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_43,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_36,c_0_16]) ).
cnf(c_0_44,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(cons(X1,nil))
| app(nil,cons(X1,esk48_0)) != esk51_0
| cons(X1,nil) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_24])]) ).
cnf(c_0_45,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ssList(cons(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
fof(c_0_46,plain,
! [X215] :
( cons(hd(X215),tl(X215)) = X215
| nil = X215
| ~ ssList(X215) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_40])])]) ).
cnf(c_0_47,negated_conjecture,
( ~ neq(nil,esk51_0)
| esk51_0 = nil
| tl(esk51_0) = esk48_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43])]) ).
cnf(c_0_48,negated_conjecture,
( ~ ssItem(X1)
| app(nil,cons(X1,esk48_0)) != esk51_0
| cons(X1,nil) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_23])]) ).
cnf(c_0_49,plain,
( ~ ssList(X1)
| cons(hd(X1),tl(X1)) = X1
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_50,negated_conjecture,
( esk51_0 = nil
| tl(esk51_0) = esk48_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_27]),c_0_43]),c_0_23])]) ).
fof(c_0_51,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
inference(fof_simplification,[status(thm)],[ax22]) ).
fof(c_0_52,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[ax21]) ).
cnf(c_0_53,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(cons(X1,esk48_0))
| cons(X1,esk48_0) != esk51_0
| cons(X1,nil) = nil ),
inference(spm,[status(thm)],[c_0_48,c_0_22]) ).
cnf(c_0_54,negated_conjecture,
( esk51_0 = nil
| cons(hd(esk51_0),esk48_0) = esk51_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_43])]) ).
fof(c_0_55,plain,
! [X126] :
( ssItem(hd(X126))
| nil = X126
| ~ ssList(X126) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_51])])]) ).
fof(c_0_56,plain,
! [X124,X125] :
( nil != cons(X125,X124)
| ~ ssItem(X125)
| ~ ssList(X124) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_52])])])]) ).
cnf(c_0_57,negated_conjecture,
( ~ ssItem(hd(esk51_0))
| esk51_0 = nil
| cons(hd(esk51_0),nil) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_43])]) ).
cnf(c_0_58,plain,
( ~ ssList(X1)
| ssItem(hd(X1))
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_59,plain,
( nil != cons(X2,X1)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_60,negated_conjecture,
( esk51_0 = nil
| cons(hd(esk51_0),nil) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_43])]) ).
cnf(c_0_61,negated_conjecture,
( ~ ssItem(hd(esk51_0))
| esk51_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_23])]) ).
cnf(c_0_62,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| X1 != X2
| ~ neq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_63,negated_conjecture,
esk51_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_58]),c_0_43])]) ).
cnf(c_0_64,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_62]) ).
cnf(c_0_65,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[c_0_18,c_0_63]) ).
cnf(c_0_66,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC005+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 : n003.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 07:50:00 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.40 Running first-order theorem proving
% 0.13/0.40 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 3782650 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--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 3782657 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 % Preprocessing time : 0.004 s
% 0.13/0.48 % Presaturation interreduction done
% 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.48 % Parsed axioms : 96
% 0.13/0.48 % Removed by relevancy pruning/SinE : 0
% 0.13/0.48 % Initial clauses : 202
% 0.13/0.48 % Removed in clause preprocessing : 2
% 0.13/0.48 % Initial clauses in saturation : 200
% 0.13/0.48 % Processed clauses : 491
% 0.13/0.48 % ...of these trivial : 5
% 0.13/0.48 % ...subsumed : 30
% 0.13/0.48 % ...remaining for further processing : 456
% 0.13/0.48 % Other redundant clauses eliminated : 69
% 0.13/0.48 % Clauses deleted for lack of memory : 0
% 0.13/0.48 % Backward-subsumed : 5
% 0.13/0.48 % Backward-rewritten : 34
% 0.13/0.48 % Generated clauses : 773
% 0.13/0.48 % ...of the previous two non-redundant : 664
% 0.13/0.48 % ...aggressively subsumed : 0
% 0.13/0.48 % Contextual simplify-reflections : 7
% 0.13/0.48 % Paramodulations : 701
% 0.13/0.48 % Factorizations : 0
% 0.13/0.48 % NegExts : 0
% 0.13/0.48 % Equation resolutions : 74
% 0.13/0.48 % Disequality decompositions : 0
% 0.13/0.48 % Total rewrite steps : 420
% 0.13/0.48 % ...of those cached : 399
% 0.13/0.48 % Propositional unsat checks : 0
% 0.13/0.48 % Propositional check models : 0
% 0.13/0.48 % Propositional check unsatisfiable : 0
% 0.13/0.48 % Propositional clauses : 0
% 0.13/0.48 % Propositional clauses after purity: 0
% 0.13/0.48 % Propositional unsat core size : 0
% 0.13/0.48 % Propositional preprocessing time : 0.000
% 0.13/0.48 % Propositional encoding time : 0.000
% 0.13/0.48 % Propositional solver time : 0.000
% 0.13/0.48 % Success case prop preproc time : 0.000
% 0.13/0.48 % Success case prop encoding time : 0.000
% 0.13/0.48 % Success case prop solver time : 0.000
% 0.13/0.48 % Current number of processed clauses : 202
% 0.13/0.48 % Positive orientable unit clauses : 23
% 0.13/0.48 % Positive unorientable unit clauses: 0
% 0.13/0.48 % Negative unit clauses : 4
% 0.13/0.48 % Non-unit-clauses : 175
% 0.13/0.48 % Current number of unprocessed clauses: 555
% 0.13/0.48 % ...number of literals in the above : 3669
% 0.13/0.48 % Current number of archived formulas : 0
% 0.13/0.48 % Current number of archived clauses : 230
% 0.13/0.48 % Clause-clause subsumption calls (NU) : 17895
% 0.13/0.48 % Rec. Clause-clause subsumption calls : 4178
% 0.13/0.48 % Non-unit clause-clause subsumptions : 37
% 0.13/0.48 % Unit Clause-clause subsumption calls : 94
% 0.13/0.48 % Rewrite failures with RHS unbound : 0
% 0.13/0.48 % BW rewrite match attempts : 3
% 0.13/0.48 % BW rewrite match successes : 3
% 0.13/0.48 % Condensation attempts : 0
% 0.13/0.48 % Condensation successes : 0
% 0.13/0.48 % Termbank termtop insertions : 36133
% 0.13/0.48 % Search garbage collected termcells : 4354
% 0.13/0.48
% 0.13/0.48 % -------------------------------------------------
% 0.13/0.48 % User time : 0.051 s
% 0.13/0.48 % System time : 0.009 s
% 0.13/0.48 % Total time : 0.060 s
% 0.13/0.48 % Maximum resident set size: 4016 pages
% 0.13/0.48
% 0.13/0.48 % -------------------------------------------------
% 0.13/0.48 % User time : 0.256 s
% 0.13/0.48 % System time : 0.026 s
% 0.13/0.48 % Total time : 0.282 s
% 0.13/0.48 % Maximum resident set size: 4608 pages
% 0.13/0.48 % E exiting
%------------------------------------------------------------------------------