TSTP Solution File: SWC356+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC356+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n018.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:28:14 EDT 2022
% Result : Theorem 0.59s 55.76s
% Output : CNFRefutation 0.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 14
% Syntax : Number of formulae : 82 ( 18 unt; 0 def)
% Number of atoms : 341 ( 85 equ)
% Maximal formula atoms : 30 ( 4 avg)
% Number of connectives : 436 ( 177 ~; 183 |; 35 &)
% ( 3 <=>; 38 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-2 aty)
% Number of variables : 136 ( 0 sgn 65 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| segmentP(X2,X1)
| ( ! [X5] :
( ssItem(X5)
=> ( cons(X5,nil) != X3
| ~ memberP(X4,X5)
| ? [X6] :
( ssItem(X6)
& X5 != X6
& memberP(X4,X6)
& leq(X6,X5) ) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',co1) ).
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(ax53,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( segmentP(X1,X2)
& segmentP(X2,X3) )
=> segmentP(X1,X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax53) ).
fof(ax58,axiom,
! [X1] :
( ssList(X1)
=> ( segmentP(nil,X1)
<=> nil = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax58) ).
fof(ax57,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,nil) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax57) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax80,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( app(X2,X3) = app(X2,X1)
=> X3 = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax80) ).
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(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(ax3,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ( memberP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(X3,cons(X2,X4)) = X1 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax3) ).
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(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/sandbox/benchmark/Axioms/SWC001+0.ax',ax7) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(c_0_14,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| segmentP(X2,X1)
| ( ! [X5] :
( ssItem(X5)
=> ( cons(X5,nil) != X3
| ~ memberP(X4,X5)
| ? [X6] :
( ssItem(X6)
& X5 != X6
& memberP(X4,X6)
& leq(X6,X5) ) ) )
& ( nil != X4
| nil != X3 ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_15,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssItem(X4)
| cons(X4,X3) = app(cons(X4,nil),X3) ),
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)],[ax81])])])])]) ).
fof(c_0_16,negated_conjecture,
! [X12] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& neq(esk2_0,nil)
& ~ segmentP(esk2_0,esk1_0)
& ( nil = esk4_0
| ssItem(esk5_0) )
& ( nil = esk3_0
| ssItem(esk5_0) )
& ( nil = esk4_0
| cons(esk5_0,nil) = esk3_0 )
& ( nil = esk3_0
| cons(esk5_0,nil) = esk3_0 )
& ( nil = esk4_0
| memberP(esk4_0,esk5_0) )
& ( nil = esk3_0
| memberP(esk4_0,esk5_0) )
& ( nil = esk4_0
| ~ ssItem(X12)
| esk5_0 = X12
| ~ memberP(esk4_0,X12)
| ~ leq(X12,esk5_0) )
& ( nil = esk3_0
| ~ ssItem(X12)
| esk5_0 = X12
| ~ memberP(esk4_0,X12)
| ~ leq(X12,esk5_0) ) ),
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)],[inference(fof_simplification,[status(thm)],[c_0_14])])])])])])])]) ).
fof(c_0_17,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_18,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_19,plain,
! [X2] :
( ~ ssList(X2)
| segmentP(X2,nil) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax57])]) ).
cnf(c_0_20,plain,
( cons(X1,X2) = app(cons(X1,nil),X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,negated_conjecture,
( cons(esk5_0,nil) = esk3_0
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,negated_conjecture,
( ssItem(esk5_0)
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,negated_conjecture,
~ segmentP(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_25,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_26,plain,
( segmentP(X1,X2)
| ~ segmentP(X3,X2)
| ~ segmentP(X1,X3)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_27,plain,
( segmentP(nil,X1)
| ~ ssList(X1)
| nil != X1 ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_28,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_29,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_30,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_31,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_32,negated_conjecture,
( cons(esk5_0,X1) = app(esk3_0,X1)
| esk3_0 = nil
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(pm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_33,negated_conjecture,
~ segmentP(esk4_0,esk3_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_34,plain,
( segmentP(X1,X2)
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]),c_0_29]) ).
cnf(c_0_35,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_30,c_0_24]) ).
cnf(c_0_36,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_31,c_0_25]) ).
fof(c_0_37,plain,
! [X4,X5,X6] :
( ~ ssList(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| app(X5,X6) != app(X5,X4)
| X6 = 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)],[ax80])])])])]) ).
cnf(c_0_38,negated_conjecture,
( app(esk3_0,nil) = esk3_0
| esk3_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_21,c_0_32]),c_0_28])]) ).
cnf(c_0_39,negated_conjecture,
esk3_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),c_0_36])]) ).
fof(c_0_40,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])])])])]) ).
cnf(c_0_41,plain,
( X1 = X2
| app(X3,X1) != app(X3,X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_42,negated_conjecture,
app(esk3_0,nil) = esk3_0,
inference(sr,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_43,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
fof(c_0_44,plain,
! [X5,X6,X7,X8] :
( ~ ssList(X5)
| ~ ssList(X6)
| ~ ssList(X7)
| ~ ssList(X8)
| ~ segmentP(X5,X6)
| segmentP(app(app(X7,X5),X8),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)],[ax56])])])])]) ).
fof(c_0_45,plain,
! [X5,X6,X9,X10] :
( ( ssList(esk6_2(X5,X6))
| ~ memberP(X5,X6)
| ~ ssItem(X6)
| ~ ssList(X5) )
& ( ssList(esk7_2(X5,X6))
| ~ memberP(X5,X6)
| ~ ssItem(X6)
| ~ ssList(X5) )
& ( app(esk6_2(X5,X6),cons(X6,esk7_2(X5,X6))) = X5
| ~ memberP(X5,X6)
| ~ ssItem(X6)
| ~ ssList(X5) )
& ( ~ ssList(X9)
| ~ ssList(X10)
| app(X9,cons(X6,X10)) != X5
| memberP(X5,X6)
| ~ ssItem(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)],[ax3])])])])])])]) ).
cnf(c_0_46,negated_conjecture,
cons(esk5_0,nil) = esk3_0,
inference(sr,[status(thm)],[c_0_21,c_0_39]) ).
cnf(c_0_47,negated_conjecture,
ssItem(esk5_0),
inference(sr,[status(thm)],[c_0_22,c_0_39]) ).
fof(c_0_48,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_49,negated_conjecture,
( X1 = nil
| app(esk3_0,X1) != esk3_0
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_41,c_0_42]),c_0_35]),c_0_28])]) ).
cnf(c_0_50,negated_conjecture,
( app(esk3_0,app(nil,X1)) = app(esk3_0,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_43,c_0_42]),c_0_28]),c_0_35])]) ).
fof(c_0_51,plain,
! [X2] :
( ~ ssList(X2)
| app(X2,nil) = X2 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])]) ).
cnf(c_0_52,plain,
( segmentP(app(app(X1,X2),X3),X4)
| ~ segmentP(X2,X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X4)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_53,plain,
( app(esk6_2(X1,X2),cons(X2,esk7_2(X1,X2))) = X1
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_54,negated_conjecture,
( cons(esk5_0,X1) = app(esk3_0,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_20,c_0_46]),c_0_47])]) ).
cnf(c_0_55,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_56,negated_conjecture,
( app(nil,X1) = nil
| app(esk3_0,X1) != esk3_0
| ~ ssList(app(nil,X1))
| ~ ssList(X1) ),
inference(pm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_57,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_58,plain,
( segmentP(app(X1,app(X2,X3)),X4)
| ~ segmentP(X2,X4)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(pm,[status(thm)],[c_0_52,c_0_43]) ).
cnf(c_0_59,negated_conjecture,
( app(esk6_2(X1,esk5_0),app(esk3_0,esk7_2(X1,esk5_0))) = X1
| ~ memberP(X1,esk5_0)
| ~ ssList(esk7_2(X1,esk5_0))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_53,c_0_54]),c_0_47])]) ).
fof(c_0_60,plain,
! [X5,X6,X9,X10] :
( ( ssList(esk12_2(X5,X6))
| ~ segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) )
& ( ssList(esk13_2(X5,X6))
| ~ segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) )
& ( app(app(esk12_2(X5,X6),X6),esk13_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_61,plain,
! [X2] :
( ~ ssList(X2)
| app(nil,X2) = X2 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])]) ).
cnf(c_0_62,plain,
( ssList(app(X1,app(X2,X3)))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(pm,[status(thm)],[c_0_55,c_0_43]),c_0_55]) ).
cnf(c_0_63,negated_conjecture,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_56,c_0_57]),c_0_28]),c_0_42])]) ).
cnf(c_0_64,negated_conjecture,
( segmentP(X1,X2)
| ~ segmentP(esk3_0,X2)
| ~ memberP(X1,esk5_0)
| ~ ssList(esk7_2(X1,esk5_0))
| ~ ssList(esk6_2(X1,esk5_0))
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_58,c_0_59]),c_0_35])]) ).
cnf(c_0_65,plain,
( ssList(esk7_2(X1,X2))
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_66,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_60]) ).
cnf(c_0_67,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
cnf(c_0_68,plain,
( app(X1,app(X2,nil)) = app(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_57,c_0_43]),c_0_28])]),c_0_55]) ).
cnf(c_0_69,negated_conjecture,
( ssList(app(X1,nil))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_62,c_0_63]),c_0_28])]) ).
cnf(c_0_70,negated_conjecture,
( segmentP(X1,X2)
| ~ segmentP(esk3_0,X2)
| ~ memberP(X1,esk5_0)
| ~ ssList(esk6_2(X1,esk5_0))
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_64,c_0_65]),c_0_47])]) ).
cnf(c_0_71,plain,
( ssList(esk6_2(X1,X2))
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_72,plain,
( segmentP(X1,X2)
| app(X2,X3) != X1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_66,c_0_67]),c_0_28])]) ).
cnf(c_0_73,plain,
( app(nil,X1) = app(X1,nil)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_67,c_0_68]),c_0_28])]),c_0_69]) ).
cnf(c_0_74,negated_conjecture,
( segmentP(X1,X2)
| ~ segmentP(esk3_0,X2)
| ~ memberP(X1,esk5_0)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_70,c_0_71]),c_0_47])]) ).
cnf(c_0_75,plain,
( segmentP(X1,X2)
| app(nil,X2) != X1
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_72,c_0_73]),c_0_28])]) ).
cnf(c_0_76,plain,
( app(nil,app(X1,X2)) = app(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_43,c_0_67]),c_0_28])]) ).
cnf(c_0_77,negated_conjecture,
( memberP(esk4_0,esk5_0)
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_78,negated_conjecture,
( segmentP(X1,X2)
| app(nil,X2) != esk3_0
| ~ memberP(X1,esk5_0)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_74,c_0_75]),c_0_35])]) ).
cnf(c_0_79,negated_conjecture,
app(nil,esk3_0) = esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_76,c_0_42]),c_0_42]),c_0_28]),c_0_35])]) ).
cnf(c_0_80,negated_conjecture,
memberP(esk4_0,esk5_0),
inference(sr,[status(thm)],[c_0_77,c_0_39]) ).
cnf(c_0_81,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_33,c_0_78]),c_0_79]),c_0_80]),c_0_35]),c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC356+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n018.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 08:42:56 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.38/23.40 eprover: CPU time limit exceeded, terminating
% 0.38/23.41 eprover: CPU time limit exceeded, terminating
% 0.38/23.41 eprover: eprover: CPU time limit exceeded, terminatingCPU time limit exceeded, terminating
% 0.38/23.41
% 0.52/46.42 eprover: CPU time limit exceeded, terminating
% 0.52/46.43 eprover: CPU time limit exceeded, terminating
% 0.52/46.43 eprover: CPU time limit exceeded, terminating
% 0.52/46.43 eprover: CPU time limit exceeded, terminating
% 0.59/55.76 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.59/55.76
% 0.59/55.76 # Failure: Resource limit exceeded (time)
% 0.59/55.76 # OLD status Res
% 0.59/55.76 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.59/55.76 # Preprocessing time : 0.020 s
% 0.59/55.76 # Running protocol protocol_eprover_230b6c199cce1dcf6700db59e75a93feb83d1bd9 for 23 seconds:
% 0.59/55.76
% 0.59/55.76 # Failure: Resource limit exceeded (time)
% 0.59/55.76 # OLD status Res
% 0.59/55.76 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,01,20000,1.0)
% 0.59/55.76 # Preprocessing time : 0.011 s
% 0.59/55.76 # Running protocol protocol_eprover_48e494e00e0717ec2eabf59b73b2d711334607de for 23 seconds:
% 0.59/55.76 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,03,20000,1.0)
% 0.59/55.76 # Preprocessing time : 0.012 s
% 0.59/55.76
% 0.59/55.76 # Proof found!
% 0.59/55.76 # SZS status Theorem
% 0.59/55.76 # SZS output start CNFRefutation
% See solution above
% 0.59/55.76 # Proof object total steps : 82
% 0.59/55.76 # Proof object clause steps : 54
% 0.59/55.76 # Proof object formula steps : 28
% 0.59/55.76 # Proof object conjectures : 34
% 0.59/55.76 # Proof object clause conjectures : 31
% 0.59/55.76 # Proof object formula conjectures : 3
% 0.59/55.76 # Proof object initial clauses used : 23
% 0.59/55.76 # Proof object initial formulas used : 14
% 0.59/55.76 # Proof object generating inferences : 24
% 0.59/55.76 # Proof object simplifying inferences : 62
% 0.59/55.76 # Training examples: 0 positive, 0 negative
% 0.59/55.76 # Parsed axioms : 96
% 0.59/55.76 # Removed by relevancy pruning/SinE : 63
% 0.59/55.76 # Initial clauses : 68
% 0.59/55.76 # Removed in clause preprocessing : 0
% 0.59/55.76 # Initial clauses in saturation : 68
% 0.59/55.76 # Processed clauses : 38264
% 0.59/55.76 # ...of these trivial : 200
% 0.59/55.76 # ...subsumed : 35422
% 0.59/55.76 # ...remaining for further processing : 2642
% 0.59/55.76 # Other redundant clauses eliminated : 286
% 0.59/55.76 # Clauses deleted for lack of memory : 282081
% 0.59/55.76 # Backward-subsumed : 107
% 0.59/55.76 # Backward-rewritten : 43
% 0.59/55.76 # Generated clauses : 413036
% 0.59/55.76 # ...of the previous two non-trivial : 402386
% 0.59/55.76 # Contextual simplify-reflections : 7423
% 0.59/55.76 # Paramodulations : 412505
% 0.59/55.76 # Factorizations : 0
% 0.59/55.76 # Equation resolutions : 526
% 0.59/55.76 # Current number of processed clauses : 2484
% 0.59/55.76 # Positive orientable unit clauses : 104
% 0.59/55.76 # Positive unorientable unit clauses: 0
% 0.59/55.76 # Negative unit clauses : 439
% 0.59/55.76 # Non-unit-clauses : 1941
% 0.59/55.76 # Current number of unprocessed clauses: 77999
% 0.59/55.76 # ...number of literals in the above : 354830
% 0.59/55.76 # Current number of archived formulas : 0
% 0.59/55.76 # Current number of archived clauses : 155
% 0.59/55.76 # Clause-clause subsumption calls (NU) : 1134985
% 0.59/55.76 # Rec. Clause-clause subsumption calls : 298444
% 0.59/55.76 # Non-unit clause-clause subsumptions : 13468
% 0.59/55.76 # Unit Clause-clause subsumption calls : 35469
% 0.59/55.76 # Rewrite failures with RHS unbound : 0
% 0.59/55.76 # BW rewrite match attempts : 432
% 0.59/55.76 # BW rewrite match successes : 25
% 0.59/55.76 # Condensation attempts : 0
% 0.59/55.76 # Condensation successes : 0
% 0.59/55.76 # Termbank termtop insertions : 7446595
% 0.59/55.76
% 0.59/55.76 # -------------------------------------------------
% 0.59/55.76 # User time : 8.235 s
% 0.59/55.76 # System time : 0.133 s
% 0.59/55.76 # Total time : 8.368 s
% 0.59/55.76 # Maximum resident set size: 139896 pages
% 0.59/69.44 eprover: CPU time limit exceeded, terminating
% 0.59/69.44 eprover: CPU time limit exceeded, terminating
% 0.59/69.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.59/69.45 eprover: No such file or directory
% 0.59/69.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.59/69.46 eprover: No such file or directory
% 0.59/69.46 eprover: CPU time limit exceeded, terminating
% 0.59/69.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.59/69.46 eprover: No such file or directory
% 0.59/69.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.59/69.46 eprover: No such file or directory
% 0.59/69.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.59/69.46 eprover: No such file or directory
% 0.59/69.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.59/69.47 eprover: No such file or directory
% 0.59/69.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.59/69.47 eprover: No such file or directory
% 0.59/69.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.59/69.47 eprover: No such file or directory
% 0.59/69.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.59/69.47 eprover: No such file or directory
% 0.59/69.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.59/69.47 eprover: No such file or directory
% 0.59/69.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.59/69.47 eprover: No such file or directory
% 0.59/69.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.59/69.48 eprover: No such file or directory
% 0.59/69.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.59/69.48 eprover: No such file or directory
% 0.59/69.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.59/69.48 eprover: No such file or directory
% 0.59/69.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.59/69.48 eprover: No such file or directory
% 0.59/69.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.59/69.48 eprover: No such file or directory
% 0.59/69.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.59/69.48 eprover: No such file or directory
% 0.59/69.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.59/69.48 eprover: No such file or directory
% 0.59/69.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.59/69.49 eprover: No such file or directory
% 0.59/69.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.59/69.49 eprover: No such file or directory
% 0.59/69.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.59/69.49 eprover: No such file or directory
% 0.59/69.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.59/69.49 eprover: No such file or directory
% 0.59/69.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.59/69.50 eprover: No such file or directory
% 0.59/69.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.59/69.50 eprover: No such file or directory
% 0.59/69.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.59/69.50 eprover: No such file or directory
% 0.59/69.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.59/69.51 eprover: No such file or directory
% 0.59/69.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.59/69.51 eprover: No such file or directory
%------------------------------------------------------------------------------