TSTP Solution File: SWC055+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC055+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n013.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:24 EDT 2022
% Result : Theorem 0.53s 51.69s
% Output : CNFRefutation 0.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 20
% Syntax : Number of formulae : 114 ( 17 unt; 0 def)
% Number of atoms : 500 ( 134 equ)
% Maximal formula atoms : 42 ( 4 avg)
% Number of connectives : 665 ( 279 ~; 280 |; 51 &)
% ( 6 <=>; 49 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-2 aty)
% Number of variables : 181 ( 0 sgn 88 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
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)
| ? [X6] :
( ssItem(X6)
& X5 != X6
& memberP(X4,X6)
& leq(X5,X6) ) ) )
& ( nil != X4
| nil != X3 ) )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X7] :
( ssList(X7)
& neq(X7,nil)
& segmentP(X2,X7)
& segmentP(X1,X7) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',co1) ).
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(ax21,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax21) ).
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(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax55,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax55) ).
fof(ax80,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( app(X2,X3) = app(X2,X1)
=> X3 = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax80) ).
fof(ax82,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> app(app(X1,X2),X3) = app(X1,app(X2,X3)) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax82) ).
fof(ax56,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( segmentP(X1,X2)
=> segmentP(app(app(X3,X1),X4),X2) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax56) ).
fof(ax3,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ( memberP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(X3,cons(X2,X4)) = X1 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax3) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(ax7,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( segmentP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(app(X3,X2),X4) = X1 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax7) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(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/sandbox/benchmark/Axioms/SWC001+0.ax',ax36) ).
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(ax38,axiom,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax38) ).
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(c_0_20,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)
| ? [X6] :
( ssItem(X6)
& X5 != X6
& memberP(X4,X6)
& leq(X5,X6) ) ) )
& ( nil != X4
| nil != X3 ) )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X7] :
( ssList(X7)
& neq(X7,nil)
& segmentP(X2,X7)
& segmentP(X1,X7) ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_21,negated_conjecture,
! [X13,X14] :
( 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) )
& ( nil = esk4_0
| ~ ssItem(X13)
| esk5_0 = X13
| ~ memberP(esk4_0,X13)
| ~ leq(esk5_0,X13) )
& ( nil = esk3_0
| ~ ssItem(X13)
| esk5_0 = X13
| ~ memberP(esk4_0,X13)
| ~ leq(esk5_0,X13) )
& ( neq(esk2_0,nil)
| nil = esk2_0 )
& ( ~ ssList(X14)
| ~ neq(X14,nil)
| ~ segmentP(esk2_0,X14)
| ~ segmentP(esk1_0,X14)
| nil = esk2_0 )
& ( neq(esk2_0,nil)
| nil != esk1_0 )
& ( ~ ssList(X14)
| ~ neq(X14,nil)
| ~ segmentP(esk2_0,X14)
| ~ segmentP(esk1_0,X14)
| nil != esk1_0 ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_20])])])])])])])]) ).
cnf(c_0_22,negated_conjecture,
( nil != esk1_0
| ~ segmentP(esk1_0,X1)
| ~ segmentP(esk2_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_23,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_24,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_25,negated_conjecture,
( neq(esk2_0,nil)
| nil != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_26,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_27,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_28,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_29,plain,
! [X2] :
( ~ ssList(X2)
| segmentP(X2,nil) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax57])]) ).
fof(c_0_30,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])])])])]) ).
fof(c_0_31,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_32,negated_conjecture,
( esk3_0 != nil
| ~ segmentP(esk3_0,X1)
| ~ segmentP(esk4_0,X1)
| ~ ssList(X1)
| ~ neq(X1,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23]),c_0_23]),c_0_24]) ).
cnf(c_0_33,negated_conjecture,
( neq(esk4_0,nil)
| esk3_0 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_24]),c_0_23]) ).
cnf(c_0_34,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_26,c_0_24]) ).
cnf(c_0_35,plain,
( segmentP(X1,X2)
| ~ segmentP(X3,X2)
| ~ segmentP(X1,X3)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_36,plain,
( segmentP(nil,X1)
| ~ ssList(X1)
| nil != X1 ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_37,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_38,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_39,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_40,plain,
( nil != cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_41,negated_conjecture,
( cons(esk5_0,nil) = esk3_0
| nil = esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_42,negated_conjecture,
( ssItem(esk5_0)
| nil = esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_43,plain,
( cons(X1,X2) = app(cons(X1,nil),X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_44,negated_conjecture,
( cons(esk5_0,nil) = esk3_0
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_45,negated_conjecture,
( ssItem(esk5_0)
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_46,negated_conjecture,
( esk3_0 != nil
| ~ segmentP(esk3_0,esk4_0)
| ~ segmentP(esk4_0,esk4_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]) ).
cnf(c_0_47,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_35,c_0_36]),c_0_37])]),c_0_38]) ).
cnf(c_0_48,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_39,c_0_23]) ).
cnf(c_0_49,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_40,c_0_41]),c_0_37])]),c_0_42]) ).
fof(c_0_50,plain,
! [X2] :
( ~ ssList(X2)
| segmentP(X2,X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])]) ).
cnf(c_0_51,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_43,c_0_44]),c_0_45]) ).
cnf(c_0_52,negated_conjecture,
( esk3_0 != nil
| ~ segmentP(esk4_0,esk4_0) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_46,c_0_47]),c_0_34]),c_0_48])]),c_0_49]) ).
cnf(c_0_53,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
fof(c_0_54,plain,
! [X4,X5,X6] :
( ~ ssList(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| app(X5,X6) != app(X5,X4)
| X6 = X4 ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax80])])])])]) ).
cnf(c_0_55,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_44,c_0_51]),c_0_37])]) ).
cnf(c_0_56,negated_conjecture,
esk3_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_52,c_0_53]),c_0_34])]) ).
fof(c_0_57,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_58,plain,
( X1 = X2
| app(X3,X1) != app(X3,X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_59,negated_conjecture,
app(esk3_0,nil) = esk3_0,
inference(sr,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_60,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
fof(c_0_61,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_62,plain,
! [X5,X6,X9,X10] :
( ( ssList(esk8_2(X5,X6))
| ~ memberP(X5,X6)
| ~ ssItem(X6)
| ~ ssList(X5) )
& ( ssList(esk9_2(X5,X6))
| ~ memberP(X5,X6)
| ~ ssItem(X6)
| ~ ssList(X5) )
& ( app(esk8_2(X5,X6),cons(X6,esk9_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_63,negated_conjecture,
cons(esk5_0,nil) = esk3_0,
inference(sr,[status(thm)],[c_0_44,c_0_56]) ).
cnf(c_0_64,negated_conjecture,
ssItem(esk5_0),
inference(sr,[status(thm)],[c_0_45,c_0_56]) ).
fof(c_0_65,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_66,negated_conjecture,
( X1 = nil
| app(esk3_0,X1) != esk3_0
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_58,c_0_59]),c_0_48]),c_0_37])]) ).
cnf(c_0_67,negated_conjecture,
( app(esk3_0,app(nil,X1)) = app(esk3_0,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_60,c_0_59]),c_0_37]),c_0_48])]) ).
fof(c_0_68,plain,
! [X2] :
( ~ ssList(X2)
| app(X2,nil) = X2 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])]) ).
cnf(c_0_69,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_61]) ).
cnf(c_0_70,plain,
( app(esk8_2(X1,X2),cons(X2,esk9_2(X1,X2))) = X1
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_62]) ).
cnf(c_0_71,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_43,c_0_63]),c_0_64])]) ).
cnf(c_0_72,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_73,negated_conjecture,
( app(nil,X1) = nil
| app(esk3_0,X1) != esk3_0
| ~ ssList(app(nil,X1))
| ~ ssList(X1) ),
inference(pm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_74,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_68]) ).
cnf(c_0_75,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_69,c_0_60]) ).
cnf(c_0_76,negated_conjecture,
( app(esk8_2(X1,esk5_0),app(esk3_0,esk9_2(X1,esk5_0))) = X1
| ~ memberP(X1,esk5_0)
| ~ ssList(esk9_2(X1,esk5_0))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_70,c_0_71]),c_0_64])]) ).
fof(c_0_77,plain,
! [X5,X6,X9,X10] :
( ( ssList(esk6_2(X5,X6))
| ~ segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) )
& ( ssList(esk7_2(X5,X6))
| ~ segmentP(X5,X6)
| ~ ssList(X6)
| ~ ssList(X5) )
& ( app(app(esk6_2(X5,X6),X6),esk7_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_78,plain,
! [X2] :
( ~ ssList(X2)
| app(nil,X2) = X2 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])]) ).
cnf(c_0_79,plain,
( ssList(app(X1,app(X2,X3)))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(pm,[status(thm)],[c_0_72,c_0_60]),c_0_72]) ).
cnf(c_0_80,negated_conjecture,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_73,c_0_74]),c_0_37]),c_0_59])]) ).
fof(c_0_81,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])])])])])]) ).
fof(c_0_82,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_83,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_84,negated_conjecture,
( nil = esk2_0
| ~ segmentP(esk1_0,X1)
| ~ segmentP(esk2_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_85,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_86,negated_conjecture,
( segmentP(X1,X2)
| ~ segmentP(esk3_0,X2)
| ~ memberP(X1,esk5_0)
| ~ ssList(esk9_2(X1,esk5_0))
| ~ ssList(esk8_2(X1,esk5_0))
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_75,c_0_76]),c_0_48])]) ).
cnf(c_0_87,plain,
( ssList(esk9_2(X1,X2))
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_62]) ).
cnf(c_0_88,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_77]) ).
cnf(c_0_89,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_78]) ).
cnf(c_0_90,plain,
( app(X1,app(X2,nil)) = app(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_74,c_0_60]),c_0_37])]),c_0_72]) ).
cnf(c_0_91,negated_conjecture,
( ssList(app(X1,nil))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_79,c_0_80]),c_0_37])]) ).
cnf(c_0_92,plain,
( memberP(app(X2,X3),X1)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ memberP(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_81]) ).
cnf(c_0_93,plain,
( nil = app(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| nil != X1
| nil != X2 ),
inference(split_conjunct,[status(thm)],[c_0_82]) ).
cnf(c_0_94,plain,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_83]) ).
cnf(c_0_95,negated_conjecture,
( memberP(esk4_0,esk5_0)
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_96,negated_conjecture,
( esk4_0 = nil
| ~ segmentP(esk3_0,X1)
| ~ segmentP(esk4_0,X1)
| ~ ssList(X1)
| ~ neq(X1,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_84,c_0_24]),c_0_23]),c_0_24]) ).
cnf(c_0_97,plain,
( neq(X1,X2)
| X1 = X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_85]) ).
cnf(c_0_98,negated_conjecture,
( segmentP(X1,X2)
| ~ segmentP(esk3_0,X2)
| ~ memberP(X1,esk5_0)
| ~ ssList(esk8_2(X1,esk5_0))
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_86,c_0_87]),c_0_64])]) ).
cnf(c_0_99,plain,
( ssList(esk8_2(X1,X2))
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_62]) ).
cnf(c_0_100,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_88,c_0_89]),c_0_37])]) ).
cnf(c_0_101,plain,
( app(nil,X1) = app(X1,nil)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_89,c_0_90]),c_0_37])]),c_0_91]) ).
cnf(c_0_102,plain,
( nil != X1
| nil != X2
| ~ memberP(X1,X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X3) ),
inference(csr,[status(thm)],[inference(pm,[status(thm)],[c_0_92,c_0_93]),c_0_94]) ).
cnf(c_0_103,negated_conjecture,
memberP(esk4_0,esk5_0),
inference(sr,[status(thm)],[c_0_95,c_0_56]) ).
cnf(c_0_104,negated_conjecture,
( esk4_0 = nil
| X1 = nil
| ~ segmentP(esk3_0,X1)
| ~ segmentP(esk4_0,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_96,c_0_97]),c_0_37])]) ).
cnf(c_0_105,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_98,c_0_99]),c_0_64])]) ).
cnf(c_0_106,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_100,c_0_101]),c_0_37])]) ).
cnf(c_0_107,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_60,c_0_89]),c_0_37])]) ).
cnf(c_0_108,negated_conjecture,
( esk4_0 != nil
| nil != X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_102,c_0_103]),c_0_34]),c_0_64])]) ).
cnf(c_0_109,negated_conjecture,
( esk4_0 = nil
| ~ segmentP(esk4_0,esk3_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_104,c_0_53]),c_0_48])]),c_0_56]) ).
cnf(c_0_110,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_105,c_0_106]),c_0_48])]) ).
cnf(c_0_111,negated_conjecture,
app(nil,esk3_0) = esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_107,c_0_59]),c_0_59]),c_0_37]),c_0_48])]) ).
cnf(c_0_112,negated_conjecture,
esk4_0 != nil,
inference(pm,[status(thm)],[c_0_108,c_0_34]) ).
cnf(c_0_113,negated_conjecture,
$false,
inference(sr,[status(thm)],[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_109,c_0_110]),c_0_111]),c_0_103]),c_0_48]),c_0_34])]),c_0_112]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC055+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.14/0.34 % Computer : n013.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sun Jun 12 05:29:14 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.38/23.42 eprover: CPU time limit exceeded, terminating
% 0.38/23.42 eprover: CPU time limit exceeded, terminating
% 0.38/23.43 eprover: CPU time limit exceeded, terminating
% 0.38/23.43 eprover: CPU time limit exceeded, terminating
% 0.51/46.43 eprover: CPU time limit exceeded, terminating
% 0.51/46.44 eprover: CPU time limit exceeded, terminating
% 0.51/46.44 eprover: CPU time limit exceeded, terminating
% 0.51/46.45 eprover: CPU time limit exceeded, terminating
% 0.53/51.69 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.53/51.69
% 0.53/51.69 # Failure: Resource limit exceeded (time)
% 0.53/51.69 # OLD status Res
% 0.53/51.69 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.53/51.69 # Preprocessing time : 0.020 s
% 0.53/51.69 # Running protocol protocol_eprover_230b6c199cce1dcf6700db59e75a93feb83d1bd9 for 23 seconds:
% 0.53/51.69
% 0.53/51.69 # Failure: Resource limit exceeded (time)
% 0.53/51.69 # OLD status Res
% 0.53/51.69 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,01,20000,1.0)
% 0.53/51.69 # Preprocessing time : 0.011 s
% 0.53/51.69 # Running protocol protocol_eprover_48e494e00e0717ec2eabf59b73b2d711334607de for 23 seconds:
% 0.53/51.69 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,03,20000,1.0)
% 0.53/51.69 # Preprocessing time : 0.011 s
% 0.53/51.69
% 0.53/51.69 # Proof found!
% 0.53/51.69 # SZS status Theorem
% 0.53/51.69 # SZS output start CNFRefutation
% See solution above
% 0.53/51.69 # Proof object total steps : 114
% 0.53/51.69 # Proof object clause steps : 74
% 0.53/51.69 # Proof object formula steps : 40
% 0.53/51.69 # Proof object conjectures : 47
% 0.53/51.69 # Proof object clause conjectures : 44
% 0.53/51.69 # Proof object formula conjectures : 3
% 0.53/51.69 # Proof object initial clauses used : 33
% 0.53/51.69 # Proof object initial formulas used : 20
% 0.53/51.69 # Proof object generating inferences : 32
% 0.53/51.69 # Proof object simplifying inferences : 86
% 0.53/51.69 # Training examples: 0 positive, 0 negative
% 0.53/51.69 # Parsed axioms : 96
% 0.53/51.69 # Removed by relevancy pruning/SinE : 63
% 0.53/51.69 # Initial clauses : 70
% 0.53/51.69 # Removed in clause preprocessing : 0
% 0.53/51.69 # Initial clauses in saturation : 70
% 0.53/51.69 # Processed clauses : 27643
% 0.53/51.69 # ...of these trivial : 151
% 0.53/51.69 # ...subsumed : 25583
% 0.53/51.69 # ...remaining for further processing : 1909
% 0.53/51.69 # Other redundant clauses eliminated : 165
% 0.53/51.69 # Clauses deleted for lack of memory : 137439
% 0.53/51.69 # Backward-subsumed : 92
% 0.53/51.69 # Backward-rewritten : 21
% 0.53/51.69 # Generated clauses : 267917
% 0.53/51.69 # ...of the previous two non-trivial : 259629
% 0.53/51.69 # Contextual simplify-reflections : 4904
% 0.53/51.69 # Paramodulations : 267625
% 0.53/51.69 # Factorizations : 0
% 0.53/51.69 # Equation resolutions : 286
% 0.53/51.69 # Current number of processed clauses : 1787
% 0.53/51.69 # Positive orientable unit clauses : 98
% 0.53/51.69 # Positive unorientable unit clauses: 0
% 0.53/51.69 # Negative unit clauses : 348
% 0.53/51.69 # Non-unit-clauses : 1341
% 0.53/51.69 # Current number of unprocessed clauses: 91740
% 0.53/51.69 # ...number of literals in the above : 504234
% 0.53/51.69 # Current number of archived formulas : 0
% 0.53/51.69 # Current number of archived clauses : 119
% 0.53/51.69 # Clause-clause subsumption calls (NU) : 617688
% 0.53/51.69 # Rec. Clause-clause subsumption calls : 130044
% 0.53/51.69 # Non-unit clause-clause subsumptions : 8874
% 0.53/51.69 # Unit Clause-clause subsumption calls : 13228
% 0.53/51.69 # Rewrite failures with RHS unbound : 0
% 0.53/51.69 # BW rewrite match attempts : 299
% 0.53/51.69 # BW rewrite match successes : 17
% 0.53/51.69 # Condensation attempts : 0
% 0.53/51.69 # Condensation successes : 0
% 0.53/51.69 # Termbank termtop insertions : 4799718
% 0.53/51.69
% 0.53/51.69 # -------------------------------------------------
% 0.53/51.69 # User time : 4.995 s
% 0.53/51.69 # System time : 0.094 s
% 0.53/51.69 # Total time : 5.089 s
% 0.53/51.69 # Maximum resident set size: 137300 pages
% 0.53/69.44 eprover: CPU time limit exceeded, terminating
% 0.53/69.45 eprover: CPU time limit exceeded, terminating
% 0.53/69.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.53/69.46 eprover: No such file or directory
% 0.53/69.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.53/69.46 eprover: No such file or directory
% 0.53/69.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.53/69.47 eprover: No such file or directory
% 0.53/69.47 eprover: CPU time limit exceeded, terminating
% 0.53/69.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.53/69.47 eprover: No such file or directory
% 0.53/69.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.53/69.47 eprover: No such file or directory
% 0.53/69.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.53/69.47 eprover: No such file or directory
% 0.53/69.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.53/69.48 eprover: No such file or directory
% 0.53/69.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.53/69.48 eprover: No such file or directory
% 0.53/69.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.53/69.48 eprover: No such file or directory
% 0.53/69.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.53/69.48 eprover: No such file or directory
% 0.53/69.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.53/69.49 eprover: No such file or directory
% 0.53/69.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.53/69.49 eprover: No such file or directory
% 0.53/69.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.53/69.49 eprover: No such file or directory
% 0.53/69.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.53/69.49 eprover: No such file or directory
% 0.53/69.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.53/69.49 eprover: No such file or directory
% 0.53/69.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.53/69.49 eprover: No such file or directory
% 0.53/69.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.53/69.49 eprover: No such file or directory
% 0.53/69.50 eprover: eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.inCannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.53/69.50
% 0.53/69.50 eprover: No such file or directory
% 0.53/69.50 eprover: No such file or directory
% 0.53/69.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.53/69.50 eprover: No such file or directory
% 0.53/69.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.53/69.50 eprover: No such file or directory
% 0.53/69.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.53/69.50 eprover: No such file or directory
% 0.53/69.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.53/69.50 eprover: No such file or directory
% 0.53/69.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.53/69.51 eprover: No such file or directory
% 0.53/69.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.53/69.51 eprover: No such file or directory
% 0.53/69.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.53/69.52 eprover: No such file or directory
% 0.53/69.53 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.53/69.53 eprover: No such file or directory
%------------------------------------------------------------------------------