%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC089+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:26:37 EDT 2022
% Result : Theorem 0.45s 26.61s
% Output : CNFRefutation 0.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 23
% Syntax : Number of formulae : 142 ( 16 unt; 0 def)
% Number of atoms : 625 ( 190 equ)
% Maximal formula atoms : 27 ( 4 avg)
% Number of connectives : 873 ( 390 ~; 375 |; 55 &)
% ( 4 <=>; 49 =>; 0 <=; 0 <~>)
% Maximal formula depth : 31 ( 6 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 5 con; 0-2 aty)
% Number of variables : 226 ( 0 sgn 87 !; 14 ?)
% 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) )
| ( nil != X3
& nil = X4 )
| ( neq(X4,nil)
& ( ~ neq(X3,nil)
| ? [X6] :
( ssList(X6)
& X4 != X6
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& tl(X3) = X7
& app(X7,X8) = X6
& ? [X9] :
( ssItem(X9)
& cons(X9,nil) = X8
& hd(X3) = X9
& neq(nil,X3) )
& neq(nil,X3) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co1) ).
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(ax78,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax78) ).
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(ax22,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax22) ).
fof(ax24,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax24) ).
fof(ax55,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,X1) ),
file('/export/starexec/sandbox/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/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(ax21,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax21) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(ax27,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssItem(X3)
=> cons(X3,app(X2,X1)) = app(cons(X3,X2),X1) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax27) ).
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X2
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax83) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
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(ax85,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil != X1
=> hd(app(X1,X2)) = hd(X1) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax85) ).
fof(ax23,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> hd(cons(X2,X1)) = X2 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax23) ).
fof(ax20,axiom,
! [X1] :
( ssList(X1)
=> ( nil = X1
| ? [X2] :
( ssList(X2)
& ? [X3] :
( ssItem(X3)
& cons(X3,X2) = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax20) ).
fof(c_0_23,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) )
| ( nil != X3
& nil = X4 )
| ( neq(X4,nil)
& ( ~ neq(X3,nil)
| ? [X6] :
( ssList(X6)
& X4 != X6
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& tl(X3) = X7
& app(X7,X8) = X6
& ? [X9] :
( ssItem(X9)
& cons(X9,nil) = X8
& hd(X3) = X9
& neq(nil,X3) )
& neq(nil,X3) ) ) ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_24,negated_conjecture,
! [X14,X15,X16,X17,X18] :
( 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(X14)
| ~ neq(X14,nil)
| ~ segmentP(esk2_0,X14)
| ~ segmentP(esk1_0,X14) )
& ( nil = esk3_0
| nil != esk4_0 )
& ( neq(esk3_0,nil)
| ~ neq(esk4_0,nil) )
& ( ~ ssList(X15)
| esk4_0 = X15
| ~ ssList(X16)
| ~ ssList(X17)
| tl(esk3_0) != X16
| app(X16,X17) != X15
| ~ ssItem(X18)
| cons(X18,nil) != X17
| hd(esk3_0) != X18
| ~ neq(nil,esk3_0)
| ~ neq(nil,esk3_0)
| ~ neq(esk4_0,nil) ) ),
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_23])])])])])])])]) ).
fof(c_0_25,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])])])])])])]) ).
fof(c_0_26,plain,
! [X2] :
( ~ ssList(X2)
| app(nil,X2) = X2 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])]) ).
fof(c_0_27,plain,
! [X2] :
( ~ ssList(X2)
| nil = X2
| cons(hd(X2),tl(X2)) = X2 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax78])]) ).
fof(c_0_28,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_29,plain,
! [X2] :
( ~ ssList(X2)
| nil = X2
| ssItem(hd(X2)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax22])]) ).
fof(c_0_30,plain,
! [X2] :
( ~ ssList(X2)
| nil = X2
| ssList(tl(X2)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax24])]) ).
cnf(c_0_31,negated_conjecture,
( ~ segmentP(esk1_0,X1)
| ~ segmentP(esk2_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_32,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_33,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_34,plain,
! [X2] :
( ~ ssList(X2)
| segmentP(X2,X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])]) ).
cnf(c_0_35,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_36,negated_conjecture,
neq(esk2_0,nil),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_37,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_38,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_39,plain,
! [X2] :
( ~ ssList(X2)
| segmentP(X2,nil) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax57])]) ).
cnf(c_0_40,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_25]) ).
cnf(c_0_41,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_42,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_43,plain,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_44,plain,
( cons(X1,X2) = app(cons(X1,nil),X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_45,plain,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_46,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_47,negated_conjecture,
( ~ segmentP(esk3_0,X1)
| ~ segmentP(esk4_0,X1)
| ~ ssList(X1)
| ~ neq(X1,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
cnf(c_0_48,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_49,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_35,c_0_33]) ).
cnf(c_0_50,negated_conjecture,
neq(esk4_0,nil),
inference(rw,[status(thm)],[c_0_36,c_0_33]) ).
cnf(c_0_51,plain,
( segmentP(X1,X2)
| ~ segmentP(X3,X2)
| ~ segmentP(X1,X3)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_52,plain,
( segmentP(nil,X1)
| ~ ssList(X1)
| nil != X1 ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_53,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_54,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_55,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_56,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_40,c_0_41]),c_0_42])]) ).
cnf(c_0_57,plain,
( app(cons(hd(X1),nil),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(pm,[status(thm)],[c_0_43,c_0_44]),c_0_45]),c_0_46]) ).
cnf(c_0_58,negated_conjecture,
~ segmentP(esk3_0,esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]),c_0_50])]) ).
cnf(c_0_59,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_51,c_0_52]),c_0_42])]),c_0_53]) ).
cnf(c_0_60,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_54,c_0_32]) ).
cnf(c_0_61,plain,
( nil != cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
fof(c_0_62,plain,
! [X2] :
( ~ ssList(X2)
| app(X2,nil) = X2 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])]) ).
fof(c_0_63,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_64,negated_conjecture,
( esk4_0 = X4
| ~ neq(esk4_0,nil)
| ~ neq(nil,esk3_0)
| ~ neq(nil,esk3_0)
| hd(esk3_0) != X1
| cons(X1,nil) != X2
| ~ ssItem(X1)
| app(X3,X2) != X4
| tl(esk3_0) != X3
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X4) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_65,plain,
( nil = X1
| segmentP(X1,cons(hd(X1),nil))
| ~ ssList(cons(hd(X1),nil))
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57])]),c_0_46]) ).
cnf(c_0_66,negated_conjecture,
esk4_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_49]),c_0_60])]) ).
fof(c_0_67,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_68,plain,
! [X4,X5,X6] :
( ~ ssList(X4)
| ~ ssList(X5)
| ~ ssItem(X6)
| cons(X6,app(X5,X4)) = app(cons(X6,X5),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)],[ax27])])])])]) ).
fof(c_0_69,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_70,plain,
( app(cons(X1,nil),X2) != nil
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(pm,[status(thm)],[c_0_61,c_0_44]) ).
cnf(c_0_71,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_62]) ).
fof(c_0_72,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssItem(X4)
| ssList(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)],[ax16])])])])]) ).
cnf(c_0_73,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
fof(c_0_74,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_75,negated_conjecture,
( esk4_0 = X4
| hd(esk3_0) != X1
| tl(esk3_0) != X3
| app(X3,X2) != X4
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ neq(nil,esk3_0)
| ~ neq(esk4_0,nil) ),
inference(cn,[status(thm)],[c_0_64]) ).
cnf(c_0_76,negated_conjecture,
( ~ segmentP(esk3_0,cons(hd(esk4_0),nil))
| ~ ssList(cons(hd(esk4_0),nil))
| ~ neq(cons(hd(esk4_0),nil),nil) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_65]),c_0_49])]),c_0_66]) ).
cnf(c_0_77,plain,
( neq(X1,X2)
| X1 = X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_67]) ).
cnf(c_0_78,plain,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_68]) ).
cnf(c_0_79,plain,
( nil = app(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| nil != X1
| nil != X2 ),
inference(split_conjunct,[status(thm)],[c_0_69]) ).
cnf(c_0_80,plain,
( cons(X1,nil) != nil
| ~ ssList(cons(X1,nil))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_42])]) ).
cnf(c_0_81,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_72]) ).
cnf(c_0_82,plain,
( segmentP(X1,X2)
| app(X3,X2) != X1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_71]),c_0_42])]),c_0_73]) ).
cnf(c_0_83,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_74]) ).
cnf(c_0_84,negated_conjecture,
( esk4_0 = X1
| cons(X2,nil) != X3
| hd(esk3_0) != X2
| tl(esk3_0) != X4
| app(X4,X3) != X1
| ~ ssList(X1)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ neq(nil,esk3_0)
| ~ ssItem(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_75,c_0_50])]) ).
cnf(c_0_85,negated_conjecture,
( cons(hd(esk4_0),nil) = nil
| ~ segmentP(esk3_0,cons(hd(esk4_0),nil))
| ~ ssList(cons(hd(esk4_0),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_42])]) ).
cnf(c_0_86,plain,
( cons(X1,nil) = app(cons(X1,X2),X3)
| nil != X3
| nil != X2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[c_0_78,c_0_79]) ).
cnf(c_0_87,plain,
( cons(X1,nil) != nil
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_42])]) ).
cnf(c_0_88,plain,
( segmentP(X1,X2)
| app(X3,app(X4,X2)) != X1
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X4)
| ~ ssList(X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_73]) ).
cnf(c_0_89,plain,
( app(nil,X1) = app(X2,app(X3,X1))
| nil != X3
| nil != X2
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_83,c_0_79]) ).
cnf(c_0_90,negated_conjecture,
( esk4_0 = X1
| app(X2,cons(X3,nil)) != X1
| hd(esk3_0) != X3
| tl(esk3_0) != X2
| ~ ssList(cons(X3,nil))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(nil,esk3_0)
| ~ ssItem(X3) ),
inference(er,[status(thm)],[c_0_84]) ).
cnf(c_0_91,negated_conjecture,
( nil != X1
| nil != X2
| ~ segmentP(esk3_0,app(cons(hd(esk4_0),X2),X1))
| ~ ssList(cons(hd(esk4_0),nil))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(hd(esk4_0)) ),
inference(csr,[status(thm)],[inference(pm,[status(thm)],[c_0_85,c_0_86]),c_0_87]) ).
cnf(c_0_92,plain,
( ssList(app(cons(X1,nil),X2))
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(pm,[status(thm)],[c_0_81,c_0_44]) ).
cnf(c_0_93,plain,
( app(cons(X1,X2),nil) = cons(X1,X2)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_71]),c_0_42])]) ).
cnf(c_0_94,plain,
( segmentP(X1,X2)
| app(nil,X2) != X1
| nil != X3
| nil != X4
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X4) ),
inference(pm,[status(thm)],[c_0_88,c_0_89]) ).
cnf(c_0_95,negated_conjecture,
( esk4_0 = X1
| cons(X2,nil) != X1
| tl(esk3_0) != nil
| hd(esk3_0) != X2
| ~ ssList(cons(X2,nil))
| ~ ssList(X1)
| ~ neq(nil,esk3_0)
| ~ ssItem(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_41]),c_0_42])]) ).
cnf(c_0_96,negated_conjecture,
( nil != X1
| nil != X2
| ~ segmentP(esk3_0,app(cons(hd(esk4_0),X2),X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(hd(esk4_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_81]),c_0_42])]) ).
cnf(c_0_97,plain,
( ssList(cons(X1,nil))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_93]),c_0_42])]) ).
cnf(c_0_98,plain,
( segmentP(X1,X2)
| app(nil,X2) != X1
| nil != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
inference(spm,[status(thm)],[c_0_94,c_0_42]) ).
cnf(c_0_99,negated_conjecture,
( esk4_0 = X1
| cons(X2,nil) != X1
| tl(esk3_0) != nil
| hd(esk3_0) != X2
| ~ ssList(X1)
| ~ neq(nil,esk3_0)
| ~ ssItem(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_81]),c_0_42])]) ).
cnf(c_0_100,negated_conjecture,
( nil != X1
| ~ segmentP(esk3_0,cons(hd(esk4_0),X1))
| ~ ssList(X1)
| ~ ssItem(hd(esk4_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_93]),c_0_42])]) ).
cnf(c_0_101,negated_conjecture,
( esk4_0 = app(X1,cons(X2,nil))
| hd(esk3_0) != X2
| tl(esk3_0) != X1
| ~ ssList(X1)
| ~ neq(nil,esk3_0)
| ~ ssItem(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_90]),c_0_73]),c_0_97]) ).
cnf(c_0_102,plain,
( segmentP(X1,X2)
| app(nil,X2) != X1
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_98,c_0_42]) ).
cnf(c_0_103,negated_conjecture,
( neq(esk3_0,nil)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_104,negated_conjecture,
( esk4_0 = cons(X1,nil)
| tl(esk3_0) != nil
| hd(esk3_0) != X1
| ~ ssList(cons(X1,nil))
| ~ neq(nil,esk3_0)
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_99]) ).
cnf(c_0_105,negated_conjecture,
( nil != X1
| ~ segmentP(esk3_0,app(cons(hd(esk4_0),nil),X1))
| ~ ssList(X1)
| ~ ssItem(hd(esk4_0)) ),
inference(pm,[status(thm)],[c_0_100,c_0_44]) ).
cnf(c_0_106,negated_conjecture,
( esk4_0 = app(X1,cons(hd(esk3_0),nil))
| tl(esk3_0) != X1
| ~ ssList(X1)
| ~ neq(nil,esk3_0)
| ~ ssItem(hd(esk3_0)) ),
inference(er,[status(thm)],[c_0_101]) ).
cnf(c_0_107,negated_conjecture,
( app(nil,X1) != esk4_0
| ~ segmentP(esk3_0,X1)
| ~ ssList(X1)
| ~ neq(X1,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_102]),c_0_49])]) ).
cnf(c_0_108,negated_conjecture,
( nil != X1
| ~ segmentP(esk3_0,X1)
| ~ ssList(X1)
| ~ neq(X1,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_59]),c_0_49])]) ).
cnf(c_0_109,negated_conjecture,
neq(esk3_0,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_103,c_0_50])]) ).
cnf(c_0_110,negated_conjecture,
( esk4_0 = cons(X1,nil)
| tl(esk3_0) != nil
| hd(esk3_0) != X1
| ~ neq(nil,esk3_0)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_81]),c_0_42])]) ).
cnf(c_0_111,negated_conjecture,
( ~ segmentP(esk3_0,cons(hd(esk4_0),nil))
| ~ ssItem(hd(esk4_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_93]),c_0_42])]) ).
cnf(c_0_112,negated_conjecture,
( esk4_0 = app(tl(esk3_0),cons(hd(esk3_0),nil))
| ~ ssList(tl(esk3_0))
| ~ neq(nil,esk3_0)
| ~ ssItem(hd(esk3_0)) ),
inference(er,[status(thm)],[c_0_106]) ).
fof(c_0_113,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssList(X4)
| nil = X3
| hd(app(X3,X4)) = hd(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)],[ax85])])])])]) ).
cnf(c_0_114,negated_conjecture,
( X1 != esk4_0
| ~ segmentP(esk3_0,X1)
| ~ ssList(X1)
| ~ neq(X1,nil) ),
inference(spm,[status(thm)],[c_0_107,c_0_41]) ).
cnf(c_0_115,negated_conjecture,
esk3_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_108,c_0_48]),c_0_60]),c_0_109])]) ).
cnf(c_0_116,negated_conjecture,
( esk4_0 = cons(hd(esk3_0),nil)
| tl(esk3_0) != nil
| ~ neq(nil,esk3_0)
| ~ ssItem(hd(esk3_0)) ),
inference(er,[status(thm)],[c_0_110]) ).
cnf(c_0_117,negated_conjecture,
( ~ segmentP(esk3_0,cons(hd(app(tl(esk3_0),cons(hd(esk3_0),nil))),nil))
| ~ ssList(tl(esk3_0))
| ~ neq(nil,esk3_0)
| ~ ssItem(hd(app(tl(esk3_0),cons(hd(esk3_0),nil))))
| ~ ssItem(hd(esk3_0)) ),
inference(spm,[status(thm)],[c_0_111,c_0_112]) ).
cnf(c_0_118,plain,
( hd(app(X1,X2)) = hd(X1)
| nil = X1
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_113]) ).
cnf(c_0_119,negated_conjecture,
( esk4_0 != cons(hd(esk3_0),nil)
| ~ ssList(cons(hd(esk3_0),nil))
| ~ neq(cons(hd(esk3_0),nil),nil) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_114,c_0_65]),c_0_60])]),c_0_115]) ).
cnf(c_0_120,negated_conjecture,
( neq(cons(hd(esk3_0),nil),nil)
| tl(esk3_0) != nil
| ~ neq(nil,esk3_0)
| ~ ssItem(hd(esk3_0)) ),
inference(spm,[status(thm)],[c_0_50,c_0_116]) ).
fof(c_0_121,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssItem(X4)
| hd(cons(X4,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)],[ax23])])])])]) ).
cnf(c_0_122,negated_conjecture,
( tl(esk3_0) = nil
| ~ segmentP(esk3_0,cons(hd(tl(esk3_0)),nil))
| ~ ssList(tl(esk3_0))
| ~ neq(nil,esk3_0)
| ~ ssItem(hd(esk3_0)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_117,c_0_118]),c_0_97]),c_0_45]) ).
cnf(c_0_123,plain,
( nil = X1
| segmentP(X2,cons(hd(X1),nil))
| ~ segmentP(X2,X1)
| ~ ssList(cons(hd(X1),nil))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_51,c_0_65]) ).
cnf(c_0_124,negated_conjecture,
( tl(esk3_0) != nil
| ~ neq(nil,esk3_0)
| ~ ssItem(hd(esk3_0)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_119,c_0_116]),c_0_120]),c_0_97]) ).
cnf(c_0_125,plain,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_121]) ).
fof(c_0_126,plain,
! [X4] :
( ( ssList(esk5_1(X4))
| nil = X4
| ~ ssList(X4) )
& ( ssItem(esk6_1(X4))
| nil = X4
| ~ ssList(X4) )
& ( cons(esk6_1(X4),esk5_1(X4)) = X4
| nil = X4
| ~ ssList(X4) ) ),
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)],[ax20])])])])])]) ).
cnf(c_0_127,negated_conjecture,
( ~ segmentP(esk3_0,tl(esk3_0))
| ~ ssList(cons(hd(tl(esk3_0)),nil))
| ~ ssList(tl(esk3_0))
| ~ neq(nil,esk3_0)
| ~ ssItem(hd(esk3_0)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_122,c_0_123]),c_0_60])]),c_0_124]) ).
cnf(c_0_128,plain,
( segmentP(X1,X2)
| cons(X3,X2) != X1
| ~ ssList(cons(X3,nil))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X3) ),
inference(pm,[status(thm)],[c_0_82,c_0_44]) ).
cnf(c_0_129,plain,
( cons(X1,tl(cons(X1,X2))) = cons(X1,X2)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_125]),c_0_81]),c_0_61]) ).
cnf(c_0_130,plain,
( nil = X1
| cons(esk6_1(X1),esk5_1(X1)) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_126]) ).
cnf(c_0_131,plain,
( nil = X1
| ssItem(esk6_1(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_126]) ).
cnf(c_0_132,plain,
( nil = X1
| ssList(esk5_1(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_126]) ).
cnf(c_0_133,negated_conjecture,
( ~ segmentP(esk3_0,tl(esk3_0))
| ~ ssList(tl(esk3_0))
| ~ neq(nil,esk3_0)
| ~ ssItem(hd(tl(esk3_0)))
| ~ ssItem(hd(esk3_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_127,c_0_81]),c_0_42])]) ).
cnf(c_0_134,plain,
( segmentP(X1,X2)
| cons(X3,X2) != X1
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_128,c_0_81]),c_0_42])]) ).
cnf(c_0_135,plain,
( cons(esk6_1(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_129,c_0_130]),c_0_131]),c_0_132]) ).
cnf(c_0_136,negated_conjecture,
( ~ segmentP(esk3_0,tl(esk3_0))
| ~ ssList(tl(esk3_0))
| ~ neq(nil,esk3_0)
| ~ ssItem(hd(esk3_0)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_133,c_0_45]),c_0_124]) ).
cnf(c_0_137,plain,
( nil = X1
| segmentP(X1,tl(X1))
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_134,c_0_135])]),c_0_131]),c_0_46]) ).
cnf(c_0_138,negated_conjecture,
( ~ ssList(tl(esk3_0))
| ~ neq(nil,esk3_0)
| ~ ssItem(hd(esk3_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_136,c_0_137]),c_0_60])]),c_0_115]) ).
cnf(c_0_139,negated_conjecture,
( ~ neq(nil,esk3_0)
| ~ ssItem(hd(esk3_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_138,c_0_46]),c_0_60])]),c_0_115]) ).
cnf(c_0_140,negated_conjecture,
~ neq(nil,esk3_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_139,c_0_45]),c_0_60])]),c_0_115]) ).
cnf(c_0_141,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_140,c_0_77]),c_0_60]),c_0_42])]),c_0_115]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : SWC089+1 : TPTP v8.1.0. Released v2.4.0.
% 0.13/0.14 % Command : run_ET %s %d
% 0.15/0.36 % Computer : n005.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Sun Jun 12 04:26:54 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.42/23.44 eprover: CPU time limit exceeded, terminating
% 0.42/23.45 eprover: CPU time limit exceeded, terminating
% 0.42/23.46 eprover: CPU time limit exceeded, terminating
% 0.42/23.47 eprover: CPU time limit exceeded, terminating
% 0.45/26.61 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.45/26.61
% 0.45/26.61 # Failure: Resource limit exceeded (time)
% 0.45/26.61 # OLD status Res
% 0.45/26.61 # Preprocessing time : 0.026 s
% 0.45/26.61 # Running protocol protocol_eprover_773c90a94152ea2e8c9d3df9c4b1eb6152c40c03 for 23 seconds:
% 0.45/26.61 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,,100,1.0)
% 0.45/26.61 # Preprocessing time : 0.023 s
% 0.45/26.61
% 0.45/26.61 # Proof found!
% 0.45/26.61 # SZS status Theorem
% 0.45/26.61 # SZS output start CNFRefutation
% See solution above
% 0.45/26.61 # Proof object total steps : 142
% 0.45/26.61 # Proof object clause steps : 96
% 0.45/26.61 # Proof object formula steps : 46
% 0.45/26.61 # Proof object conjectures : 52
% 0.45/26.61 # Proof object clause conjectures : 49
% 0.45/26.61 # Proof object formula conjectures : 3
% 0.45/26.61 # Proof object initial clauses used : 32
% 0.45/26.61 # Proof object initial formulas used : 23
% 0.45/26.61 # Proof object generating inferences : 57
% 0.45/26.61 # Proof object simplifying inferences : 99
% 0.45/26.61 # Training examples: 0 positive, 0 negative
% 0.45/26.61 # Parsed axioms : 96
% 0.45/26.61 # Removed by relevancy pruning/SinE : 60
% 0.45/26.61 # Initial clauses : 61
% 0.45/26.61 # Removed in clause preprocessing : 0
% 0.45/26.61 # Initial clauses in saturation : 61
% 0.45/26.61 # Processed clauses : 5379
% 0.45/26.61 # ...of these trivial : 174
% 0.45/26.61 # ...subsumed : 3781
% 0.45/26.61 # ...remaining for further processing : 1424
% 0.45/26.61 # Other redundant clauses eliminated : 588
% 0.45/26.61 # Clauses deleted for lack of memory : 0
% 0.45/26.61 # Backward-subsumed : 365
% 0.45/26.61 # Backward-rewritten : 41
% 0.45/26.61 # Generated clauses : 42446
% 0.45/26.61 # ...of the previous two non-trivial : 39535
% 0.45/26.61 # Contextual simplify-reflections : 7328
% 0.45/26.61 # Paramodulations : 41019
% 0.45/26.61 # Factorizations : 0
% 0.45/26.61 # Equation resolutions : 752
% 0.45/26.61 # Current number of processed clauses : 1015
% 0.45/26.61 # Positive orientable unit clauses : 32
% 0.45/26.61 # Positive unorientable unit clauses: 0
% 0.45/26.61 # Negative unit clauses : 66
% 0.45/26.61 # Non-unit-clauses : 917
% 0.45/26.61 # Current number of unprocessed clauses: 29982
% 0.45/26.61 # ...number of literals in the above : 231968
% 0.45/26.61 # Current number of archived formulas : 0
% 0.45/26.61 # Current number of archived clauses : 406
% 0.45/26.61 # Clause-clause subsumption calls (NU) : 1473223
% 0.45/26.61 # Rec. Clause-clause subsumption calls : 79918
% 0.45/26.61 # Non-unit clause-clause subsumptions : 11623
% 0.45/26.61 # Unit Clause-clause subsumption calls : 22016
% 0.45/26.61 # Rewrite failures with RHS unbound : 0
% 0.45/26.61 # BW rewrite match attempts : 22
% 0.45/26.61 # BW rewrite match successes : 22
% 0.45/26.61 # Condensation attempts : 0
% 0.45/26.61 # Condensation successes : 0
% 0.45/26.61 # Termbank termtop insertions : 914549
% 0.45/26.61
% 0.45/26.61 # -------------------------------------------------
% 0.45/26.61 # User time : 2.385 s
% 0.45/26.61 # System time : 0.028 s
% 0.45/26.61 # Total time : 2.413 s
% 0.45/26.61 # Maximum resident set size: 34040 pages
% 0.45/46.45 eprover: CPU time limit exceeded, terminating
% 0.45/46.46 eprover: CPU time limit exceeded, terminating
% 0.45/46.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.45/46.47 eprover: No such file or directory
% 0.45/46.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.45/46.47 eprover: No such file or directory
% 0.45/46.47 eprover: CPU time limit exceeded, terminating
% 0.45/46.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.45/46.47 eprover: No such file or directory
% 0.45/46.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.45/46.47 eprover: No such file or directory
% 0.45/46.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.45/46.48 eprover: No such file or directory
% 0.45/46.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.45/46.48 eprover: No such file or directory
% 0.45/46.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.45/46.49 eprover: No such file or directory
% 0.45/46.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.45/46.49 eprover: No such file or directory
% 0.45/46.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.45/46.49 eprover: No such file or directory
% 0.45/46.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.45/46.49 eprover: No such file or directory
% 0.45/46.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.45/46.49 eprover: No such file or directory
% 0.45/46.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.45/46.49 eprover: No such file or directory
% 0.45/46.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.45/46.49 eprover: No such file or directory
% 0.45/46.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.45/46.49 eprover: No such file or directory
% 0.45/46.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.45/46.50 eprover: No such file or directory
% 0.45/46.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.45/46.50 eprover: No such file or directory
% 0.45/46.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.45/46.50 eprover: No such file or directory
% 0.45/46.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.45/46.50 eprover: No such file or directory
% 0.45/46.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.45/46.50 eprover: No such file or directory
% 0.45/46.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.45/46.51 eprover: No such file or directory
% 0.45/46.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.45/46.51 eprover: No such file or directory
% 0.45/46.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.45/46.51 eprover: No such file or directory
% 0.45/46.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.45/46.51 eprover: No such file or directory
% 0.45/46.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.45/46.51 eprover: eprover: No such file or directory
% 0.45/46.51 Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.45/46.51 eprover: No such file or directory
% 0.45/46.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.45/46.51 eprover: No such file or directory
% 0.45/46.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.45/46.52 eprover: No such file or directory
% 0.45/46.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.45/46.52 eprover: No such file or directory
% 0.45/46.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.45/46.52 eprover: No such file or directory
% 0.45/46.53 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.45/46.53 eprover: No such file or directory
%------------------------------------------------------------------------------