TSTP Solution File: SWC108+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC108+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n008.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Tue Jul 19 20:26:44 EDT 2022
% Result : Theorem 0.22s 1.40s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 14
% Syntax : Number of formulae : 80 ( 15 unt; 0 def)
% Number of atoms : 321 ( 92 equ)
% Maximal formula atoms : 24 ( 4 avg)
% Number of connectives : 408 ( 167 ~; 170 |; 34 &)
% ( 5 <=>; 32 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 4 ( 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 : 104 ( 0 sgn 55 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ( neq(X1,nil)
& segmentP(X2,X1) ) ) )
| ( ( nil != X4
| nil != X3 )
& ( ~ neq(X3,nil)
| ~ rearsegP(X4,X3) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co1) ).
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(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(ax7,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( segmentP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(app(X3,X2),X4) = X1 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax7) ).
fof(ax6,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( rearsegP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& app(X3,X2) = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax6) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X2
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax83) ).
fof(ax47,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( rearsegP(X1,X2)
& rearsegP(X2,X3) )
=> rearsegP(X1,X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax47) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(ax53,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( segmentP(X1,X2)
& segmentP(X2,X3) )
=> segmentP(X1,X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax53) ).
fof(ax58,axiom,
! [X1] :
( ssList(X1)
=> ( segmentP(nil,X1)
<=> nil = X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax58) ).
fof(ax57,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,nil) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax57) ).
fof(ax52,axiom,
! [X1] :
( ssList(X1)
=> ( rearsegP(nil,X1)
<=> nil = X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax52) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(c_0_14,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ( neq(X1,nil)
& segmentP(X2,X1) ) ) )
| ( ( nil != X4
| nil != X3 )
& ( ~ neq(X3,nil)
| ~ rearsegP(X4,X3) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_15,plain,
! [X4,X5,X6] :
( ~ ssList(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| app(app(X4,X5),X6) = app(X4,app(X5,X6)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])])])]) ).
fof(c_0_16,plain,
! [X2] :
( ~ ssList(X2)
| app(nil,X2) = X2 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])]) ).
fof(c_0_17,negated_conjecture,
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ( neq(esk2_0,nil)
| nil = esk2_0 )
& ( ~ neq(esk1_0,nil)
| ~ segmentP(esk2_0,esk1_0)
| nil = esk2_0 )
& ( neq(esk2_0,nil)
| nil != esk1_0 )
& ( ~ neq(esk1_0,nil)
| ~ segmentP(esk2_0,esk1_0)
| nil != esk1_0 )
& ( neq(esk3_0,nil)
| nil = esk4_0 )
& ( rearsegP(esk4_0,esk3_0)
| nil = esk4_0 )
& ( neq(esk3_0,nil)
| nil = esk3_0 )
& ( rearsegP(esk4_0,esk3_0)
| nil = esk3_0 ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_14])])])])])])]) ).
fof(c_0_18,plain,
! [X5,X6,X9,X10] :
( ( ssList(esk8_2(X5,X6))
| ~ segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) )
& ( ssList(esk9_2(X5,X6))
| ~ segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) )
& ( app(app(esk8_2(X5,X6),X6),esk9_2(X5,X6)) = X5
| ~ segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) )
& ( ~ ssList(X9)
| ~ ssList(X10)
| app(app(X9,X6),X10) != X5
| segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax7])])])])])])]) ).
fof(c_0_19,plain,
! [X4,X5,X7] :
( ( ssList(esk5_2(X4,X5))
| ~ rearsegP(X4,X5)
| ~ ssList(X5)
| ~ ssList(X4) )
& ( app(esk5_2(X4,X5),X5) = X4
| ~ rearsegP(X4,X5)
| ~ ssList(X5)
| ~ ssList(X4) )
& ( ~ ssList(X7)
| app(X7,X5) != X4
| rearsegP(X4,X5)
| ~ ssList(X5)
| ~ ssList(X4) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax6])])])])])])]) ).
cnf(c_0_20,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
fof(c_0_23,plain,
! [X3,X4] :
( ( nil = X4
| nil != app(X3,X4)
| ~ ssList(X4)
| ~ ssList(X3) )
& ( nil = X3
| nil != app(X3,X4)
| ~ ssList(X4)
| ~ ssList(X3) )
& ( nil != X4
| nil != X3
| nil = app(X3,X4)
| ~ ssList(X4)
| ~ ssList(X3) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax83])])])])])]) ).
fof(c_0_24,plain,
! [X4,X5,X6] :
( ~ ssList(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| ~ rearsegP(X4,X5)
| ~ rearsegP(X5,X6)
| rearsegP(X4,X6) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax47])])])])]) ).
cnf(c_0_25,negated_conjecture,
( nil = esk3_0
| rearsegP(esk4_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_26,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_27,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_28,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_29,plain,
( segmentP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X3,X2),X4) != X1
| ~ ssList(X4)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_30,plain,
( app(esk5_2(X1,X2),X2) = X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_31,plain,
( ssList(esk5_2(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_32,plain,
! [X2] :
( ~ ssList(X2)
| app(X2,nil) = X2 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])]) ).
cnf(c_0_33,negated_conjecture,
( nil = esk4_0
| neq(esk3_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_34,plain,
! [X4,X5,X6] :
( ~ ssList(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| ~ segmentP(X4,X5)
| ~ segmentP(X5,X6)
| segmentP(X4,X6) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax53])])])])]) ).
fof(c_0_35,plain,
! [X2] :
( ( ~ segmentP(nil,X2)
| nil = X2
| ~ ssList(X2) )
& ( nil != X2
| segmentP(nil,X2)
| ~ ssList(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax58])])]) ).
fof(c_0_36,plain,
! [X2] :
( ~ ssList(X2)
| segmentP(X2,nil) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax57])]) ).
cnf(c_0_37,plain,
( app(nil,app(X1,X2)) = app(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_38,plain,
( nil = app(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| nil != X1
| nil != X2 ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_39,plain,
! [X2] :
( ( ~ rearsegP(nil,X2)
| nil = X2
| ~ ssList(X2) )
& ( nil != X2
| rearsegP(nil,X2)
| ~ ssList(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax52])])]) ).
cnf(c_0_40,plain,
( rearsegP(X1,X2)
| ~ rearsegP(X3,X2)
| ~ rearsegP(X1,X3)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_41,negated_conjecture,
( nil = esk1_0
| rearsegP(esk4_0,esk1_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26]),c_0_26]) ).
cnf(c_0_42,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_43,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_44,plain,
( segmentP(X1,X2)
| app(X3,X4) != X1
| ~ rearsegP(X3,X2)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]) ).
cnf(c_0_45,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_46,negated_conjecture,
( nil = esk2_0
| ~ segmentP(esk2_0,esk1_0)
| ~ neq(esk1_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_47,negated_conjecture,
( nil = esk4_0
| neq(esk1_0,nil) ),
inference(rw,[status(thm)],[c_0_33,c_0_26]) ).
cnf(c_0_48,plain,
( segmentP(X1,X2)
| ~ segmentP(X3,X2)
| ~ segmentP(X1,X3)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_49,plain,
( segmentP(nil,X1)
| ~ ssList(X1)
| nil != X1 ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_50,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
fof(c_0_51,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssList(X4)
| ssList(app(X3,X4)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])])]) ).
cnf(c_0_52,plain,
( app(nil,nil) = nil
| nil != X1
| nil != X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_53,plain,
( nil = X1
| ~ ssList(X1)
| ~ rearsegP(nil,X1) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_54,negated_conjecture,
( nil = esk1_0
| rearsegP(X1,esk1_0)
| ~ rearsegP(X1,esk4_0)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),c_0_43])]) ).
cnf(c_0_55,plain,
( segmentP(X1,X2)
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_22])])]) ).
cnf(c_0_56,negated_conjecture,
( nil = esk4_0
| ~ segmentP(esk4_0,esk1_0) ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_28]),c_0_28]),c_0_47]) ).
cnf(c_0_57,plain,
( segmentP(X1,X2)
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_22])]),c_0_50]) ).
cnf(c_0_58,plain,
( rearsegP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X3,X2) != X1
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_59,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_60,plain,
( app(nil,nil) = nil
| nil != X1
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_52,c_0_22]) ).
cnf(c_0_61,negated_conjecture,
( nil = esk1_0
| ~ rearsegP(nil,esk4_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_43]),c_0_22])]) ).
cnf(c_0_62,plain,
( rearsegP(nil,X1)
| ~ ssList(X1)
| nil != X1 ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_63,negated_conjecture,
( nil = esk1_0
| segmentP(esk4_0,esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_41]),c_0_43]),c_0_42])]) ).
cnf(c_0_64,negated_conjecture,
( nil = esk4_0
| nil != esk1_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_43]),c_0_42])]) ).
cnf(c_0_65,plain,
( rearsegP(app(X1,X2),X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_58]),c_0_59]) ).
cnf(c_0_66,plain,
app(nil,nil) = nil,
inference(spm,[status(thm)],[c_0_60,c_0_22]) ).
cnf(c_0_67,negated_conjecture,
( nil != esk1_0
| ~ segmentP(esk2_0,esk1_0)
| ~ neq(esk1_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_68,negated_conjecture,
( nil = esk1_0
| nil != esk4_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_42])]) ).
cnf(c_0_69,negated_conjecture,
nil = esk4_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_63]),c_0_64]) ).
cnf(c_0_70,plain,
rearsegP(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_22])]) ).
cnf(c_0_71,negated_conjecture,
( nil != esk1_0
| ~ segmentP(esk4_0,esk1_0)
| ~ neq(esk1_0,nil) ),
inference(rw,[status(thm)],[c_0_67,c_0_28]) ).
cnf(c_0_72,negated_conjecture,
esk1_0 = esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_68,c_0_69]),c_0_69])]) ).
cnf(c_0_73,plain,
rearsegP(esk4_0,esk4_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_70,c_0_69]),c_0_69]) ).
cnf(c_0_74,negated_conjecture,
( neq(esk2_0,nil)
| nil != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_75,negated_conjecture,
( ~ segmentP(esk4_0,esk4_0)
| ~ neq(esk4_0,esk4_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_71,c_0_69]),c_0_69]),c_0_72]),c_0_72]),c_0_72])]) ).
cnf(c_0_76,plain,
segmentP(esk4_0,esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_73]),c_0_42])]) ).
cnf(c_0_77,negated_conjecture,
( neq(esk4_0,nil)
| nil != esk1_0 ),
inference(rw,[status(thm)],[c_0_74,c_0_28]) ).
cnf(c_0_78,negated_conjecture,
~ neq(esk4_0,esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_75,c_0_76])]) ).
cnf(c_0_79,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_77,c_0_69]),c_0_69]),c_0_72])]),c_0_78]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SWC108+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n008.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jun 12 19:03:52 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.22/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.40 # Preprocessing time : 0.020 s
% 0.22/1.40
% 0.22/1.40 # Proof found!
% 0.22/1.40 # SZS status Theorem
% 0.22/1.40 # SZS output start CNFRefutation
% See solution above
% 0.22/1.40 # Proof object total steps : 80
% 0.22/1.40 # Proof object clause steps : 52
% 0.22/1.40 # Proof object formula steps : 28
% 0.22/1.40 # Proof object conjectures : 28
% 0.22/1.40 # Proof object clause conjectures : 25
% 0.22/1.40 # Proof object formula conjectures : 3
% 0.22/1.40 # Proof object initial clauses used : 25
% 0.22/1.40 # Proof object initial formulas used : 14
% 0.22/1.40 # Proof object generating inferences : 16
% 0.22/1.40 # Proof object simplifying inferences : 56
% 0.22/1.40 # Training examples: 0 positive, 0 negative
% 0.22/1.40 # Parsed axioms : 96
% 0.22/1.40 # Removed by relevancy pruning/SinE : 63
% 0.22/1.40 # Initial clauses : 62
% 0.22/1.40 # Removed in clause preprocessing : 0
% 0.22/1.40 # Initial clauses in saturation : 62
% 0.22/1.40 # Processed clauses : 618
% 0.22/1.40 # ...of these trivial : 18
% 0.22/1.40 # ...subsumed : 347
% 0.22/1.40 # ...remaining for further processing : 252
% 0.22/1.40 # Other redundant clauses eliminated : 51
% 0.22/1.40 # Clauses deleted for lack of memory : 0
% 0.22/1.40 # Backward-subsumed : 22
% 0.22/1.40 # Backward-rewritten : 146
% 0.22/1.40 # Generated clauses : 3731
% 0.22/1.40 # ...of the previous two non-trivial : 3422
% 0.22/1.40 # Contextual simplify-reflections : 345
% 0.22/1.40 # Paramodulations : 3656
% 0.22/1.40 # Factorizations : 0
% 0.22/1.40 # Equation resolutions : 75
% 0.22/1.40 # Current number of processed clauses : 82
% 0.22/1.40 # Positive orientable unit clauses : 9
% 0.22/1.40 # Positive unorientable unit clauses: 0
% 0.22/1.40 # Negative unit clauses : 2
% 0.22/1.40 # Non-unit-clauses : 71
% 0.22/1.40 # Current number of unprocessed clauses: 537
% 0.22/1.40 # ...number of literals in the above : 3831
% 0.22/1.40 # Current number of archived formulas : 0
% 0.22/1.40 # Current number of archived clauses : 168
% 0.22/1.40 # Clause-clause subsumption calls (NU) : 11828
% 0.22/1.40 # Rec. Clause-clause subsumption calls : 3907
% 0.22/1.40 # Non-unit clause-clause subsumptions : 714
% 0.22/1.40 # Unit Clause-clause subsumption calls : 9
% 0.22/1.40 # Rewrite failures with RHS unbound : 0
% 0.22/1.40 # BW rewrite match attempts : 4
% 0.22/1.40 # BW rewrite match successes : 4
% 0.22/1.40 # Condensation attempts : 0
% 0.22/1.40 # Condensation successes : 0
% 0.22/1.40 # Termbank termtop insertions : 66947
% 0.22/1.40
% 0.22/1.40 # -------------------------------------------------
% 0.22/1.40 # User time : 0.167 s
% 0.22/1.40 # System time : 0.005 s
% 0.22/1.40 # Total time : 0.172 s
% 0.22/1.40 # Maximum resident set size: 6084 pages
%------------------------------------------------------------------------------