%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC067+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 : n011.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:51 PM UTC 2026
% Result : Theorem 0.15s 0.47s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 9
% Syntax : Number of formulae : 62 ( 14 unt; 0 def)
% Number of atoms : 304 ( 107 equ)
% Maximal formula atoms : 40 ( 4 avg)
% Number of connectives : 380 ( 138 ~; 134 |; 71 &)
% ( 3 <=>; 34 =>; 0 <=; 0 <~>)
% Maximal formula depth : 31 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 103 ( 0 sgn 55 !; 27 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( ? [X15] :
( segmentP(X1,X15)
& segmentP(X2,X15)
& neq(X15,nil)
& ssList(X15) )
| ~ neq(X2,nil) )
& ( nil = X1
| nil != X2 ) )
| ( nil = X3
& nil != X4 )
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( ? [X11] :
( ? [X12] :
( ? [X13] :
( ? [X14] :
( lt(X13,X11)
& app(X14,cons(X13,nil)) = X3
& ssList(X14) )
& ssItem(X13) )
& app(cons(X11,nil),X12) = X6
& ssList(X12) )
& ssItem(X11) )
| ? [X7] :
( ? [X8] :
( ? [X9] :
( ? [X10] :
( lt(X7,X9)
& app(cons(X9,nil),X10) = X3
& ssList(X10) )
& ssItem(X9) )
& app(X8,cons(X7,nil)) = X5
& ssList(X8) )
& ssItem(X7) )
| ~ strictorderedP(X3)
| app(app(X5,X3),X6) != X4 ) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X1
& nil = X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax83) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax84) ).
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(ax55,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax55) ).
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(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(c_0_9,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( ? [X15] :
( segmentP(X1,X15)
& segmentP(X2,X15)
& neq(X15,nil)
& ssList(X15) )
| ~ neq(X2,nil) )
& ( nil = X1
| nil != X2 ) )
| ( nil = X3
& nil != X4 )
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( ? [X11] :
( ? [X12] :
( ? [X13] :
( ? [X14] :
( lt(X13,X11)
& app(X14,cons(X13,nil)) = X3
& ssList(X14) )
& ssItem(X13) )
& app(cons(X11,nil),X12) = X6
& ssList(X12) )
& ssItem(X11) )
| ? [X7] :
( ? [X8] :
( ? [X9] :
( ? [X10] :
( lt(X7,X9)
& app(cons(X9,nil),X10) = X3
& ssList(X10) )
& ssItem(X9) )
& app(X8,cons(X7,nil)) = X5
& ssList(X8) )
& ssItem(X7) )
| ~ strictorderedP(X3)
| app(app(X5,X3),X6) != X4 ) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_10,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( ? [X15] :
( segmentP(X1,X15)
& segmentP(X2,X15)
& neq(X15,nil)
& ssList(X15) )
| ~ neq(X2,nil) )
& ( nil = X1
| nil != X2 ) )
| ( nil = X3
& nil != X4 )
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( ? [X11] :
( ? [X12] :
( ? [X13] :
( ? [X14] :
( lt(X13,X11)
& app(X14,cons(X13,nil)) = X3
& ssList(X14) )
& ssItem(X13) )
& app(cons(X11,nil),X12) = X6
& ssList(X12) )
& ssItem(X11) )
| ? [X7] :
( ? [X8] :
( ? [X9] :
( ? [X10] :
( lt(X7,X9)
& app(cons(X9,nil),X10) = X3
& ssList(X10) )
& ssItem(X9) )
& app(X8,cons(X7,nil)) = X5
& ssList(X8) )
& ssItem(X7) )
| ~ strictorderedP(X3)
| app(app(X5,X3),X6) != X4 ) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_11,negated_conjecture,
! [X22,X23,X24,X25,X26,X27,X28,X29,X30] :
( ( nil != esk1_0
| ~ segmentP(esk1_0,X30)
| ~ segmentP(esk2_0,X30)
| ~ neq(X30,nil)
| ~ ssList(X30) )
& ( nil != esk1_0
| neq(esk2_0,nil) )
& ( nil = esk2_0
| ~ segmentP(esk1_0,X30)
| ~ segmentP(esk2_0,X30)
| ~ neq(X30,nil)
| ~ ssList(X30) )
& ( nil = esk2_0
| neq(esk2_0,nil) )
& ( nil != esk3_0
| nil = esk4_0 )
& ( ~ lt(X28,X26)
| app(X29,cons(X28,nil)) != esk3_0
| ~ ssList(X29)
| ~ ssItem(X28)
| app(cons(X26,nil),X27) != esk6_0
| ~ ssList(X27)
| ~ ssItem(X26) )
& ( ~ lt(X22,X24)
| app(cons(X24,nil),X25) != esk3_0
| ~ ssList(X25)
| ~ ssItem(X24)
| app(X23,cons(X22,nil)) != esk5_0
| ~ ssList(X23)
| ~ ssItem(X22) )
& strictorderedP(esk3_0)
& app(app(esk5_0,esk3_0),esk6_0) = esk4_0
& ssList(esk6_0)
& ssList(esk5_0)
& 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_10])])])])])]) ).
fof(c_0_12,plain,
! [X88,X89] :
( ( ~ ssList(X88)
| ~ ssList(X89)
| nil = app(X88,X89)
| nil != X88
| nil != X89 )
& ( ~ ssList(X88)
| ~ ssList(X89)
| nil != app(X88,X89)
| nil = X88 )
& ( ~ ssList(X88)
| ~ ssList(X89)
| nil != app(X88,X89)
| nil = X89 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax83])])])])]) ).
cnf(c_0_13,negated_conjecture,
app(app(esk5_0,esk3_0),esk6_0) = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| nil != app(X2,X1)
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,negated_conjecture,
app(app(esk5_0,esk3_0),esk6_0) = esk2_0,
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,negated_conjecture,
ssList(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_18,plain,
! [X71,X72] :
( ssList(app(X71,X72))
| ~ ssList(X72)
| ~ ssList(X71) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
cnf(c_0_19,negated_conjecture,
( ~ ssList(app(esk5_0,esk3_0))
| esk2_0 != nil
| esk6_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_20,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_21,negated_conjecture,
ssList(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_22,negated_conjecture,
ssList(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_23,plain,
! [X90] :
( app(X90,nil) = X90
| ~ ssList(X90) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])])]) ).
cnf(c_0_24,negated_conjecture,
( esk2_0 != nil
| esk6_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22])]) ).
cnf(c_0_25,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_26,negated_conjecture,
( esk2_0 != nil
| app(app(esk5_0,esk3_0),nil) = esk2_0 ),
inference(spm,[status(thm)],[c_0_16,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
( ~ ssList(app(esk5_0,esk3_0))
| esk2_0 != nil
| app(esk5_0,esk3_0) = esk2_0 ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_28,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != app(X1,X2)
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_29,negated_conjecture,
( esk2_0 != nil
| app(esk5_0,esk3_0) = esk2_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_20]),c_0_21]),c_0_22])]) ).
cnf(c_0_30,negated_conjecture,
( nil != esk1_0
| ~ segmentP(esk1_0,X1)
| ~ segmentP(esk2_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_31,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_32,negated_conjecture,
( nil != esk1_0
| neq(esk2_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_33,plain,
! [X76] :
( app(nil,X76) = X76
| ~ ssList(X76) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
cnf(c_0_34,negated_conjecture,
( esk2_0 != nil
| esk5_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_21]),c_0_22])]) ).
cnf(c_0_35,negated_conjecture,
( ~ neq(X1,nil)
| ~ ssList(X1)
| ~ segmentP(esk2_0,X1)
| ~ segmentP(esk3_0,X1)
| esk3_0 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31]),c_0_31]) ).
cnf(c_0_36,negated_conjecture,
( esk3_0 != nil
| neq(esk2_0,nil) ),
inference(rw,[status(thm)],[c_0_32,c_0_31]) ).
cnf(c_0_37,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_38,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_39,negated_conjecture,
( esk2_0 != nil
| app(nil,esk3_0) = esk2_0 ),
inference(spm,[status(thm)],[c_0_29,c_0_34]) ).
fof(c_0_40,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
cnf(c_0_41,negated_conjecture,
( ~ segmentP(esk2_0,esk2_0)
| ~ segmentP(esk3_0,esk2_0)
| esk3_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]) ).
cnf(c_0_42,negated_conjecture,
( esk2_0 != nil
| esk3_0 = esk2_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_21])]) ).
fof(c_0_43,plain,
! [X42] :
( segmentP(X42,X42)
| ~ ssList(X42) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])])]) ).
cnf(c_0_44,negated_conjecture,
( ~ segmentP(esk1_0,X1)
| ~ segmentP(esk2_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1)
| nil = esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_45,plain,
! [X51,X52] :
( ( ~ ssList(X51)
| ~ ssList(X52)
| neq(X51,X52)
| X51 = X52 )
& ( ~ ssList(X51)
| ~ ssList(X52)
| X51 != X52
| ~ neq(X51,X52) ) ),
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_40])])])])]) ).
cnf(c_0_46,negated_conjecture,
( ~ segmentP(esk2_0,esk2_0)
| esk2_0 != nil ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_47,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
fof(c_0_48,plain,
! [X43,X44,X45,X46] :
( segmentP(app(app(X45,X43),X46),X44)
| ~ segmentP(X43,X44)
| ~ ssList(X46)
| ~ ssList(X45)
| ~ ssList(X44)
| ~ ssList(X43) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax56])])])]) ).
cnf(c_0_49,negated_conjecture,
( ~ neq(X1,nil)
| ~ ssList(X1)
| ~ segmentP(esk2_0,X1)
| ~ segmentP(esk3_0,X1)
| esk2_0 = nil ),
inference(rw,[status(thm)],[c_0_44,c_0_31]) ).
cnf(c_0_50,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| neq(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_51,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_52,negated_conjecture,
esk2_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_37])]) ).
cnf(c_0_53,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_48]) ).
cnf(c_0_54,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(esk2_0,X1)
| ~ segmentP(esk3_0,X1)
| X1 = nil ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51])]),c_0_52]) ).
cnf(c_0_55,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(esk3_0,X1)
| segmentP(esk2_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_16]),c_0_17]),c_0_22]),c_0_21])]) ).
cnf(c_0_56,negated_conjecture,
( nil != esk3_0
| nil = esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_57,negated_conjecture,
( ~ segmentP(esk2_0,esk3_0)
| esk3_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_47]),c_0_21])]) ).
cnf(c_0_58,negated_conjecture,
segmentP(esk2_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_47]),c_0_21])]) ).
cnf(c_0_59,negated_conjecture,
( esk3_0 != nil
| esk2_0 = nil ),
inference(rw,[status(thm)],[c_0_56,c_0_14]) ).
cnf(c_0_60,negated_conjecture,
esk3_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_58])]) ).
cnf(c_0_61,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_60])]),c_0_52]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC067+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/0.37 % Computer : n011.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 07:53:10 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.42 Running first-order theorem proving
% 0.15/0.42 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.15/0.47 % Version: 3.5.1
% 0.15/0.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.47 % Starting sh5l with 300s (1) cores
% 0.15/0.47 % new_bool_1 with pid 1393540 completed with status 0
% 0.15/0.47 % Result found by new_bool_1
% 0.15/0.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.47 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.15/0.47 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.47 % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.47 % SubtermCWHack with pid 1393542 completed with status 0
% 0.15/0.47 % Result found by SubtermCWHack
% 0.15/0.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.47 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.15/0.47 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.47 % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.47 % Preprocessing time : 0.002 s
% 0.15/0.47
% 0.15/0.47 % Proof found!
% 0.15/0.47 % SZS status Theorem
% 0.15/0.47 % SZS output start CNFRefutation
% See solution above
% 0.15/0.47 % Parsed axioms : 96
% 0.15/0.47 % Removed by relevancy pruning/SinE : 47
% 0.15/0.47 % Initial clauses : 93
% 0.15/0.47 % Removed in clause preprocessing : 1
% 0.15/0.47 % Initial clauses in saturation : 92
% 0.15/0.47 % Processed clauses : 325
% 0.15/0.47 % ...of these trivial : 7
% 0.15/0.47 % ...subsumed : 127
% 0.15/0.47 % ...remaining for further processing : 191
% 0.15/0.47 % Other redundant clauses eliminated : 31
% 0.15/0.47 % Clauses deleted for lack of memory : 0
% 0.15/0.47 % Backward-subsumed : 53
% 0.15/0.47 % Backward-rewritten : 23
% 0.15/0.47 % Generated clauses : 893
% 0.15/0.47 % ...of the previous two non-redundant : 742
% 0.15/0.47 % ...aggressively subsumed : 0
% 0.15/0.47 % Contextual simplify-reflections : 9
% 0.15/0.47 % Paramodulations : 857
% 0.15/0.47 % Factorizations : 0
% 0.15/0.47 % NegExts : 0
% 0.15/0.47 % Equation resolutions : 36
% 0.15/0.47 % Disequality decompositions : 0
% 0.15/0.47 % Total rewrite steps : 864
% 0.15/0.47 % ...of those cached : 851
% 0.15/0.47 % Propositional unsat checks : 0
% 0.15/0.47 % Propositional check models : 0
% 0.15/0.47 % Propositional check unsatisfiable : 0
% 0.15/0.47 % Propositional clauses : 0
% 0.15/0.47 % Propositional clauses after purity: 0
% 0.15/0.47 % Propositional unsat core size : 0
% 0.15/0.47 % Propositional preprocessing time : 0.000
% 0.15/0.47 % Propositional encoding time : 0.000
% 0.15/0.47 % Propositional solver time : 0.000
% 0.15/0.47 % Success case prop preproc time : 0.000
% 0.15/0.47 % Success case prop encoding time : 0.000
% 0.15/0.47 % Success case prop solver time : 0.000
% 0.15/0.47 % Current number of processed clauses : 107
% 0.15/0.47 % Positive orientable unit clauses : 15
% 0.15/0.47 % Positive unorientable unit clauses: 0
% 0.15/0.47 % Negative unit clauses : 3
% 0.15/0.47 % Non-unit-clauses : 89
% 0.15/0.47 % Current number of unprocessed clauses: 383
% 0.15/0.47 % ...number of literals in the above : 1919
% 0.15/0.47 % Current number of archived formulas : 0
% 0.15/0.47 % Current number of archived clauses : 77
% 0.15/0.47 % Clause-clause subsumption calls (NU) : 3197
% 0.15/0.47 % Rec. Clause-clause subsumption calls : 2179
% 0.15/0.47 % Non-unit clause-clause subsumptions : 142
% 0.15/0.47 % Unit Clause-clause subsumption calls : 117
% 0.15/0.47 % Rewrite failures with RHS unbound : 0
% 0.15/0.47 % BW rewrite match attempts : 5
% 0.15/0.47 % BW rewrite match successes : 5
% 0.15/0.47 % Condensation attempts : 0
% 0.15/0.47 % Condensation successes : 0
% 0.15/0.47 % Termbank termtop insertions : 21549
% 0.15/0.47 % Search garbage collected termcells : 2449
% 0.15/0.47
% 0.15/0.47 % -------------------------------------------------
% 0.15/0.47 % User time : 0.023 s
% 0.15/0.47 % System time : 0.006 s
% 0.15/0.47 % Total time : 0.029 s
% 0.15/0.47 % Maximum resident set size: 4024 pages
% 0.15/0.47
% 0.15/0.47 % -------------------------------------------------
% 0.15/0.47 % User time : 0.027 s
% 0.15/0.47 % System time : 0.010 s
% 0.15/0.47 % Total time : 0.037 s
% 0.15/0.47 % Maximum resident set size: 4864 pages
% 0.15/0.47 % E exiting
%------------------------------------------------------------------------------