TSTP Solution File: SWC342+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC342+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n025.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:09 EDT 2022
% Result : Theorem 0.52s 49.70s
% Output : CNFRefutation 0.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 18
% Syntax : Number of formulae : 96 ( 18 unt; 0 def)
% Number of atoms : 377 ( 95 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 482 ( 201 ~; 202 |; 33 &)
% ( 5 <=>; 41 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-2 aty)
% Number of variables : 139 ( 0 sgn 72 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
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(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ! [X5] :
( ssItem(X5)
=> ( cons(X5,nil) != X3
| ~ memberP(X4,X5) ) )
& ( nil != X4
| nil != X3 ) )
| ( segmentP(X2,X1)
& totalorderedP(X1) ) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',co1) ).
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(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(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(ax38,axiom,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax38) ).
fof(ax21,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax21) ).
fof(ax66,axiom,
totalorderedP(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax66) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(ax56,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( segmentP(X1,X2)
=> segmentP(app(app(X3,X1),X4),X2) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax56) ).
fof(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(ax65,axiom,
! [X1] :
( ssItem(X1)
=> totalorderedP(cons(X1,nil)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax65) ).
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(c_0_18,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_19,plain,
! [X2] :
( ~ ssList(X2)
| app(nil,X2) = X2 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])]) ).
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_18]) ).
cnf(c_0_21,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_22,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
fof(c_0_23,plain,
! [X2] :
( ~ ssList(X2)
| app(X2,nil) = X2 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])]) ).
fof(c_0_24,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( ! [X5] :
( ssItem(X5)
=> ( cons(X5,nil) != X3
| ~ memberP(X4,X5) ) )
& ( nil != X4
| nil != X3 ) )
| ( segmentP(X2,X1)
& totalorderedP(X1) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_25,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_26,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_20,c_0_21]),c_0_22])]) ).
cnf(c_0_27,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_28,negated_conjecture,
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_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) )
& ( ~ segmentP(esk2_0,esk1_0)
| ~ totalorderedP(esk1_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_24])])])])])])]) ).
fof(c_0_29,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_30,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_31,plain,
! [X2] :
( ~ ssList(X2)
| segmentP(X2,nil) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax57])]) ).
fof(c_0_32,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_33,plain,
( nil = app(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| nil != X1
| nil != X2 ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_34,plain,
( app(nil,X1) = app(X1,nil)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_26,c_0_27]),c_0_22])]) ).
fof(c_0_35,plain,
! [X2] :
( ~ ssItem(X2)
| ~ memberP(nil,X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ax38])])]) ).
cnf(c_0_36,negated_conjecture,
( ~ totalorderedP(esk1_0)
| ~ segmentP(esk2_0,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_37,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_38,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_39,plain,
( segmentP(X1,X2)
| ~ segmentP(X3,X2)
| ~ segmentP(X1,X3)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_40,plain,
( segmentP(nil,X1)
| ~ ssList(X1)
| nil != X1 ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_41,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_42,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_43,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_44,plain,
( memberP(app(X2,X3),X1)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ memberP(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_45,plain,
( app(nil,X1) = nil
| nil != X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_33,c_0_34]),c_0_22])]) ).
cnf(c_0_46,plain,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
fof(c_0_47,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssItem(X4)
| nil != cons(X4,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)],[ax21])])])])]) ).
cnf(c_0_48,negated_conjecture,
( ~ totalorderedP(esk3_0)
| ~ segmentP(esk4_0,esk3_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37]),c_0_37]),c_0_38]) ).
cnf(c_0_49,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_39,c_0_40]),c_0_22])]),c_0_41]) ).
cnf(c_0_50,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_42,c_0_37]) ).
cnf(c_0_51,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_43,c_0_38]) ).
cnf(c_0_52,plain,
( nil != X1
| ~ memberP(X1,X2)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_44,c_0_45]),c_0_22])]),c_0_46]) ).
cnf(c_0_53,negated_conjecture,
( memberP(esk4_0,esk5_0)
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_54,negated_conjecture,
( ssItem(esk5_0)
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_55,plain,
( nil != cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_56,negated_conjecture,
( cons(esk5_0,nil) = esk3_0
| nil = esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_57,negated_conjecture,
( ssItem(esk5_0)
| nil = esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_58,negated_conjecture,
( esk3_0 != nil
| ~ totalorderedP(esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_48,c_0_49]),c_0_50]),c_0_51])]) ).
cnf(c_0_59,negated_conjecture,
( esk3_0 = nil
| esk4_0 != nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_52,c_0_53]),c_0_51])]),c_0_54]) ).
cnf(c_0_60,plain,
totalorderedP(nil),
inference(split_conjunct,[status(thm)],[ax66]) ).
cnf(c_0_61,negated_conjecture,
( esk4_0 = nil
| esk3_0 != nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_55,c_0_56]),c_0_22])]),c_0_57]) ).
fof(c_0_62,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])])])])]) ).
cnf(c_0_63,negated_conjecture,
( cons(esk5_0,nil) = esk3_0
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_64,negated_conjecture,
esk3_0 != nil,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_58,c_0_59]),c_0_60])]),c_0_61]) ).
fof(c_0_65,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_66,plain,
! [X5,X6,X9,X10] :
( ( ssList(esk13_2(X5,X6))
| ~ memberP(X5,X6)
| ~ ssItem(X6)
| ~ ssList(X5) )
& ( ssList(esk14_2(X5,X6))
| ~ memberP(X5,X6)
| ~ ssItem(X6)
| ~ ssList(X5) )
& ( app(esk13_2(X5,X6),cons(X6,esk14_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_67,plain,
( cons(X1,X2) = app(cons(X1,nil),X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_62]) ).
cnf(c_0_68,negated_conjecture,
cons(esk5_0,nil) = esk3_0,
inference(sr,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_69,negated_conjecture,
ssItem(esk5_0),
inference(sr,[status(thm)],[c_0_54,c_0_64]) ).
cnf(c_0_70,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_65]) ).
cnf(c_0_71,plain,
( app(esk13_2(X1,X2),cons(X2,esk14_2(X1,X2))) = X1
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_66]) ).
cnf(c_0_72,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_67,c_0_68]),c_0_69])]) ).
fof(c_0_73,plain,
! [X2] :
( ~ ssItem(X2)
| totalorderedP(cons(X2,nil)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax65])]) ).
cnf(c_0_74,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_70,c_0_20]) ).
cnf(c_0_75,negated_conjecture,
( app(esk13_2(X1,esk5_0),app(esk3_0,esk14_2(X1,esk5_0))) = X1
| ~ memberP(X1,esk5_0)
| ~ ssList(esk14_2(X1,esk5_0))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_71,c_0_72]),c_0_69])]) ).
fof(c_0_76,plain,
! [X5,X6,X9,X10] :
( ( ssList(esk11_2(X5,X6))
| ~ segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) )
& ( ssList(esk12_2(X5,X6))
| ~ segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) )
& ( app(app(esk11_2(X5,X6),X6),esk12_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])])])])])])]) ).
cnf(c_0_77,plain,
( totalorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_73]) ).
cnf(c_0_78,negated_conjecture,
( segmentP(X1,X2)
| ~ segmentP(esk3_0,X2)
| ~ memberP(X1,esk5_0)
| ~ ssList(esk14_2(X1,esk5_0))
| ~ ssList(esk13_2(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_50])]) ).
cnf(c_0_79,plain,
( ssList(esk14_2(X1,X2))
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_66]) ).
cnf(c_0_80,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_76]) ).
cnf(c_0_81,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_67,c_0_63]),c_0_54]) ).
cnf(c_0_82,negated_conjecture,
( esk3_0 = nil
| totalorderedP(esk3_0) ),
inference(csr,[status(thm)],[inference(pm,[status(thm)],[c_0_77,c_0_63]),c_0_54]) ).
cnf(c_0_83,negated_conjecture,
( segmentP(X1,X2)
| ~ segmentP(esk3_0,X2)
| ~ memberP(X1,esk5_0)
| ~ ssList(esk13_2(X1,esk5_0))
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_78,c_0_79]),c_0_69])]) ).
cnf(c_0_84,plain,
( ssList(esk13_2(X1,X2))
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_66]) ).
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(pm,[status(thm)],[c_0_80,c_0_21]),c_0_22])]) ).
cnf(c_0_86,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_63,c_0_81]),c_0_22])]) ).
cnf(c_0_87,negated_conjecture,
totalorderedP(esk3_0),
inference(sr,[status(thm)],[c_0_82,c_0_64]) ).
cnf(c_0_88,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_83,c_0_84]),c_0_69])]) ).
cnf(c_0_89,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_85,c_0_34]),c_0_22])]) ).
cnf(c_0_90,negated_conjecture,
( app(nil,esk3_0) = esk3_0
| esk3_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_34,c_0_86]),c_0_50])]) ).
cnf(c_0_91,negated_conjecture,
~ segmentP(esk4_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_87])]) ).
cnf(c_0_92,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_88,c_0_89]),c_0_50])]) ).
cnf(c_0_93,negated_conjecture,
app(nil,esk3_0) = esk3_0,
inference(sr,[status(thm)],[c_0_90,c_0_64]) ).
cnf(c_0_94,negated_conjecture,
memberP(esk4_0,esk5_0),
inference(sr,[status(thm)],[c_0_53,c_0_64]) ).
cnf(c_0_95,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_91,c_0_92]),c_0_93]),c_0_94]),c_0_50]),c_0_51])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWC342+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n025.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:30:53 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.36/23.40 eprover: CPU time limit exceeded, terminating
% 0.36/23.40 eprover: CPU time limit exceeded, terminating
% 0.36/23.40 eprover: CPU time limit exceeded, terminating
% 0.36/23.41 eprover: CPU time limit exceeded, terminating
% 0.50/46.41 eprover: CPU time limit exceeded, terminating
% 0.50/46.42 eprover: CPU time limit exceeded, terminating
% 0.50/46.42 eprover: CPU time limit exceeded, terminating
% 0.50/46.43 eprover: CPU time limit exceeded, terminating
% 0.52/49.70 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.52/49.70
% 0.52/49.70 # Failure: Resource limit exceeded (time)
% 0.52/49.70 # OLD status Res
% 0.52/49.70 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.52/49.70 # Preprocessing time : 0.020 s
% 0.52/49.70 # Running protocol protocol_eprover_230b6c199cce1dcf6700db59e75a93feb83d1bd9 for 23 seconds:
% 0.52/49.70
% 0.52/49.70 # Failure: Resource limit exceeded (time)
% 0.52/49.70 # OLD status Res
% 0.52/49.70 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,01,20000,1.0)
% 0.52/49.70 # Preprocessing time : 0.010 s
% 0.52/49.70 # Running protocol protocol_eprover_48e494e00e0717ec2eabf59b73b2d711334607de for 23 seconds:
% 0.52/49.70 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,03,20000,1.0)
% 0.52/49.70 # Preprocessing time : 0.011 s
% 0.52/49.70
% 0.52/49.70 # Proof found!
% 0.52/49.70 # SZS status Theorem
% 0.52/49.70 # SZS output start CNFRefutation
% See solution above
% 0.52/49.70 # Proof object total steps : 96
% 0.52/49.70 # Proof object clause steps : 61
% 0.52/49.70 # Proof object formula steps : 35
% 0.52/49.70 # Proof object conjectures : 37
% 0.52/49.70 # Proof object clause conjectures : 34
% 0.52/49.70 # Proof object formula conjectures : 3
% 0.52/49.70 # Proof object initial clauses used : 29
% 0.52/49.70 # Proof object initial formulas used : 18
% 0.52/49.70 # Proof object generating inferences : 23
% 0.52/49.70 # Proof object simplifying inferences : 63
% 0.52/49.70 # Training examples: 0 positive, 0 negative
% 0.52/49.70 # Parsed axioms : 96
% 0.52/49.70 # Removed by relevancy pruning/SinE : 51
% 0.52/49.70 # Initial clauses : 89
% 0.52/49.70 # Removed in clause preprocessing : 1
% 0.52/49.70 # Initial clauses in saturation : 88
% 0.52/49.70 # Processed clauses : 20562
% 0.52/49.70 # ...of these trivial : 240
% 0.52/49.70 # ...subsumed : 18591
% 0.52/49.70 # ...remaining for further processing : 1731
% 0.52/49.70 # Other redundant clauses eliminated : 253
% 0.52/49.70 # Clauses deleted for lack of memory : 66431
% 0.52/49.70 # Backward-subsumed : 88
% 0.52/49.70 # Backward-rewritten : 203
% 0.52/49.70 # Generated clauses : 185094
% 0.52/49.70 # ...of the previous two non-trivial : 174825
% 0.52/49.70 # Contextual simplify-reflections : 5799
% 0.52/49.70 # Paramodulations : 184670
% 0.52/49.70 # Factorizations : 0
% 0.52/49.70 # Equation resolutions : 371
% 0.52/49.70 # Current number of processed clauses : 1385
% 0.52/49.70 # Positive orientable unit clauses : 136
% 0.52/49.70 # Positive unorientable unit clauses: 0
% 0.52/49.70 # Negative unit clauses : 145
% 0.52/49.70 # Non-unit-clauses : 1104
% 0.52/49.70 # Current number of unprocessed clauses: 83428
% 0.52/49.70 # ...number of literals in the above : 500954
% 0.52/49.70 # Current number of archived formulas : 0
% 0.52/49.70 # Current number of archived clauses : 344
% 0.52/49.70 # Clause-clause subsumption calls (NU) : 420020
% 0.52/49.70 # Rec. Clause-clause subsumption calls : 112243
% 0.52/49.70 # Non-unit clause-clause subsumptions : 9243
% 0.52/49.70 # Unit Clause-clause subsumption calls : 2772
% 0.52/49.70 # Rewrite failures with RHS unbound : 0
% 0.52/49.70 # BW rewrite match attempts : 572
% 0.52/49.70 # BW rewrite match successes : 49
% 0.52/49.70 # Condensation attempts : 0
% 0.52/49.70 # Condensation successes : 0
% 0.52/49.70 # Termbank termtop insertions : 3554480
% 0.52/49.70
% 0.52/49.70 # -------------------------------------------------
% 0.52/49.70 # User time : 2.980 s
% 0.52/49.70 # System time : 0.078 s
% 0.52/49.70 # Total time : 3.058 s
% 0.52/49.70 # Maximum resident set size: 131792 pages
% 0.52/69.43 eprover: CPU time limit exceeded, terminating
% 0.52/69.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.52/69.45 eprover: No such file or directory
% 0.52/69.45 eprover: CPU time limit exceeded, terminating
% 0.52/69.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.52/69.46 eprover: No such file or directory
% 0.52/69.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.52/69.46 eprover: No such file or directory
% 0.52/69.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.52/69.47 eprover: No such file or directory
% 0.52/69.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.52/69.47 eprover: No such file or directory
% 0.52/69.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.52/69.47 eprover: No such file or directory
% 0.52/69.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.52/69.47 eprover: No such file or directory
% 0.52/69.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.52/69.48 eprover: No such file or directory
% 0.52/69.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.52/69.48 eprover: No such file or directory
% 0.52/69.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.52/69.48 eprover: No such file or directory
% 0.52/69.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.52/69.48 eprover: No such file or directory
% 0.52/69.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.52/69.49 eprover: No such file or directory
% 0.52/69.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.52/69.49 eprover: No such file or directory
% 0.52/69.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.52/69.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.52/69.50 eprover: No such file or directory
% 0.52/69.50 eprover: No such file or directory
% 0.52/69.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.52/69.50 eprover: No such file or directory
% 0.52/69.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.52/69.51 eprover: No such file or directory
% 0.52/69.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.52/69.51 eprover: No such file or directory
%------------------------------------------------------------------------------