TSTP Solution File: SWC388+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC388+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n005.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:26 EDT 2022
% Result : Theorem 1.11s 131.28s
% Output : CNFRefutation 1.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 15
% Syntax : Number of formulae : 106 ( 34 unt; 0 def)
% Number of atoms : 359 ( 79 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 425 ( 172 ~; 181 |; 37 &)
% ( 6 <=>; 29 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-2 aty)
% Number of variables : 107 ( 0 sgn 54 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ segmentP(X4,X3)
| ? [X5] :
( ssItem(X5)
& cons(X5,nil) = X1
& memberP(X2,X5) )
| ( ~ singletonP(X3)
& neq(X4,nil) )
| ( nil = X2
& nil = X1 ) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co1) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
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/sandbox2/benchmark/Axioms/SWC001+0.ax',ax3) ).
fof(ax4,axiom,
! [X1] :
( ssList(X1)
=> ( singletonP(X1)
<=> ? [X2] :
( ssItem(X2)
& cons(X2,nil) = X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax4) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(ax36,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( memberP(app(X2,X3),X1)
<=> ( memberP(X2,X1)
| memberP(X3,X1) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax36) ).
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(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax57,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,nil) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax57) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(ax55,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax55) ).
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(ax54,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( ( segmentP(X1,X2)
& segmentP(X2,X1) )
=> X1 = X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax54) ).
fof(ax39,axiom,
~ singletonP(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax39) ).
fof(c_0_15,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ segmentP(X4,X3)
| ? [X5] :
( ssItem(X5)
& cons(X5,nil) = X1
& memberP(X2,X5) )
| ( ~ singletonP(X3)
& neq(X4,nil) )
| ( nil = X2
& nil = X1 ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_16,plain,
! [X3,X4] :
( ( ~ neq(X3,X4)
| X3 != X4
| ~ ssList(X4)
| ~ ssList(X3) )
& ( X3 = X4
| neq(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)],[ax15])])])])])]) ).
fof(c_0_17,negated_conjecture,
! [X10] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& segmentP(esk4_0,esk3_0)
& ( ~ ssItem(X10)
| cons(X10,nil) != esk1_0
| ~ memberP(esk2_0,X10) )
& ( singletonP(esk3_0)
| ~ neq(esk4_0,nil) )
& ( nil != esk2_0
| nil != esk1_0 ) ),
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_15])])])])])])]) ).
cnf(c_0_18,plain,
( neq(X1,X2)
| X1 = X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_19,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_20,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_21,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,negated_conjecture,
( singletonP(esk3_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
( X1 = nil
| neq(X1,nil)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,negated_conjecture,
segmentP(esk4_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_27,negated_conjecture,
( singletonP(esk1_0)
| ~ neq(esk4_0,nil) ),
inference(rw,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,negated_conjecture,
( esk4_0 = nil
| neq(esk4_0,nil) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
fof(c_0_29,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])])])])])])]) ).
fof(c_0_30,plain,
! [X3,X5] :
( ( ssItem(esk5_1(X3))
| ~ singletonP(X3)
| ~ ssList(X3) )
& ( cons(esk5_1(X3),nil) = X3
| ~ singletonP(X3)
| ~ ssList(X3) )
& ( ~ ssItem(X5)
| cons(X5,nil) != X3
| singletonP(X3)
| ~ ssList(X3) ) ),
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)],[ax4])])])])])])]) ).
cnf(c_0_31,negated_conjecture,
segmentP(esk4_0,esk1_0),
inference(rw,[status(thm)],[c_0_26,c_0_23]) ).
cnf(c_0_32,negated_conjecture,
( esk4_0 = nil
| singletonP(esk1_0) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,plain,
( memberP(X1,X2)
| ~ ssList(X1)
| ~ ssItem(X2)
| app(X3,cons(X2,X4)) != X1
| ~ ssList(X4)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_34,plain,
( cons(esk5_1(X1),nil) = X1
| ~ ssList(X1)
| ~ singletonP(X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_35,negated_conjecture,
( segmentP(nil,esk1_0)
| singletonP(esk1_0) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_37,plain,
( memberP(app(X1,cons(X2,X3)),X2)
| ~ ssList(app(X1,cons(X2,X3)))
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(er,[status(thm)],[c_0_33]) ).
cnf(c_0_38,negated_conjecture,
( cons(esk5_1(esk1_0),nil) = esk1_0
| segmentP(nil,esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]) ).
cnf(c_0_39,plain,
( ssItem(esk5_1(X1))
| ~ ssList(X1)
| ~ singletonP(X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
fof(c_0_40,plain,
! [X2] :
( ~ ssList(X2)
| app(nil,X2) = X2 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])]) ).
cnf(c_0_41,negated_conjecture,
( segmentP(nil,esk1_0)
| memberP(app(X1,esk1_0),esk5_1(esk1_0))
| ~ ssList(app(X1,esk1_0))
| ~ ssList(X1)
| ~ ssItem(esk5_1(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_19])]) ).
cnf(c_0_42,negated_conjecture,
( segmentP(nil,esk1_0)
| ssItem(esk5_1(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_35]),c_0_36])]) ).
cnf(c_0_43,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
fof(c_0_44,plain,
! [X4,X5,X6] :
( ( ~ memberP(app(X5,X6),X4)
| memberP(X5,X4)
| memberP(X6,X4)
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssItem(X4) )
& ( ~ memberP(X5,X4)
| memberP(app(X5,X6),X4)
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssItem(X4) )
& ( ~ memberP(X6,X4)
| memberP(app(X5,X6),X4)
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssItem(X4) ) ),
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)],[ax36])])])])])]) ).
cnf(c_0_45,negated_conjecture,
( segmentP(nil,esk1_0)
| memberP(app(X1,esk1_0),esk5_1(esk1_0))
| ~ ssList(app(X1,esk1_0))
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_46,negated_conjecture,
app(nil,esk1_0) = esk1_0,
inference(spm,[status(thm)],[c_0_43,c_0_36]) ).
cnf(c_0_47,plain,
( memberP(app(X2,X3),X1)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ memberP(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_48,negated_conjecture,
( segmentP(nil,esk1_0)
| memberP(esk1_0,esk5_1(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_36]),c_0_19])]) ).
fof(c_0_49,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_50,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])])])])]) ).
fof(c_0_51,plain,
! [X2] :
( ~ ssList(X2)
| segmentP(X2,nil) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax57])]) ).
cnf(c_0_52,negated_conjecture,
( segmentP(nil,esk1_0)
| memberP(app(X1,esk1_0),esk5_1(esk1_0))
| ~ ssList(X1)
| ~ ssItem(esk5_1(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_36])]) ).
cnf(c_0_53,plain,
( ssList(esk12_2(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ segmentP(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_54,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_55,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_56,negated_conjecture,
( segmentP(nil,esk1_0)
| memberP(app(X1,esk1_0),esk5_1(esk1_0))
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_52,c_0_42]) ).
cnf(c_0_57,negated_conjecture,
ssList(esk12_2(esk4_0,esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_31]),c_0_36]),c_0_25])]) ).
cnf(c_0_58,negated_conjecture,
( ssList(app(X1,esk1_0))
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_54,c_0_36]) ).
fof(c_0_59,plain,
! [X2] :
( ~ ssList(X2)
| app(X2,nil) = X2 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])]) ).
cnf(c_0_60,plain,
segmentP(nil,nil),
inference(spm,[status(thm)],[c_0_55,c_0_19]) ).
cnf(c_0_61,negated_conjecture,
( ~ memberP(esk2_0,X1)
| cons(X1,nil) != esk1_0
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_62,plain,
( memberP(app(X2,X3),X1)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ memberP(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_63,negated_conjecture,
( segmentP(nil,esk1_0)
| memberP(app(esk12_2(esk4_0,esk1_0),esk1_0),esk5_1(esk1_0)) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_64,negated_conjecture,
ssList(app(esk12_2(esk4_0,esk1_0),esk1_0)),
inference(spm,[status(thm)],[c_0_58,c_0_57]) ).
fof(c_0_65,plain,
! [X2] :
( ~ ssList(X2)
| segmentP(X2,X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])]) ).
cnf(c_0_66,plain,
( app(app(esk12_2(X1,X2),X2),esk13_2(X1,X2)) = X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ segmentP(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_67,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_68,plain,
ssList(esk12_2(nil,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_60]),c_0_19])]) ).
cnf(c_0_69,negated_conjecture,
( cons(X1,nil) != esk1_0
| ~ memberP(esk4_0,X1)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[c_0_61,c_0_21]) ).
cnf(c_0_70,negated_conjecture,
( segmentP(nil,esk1_0)
| memberP(app(app(esk12_2(esk4_0,esk1_0),esk1_0),X1),esk5_1(esk1_0))
| ~ ssList(X1)
| ~ ssItem(esk5_1(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_64])]) ).
cnf(c_0_71,plain,
( ssList(esk13_2(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ segmentP(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_72,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_65]) ).
fof(c_0_73,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])])])])])]) ).
cnf(c_0_74,plain,
app(app(esk12_2(nil,nil),nil),esk13_2(nil,nil)) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_60]),c_0_19])]) ).
cnf(c_0_75,plain,
app(esk12_2(nil,nil),nil) = esk12_2(nil,nil),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
fof(c_0_76,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssList(X4)
| ~ segmentP(X3,X4)
| ~ segmentP(X4,X3)
| 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)],[ax54])])])])]) ).
cnf(c_0_77,negated_conjecture,
( segmentP(nil,esk1_0)
| ~ memberP(esk4_0,esk5_1(esk1_0))
| ~ ssItem(esk5_1(esk1_0)) ),
inference(spm,[status(thm)],[c_0_69,c_0_38]) ).
cnf(c_0_78,negated_conjecture,
( segmentP(nil,esk1_0)
| memberP(app(app(esk12_2(esk4_0,esk1_0),esk1_0),X1),esk5_1(esk1_0))
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_70,c_0_42]) ).
cnf(c_0_79,negated_conjecture,
ssList(esk13_2(esk4_0,esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_31]),c_0_36]),c_0_25])]) ).
cnf(c_0_80,negated_conjecture,
app(app(esk12_2(esk4_0,esk1_0),esk1_0),esk13_2(esk4_0,esk1_0)) = esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_31]),c_0_36]),c_0_25])]) ).
cnf(c_0_81,negated_conjecture,
segmentP(esk1_0,esk1_0),
inference(spm,[status(thm)],[c_0_72,c_0_36]) ).
cnf(c_0_82,plain,
( nil = X1
| ~ ssList(X1)
| ~ ssList(X2)
| nil != app(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_73]) ).
cnf(c_0_83,plain,
app(esk12_2(nil,nil),esk13_2(nil,nil)) = nil,
inference(rw,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_84,plain,
ssList(esk13_2(nil,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_60]),c_0_19])]) ).
cnf(c_0_85,plain,
( X1 = X2
| ~ segmentP(X2,X1)
| ~ segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_76]) ).
cnf(c_0_86,negated_conjecture,
segmentP(esk1_0,nil),
inference(spm,[status(thm)],[c_0_55,c_0_36]) ).
cnf(c_0_87,negated_conjecture,
( segmentP(nil,esk1_0)
| ~ memberP(esk4_0,esk5_1(esk1_0)) ),
inference(spm,[status(thm)],[c_0_77,c_0_42]) ).
cnf(c_0_88,negated_conjecture,
( segmentP(nil,esk1_0)
| memberP(esk4_0,esk5_1(esk1_0)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_80]) ).
cnf(c_0_89,negated_conjecture,
ssList(esk13_2(esk1_0,esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_81]),c_0_36])]) ).
cnf(c_0_90,plain,
esk12_2(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_84]),c_0_68])]) ).
cnf(c_0_91,negated_conjecture,
( nil != esk1_0
| nil != esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_92,negated_conjecture,
( esk1_0 = nil
| ~ segmentP(nil,esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_86]),c_0_36]),c_0_19])]) ).
cnf(c_0_93,negated_conjecture,
segmentP(nil,esk1_0),
inference(spm,[status(thm)],[c_0_87,c_0_88]) ).
fof(c_0_94,plain,
~ singletonP(nil),
inference(fof_simplification,[status(thm)],[ax39]) ).
cnf(c_0_95,negated_conjecture,
( X1 = esk13_2(esk1_0,esk1_0)
| neq(X1,esk13_2(esk1_0,esk1_0))
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_89]) ).
cnf(c_0_96,plain,
( nil = X2
| ~ ssList(X1)
| ~ ssList(X2)
| nil != app(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_73]) ).
cnf(c_0_97,plain,
app(nil,esk13_2(nil,nil)) = nil,
inference(rw,[status(thm)],[c_0_83,c_0_90]) ).
cnf(c_0_98,negated_conjecture,
( esk1_0 != nil
| esk4_0 != nil ),
inference(rw,[status(thm)],[c_0_91,c_0_21]) ).
cnf(c_0_99,negated_conjecture,
esk1_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_92,c_0_93])]) ).
cnf(c_0_100,plain,
~ singletonP(nil),
inference(split_conjunct,[status(thm)],[c_0_94]) ).
cnf(c_0_101,negated_conjecture,
( esk13_2(esk1_0,esk1_0) = esk4_0
| neq(esk4_0,esk13_2(esk1_0,esk1_0)) ),
inference(spm,[status(thm)],[c_0_95,c_0_25]) ).
cnf(c_0_102,plain,
esk13_2(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_97]),c_0_84]),c_0_19])]) ).
cnf(c_0_103,negated_conjecture,
esk4_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_98,c_0_99])]) ).
cnf(c_0_104,negated_conjecture,
~ neq(esk4_0,nil),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_99]),c_0_100]) ).
cnf(c_0_105,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_101,c_0_99]),c_0_99]),c_0_102]),c_0_99]),c_0_99]),c_0_102]),c_0_103]),c_0_104]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC388+1 : TPTP v8.1.0. Released v2.4.0.
% 0.13/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n005.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jun 12 06:51:24 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.40/23.41 eprover: eprover: CPU time limit exceeded, terminatingCPU time limit exceeded, terminating
% 0.40/23.41
% 0.40/23.42 eprover: CPU time limit exceeded, terminating
% 0.40/23.43 eprover: CPU time limit exceeded, terminating
% 0.53/46.43 eprover: CPU time limit exceeded, terminating
% 0.53/46.43 eprover: CPU time limit exceeded, terminating
% 0.53/46.44 eprover: CPU time limit exceeded, terminating
% 0.53/46.45 eprover: CPU time limit exceeded, terminating
% 0.69/69.44 eprover: CPU time limit exceeded, terminating
% 0.69/69.45 eprover: CPU time limit exceeded, terminating
% 0.69/69.47 eprover: CPU time limit exceeded, terminating
% 0.69/69.47 eprover: CPU time limit exceeded, terminating
% 0.85/92.45 eprover: CPU time limit exceeded, terminating
% 0.85/92.48 eprover: CPU time limit exceeded, terminating
% 0.85/92.49 eprover: CPU time limit exceeded, terminating
% 0.85/92.50 eprover: CPU time limit exceeded, terminating
% 1.01/115.49 eprover: CPU time limit exceeded, terminating
% 1.01/115.49 eprover: CPU time limit exceeded, terminating
% 1.01/115.50 eprover: CPU time limit exceeded, terminating
% 1.01/115.51 eprover: CPU time limit exceeded, terminating
% 1.11/131.28 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 1.11/131.28
% 1.11/131.28 # Failure: Resource limit exceeded (time)
% 1.11/131.28 # OLD status Res
% 1.11/131.28 # Preprocessing time : 0.025 s
% 1.11/131.28 # Running protocol protocol_eprover_773c90a94152ea2e8c9d3df9c4b1eb6152c40c03 for 23 seconds:
% 1.11/131.28
% 1.11/131.28 # Failure: Resource limit exceeded (time)
% 1.11/131.28 # OLD status Res
% 1.11/131.28 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,,100,1.0)
% 1.11/131.28 # Preprocessing time : 0.021 s
% 1.11/131.28 # Running protocol protocol_eprover_75515770aeb32f68e33e9fbd9dff93f5a2e34f2e for 23 seconds:
% 1.11/131.28
% 1.11/131.28 # Failure: Resource limit exceeded (time)
% 1.11/131.28 # OLD status Res
% 1.11/131.28 # Preprocessing time : 0.015 s
% 1.11/131.28 # Running protocol protocol_eprover_6c565d2524e660970ec2a72c26d577f665a55420 for 23 seconds:
% 1.11/131.28
% 1.11/131.28 # Failure: Resource limit exceeded (time)
% 1.11/131.28 # OLD status Res
% 1.11/131.28 # Preprocessing time : 0.015 s
% 1.11/131.28 # Running protocol protocol_eprover_750456fc664a9e0b97096ad0f5110b1ead7d782b for 23 seconds:
% 1.11/131.28
% 1.11/131.28 # Failure: Resource limit exceeded (time)
% 1.11/131.28 # OLD status Res
% 1.11/131.28 # Preprocessing time : 0.016 s
% 1.11/131.28 # Running protocol protocol_eprover_a9abcacdf80c460fdc9fe242616d68da2308faf5 for 23 seconds:
% 1.11/131.28 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,02,500,1.0)
% 1.11/131.28 # Preprocessing time : 0.020 s
% 1.11/131.28
% 1.11/131.28 # Proof found!
% 1.11/131.28 # SZS status Theorem
% 1.11/131.28 # SZS output start CNFRefutation
% See solution above
% 1.11/131.28 # Proof object total steps : 106
% 1.11/131.28 # Proof object clause steps : 76
% 1.11/131.28 # Proof object formula steps : 30
% 1.11/131.28 # Proof object conjectures : 49
% 1.11/131.28 # Proof object clause conjectures : 46
% 1.11/131.28 # Proof object formula conjectures : 3
% 1.11/131.28 # Proof object initial clauses used : 27
% 1.11/131.28 # Proof object initial formulas used : 15
% 1.11/131.28 # Proof object generating inferences : 38
% 1.11/131.28 # Proof object simplifying inferences : 61
% 1.11/131.28 # Training examples: 0 positive, 0 negative
% 1.11/131.28 # Parsed axioms : 96
% 1.11/131.28 # Removed by relevancy pruning/SinE : 64
% 1.11/131.28 # Initial clauses : 63
% 1.11/131.28 # Removed in clause preprocessing : 0
% 1.11/131.28 # Initial clauses in saturation : 63
% 1.11/131.28 # Processed clauses : 16190
% 1.11/131.28 # ...of these trivial : 236
% 1.11/131.28 # ...subsumed : 7131
% 1.11/131.28 # ...remaining for further processing : 8822
% 1.11/131.28 # Other redundant clauses eliminated : 3
% 1.11/131.28 # Clauses deleted for lack of memory : 1614924
% 1.11/131.28 # Backward-subsumed : 1040
% 1.11/131.28 # Backward-rewritten : 6810
% 1.11/131.28 # Generated clauses : 1770299
% 1.11/131.28 # ...of the previous two non-trivial : 1769541
% 1.11/131.28 # Contextual simplify-reflections : 0
% 1.11/131.28 # Paramodulations : 1769699
% 1.11/131.28 # Factorizations : 0
% 1.11/131.28 # Equation resolutions : 428
% 1.11/131.28 # Current number of processed clauses : 797
% 1.11/131.28 # Positive orientable unit clauses : 142
% 1.11/131.28 # Positive unorientable unit clauses: 0
% 1.11/131.28 # Negative unit clauses : 11
% 1.11/131.28 # Non-unit-clauses : 644
% 1.11/131.28 # Current number of unprocessed clauses: 5090
% 1.11/131.28 # ...number of literals in the above : 10806
% 1.11/131.28 # Current number of archived formulas : 0
% 1.11/131.28 # Current number of archived clauses : 8022
% 1.11/131.28 # Clause-clause subsumption calls (NU) : 1041539
% 1.11/131.28 # Rec. Clause-clause subsumption calls : 860956
% 1.11/131.28 # Non-unit clause-clause subsumptions : 8001
% 1.11/131.28 # Unit Clause-clause subsumption calls : 97808
% 1.11/131.28 # Rewrite failures with RHS unbound : 0
% 1.11/131.28 # BW rewrite match attempts : 1431
% 1.11/131.28 # BW rewrite match successes : 231
% 1.11/131.28 # Condensation attempts : 0
% 1.11/131.28 # Condensation successes : 0
% 1.11/131.28 # Termbank termtop insertions : 39585218
% 1.11/131.28
% 1.11/131.28 # -------------------------------------------------
% 1.11/131.28 # User time : 15.360 s
% 1.11/131.28 # System time : 0.141 s
% 1.11/131.28 # Total time : 15.501 s
% 1.11/131.28 # Maximum resident set size: 142112 pages
% 1.11/138.50 eprover: CPU time limit exceeded, terminating
% 1.11/138.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 1.11/138.51 eprover: No such file or directory
% 1.11/138.52 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 1.11/138.52 eprover: No such file or directory
% 1.11/138.52 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 1.11/138.52 eprover: No such file or directory
% 1.11/138.52 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 1.11/138.52 eprover: No such file or directory
% 1.11/138.53 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 1.11/138.53 eprover: No such file or directory
% 1.11/138.53 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 1.11/138.53 eprover: No such file or directory
% 1.11/138.53 eprover: CPU time limit exceeded, terminating
% 1.11/138.54 eprover: CPU time limit exceeded, terminating
% 1.11/138.55 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.11/138.55 eprover: No such file or directory
% 1.11/138.55 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.11/138.55 eprover: No such file or directory
% 1.11/138.55 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 1.11/138.55 eprover: No such file or directory
% 1.11/138.56 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.11/138.56 eprover: No such file or directory
% 1.11/138.56 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 1.11/138.56 eprover: No such file or directory
% 1.11/138.56 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.11/138.56 eprover: No such file or directory
% 1.11/138.56 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.11/138.56 eprover: No such file or directory
% 1.11/138.56 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 1.11/138.56 eprover: No such file or directory
% 1.11/138.57 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.11/138.57 eprover: No such file or directory
% 1.11/138.57 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 1.11/138.57 eprover: No such file or directory
% 1.11/138.58 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 1.11/138.58 eprover: No such file or directory
% 1.11/138.58 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 1.11/138.58 eprover: No such file or directory
%------------------------------------------------------------------------------