%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC052+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 : n014.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:47 PM UTC 2026
% Result : Theorem 0.19s 0.58s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 9
% Syntax : Number of formulae : 73 ( 16 unt; 0 def)
% Number of atoms : 278 ( 69 equ)
% Maximal formula atoms : 30 ( 3 avg)
% Number of connectives : 354 ( 149 ~; 144 |; 37 &)
% ( 3 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 68 ( 0 sgn 39 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ( ( ? [X6] :
( segmentP(X1,X6)
& segmentP(X2,X6)
& neq(X6,nil)
& ssList(X6) )
| ~ neq(X2,nil) )
& ( nil = X1
| nil != X2 ) )
| ( neq(X4,nil)
& ! [X5] :
( ~ frontsegP(X3,X5)
| ~ frontsegP(X4,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) ) )
| ( nil = X4
& nil != X3 )
| X1 != X3
| X2 != X4
| ~ ssList(X4) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax46,axiom,
! [X1] :
( ssList(X1)
=> ( frontsegP(nil,X1)
<=> nil = X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax46) ).
fof(ax58,axiom,
! [X1] :
( ssList(X1)
=> ( segmentP(nil,X1)
<=> nil = X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax58) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax57,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,nil) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax57) ).
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/sandbox2/benchmark/Axioms/SWC001+0.ax',ax56) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(ax5,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( frontsegP(X1,X2)
<=> ? [X3] :
( app(X2,X3) = X1
& ssList(X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax5) ).
fof(ax55,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax55) ).
fof(c_0_9,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ( ( ? [X6] :
( segmentP(X1,X6)
& segmentP(X2,X6)
& neq(X6,nil)
& ssList(X6) )
| ~ neq(X2,nil) )
& ( nil = X1
| nil != X2 ) )
| ( neq(X4,nil)
& ! [X5] :
( ~ frontsegP(X3,X5)
| ~ frontsegP(X4,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) ) )
| ( nil = X4
& nil != X3 )
| X1 != X3
| X2 != X4
| ~ ssList(X4) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_10,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ( ( ? [X6] :
( segmentP(X1,X6)
& segmentP(X2,X6)
& neq(X6,nil)
& ssList(X6) )
| ~ neq(X2,nil) )
& ( nil = X1
| nil != X2 ) )
| ( neq(X4,nil)
& ! [X5] :
( ~ frontsegP(X3,X5)
| ~ frontsegP(X4,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) ) )
| ( nil = X4
& nil != X3 )
| X1 != X3
| X2 != X4
| ~ ssList(X4) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_11,negated_conjecture,
! [X12] :
( ( nil != esk1_0
| ~ segmentP(esk1_0,X12)
| ~ segmentP(esk2_0,X12)
| ~ neq(X12,nil)
| ~ ssList(X12) )
& ( nil != esk1_0
| neq(esk2_0,nil) )
& ( nil = esk2_0
| ~ segmentP(esk1_0,X12)
| ~ segmentP(esk2_0,X12)
| ~ neq(X12,nil)
| ~ ssList(X12) )
& ( nil = esk2_0
| neq(esk2_0,nil) )
& ( ~ neq(esk4_0,nil)
| frontsegP(esk3_0,esk5_0) )
& ( ~ neq(esk4_0,nil)
| frontsegP(esk4_0,esk5_0) )
& ( ~ neq(esk4_0,nil)
| neq(esk5_0,nil) )
& ( ~ neq(esk4_0,nil)
| ssList(esk5_0) )
& ( nil != esk4_0
| nil = esk3_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])])])])])]) ).
cnf(c_0_12,negated_conjecture,
( ~ neq(esk4_0,nil)
| frontsegP(esk3_0,esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_13,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,negated_conjecture,
( nil != esk1_0
| neq(esk2_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
( ~ neq(esk4_0,nil)
| frontsegP(esk1_0,esk5_0) ),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,negated_conjecture,
( esk1_0 != nil
| neq(esk4_0,nil) ),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
( nil != esk4_0
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,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_20,negated_conjecture,
( ~ neq(esk4_0,nil)
| ssList(esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_21,plain,
! [X58] :
( ( ~ ssList(X58)
| frontsegP(nil,X58)
| nil != X58 )
& ( ~ ssList(X58)
| nil = X58
| ~ frontsegP(nil,X58) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax46])])])]) ).
cnf(c_0_22,negated_conjecture,
( esk1_0 != nil
| frontsegP(esk1_0,esk5_0) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,negated_conjecture,
( esk4_0 != nil
| esk1_0 = nil ),
inference(rw,[status(thm)],[c_0_18,c_0_13]) ).
cnf(c_0_24,negated_conjecture,
( ~ neq(X1,nil)
| ~ ssList(X1)
| ~ segmentP(esk4_0,X1)
| ~ segmentP(esk1_0,X1)
| esk1_0 != nil ),
inference(rw,[status(thm)],[c_0_19,c_0_15]) ).
cnf(c_0_25,negated_conjecture,
( ~ neq(esk4_0,nil)
| neq(esk5_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_26,negated_conjecture,
( esk1_0 != nil
| ssList(esk5_0) ),
inference(spm,[status(thm)],[c_0_20,c_0_17]) ).
cnf(c_0_27,plain,
( ~ ssList(X1)
| ~ frontsegP(nil,X1)
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_28,negated_conjecture,
( esk4_0 != nil
| frontsegP(nil,esk5_0) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
fof(c_0_29,plain,
! [X30] :
( ( ~ ssList(X30)
| segmentP(nil,X30)
| nil != X30 )
& ( ~ ssList(X30)
| nil = X30
| ~ segmentP(nil,X30) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax58])])])]) ).
cnf(c_0_30,negated_conjecture,
( ~ segmentP(esk4_0,esk5_0)
| ~ segmentP(esk1_0,esk5_0)
| esk1_0 != nil ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_17]),c_0_26]) ).
cnf(c_0_31,negated_conjecture,
( ~ ssList(esk5_0)
| esk4_0 != nil
| esk5_0 = nil ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,plain,
( ~ ssList(X1)
| nil != X1
| segmentP(nil,X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_33,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_34,negated_conjecture,
( ~ segmentP(esk4_0,esk5_0)
| ~ segmentP(nil,esk5_0)
| esk4_0 != nil ),
inference(spm,[status(thm)],[c_0_30,c_0_23]) ).
cnf(c_0_35,negated_conjecture,
( esk4_0 != nil
| esk5_0 = nil ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_26]),c_0_23]) ).
cnf(c_0_36,plain,
segmentP(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_32]),c_0_33])]) ).
fof(c_0_37,plain,
! [X29] :
( segmentP(X29,nil)
| ~ ssList(X29) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax57])])]) ).
fof(c_0_38,plain,
! [X25,X26,X27,X28] :
( segmentP(app(app(X27,X25),X28),X26)
| ~ segmentP(X25,X26)
| ~ ssList(X28)
| ~ ssList(X27)
| ~ ssList(X26)
| ~ ssList(X25) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax56])])])]) ).
fof(c_0_39,plain,
! [X64] :
( app(nil,X64) = X64
| ~ ssList(X64) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
cnf(c_0_40,negated_conjecture,
( nil = esk2_0
| neq(esk2_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_41,negated_conjecture,
( ~ segmentP(esk4_0,nil)
| 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_42,plain,
( ~ ssList(X1)
| segmentP(X1,nil) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_43,negated_conjecture,
ssList(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_44,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_38]) ).
cnf(c_0_45,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
fof(c_0_46,plain,
! [X40,X41,X43] :
( ( ~ ssList(X40)
| ~ ssList(X41)
| frontsegP(X40,X41)
| app(X41,X43) != X40
| ~ ssList(X43) )
& ( ~ ssList(X40)
| ~ ssList(X41)
| ~ frontsegP(X40,X41)
| app(X41,esk10_2(X40,X41)) = X40 )
& ( ~ ssList(X40)
| ~ ssList(X41)
| ~ frontsegP(X40,X41)
| ssList(esk10_2(X40,X41)) ) ),
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)],[ax5])])])])])]) ).
cnf(c_0_47,negated_conjecture,
( ~ neq(esk4_0,nil)
| frontsegP(esk4_0,esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_48,negated_conjecture,
( neq(esk4_0,nil)
| esk4_0 = nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_15]),c_0_15]) ).
cnf(c_0_49,negated_conjecture,
esk4_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43])]) ).
cnf(c_0_50,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_44,c_0_45]),c_0_33])]) ).
cnf(c_0_51,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X2,X1)
| app(X1,esk10_2(X2,X1)) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_52,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| ssList(esk10_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_53,negated_conjecture,
( frontsegP(esk4_0,esk5_0)
| esk4_0 = nil ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_54,negated_conjecture,
( ssList(esk5_0)
| esk4_0 = nil ),
inference(spm,[status(thm)],[c_0_20,c_0_48]) ).
cnf(c_0_55,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]) ).
cnf(c_0_56,negated_conjecture,
neq(esk4_0,nil),
inference(sr,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_57,plain,
( ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ frontsegP(X1,X3)
| ~ segmentP(X3,X2)
| segmentP(X1,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52]) ).
cnf(c_0_58,negated_conjecture,
frontsegP(esk4_0,esk5_0),
inference(sr,[status(thm)],[c_0_53,c_0_49]) ).
cnf(c_0_59,negated_conjecture,
ssList(esk5_0),
inference(sr,[status(thm)],[c_0_54,c_0_49]) ).
fof(c_0_60,plain,
! [X24] :
( segmentP(X24,X24)
| ~ ssList(X24) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])])]) ).
cnf(c_0_61,negated_conjecture,
( frontsegP(esk1_0,esk5_0)
| esk4_0 = nil ),
inference(spm,[status(thm)],[c_0_16,c_0_48]) ).
cnf(c_0_62,negated_conjecture,
( ~ neq(X1,nil)
| ~ ssList(X1)
| ~ segmentP(esk4_0,X1)
| ~ segmentP(esk1_0,X1)
| esk4_0 = nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_15]),c_0_15]) ).
cnf(c_0_63,negated_conjecture,
neq(esk5_0,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_56])]) ).
cnf(c_0_64,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(esk5_0,X1)
| segmentP(esk4_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59]),c_0_43])]) ).
cnf(c_0_65,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_66,negated_conjecture,
frontsegP(esk1_0,esk5_0),
inference(sr,[status(thm)],[c_0_61,c_0_49]) ).
cnf(c_0_67,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_68,negated_conjecture,
( ~ segmentP(esk4_0,esk5_0)
| ~ segmentP(esk1_0,esk5_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_59])]),c_0_49]) ).
cnf(c_0_69,negated_conjecture,
segmentP(esk4_0,esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_59])]) ).
cnf(c_0_70,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(esk5_0,X1)
| segmentP(esk1_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_66]),c_0_59]),c_0_67])]) ).
cnf(c_0_71,negated_conjecture,
~ segmentP(esk1_0,esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_68,c_0_69])]) ).
cnf(c_0_72,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_65]),c_0_59])]),c_0_71]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC052+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.10/0.38 % Computer : n014.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Mon Sep 21 07:51:35 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 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.19/0.58 % Version: 3.5.1
% 0.19/0.58 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.58 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.19/0.58 % Starting new_bool_1 with 300s (1) cores
% 0.19/0.58 % Starting sh5l with 300s (1) cores
% 0.19/0.58 % new_bool_3 with pid 3572456 completed with status 0
% 0.19/0.58 % Result found by new_bool_3
% 0.19/0.58 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.58 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.19/0.58 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.19/0.58 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.58 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.19/0.58 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.58 % Starting SubtermCWHack with 31s (1) cores
% 0.19/0.58 % SubtermCWHack with pid 3572459 completed with status 0
% 0.19/0.58 % Result found by SubtermCWHack
% 0.19/0.58 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.58 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.19/0.58 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.19/0.58 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.58 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.19/0.58 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.58 % Starting SubtermCWHack with 31s (1) cores
% 0.19/0.58 % Preprocessing time : 0.001 s
% 0.19/0.58
% 0.19/0.58 % Proof found!
% 0.19/0.58 % SZS status Theorem
% 0.19/0.58 % SZS output start CNFRefutation
% See solution above
% 0.19/0.58 % Parsed axioms : 96
% 0.19/0.58 % Removed by relevancy pruning/SinE : 62
% 0.19/0.58 % Initial clauses : 66
% 0.19/0.58 % Removed in clause preprocessing : 0
% 0.19/0.58 % Initial clauses in saturation : 66
% 0.19/0.58 % Processed clauses : 1725
% 0.19/0.58 % ...of these trivial : 4
% 0.19/0.58 % ...subsumed : 1295
% 0.19/0.58 % ...remaining for further processing : 426
% 0.19/0.58 % Other redundant clauses eliminated : 160
% 0.19/0.58 % Clauses deleted for lack of memory : 0
% 0.19/0.58 % Backward-subsumed : 38
% 0.19/0.58 % Backward-rewritten : 8
% 0.19/0.58 % Generated clauses : 8372
% 0.19/0.58 % ...of the previous two non-redundant : 7261
% 0.19/0.58 % ...aggressively subsumed : 0
% 0.19/0.58 % Contextual simplify-reflections : 129
% 0.19/0.58 % Paramodulations : 8193
% 0.19/0.58 % Factorizations : 0
% 0.19/0.58 % NegExts : 0
% 0.19/0.58 % Equation resolutions : 176
% 0.19/0.58 % Disequality decompositions : 0
% 0.19/0.58 % Total rewrite steps : 5697
% 0.19/0.58 % ...of those cached : 5681
% 0.19/0.58 % Propositional unsat checks : 0
% 0.19/0.58 % Propositional check models : 0
% 0.19/0.58 % Propositional check unsatisfiable : 0
% 0.19/0.58 % Propositional clauses : 0
% 0.19/0.58 % Propositional clauses after purity: 0
% 0.19/0.58 % Propositional unsat core size : 0
% 0.19/0.58 % Propositional preprocessing time : 0.000
% 0.19/0.58 % Propositional encoding time : 0.000
% 0.19/0.58 % Propositional solver time : 0.000
% 0.19/0.58 % Success case prop preproc time : 0.000
% 0.19/0.58 % Success case prop encoding time : 0.000
% 0.19/0.58 % Success case prop solver time : 0.000
% 0.19/0.58 % Current number of processed clauses : 368
% 0.19/0.58 % Positive orientable unit clauses : 20
% 0.19/0.58 % Positive unorientable unit clauses: 0
% 0.19/0.58 % Negative unit clauses : 4
% 0.19/0.58 % Non-unit-clauses : 344
% 0.19/0.58 % Current number of unprocessed clauses: 5594
% 0.19/0.58 % ...number of literals in the above : 32812
% 0.19/0.58 % Current number of archived formulas : 0
% 0.19/0.58 % Current number of archived clauses : 50
% 0.19/0.58 % Clause-clause subsumption calls (NU) : 29961
% 0.19/0.58 % Rec. Clause-clause subsumption calls : 19136
% 0.19/0.58 % Non-unit clause-clause subsumptions : 1445
% 0.19/0.58 % Unit Clause-clause subsumption calls : 458
% 0.19/0.58 % Rewrite failures with RHS unbound : 0
% 0.19/0.58 % BW rewrite match attempts : 10
% 0.19/0.58 % BW rewrite match successes : 10
% 0.19/0.58 % Condensation attempts : 0
% 0.19/0.58 % Condensation successes : 0
% 0.19/0.58 % Termbank termtop insertions : 151407
% 0.19/0.58 % Search garbage collected termcells : 1834
% 0.19/0.58
% 0.19/0.58 % -------------------------------------------------
% 0.19/0.58 % User time : 0.124 s
% 0.19/0.58 % System time : 0.009 s
% 0.19/0.58 % Total time : 0.134 s
% 0.19/0.58 % Maximum resident set size: 3708 pages
% 0.19/0.58
% 0.19/0.58 % -------------------------------------------------
% 0.19/0.58 % User time : 0.127 s
% 0.19/0.58 % System time : 0.015 s
% 0.19/0.58 % Total time : 0.142 s
% 0.19/0.58 % Maximum resident set size: 4864 pages
% 0.19/0.58 % E exiting
%------------------------------------------------------------------------------