%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC120+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 : n018.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:05 PM UTC 2026
% Result : Theorem 0.16s 5.68s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 11
% Syntax : Number of formulae : 67 ( 11 unt; 0 def)
% Number of atoms : 267 ( 75 equ)
% Maximal formula atoms : 30 ( 3 avg)
% Number of connectives : 326 ( 126 ~; 124 |; 33 &)
% ( 2 <=>; 41 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 84 ( 0 sgn 51 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( neq(X4,nil)
| ~ neq(X2,nil) )
& ( ( segmentP(X2,X1)
& neq(X1,nil) )
| ? [X5] :
( ? [X6] :
( neq(nil,X4)
& app(X3,X6) = X5
& tl(X4) = X6
& ssList(X6) )
& X4 != X5
& ssList(X5) )
| ~ neq(X2,nil) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax56,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( segmentP(X1,X2)
=> segmentP(app(app(X3,X1),X4),X2) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax56) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax24,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax24) ).
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(ax55,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax55) ).
fof(ax18,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax18) ).
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(c_0_11,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( neq(X4,nil)
| ~ neq(X2,nil) )
& ( ( segmentP(X2,X1)
& neq(X1,nil) )
| ? [X5] :
( ? [X6] :
( neq(nil,X4)
& app(X3,X6) = X5
& tl(X4) = X6
& ssList(X6) )
& X4 != X5
& 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) )
& ( ( segmentP(X2,X1)
& neq(X1,nil) )
| ? [X5] :
( ? [X6] :
( neq(nil,X4)
& app(X3,X6) = X5
& tl(X4) = X6
& ssList(X6) )
& X4 != X5
& ssList(X5) )
| ~ neq(X2,nil) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_13,negated_conjecture,
! [X11,X12] :
( ( ~ segmentP(esk2_0,esk1_0)
| ~ neq(esk1_0,nil)
| ~ neq(esk4_0,nil) )
& ( ~ segmentP(esk2_0,esk1_0)
| ~ neq(esk1_0,nil)
| neq(esk2_0,nil) )
& ( ~ neq(nil,esk4_0)
| app(esk3_0,X12) != X11
| tl(esk4_0) != X12
| ~ ssList(X12)
| esk4_0 = X11
| ~ ssList(X11)
| ~ neq(esk4_0,nil) )
& ( ~ neq(nil,esk4_0)
| app(esk3_0,X12) != X11
| tl(esk4_0) != X12
| ~ ssList(X12)
| esk4_0 = X11
| ~ ssList(X11)
| neq(esk2_0,nil) )
& ( neq(esk2_0,nil)
| ~ neq(esk4_0,nil) )
& ( neq(esk2_0,nil)
| neq(esk2_0,nil) )
& esk1_0 = esk3_0
& esk2_0 = esk4_0
& ssList(esk4_0)
& ssList(esk3_0)
& ssList(esk2_0)
& ssList(esk1_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(esk2_0,nil)
| neq(esk2_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_15,negated_conjecture,
neq(esk2_0,nil),
inference(cn,[status(thm)],[c_0_14]) ).
cnf(c_0_16,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_17,plain,
! [X40,X41,X42,X43] :
( segmentP(app(app(X42,X40),X43),X41)
| ~ segmentP(X40,X41)
| ~ ssList(X43)
| ~ ssList(X42)
| ~ ssList(X41)
| ~ ssList(X40) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax56])])])]) ).
fof(c_0_18,plain,
! [X22] :
( app(nil,X22) = X22
| ~ ssList(X22) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
cnf(c_0_19,negated_conjecture,
( ~ neq(nil,esk4_0)
| app(esk3_0,X2) != X1
| tl(esk4_0) != X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(esk4_0,nil)
| esk4_0 = X1 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,negated_conjecture,
neq(esk4_0,nil),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
fof(c_0_22,plain,
! [X54,X55] :
( ssList(app(X54,X55))
| ~ ssList(X55)
| ~ ssList(X54) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
cnf(c_0_23,plain,
( ~ segmentP(X1,X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| segmentP(app(app(X3,X1),X4),X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_26,negated_conjecture,
( ~ neq(nil,esk4_0)
| ~ ssList(tl(esk4_0))
| ~ ssList(app(esk1_0,tl(esk4_0)))
| app(esk1_0,tl(esk4_0)) = esk4_0 ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_21])])])]) ).
cnf(c_0_27,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_29,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
inference(fof_simplification,[status(thm)],[ax24]) ).
cnf(c_0_30,plain,
( ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ segmentP(X1,X3)
| segmentP(app(X1,X2),X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_31,negated_conjecture,
( ~ neq(nil,esk4_0)
| ~ ssList(tl(esk4_0))
| app(esk1_0,tl(esk4_0)) = esk4_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]) ).
fof(c_0_32,plain,
! [X78] :
( ssList(tl(X78))
| nil = X78
| ~ ssList(X78) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_29])])]) ).
fof(c_0_33,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
cnf(c_0_34,negated_conjecture,
( ~ neq(nil,esk4_0)
| ~ ssList(X1)
| ~ ssList(tl(esk4_0))
| ~ segmentP(esk1_0,X1)
| segmentP(esk4_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_28])]) ).
cnf(c_0_35,plain,
( ~ ssList(X1)
| ssList(tl(X1))
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_36,negated_conjecture,
ssList(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_37,plain,
! [X15,X16] :
( ( ~ ssList(X15)
| ~ ssList(X16)
| neq(X15,X16)
| X15 = X16 )
& ( ~ ssList(X15)
| ~ ssList(X16)
| X15 != X16
| ~ neq(X15,X16) ) ),
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_33])])])])]) ).
cnf(c_0_38,negated_conjecture,
( ~ segmentP(esk2_0,esk1_0)
| ~ neq(esk1_0,nil)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_39,negated_conjecture,
( ~ neq(nil,esk4_0)
| ~ ssList(X1)
| ~ segmentP(esk1_0,X1)
| segmentP(esk4_0,X1)
| esk4_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]) ).
cnf(c_0_40,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| neq(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
fof(c_0_41,plain,
! [X39] :
( segmentP(X39,X39)
| ~ ssList(X39) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])])]) ).
cnf(c_0_42,negated_conjecture,
( ~ neq(esk1_0,nil)
| ~ segmentP(esk4_0,esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_21]),c_0_16])]) ).
cnf(c_0_43,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(esk1_0,X1)
| segmentP(esk4_0,X1)
| esk4_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_36]),c_0_25])]) ).
cnf(c_0_44,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_45,negated_conjecture,
( ~ segmentP(esk4_0,esk1_0)
| esk1_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_40]),c_0_25]),c_0_28])]) ).
cnf(c_0_46,negated_conjecture,
( segmentP(esk4_0,esk1_0)
| esk4_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_28])]) ).
fof(c_0_47,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
inference(fof_simplification,[status(thm)],[ax18]) ).
fof(c_0_48,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
inference(fof_simplification,[status(thm)],[ax78]) ).
fof(c_0_49,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
inference(fof_simplification,[status(thm)],[ax22]) ).
cnf(c_0_50,negated_conjecture,
( esk1_0 = nil
| esk4_0 = nil ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
fof(c_0_51,plain,
! [X88,X89] :
( cons(X89,X88) != X88
| ~ ssItem(X89)
| ~ ssList(X88) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_47])])])]) ).
fof(c_0_52,plain,
! [X85] :
( cons(hd(X85),tl(X85)) = X85
| nil = X85
| ~ ssList(X85) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_48])])]) ).
fof(c_0_53,plain,
! [X124] :
( ssItem(hd(X124))
| nil = X124
| ~ ssList(X124) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_49])])]) ).
cnf(c_0_54,negated_conjecture,
( ~ neq(nil,esk4_0)
| ~ ssList(tl(esk4_0))
| esk4_0 = nil
| app(nil,tl(esk4_0)) = esk4_0 ),
inference(spm,[status(thm)],[c_0_31,c_0_50]) ).
cnf(c_0_55,plain,
( cons(X2,X1) != X1
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_56,plain,
( ~ ssList(X1)
| cons(hd(X1),tl(X1)) = X1
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_57,plain,
( ~ ssList(X1)
| ssItem(hd(X1))
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_58,negated_conjecture,
( ~ neq(nil,esk4_0)
| ~ ssList(tl(esk4_0))
| esk4_0 = nil
| tl(esk4_0) = esk4_0 ),
inference(spm,[status(thm)],[c_0_24,c_0_54]) ).
cnf(c_0_59,plain,
( ~ ssList(X1)
| tl(X1) != X1
| nil = X1 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57]),c_0_35]) ).
cnf(c_0_60,negated_conjecture,
( ~ neq(nil,esk4_0)
| esk4_0 = nil
| tl(esk4_0) = esk4_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_35]),c_0_36])]) ).
cnf(c_0_61,negated_conjecture,
( ~ neq(nil,esk4_0)
| esk4_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_36])]) ).
cnf(c_0_62,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| X1 != X2
| ~ neq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_63,negated_conjecture,
esk4_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_40]),c_0_36]),c_0_25])]) ).
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_21,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_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC120+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/5.38 % Computer : n018.cluster.edu
% 0.11/5.38 % Model : x86_64 x86_64
% 0.11/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.38 % Memory : 8046.5625MB
% 0.11/5.38 % OS : Linux 6.8.0-71-generic
% 0.11/5.38 % CPULimit : 300
% 0.11/5.38 % WCLimit : 300
% 0.11/5.38 % DateTime : Mon Sep 21 07:59:19 UTC 2026
% 0.11/5.39 % CPUTime :
% 0.11/5.39 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/5.46 Running first-order theorem proving
% 0.16/5.46 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.16/5.68 % Version: 3.5.1
% 0.16/5.68 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/5.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.68 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/5.68 % Starting new_bool_3 with 300s (1) cores
% 0.16/5.68 % Starting new_bool_1 with 300s (1) cores
% 0.16/5.68 % Starting sh5l with 300s (1) cores
% 0.16/5.68 % sh5l with pid 1394720 completed with status 0
% 0.16/5.68 % Result found by sh5l
% 0.16/5.68 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/5.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.68 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/5.68 % Starting new_bool_3 with 300s (1) cores
% 0.16/5.68 % Starting new_bool_1 with 300s (1) cores
% 0.16/5.68 % Starting sh5l with 300s (1) cores
% 0.16/5.68 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.16/5.68 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/5.68 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.16/5.68 % Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.16/5.68 % Starting SubtermCWHack with 28s (1) cores
% 0.16/5.68 % SubtermCWHack with pid 1394723 completed with status 0
% 0.16/5.68 % Result found by SubtermCWHack
% 0.16/5.68 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/5.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.68 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/5.68 % Starting new_bool_3 with 300s (1) cores
% 0.16/5.68 % Starting new_bool_1 with 300s (1) cores
% 0.16/5.68 % Starting sh5l with 300s (1) cores
% 0.16/5.68 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.16/5.68 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/5.68 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.16/5.68 % Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.16/5.68 % Starting SubtermCWHack with 28s (1) cores
% 0.16/5.68 % Preprocessing time : 0.005 s
% 0.16/5.68
% 0.16/5.68 % Proof found!
% 0.16/5.68 % SZS status Theorem
% 0.16/5.68 % SZS output start CNFRefutation
% See solution above
% 0.16/5.68 % Parsed axioms : 96
% 0.16/5.68 % Removed by relevancy pruning/SinE : 12
% 0.16/5.68 % Initial clauses : 168
% 0.16/5.68 % Removed in clause preprocessing : 2
% 0.16/5.68 % Initial clauses in saturation : 166
% 0.16/5.68 % Processed clauses : 703
% 0.16/5.68 % ...of these trivial : 6
% 0.16/5.68 % ...subsumed : 329
% 0.16/5.68 % ...remaining for further processing : 368
% 0.16/5.68 % Other redundant clauses eliminated : 76
% 0.16/5.68 % Clauses deleted for lack of memory : 0
% 0.16/5.68 % Backward-subsumed : 43
% 0.16/5.68 % Backward-rewritten : 71
% 0.16/5.68 % Generated clauses : 1935
% 0.16/5.68 % ...of the previous two non-redundant : 1601
% 0.16/5.68 % ...aggressively subsumed : 0
% 0.16/5.68 % Contextual simplify-reflections : 73
% 0.16/5.68 % Paramodulations : 1856
% 0.16/5.68 % Factorizations : 0
% 0.16/5.68 % NegExts : 0
% 0.16/5.68 % Equation resolutions : 81
% 0.16/5.68 % Disequality decompositions : 0
% 0.16/5.68 % Total rewrite steps : 1415
% 0.16/5.68 % ...of those cached : 1397
% 0.16/5.68 % Propositional unsat checks : 0
% 0.16/5.68 % Propositional check models : 0
% 0.16/5.68 % Propositional check unsatisfiable : 0
% 0.16/5.68 % Propositional clauses : 0
% 0.16/5.68 % Propositional clauses after purity: 0
% 0.16/5.68 % Propositional unsat core size : 0
% 0.16/5.68 % Propositional preprocessing time : 0.000
% 0.16/5.68 % Propositional encoding time : 0.000
% 0.16/5.68 % Propositional solver time : 0.000
% 0.16/5.68 % Success case prop preproc time : 0.000
% 0.16/5.68 % Success case prop encoding time : 0.000
% 0.16/5.68 % Success case prop solver time : 0.000
% 0.16/5.68 % Current number of processed clauses : 235
% 0.16/5.68 % Positive orientable unit clauses : 18
% 0.16/5.68 % Positive unorientable unit clauses: 0
% 0.16/5.68 % Negative unit clauses : 1
% 0.16/5.68 % Non-unit-clauses : 216
% 0.16/5.68 % Current number of unprocessed clauses: 1053
% 0.16/5.68 % ...number of literals in the above : 6384
% 0.16/5.68 % Current number of archived formulas : 0
% 0.16/5.68 % Current number of archived clauses : 114
% 0.16/5.68 % Clause-clause subsumption calls (NU) : 19546
% 0.16/5.68 % Rec. Clause-clause subsumption calls : 6753
% 0.16/5.68 % Non-unit clause-clause subsumptions : 445
% 0.16/5.68 % Unit Clause-clause subsumption calls : 107
% 0.16/5.68 % Rewrite failures with RHS unbound : 0
% 0.16/5.68 % BW rewrite match attempts : 5
% 0.16/5.68 % BW rewrite match successes : 5
% 0.16/5.68 % Condensation attempts : 0
% 0.16/5.68 % Condensation successes : 0
% 0.16/5.68 % Termbank termtop insertions : 48139
% 0.16/5.68 % Search garbage collected termcells : 3682
% 0.16/5.68
% 0.16/5.68 % -------------------------------------------------
% 0.16/5.68 % User time : 0.112 s
% 0.16/5.68 % System time : 0.012 s
% 0.16/5.68 % Total time : 0.124 s
% 0.16/5.68 % Maximum resident set size: 3708 pages
% 0.16/5.68
% 0.16/5.68 % -------------------------------------------------
% 0.16/5.68 % User time : 0.117 s
% 0.16/5.68 % System time : 0.019 s
% 0.16/5.68 % Total time : 0.136 s
% 0.16/5.68 % Maximum resident set size: 4608 pages
% 0.16/5.68 % E exiting
%------------------------------------------------------------------------------