TSTP Solution File: SWC092+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC092+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n032.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:38 EDT 2022
% Result : Theorem 0.15s 1.34s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 15
% Syntax : Number of formulae : 94 ( 18 unt; 0 def)
% Number of atoms : 364 ( 132 equ)
% Maximal formula atoms : 23 ( 3 avg)
% Number of connectives : 466 ( 196 ~; 185 |; 43 &)
% ( 4 <=>; 38 =>; 0 <=; 0 <~>)
% Maximal formula depth : 29 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 134 ( 0 sgn 67 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& segmentP(X2,X5)
& segmentP(X1,X5) )
| ! [X6] :
( ssList(X6)
=> ( app(X3,X6) != X4
| ~ strictorderedP(X3)
| ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(cons(X7,nil),X8) = X6
& ? [X9] :
( ssItem(X9)
& ? [X10] :
( ssList(X10)
& app(X10,cons(X9,nil)) = X3
& lt(X9,X7) ) ) ) ) ) )
| ( nil != X4
& nil = 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(ax80,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( app(X2,X3) = app(X2,X1)
=> X3 = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax80) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax79,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( app(X3,X2) = app(X1,X2)
=> X3 = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax79) ).
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(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax55,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax55) ).
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(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(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax28) ).
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(c_0_15,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& neq(X5,nil)
& segmentP(X2,X5)
& segmentP(X1,X5) )
| ! [X6] :
( ssList(X6)
=> ( app(X3,X6) != X4
| ~ strictorderedP(X3)
| ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(cons(X7,nil),X8) = X6
& ? [X9] :
( ssItem(X9)
& ? [X10] :
( ssList(X10)
& app(X10,cons(X9,nil)) = X3
& lt(X9,X7) ) ) ) ) ) )
| ( nil != X4
& nil = X3 ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_16,negated_conjecture,
! [X15,X17,X18,X19,X20] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& neq(esk2_0,nil)
& ( ~ ssList(X15)
| ~ neq(X15,nil)
| ~ segmentP(esk2_0,X15)
| ~ segmentP(esk1_0,X15) )
& ssList(esk5_0)
& app(esk3_0,esk5_0) = esk4_0
& strictorderedP(esk3_0)
& ( ~ ssItem(X17)
| ~ ssList(X18)
| app(cons(X17,nil),X18) != esk5_0
| ~ ssItem(X19)
| ~ ssList(X20)
| app(X20,cons(X19,nil)) != esk3_0
| ~ lt(X19,X17) )
& ( nil = esk4_0
| nil != esk3_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])])])])])])]) ).
fof(c_0_17,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_18,negated_conjecture,
app(esk3_0,esk5_0) = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_19,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_20,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])])])])]) ).
fof(c_0_21,plain,
! [X2] :
( ~ ssList(X2)
| app(X2,nil) = X2 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])]) ).
cnf(c_0_22,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,negated_conjecture,
app(esk1_0,esk5_0) = esk4_0,
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,negated_conjecture,
ssList(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_25,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_26,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_27,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_28,plain,
( X1 = X2
| app(X3,X1) != app(X3,X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_29,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_30,negated_conjecture,
( app(esk4_0,X1) = app(esk1_0,app(esk5_0,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_25])]) ).
cnf(c_0_31,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_33,negated_conjecture,
( X1 = esk5_0
| app(esk1_0,X1) != esk4_0
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_23]),c_0_25]),c_0_24])]) ).
cnf(c_0_34,negated_conjecture,
app(esk1_0,app(esk5_0,nil)) = esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_32])]) ).
cnf(c_0_35,negated_conjecture,
( nil = esk5_0
| esk4_0 != esk1_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_29]),c_0_32]),c_0_25])]) ).
fof(c_0_36,plain,
! [X4,X5,X6] :
( ~ ssList(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| app(X6,X5) != app(X4,X5)
| 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)],[ax79])])])])]) ).
fof(c_0_37,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_38,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_39,plain,
( X1 = nil
| app(X2,X1) != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_32])]) ).
cnf(c_0_40,negated_conjecture,
( app(esk1_0,app(esk5_0,esk5_0)) = esk4_0
| esk4_0 != esk1_0 ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_41,negated_conjecture,
( ~ segmentP(esk1_0,X1)
| ~ segmentP(esk2_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_42,negated_conjecture,
neq(esk2_0,nil),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_43,plain,
( X1 = X2
| app(X1,X3) != app(X2,X3)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_44,plain,
( nil = app(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| nil != X1
| nil != X2 ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_45,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_46,negated_conjecture,
( app(esk5_0,esk5_0) = nil
| esk4_0 != esk1_0
| ~ ssList(app(esk5_0,esk5_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_25])]) ).
cnf(c_0_47,negated_conjecture,
( ~ segmentP(esk1_0,X1)
| ~ segmentP(esk4_0,X1)
| ~ ssList(X1)
| ~ neq(X1,nil) ),
inference(rw,[status(thm)],[c_0_41,c_0_27]) ).
cnf(c_0_48,negated_conjecture,
neq(esk4_0,nil),
inference(rw,[status(thm)],[c_0_42,c_0_27]) ).
fof(c_0_49,plain,
! [X2] :
( ~ ssList(X2)
| segmentP(X2,X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])]) ).
fof(c_0_50,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_51,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_52,plain,
! [X2] :
( ~ ssList(X2)
| segmentP(X2,nil) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax57])]) ).
cnf(c_0_53,plain,
( nil = X1
| ~ ssList(X1)
| ~ ssList(X2)
| nil != app(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_54,plain,
( X1 = X2
| app(X1,nil) != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_29]),c_0_32])]) ).
cnf(c_0_55,negated_conjecture,
( app(esk1_0,nil) = esk4_0
| nil != esk5_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_44]),c_0_32]),c_0_24])]) ).
cnf(c_0_56,negated_conjecture,
( ssList(app(esk1_0,app(esk5_0,X1)))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_30]),c_0_31])]) ).
cnf(c_0_57,negated_conjecture,
( app(esk5_0,esk5_0) = nil
| esk4_0 != esk1_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_45]),c_0_24])]) ).
cnf(c_0_58,negated_conjecture,
( ~ segmentP(esk1_0,esk4_0)
| ~ segmentP(esk4_0,esk4_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_31])]) ).
cnf(c_0_59,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_60,plain,
( segmentP(X1,X2)
| ~ segmentP(X3,X2)
| ~ segmentP(X1,X3)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_61,plain,
( segmentP(nil,X1)
| ~ ssList(X1)
| nil != X1 ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_62,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_63,plain,
( nil = X2
| ~ ssList(X1)
| ~ ssList(X2)
| nil != app(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_64,negated_conjecture,
( nil = esk4_0
| app(esk1_0,app(esk5_0,X1)) != nil
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_30]),c_0_31])]) ).
cnf(c_0_65,negated_conjecture,
( esk1_0 = X1
| nil != esk5_0
| esk4_0 != X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_25])]) ).
cnf(c_0_66,negated_conjecture,
( ssList(app(esk1_0,nil))
| esk4_0 != esk1_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_24])]) ).
cnf(c_0_67,negated_conjecture,
( esk4_0 = esk1_0
| nil != esk5_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_55]),c_0_25])]) ).
cnf(c_0_68,negated_conjecture,
~ segmentP(esk1_0,esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_31])]) ).
cnf(c_0_69,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_60,c_0_61]),c_0_32])]),c_0_62]) ).
cnf(c_0_70,plain,
( nil = X1
| app(X2,app(X3,X1)) != nil
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_22]),c_0_45]) ).
cnf(c_0_71,negated_conjecture,
( nil = esk4_0
| app(esk1_0,nil) != nil
| nil != esk5_0
| nil != X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_44]),c_0_24])]) ).
cnf(c_0_72,negated_conjecture,
( app(esk1_0,nil) = esk1_0
| nil != esk5_0 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_67]),c_0_55]) ).
cnf(c_0_73,negated_conjecture,
nil != esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_31]),c_0_25])]) ).
fof(c_0_74,plain,
! [X5,X6,X9,X10] :
( ( ssList(esk15_2(X5,X6))
| ~ segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) )
& ( ssList(esk16_2(X5,X6))
| ~ segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) )
& ( app(app(esk15_2(X5,X6),X6),esk16_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_75,plain,
! [X2] :
( ~ ssList(X2)
| app(nil,X2) = X2 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])]) ).
cnf(c_0_76,negated_conjecture,
( nil = esk5_0
| app(X1,esk4_0) != nil
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_23]),c_0_24]),c_0_25])]) ).
cnf(c_0_77,negated_conjecture,
( nil != esk1_0
| nil != esk5_0
| nil != X1
| ~ ssList(X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_73]) ).
fof(c_0_78,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])])])])])]) ).
cnf(c_0_79,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_74]) ).
cnf(c_0_80,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_75]) ).
cnf(c_0_81,negated_conjecture,
( nil = esk5_0
| app(esk1_0,app(esk5_0,esk4_0)) != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_30]),c_0_31])]) ).
cnf(c_0_82,negated_conjecture,
( nil != esk1_0
| nil != esk5_0 ),
inference(spm,[status(thm)],[c_0_77,c_0_24]) ).
cnf(c_0_83,negated_conjecture,
( nil = esk4_0
| nil != esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_84,plain,
( neq(X1,X2)
| X1 = X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_78]) ).
cnf(c_0_85,plain,
( segmentP(X1,X2)
| app(X2,X3) != X1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_32])]) ).
cnf(c_0_86,negated_conjecture,
( app(esk5_0,esk4_0) != nil
| nil != esk1_0
| ~ ssList(app(esk5_0,esk4_0)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_44]),c_0_25])]),c_0_82]) ).
cnf(c_0_87,negated_conjecture,
( nil = esk5_0
| nil != esk4_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_23]),c_0_24]),c_0_25])]) ).
cnf(c_0_88,negated_conjecture,
( nil = esk4_0
| nil != esk1_0 ),
inference(rw,[status(thm)],[c_0_83,c_0_19]) ).
cnf(c_0_89,negated_conjecture,
( X1 = nil
| ~ segmentP(esk1_0,X1)
| ~ segmentP(esk4_0,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_84]),c_0_32])]) ).
cnf(c_0_90,negated_conjecture,
( segmentP(X1,esk1_0)
| esk4_0 != X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_23]),c_0_24]),c_0_25])]) ).
cnf(c_0_91,negated_conjecture,
nil != esk1_0,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_44]),c_0_32]),c_0_31]),c_0_24])]),c_0_87]),c_0_88]) ).
cnf(c_0_92,negated_conjecture,
~ segmentP(esk1_0,esk1_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_90]),c_0_25]),c_0_31])]),c_0_91]) ).
cnf(c_0_93,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_59]),c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : SWC092+1 : TPTP v8.1.0. Released v2.4.0.
% 0.00/0.08 % Command : run_ET %s %d
% 0.07/0.27 % Computer : n032.cluster.edu
% 0.07/0.27 % Model : x86_64 x86_64
% 0.07/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.27 % Memory : 8042.1875MB
% 0.07/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.27 % CPULimit : 300
% 0.07/0.27 % WCLimit : 600
% 0.07/0.27 % DateTime : Sun Jun 12 21:20:11 EDT 2022
% 0.07/0.27 % CPUTime :
% 0.15/1.34 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.15/1.34 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.15/1.34 # Preprocessing time : 0.013 s
% 0.15/1.34
% 0.15/1.34 # Proof found!
% 0.15/1.34 # SZS status Theorem
% 0.15/1.34 # SZS output start CNFRefutation
% See solution above
% 0.15/1.34 # Proof object total steps : 94
% 0.15/1.34 # Proof object clause steps : 64
% 0.15/1.34 # Proof object formula steps : 30
% 0.15/1.34 # Proof object conjectures : 46
% 0.15/1.34 # Proof object clause conjectures : 43
% 0.15/1.34 # Proof object formula conjectures : 3
% 0.15/1.34 # Proof object initial clauses used : 25
% 0.15/1.34 # Proof object initial formulas used : 15
% 0.15/1.34 # Proof object generating inferences : 34
% 0.15/1.34 # Proof object simplifying inferences : 84
% 0.15/1.34 # Training examples: 0 positive, 0 negative
% 0.15/1.34 # Parsed axioms : 96
% 0.15/1.34 # Removed by relevancy pruning/SinE : 47
% 0.15/1.34 # Initial clauses : 89
% 0.15/1.34 # Removed in clause preprocessing : 1
% 0.15/1.34 # Initial clauses in saturation : 88
% 0.15/1.34 # Processed clauses : 4134
% 0.15/1.34 # ...of these trivial : 90
% 0.15/1.34 # ...subsumed : 3315
% 0.15/1.34 # ...remaining for further processing : 729
% 0.15/1.34 # Other redundant clauses eliminated : 29
% 0.15/1.34 # Clauses deleted for lack of memory : 0
% 0.15/1.34 # Backward-subsumed : 41
% 0.15/1.34 # Backward-rewritten : 20
% 0.15/1.34 # Generated clauses : 16179
% 0.15/1.34 # ...of the previous two non-trivial : 14636
% 0.15/1.34 # Contextual simplify-reflections : 2653
% 0.15/1.34 # Paramodulations : 16123
% 0.15/1.34 # Factorizations : 0
% 0.15/1.34 # Equation resolutions : 51
% 0.15/1.34 # Current number of processed clauses : 660
% 0.15/1.34 # Positive orientable unit clauses : 23
% 0.15/1.34 # Positive unorientable unit clauses: 0
% 0.15/1.34 # Negative unit clauses : 13
% 0.15/1.34 # Non-unit-clauses : 624
% 0.15/1.34 # Current number of unprocessed clauses: 10348
% 0.15/1.34 # ...number of literals in the above : 52823
% 0.15/1.34 # Current number of archived formulas : 0
% 0.15/1.34 # Current number of archived clauses : 66
% 0.15/1.34 # Clause-clause subsumption calls (NU) : 193601
% 0.15/1.34 # Rec. Clause-clause subsumption calls : 168947
% 0.15/1.34 # Non-unit clause-clause subsumptions : 5196
% 0.15/1.34 # Unit Clause-clause subsumption calls : 1271
% 0.15/1.34 # Rewrite failures with RHS unbound : 0
% 0.15/1.34 # BW rewrite match attempts : 6
% 0.15/1.34 # BW rewrite match successes : 3
% 0.15/1.34 # Condensation attempts : 0
% 0.15/1.34 # Condensation successes : 0
% 0.15/1.34 # Termbank termtop insertions : 259053
% 0.15/1.34
% 0.15/1.34 # -------------------------------------------------
% 0.15/1.34 # User time : 0.461 s
% 0.15/1.34 # System time : 0.006 s
% 0.15/1.34 # Total time : 0.467 s
% 0.15/1.34 # Maximum resident set size: 12732 pages
% 0.15/23.33 eprover: CPU time limit exceeded, terminating
% 0.15/23.35 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.15/23.35 eprover: No such file or directory
% 0.15/23.35 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.15/23.35 eprover: No such file or directory
% 0.15/23.36 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.15/23.36 eprover: No such file or directory
% 0.15/23.36 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.15/23.36 eprover: No such file or directory
% 0.15/23.37 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.15/23.37 eprover: No such file or directory
% 0.15/23.37 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.15/23.37 eprover: No such file or directory
% 0.15/23.38 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.15/23.38 eprover: No such file or directory
% 0.15/23.38 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.15/23.38 eprover: No such file or directory
% 0.15/23.39 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.15/23.39 eprover: No such file or directory
% 0.15/23.39 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.15/23.39 eprover: No such file or directory
% 0.15/23.40 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.15/23.40 eprover: No such file or directory
%------------------------------------------------------------------------------