TSTP Solution File: GRA012+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : GRA012+1 : TPTP v8.1.0. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n027.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 : Sat Jul 16 07:16:09 EDT 2022
% Result : Theorem 0.27s 11.46s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 14
% Syntax : Number of formulae : 114 ( 22 unt; 0 def)
% Number of atoms : 467 ( 159 equ)
% Maximal formula atoms : 37 ( 4 avg)
% Number of connectives : 585 ( 232 ~; 269 |; 62 &)
% ( 3 <=>; 17 =>; 1 <=; 1 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 2 prp; 0-3 aty)
% Number of functors : 17 ( 17 usr; 7 con; 0-4 aty)
% Number of variables : 234 ( 42 sgn 99 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(triangles_on_a_path,conjecture,
( complete
=> ! [X4,X2,X3] :
( shortest_path(X2,X3,X4)
=> number_of_in(triangles,X4) = minus(length_of(X4),n1) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',triangles_on_a_path) ).
fof(shortest_path_defn,axiom,
! [X2,X3,X10] :
( shortest_path(X2,X3,X10)
<=> ( path(X2,X3,X10)
& X2 != X3
& ! [X4] :
( path(X2,X3,X4)
=> less_or_equal(length_of(X10),length_of(X4)) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GRA001+0.ax',shortest_path_defn) ).
fof(length_defn,axiom,
! [X2,X3,X4] :
( path(X2,X3,X4)
=> length_of(X4) = number_of_in(edges,X4) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',length_defn) ).
fof(path_length_sequential_pairs,axiom,
! [X2,X3,X4] :
( path(X2,X3,X4)
=> number_of_in(sequential_pairs,X4) = minus(length_of(X4),n1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',path_length_sequential_pairs) ).
fof(in_path_properties,axiom,
! [X2,X3,X4,X6] :
( ( path(X2,X3,X4)
& in_path(X6,X4) )
=> ( vertex(X6)
& ? [X1] :
( on_path(X1,X4)
& ( X6 = head_of(X1)
| X6 = tail_of(X1) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GRA001+0.ax',in_path_properties) ).
fof(on_path_properties,axiom,
! [X2,X3,X4,X1] :
( ( path(X2,X3,X4)
& on_path(X1,X4) )
=> ( edge(X1)
& in_path(head_of(X1),X4)
& in_path(tail_of(X1),X4) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GRA001+0.ax',on_path_properties) ).
fof(precedes_defn,axiom,
! [X4,X2,X3] :
( path(X2,X3,X4)
=> ! [X7,X8] :
( precedes(X7,X8,X4)
<= ( on_path(X7,X4)
& on_path(X8,X4)
& ( sequential(X7,X8)
| ? [X9] :
( sequential(X7,X9)
& precedes(X9,X8,X4) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GRA001+0.ax',precedes_defn) ).
fof(sequential_pairs_and_triangles,axiom,
! [X4,X2,X3] :
( ( path(X2,X3,X4)
& ! [X7,X8] :
( ( on_path(X7,X4)
& on_path(X8,X4)
& sequential(X7,X8) )
=> ? [X9] : triangle(X7,X8,X9) ) )
=> number_of_in(sequential_pairs,X4) = number_of_in(triangles,X4) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sequential_pairs_and_triangles) ).
fof(shortest_path_properties,axiom,
! [X2,X3,X7,X8,X4] :
( ( shortest_path(X2,X3,X4)
& precedes(X7,X8,X4) )
=> ( ~ ? [X9] :
( tail_of(X9) = tail_of(X7)
& head_of(X9) = head_of(X8) )
& ~ precedes(X8,X7,X4) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GRA001+0.ax',shortest_path_properties) ).
fof(complete_properties,axiom,
( complete
=> ! [X2,X3] :
( ( vertex(X2)
& vertex(X3)
& X2 != X3 )
=> ? [X1] :
( edge(X1)
& ( ( X2 = head_of(X1)
& X3 = tail_of(X1) )
<~> ( X3 = head_of(X1)
& X2 = tail_of(X1) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GRA001+0.ax',complete_properties) ).
fof(triangle_defn,axiom,
! [X7,X8,X9] :
( triangle(X7,X8,X9)
<=> ( edge(X7)
& edge(X8)
& edge(X9)
& sequential(X7,X8)
& sequential(X8,X9)
& sequential(X9,X7) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',triangle_defn) ).
fof(sequential_defn,axiom,
! [X7,X8] :
( sequential(X7,X8)
<=> ( edge(X7)
& edge(X8)
& X7 != X8
& head_of(X7) = tail_of(X8) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GRA001+0.ax',sequential_defn) ).
fof(edge_ends_are_vertices,axiom,
! [X1] :
( edge(X1)
=> ( vertex(head_of(X1))
& vertex(tail_of(X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GRA001+0.ax',edge_ends_are_vertices) ).
fof(no_loops,axiom,
! [X1] :
( edge(X1)
=> head_of(X1) != tail_of(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/GRA001+0.ax',no_loops) ).
fof(c_0_14,negated_conjecture,
~ ( complete
=> ! [X4,X2,X3] :
( shortest_path(X2,X3,X4)
=> number_of_in(triangles,X4) = minus(length_of(X4),n1) ) ),
inference(assume_negation,[status(cth)],[triangles_on_a_path]) ).
fof(c_0_15,plain,
! [X11,X12,X13,X14,X11,X12,X13] :
( ( path(X11,X12,X13)
| ~ shortest_path(X11,X12,X13) )
& ( X11 != X12
| ~ shortest_path(X11,X12,X13) )
& ( ~ path(X11,X12,X14)
| less_or_equal(length_of(X13),length_of(X14))
| ~ shortest_path(X11,X12,X13) )
& ( path(X11,X12,esk6_3(X11,X12,X13))
| ~ path(X11,X12,X13)
| X11 = X12
| shortest_path(X11,X12,X13) )
& ( ~ less_or_equal(length_of(X13),length_of(esk6_3(X11,X12,X13)))
| ~ path(X11,X12,X13)
| X11 = X12
| shortest_path(X11,X12,X13) ) ),
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)],[shortest_path_defn])])])])])])]) ).
fof(c_0_16,negated_conjecture,
( complete
& shortest_path(esk10_0,esk11_0,esk9_0)
& number_of_in(triangles,esk9_0) != minus(length_of(esk9_0),n1) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])])]) ).
fof(c_0_17,plain,
! [X5,X6,X7] :
( ~ path(X5,X6,X7)
| length_of(X7) = number_of_in(edges,X7) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[length_defn])]) ).
cnf(c_0_18,plain,
( path(X1,X2,X3)
| ~ shortest_path(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,negated_conjecture,
shortest_path(esk10_0,esk11_0,esk9_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,plain,
( length_of(X1) = number_of_in(edges,X1)
| ~ path(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_21,negated_conjecture,
path(esk10_0,esk11_0,esk9_0),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
fof(c_0_22,plain,
! [X5,X6,X7] :
( ~ path(X5,X6,X7)
| number_of_in(sequential_pairs,X7) = minus(length_of(X7),n1) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[path_length_sequential_pairs])]) ).
cnf(c_0_23,negated_conjecture,
number_of_in(triangles,esk9_0) != minus(length_of(esk9_0),n1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,negated_conjecture,
length_of(esk9_0) = number_of_in(edges,esk9_0),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
( number_of_in(sequential_pairs,X1) = minus(length_of(X1),n1)
| ~ path(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_26,plain,
! [X7,X8,X9,X10] :
( ( vertex(X10)
| ~ path(X7,X8,X9)
| ~ in_path(X10,X9) )
& ( on_path(esk4_4(X7,X8,X9,X10),X9)
| ~ path(X7,X8,X9)
| ~ in_path(X10,X9) )
& ( X10 = head_of(esk4_4(X7,X8,X9,X10))
| X10 = tail_of(esk4_4(X7,X8,X9,X10))
| ~ path(X7,X8,X9)
| ~ in_path(X10,X9) ) ),
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)],[in_path_properties])])])])])]) ).
fof(c_0_27,plain,
! [X5,X6,X7,X8] :
( ( edge(X8)
| ~ path(X5,X6,X7)
| ~ on_path(X8,X7) )
& ( in_path(head_of(X8),X7)
| ~ path(X5,X6,X7)
| ~ on_path(X8,X7) )
& ( in_path(tail_of(X8),X7)
| ~ path(X5,X6,X7)
| ~ on_path(X8,X7) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[on_path_properties])])]) ).
fof(c_0_28,plain,
! [X10,X11,X12,X13,X14,X15] :
( ( ~ sequential(X13,X14)
| ~ on_path(X13,X10)
| ~ on_path(X14,X10)
| precedes(X13,X14,X10)
| ~ path(X11,X12,X10) )
& ( ~ sequential(X13,X15)
| ~ precedes(X15,X14,X10)
| ~ on_path(X13,X10)
| ~ on_path(X14,X10)
| precedes(X13,X14,X10)
| ~ path(X11,X12,X10) ) ),
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)],[inference(fof_simplification,[status(thm)],[precedes_defn])])])])])])]) ).
fof(c_0_29,plain,
! [X10,X11,X12,X15] :
( ( on_path(esk7_1(X10),X10)
| ~ path(X11,X12,X10)
| number_of_in(sequential_pairs,X10) = number_of_in(triangles,X10) )
& ( on_path(esk8_1(X10),X10)
| ~ path(X11,X12,X10)
| number_of_in(sequential_pairs,X10) = number_of_in(triangles,X10) )
& ( sequential(esk7_1(X10),esk8_1(X10))
| ~ path(X11,X12,X10)
| number_of_in(sequential_pairs,X10) = number_of_in(triangles,X10) )
& ( ~ triangle(esk7_1(X10),esk8_1(X10),X15)
| ~ path(X11,X12,X10)
| number_of_in(sequential_pairs,X10) = number_of_in(triangles,X10) ) ),
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)],[sequential_pairs_and_triangles])])])])])])]) ).
cnf(c_0_30,negated_conjecture,
minus(number_of_in(edges,esk9_0),n1) != number_of_in(triangles,esk9_0),
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_31,negated_conjecture,
minus(number_of_in(edges,esk9_0),n1) = number_of_in(sequential_pairs,esk9_0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_21]),c_0_24]) ).
cnf(c_0_32,plain,
( vertex(X1)
| ~ in_path(X1,X2)
| ~ path(X3,X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_33,plain,
( in_path(head_of(X1),X2)
| ~ on_path(X1,X2)
| ~ path(X3,X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
fof(c_0_34,plain,
! [X10,X11,X12,X13,X14,X15] :
( ( tail_of(X15) != tail_of(X12)
| head_of(X15) != head_of(X13)
| ~ shortest_path(X10,X11,X14)
| ~ precedes(X12,X13,X14) )
& ( ~ precedes(X13,X12,X14)
| ~ shortest_path(X10,X11,X14)
| ~ precedes(X12,X13,X14) ) ),
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)],[inference(fof_simplification,[status(thm)],[shortest_path_properties])])])])])])]) ).
cnf(c_0_35,plain,
( precedes(X4,X5,X3)
| ~ path(X1,X2,X3)
| ~ on_path(X5,X3)
| ~ on_path(X4,X3)
| ~ sequential(X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_36,plain,
( number_of_in(sequential_pairs,X1) = number_of_in(triangles,X1)
| on_path(esk8_1(X1),X1)
| ~ path(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_37,negated_conjecture,
number_of_in(triangles,esk9_0) != number_of_in(sequential_pairs,esk9_0),
inference(rw,[status(thm)],[c_0_30,c_0_31]) ).
fof(c_0_38,plain,
! [X4,X5] :
( ( edge(esk1_2(X4,X5))
| ~ vertex(X4)
| ~ vertex(X5)
| X4 = X5
| ~ complete )
& ( X4 != head_of(esk1_2(X4,X5))
| X5 != tail_of(esk1_2(X4,X5))
| X5 != head_of(esk1_2(X4,X5))
| X4 != tail_of(esk1_2(X4,X5))
| ~ vertex(X4)
| ~ vertex(X5)
| X4 = X5
| ~ complete )
& ( X5 = head_of(esk1_2(X4,X5))
| X4 = head_of(esk1_2(X4,X5))
| ~ vertex(X4)
| ~ vertex(X5)
| X4 = X5
| ~ complete )
& ( X4 = tail_of(esk1_2(X4,X5))
| X4 = head_of(esk1_2(X4,X5))
| ~ vertex(X4)
| ~ vertex(X5)
| X4 = X5
| ~ complete )
& ( X5 = head_of(esk1_2(X4,X5))
| X5 = tail_of(esk1_2(X4,X5))
| ~ vertex(X4)
| ~ vertex(X5)
| X4 = X5
| ~ complete )
& ( X4 = tail_of(esk1_2(X4,X5))
| X5 = tail_of(esk1_2(X4,X5))
| ~ vertex(X4)
| ~ vertex(X5)
| X4 = X5
| ~ complete ) ),
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)],[complete_properties])])])])])])])]) ).
cnf(c_0_39,negated_conjecture,
( vertex(X1)
| ~ in_path(X1,esk9_0) ),
inference(spm,[status(thm)],[c_0_32,c_0_21]) ).
cnf(c_0_40,negated_conjecture,
( in_path(head_of(X1),esk9_0)
| ~ on_path(X1,esk9_0) ),
inference(spm,[status(thm)],[c_0_33,c_0_21]) ).
cnf(c_0_41,plain,
( in_path(tail_of(X1),X2)
| ~ on_path(X1,X2)
| ~ path(X3,X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_42,plain,
( ~ precedes(X1,X2,X3)
| ~ shortest_path(X4,X5,X3)
| head_of(X6) != head_of(X2)
| tail_of(X6) != tail_of(X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_43,negated_conjecture,
( precedes(X1,X2,esk9_0)
| ~ sequential(X1,X2)
| ~ on_path(X2,esk9_0)
| ~ on_path(X1,esk9_0) ),
inference(spm,[status(thm)],[c_0_35,c_0_21]) ).
cnf(c_0_44,negated_conjecture,
on_path(esk8_1(esk9_0),esk9_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_21]),c_0_37]) ).
cnf(c_0_45,plain,
( X1 = X2
| X2 = tail_of(esk1_2(X1,X2))
| X1 = tail_of(esk1_2(X1,X2))
| ~ complete
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_46,negated_conjecture,
complete,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_47,negated_conjecture,
( vertex(head_of(X1))
| ~ on_path(X1,esk9_0) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_48,negated_conjecture,
( in_path(tail_of(X1),esk9_0)
| ~ on_path(X1,esk9_0) ),
inference(spm,[status(thm)],[c_0_41,c_0_21]) ).
cnf(c_0_49,plain,
( number_of_in(sequential_pairs,X1) = number_of_in(triangles,X1)
| on_path(esk7_1(X1),X1)
| ~ path(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
fof(c_0_50,plain,
! [X10,X11,X12,X10,X11,X12] :
( ( edge(X10)
| ~ triangle(X10,X11,X12) )
& ( edge(X11)
| ~ triangle(X10,X11,X12) )
& ( edge(X12)
| ~ triangle(X10,X11,X12) )
& ( sequential(X10,X11)
| ~ triangle(X10,X11,X12) )
& ( sequential(X11,X12)
| ~ triangle(X10,X11,X12) )
& ( sequential(X12,X10)
| ~ triangle(X10,X11,X12) )
& ( ~ edge(X10)
| ~ edge(X11)
| ~ edge(X12)
| ~ sequential(X10,X11)
| ~ sequential(X11,X12)
| ~ sequential(X12,X10)
| triangle(X10,X11,X12) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[triangle_defn])])])])]) ).
fof(c_0_51,plain,
! [X9,X10,X9,X10] :
( ( edge(X9)
| ~ sequential(X9,X10) )
& ( edge(X10)
| ~ sequential(X9,X10) )
& ( X9 != X10
| ~ sequential(X9,X10) )
& ( head_of(X9) = tail_of(X10)
| ~ sequential(X9,X10) )
& ( ~ edge(X9)
| ~ edge(X10)
| X9 = X10
| head_of(X9) != tail_of(X10)
| sequential(X9,X10) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sequential_defn])])])])]) ).
cnf(c_0_52,negated_conjecture,
( head_of(X1) != head_of(X2)
| tail_of(X3) != tail_of(X2)
| ~ precedes(X3,X1,esk9_0) ),
inference(spm,[status(thm)],[c_0_42,c_0_19]) ).
cnf(c_0_53,negated_conjecture,
( precedes(X1,esk8_1(esk9_0),esk9_0)
| ~ sequential(X1,esk8_1(esk9_0))
| ~ on_path(X1,esk9_0) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_54,plain,
( number_of_in(sequential_pairs,X1) = number_of_in(triangles,X1)
| sequential(esk7_1(X1),esk8_1(X1))
| ~ path(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_55,plain,
( tail_of(esk1_2(X1,X2)) = X1
| tail_of(esk1_2(X1,X2)) = X2
| X1 = X2
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46])]) ).
cnf(c_0_56,negated_conjecture,
vertex(head_of(esk8_1(esk9_0))),
inference(spm,[status(thm)],[c_0_47,c_0_44]) ).
cnf(c_0_57,negated_conjecture,
( vertex(tail_of(X1))
| ~ on_path(X1,esk9_0) ),
inference(spm,[status(thm)],[c_0_39,c_0_48]) ).
cnf(c_0_58,negated_conjecture,
on_path(esk7_1(esk9_0),esk9_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_21]),c_0_37]) ).
cnf(c_0_59,plain,
( triangle(X1,X2,X3)
| ~ sequential(X3,X1)
| ~ sequential(X2,X3)
| ~ sequential(X1,X2)
| ~ edge(X3)
| ~ edge(X2)
| ~ edge(X1) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_60,plain,
( edge(X1)
| ~ sequential(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_61,plain,
( X1 = X2
| edge(esk1_2(X1,X2))
| ~ complete
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_62,plain,
( edge(X1)
| ~ on_path(X1,X2)
| ~ path(X3,X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_63,negated_conjecture,
( head_of(esk8_1(esk9_0)) != head_of(X1)
| tail_of(X2) != tail_of(X1)
| ~ sequential(X2,esk8_1(esk9_0))
| ~ on_path(X2,esk9_0) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_64,negated_conjecture,
sequential(esk7_1(esk9_0),esk8_1(esk9_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_21]),c_0_37]) ).
cnf(c_0_65,negated_conjecture,
( tail_of(esk1_2(X1,head_of(esk8_1(esk9_0)))) = head_of(esk8_1(esk9_0))
| tail_of(esk1_2(X1,head_of(esk8_1(esk9_0)))) = X1
| X1 = head_of(esk8_1(esk9_0))
| ~ vertex(X1) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_66,negated_conjecture,
vertex(tail_of(esk7_1(esk9_0))),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_67,plain,
( number_of_in(sequential_pairs,X1) = number_of_in(triangles,X1)
| ~ path(X2,X3,X1)
| ~ triangle(esk7_1(X1),esk8_1(X1),X4) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_68,plain,
( triangle(X1,X2,X3)
| ~ sequential(X3,X1)
| ~ sequential(X2,X3)
| ~ sequential(X1,X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_59,c_0_60]),c_0_60]),c_0_60]) ).
cnf(c_0_69,plain,
( sequential(X1,X2)
| X1 = X2
| head_of(X1) != tail_of(X2)
| ~ edge(X2)
| ~ edge(X1) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_70,plain,
( X1 = X2
| edge(esk1_2(X1,X2))
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_46])]) ).
cnf(c_0_71,negated_conjecture,
( edge(X1)
| ~ on_path(X1,esk9_0) ),
inference(spm,[status(thm)],[c_0_62,c_0_21]) ).
cnf(c_0_72,plain,
( X1 = X2
| X1 = head_of(esk1_2(X1,X2))
| X2 = head_of(esk1_2(X1,X2))
| ~ complete
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
fof(c_0_73,plain,
! [X2] :
( ( vertex(head_of(X2))
| ~ edge(X2) )
& ( vertex(tail_of(X2))
| ~ edge(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[edge_ends_are_vertices])])]) ).
fof(c_0_74,plain,
! [X2] :
( ~ edge(X2)
| head_of(X2) != tail_of(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[no_loops])]) ).
cnf(c_0_75,negated_conjecture,
( head_of(esk8_1(esk9_0)) != head_of(X1)
| tail_of(esk7_1(esk9_0)) != tail_of(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_58])]) ).
cnf(c_0_76,negated_conjecture,
( tail_of(esk1_2(tail_of(esk7_1(esk9_0)),head_of(esk8_1(esk9_0)))) = tail_of(esk7_1(esk9_0))
| tail_of(esk1_2(tail_of(esk7_1(esk9_0)),head_of(esk8_1(esk9_0)))) = head_of(esk8_1(esk9_0))
| tail_of(esk7_1(esk9_0)) = head_of(esk8_1(esk9_0)) ),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_77,plain,
( number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1)
| ~ sequential(X2,esk7_1(X1))
| ~ sequential(esk8_1(X1),X2)
| ~ path(X3,X4,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_54]) ).
cnf(c_0_78,plain,
( esk1_2(X1,X2) = X3
| X1 = X2
| sequential(esk1_2(X1,X2),X3)
| tail_of(X3) != head_of(esk1_2(X1,X2))
| ~ vertex(X2)
| ~ vertex(X1)
| ~ edge(X3) ),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_79,negated_conjecture,
edge(esk8_1(esk9_0)),
inference(spm,[status(thm)],[c_0_71,c_0_44]) ).
cnf(c_0_80,plain,
( head_of(esk1_2(X1,X2)) = X1
| head_of(esk1_2(X1,X2)) = X2
| X1 = X2
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_46])]) ).
cnf(c_0_81,plain,
( vertex(head_of(X1))
| ~ edge(X1) ),
inference(split_conjunct,[status(thm)],[c_0_73]) ).
cnf(c_0_82,plain,
( head_of(X1) != tail_of(X1)
| ~ edge(X1) ),
inference(split_conjunct,[status(thm)],[c_0_74]) ).
cnf(c_0_83,negated_conjecture,
( tail_of(esk1_2(tail_of(esk7_1(esk9_0)),head_of(esk8_1(esk9_0)))) = head_of(esk8_1(esk9_0))
| tail_of(esk7_1(esk9_0)) = head_of(esk8_1(esk9_0))
| head_of(esk1_2(tail_of(esk7_1(esk9_0)),head_of(esk8_1(esk9_0)))) != head_of(esk8_1(esk9_0)) ),
inference(spm,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_84,plain,
( number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1)
| esk1_2(X2,X3) = esk7_1(X1)
| X2 = X3
| tail_of(esk7_1(X1)) != head_of(esk1_2(X2,X3))
| ~ sequential(esk8_1(X1),esk1_2(X2,X3))
| ~ path(X4,X5,X1)
| ~ vertex(X3)
| ~ vertex(X2)
| ~ edge(esk7_1(X1)) ),
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_85,negated_conjecture,
( esk8_1(esk9_0) = X1
| sequential(esk8_1(esk9_0),X1)
| tail_of(X1) != head_of(esk8_1(esk9_0))
| ~ edge(X1) ),
inference(spm,[status(thm)],[c_0_69,c_0_79]) ).
cnf(c_0_86,negated_conjecture,
edge(esk7_1(esk9_0)),
inference(spm,[status(thm)],[c_0_71,c_0_58]) ).
cnf(c_0_87,plain,
( head_of(esk1_2(X1,head_of(X2))) = head_of(X2)
| head_of(esk1_2(X1,head_of(X2))) = X1
| X1 = head_of(X2)
| ~ vertex(X1)
| ~ edge(X2) ),
inference(spm,[status(thm)],[c_0_80,c_0_81]) ).
cnf(c_0_88,negated_conjecture,
( tail_of(esk7_1(esk9_0)) = head_of(esk8_1(esk9_0))
| head_of(esk1_2(tail_of(esk7_1(esk9_0)),head_of(esk8_1(esk9_0)))) != head_of(esk8_1(esk9_0))
| ~ edge(esk1_2(tail_of(esk7_1(esk9_0)),head_of(esk8_1(esk9_0)))) ),
inference(spm,[status(thm)],[c_0_82,c_0_83]) ).
cnf(c_0_89,plain,
( X1 = X2
| X2 = tail_of(esk1_2(X1,X2))
| X2 = head_of(esk1_2(X1,X2))
| ~ complete
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_90,plain,
( ~ precedes(X1,X2,X3)
| ~ shortest_path(X4,X5,X3)
| ~ precedes(X2,X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_91,negated_conjecture,
( esk8_1(esk9_0) = esk1_2(X1,X2)
| esk1_2(X1,X2) = esk7_1(esk9_0)
| X1 = X2
| tail_of(esk7_1(esk9_0)) != head_of(esk1_2(X1,X2))
| tail_of(esk1_2(X1,X2)) != head_of(esk8_1(esk9_0))
| ~ path(X3,X4,esk9_0)
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_86])]),c_0_37]),c_0_70]) ).
cnf(c_0_92,negated_conjecture,
( head_of(esk1_2(tail_of(esk7_1(esk9_0)),head_of(X1))) = tail_of(esk7_1(esk9_0))
| head_of(esk1_2(tail_of(esk7_1(esk9_0)),head_of(X1))) = head_of(X1)
| tail_of(esk7_1(esk9_0)) = head_of(X1)
| ~ edge(X1) ),
inference(spm,[status(thm)],[c_0_87,c_0_66]) ).
cnf(c_0_93,negated_conjecture,
( tail_of(esk7_1(esk9_0)) = head_of(esk8_1(esk9_0))
| head_of(esk1_2(tail_of(esk7_1(esk9_0)),head_of(esk8_1(esk9_0)))) != head_of(esk8_1(esk9_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_70]),c_0_56]),c_0_66])]) ).
cnf(c_0_94,plain,
( tail_of(esk1_2(X1,X2)) = X2
| head_of(esk1_2(X1,X2)) = X2
| X1 = X2
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_89,c_0_46])]) ).
cnf(c_0_95,plain,
( head_of(X1) = tail_of(X2)
| ~ sequential(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_96,negated_conjecture,
( ~ precedes(X1,X2,esk9_0)
| ~ precedes(X2,X1,esk9_0) ),
inference(spm,[status(thm)],[c_0_90,c_0_19]) ).
cnf(c_0_97,plain,
( X1 = X2
| X1 = head_of(esk1_2(X1,X2))
| X1 = tail_of(esk1_2(X1,X2))
| ~ complete
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_98,negated_conjecture,
( esk1_2(X1,X2) = esk7_1(esk9_0)
| esk8_1(esk9_0) = esk1_2(X1,X2)
| X1 = X2
| tail_of(esk7_1(esk9_0)) != head_of(esk1_2(X1,X2))
| tail_of(esk1_2(X1,X2)) != head_of(esk8_1(esk9_0))
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(spm,[status(thm)],[c_0_91,c_0_21]) ).
cnf(c_0_99,negated_conjecture,
( head_of(esk1_2(tail_of(esk7_1(esk9_0)),head_of(esk8_1(esk9_0)))) = tail_of(esk7_1(esk9_0))
| tail_of(esk7_1(esk9_0)) = head_of(esk8_1(esk9_0)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_79]),c_0_93]) ).
cnf(c_0_100,negated_conjecture,
( tail_of(esk1_2(tail_of(esk7_1(esk9_0)),head_of(esk8_1(esk9_0)))) = head_of(esk8_1(esk9_0))
| tail_of(esk7_1(esk9_0)) = head_of(esk8_1(esk9_0)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_76]),c_0_56]),c_0_66])]),c_0_93]) ).
cnf(c_0_101,negated_conjecture,
tail_of(esk8_1(esk9_0)) = head_of(esk7_1(esk9_0)),
inference(spm,[status(thm)],[c_0_95,c_0_64]) ).
cnf(c_0_102,negated_conjecture,
( ~ precedes(esk8_1(esk9_0),X1,esk9_0)
| ~ sequential(X1,esk8_1(esk9_0))
| ~ on_path(X1,esk9_0) ),
inference(spm,[status(thm)],[c_0_96,c_0_53]) ).
cnf(c_0_103,negated_conjecture,
( precedes(X1,esk7_1(esk9_0),esk9_0)
| ~ sequential(X1,esk7_1(esk9_0))
| ~ on_path(X1,esk9_0) ),
inference(spm,[status(thm)],[c_0_43,c_0_58]) ).
cnf(c_0_104,plain,
( tail_of(esk1_2(X1,X2)) = X1
| head_of(esk1_2(X1,X2)) = X1
| X1 = X2
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_97,c_0_46])]) ).
cnf(c_0_105,negated_conjecture,
( esk1_2(tail_of(esk7_1(esk9_0)),head_of(esk8_1(esk9_0))) = esk8_1(esk9_0)
| esk1_2(tail_of(esk7_1(esk9_0)),head_of(esk8_1(esk9_0))) = esk7_1(esk9_0)
| tail_of(esk7_1(esk9_0)) = head_of(esk8_1(esk9_0)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_99]),c_0_56]),c_0_66])]),c_0_100]) ).
cnf(c_0_106,negated_conjecture,
tail_of(esk7_1(esk9_0)) != head_of(esk7_1(esk9_0)),
inference(spm,[status(thm)],[c_0_75,c_0_101]) ).
cnf(c_0_107,negated_conjecture,
~ sequential(esk8_1(esk9_0),esk7_1(esk9_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_103]),c_0_64]),c_0_58]),c_0_44])]) ).
cnf(c_0_108,negated_conjecture,
( esk1_2(tail_of(esk7_1(esk9_0)),head_of(esk8_1(esk9_0))) = esk7_1(esk9_0)
| tail_of(esk7_1(esk9_0)) = head_of(esk8_1(esk9_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_105]),c_0_101]),c_0_56]),c_0_66])]),c_0_106]) ).
cnf(c_0_109,negated_conjecture,
head_of(esk8_1(esk9_0)) != head_of(esk7_1(esk9_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_101]),c_0_79])]) ).
cnf(c_0_110,negated_conjecture,
( esk8_1(esk9_0) = esk7_1(esk9_0)
| tail_of(esk7_1(esk9_0)) != head_of(esk8_1(esk9_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_85]),c_0_86])]) ).
cnf(c_0_111,negated_conjecture,
tail_of(esk7_1(esk9_0)) = head_of(esk8_1(esk9_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_108]),c_0_56]),c_0_66])]),c_0_109]) ).
cnf(c_0_112,negated_conjecture,
esk8_1(esk9_0) = esk7_1(esk9_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_110,c_0_111])]) ).
cnf(c_0_113,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_109,c_0_112])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : GRA012+1 : TPTP v8.1.0. Bugfixed v3.2.0.
% 0.06/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n027.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 : Tue May 31 02:55:17 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.27/11.46 # Running protocol protocol_eprover_63dc1b1eb7d762c2f3686774d32795976f981b97 for 23 seconds:
% 0.27/11.46 # Preprocessing time : 0.018 s
% 0.27/11.46
% 0.27/11.46 # Proof found!
% 0.27/11.46 # SZS status Theorem
% 0.27/11.46 # SZS output start CNFRefutation
% See solution above
% 0.27/11.46 # Proof object total steps : 114
% 0.27/11.46 # Proof object clause steps : 85
% 0.27/11.46 # Proof object formula steps : 29
% 0.27/11.46 # Proof object conjectures : 53
% 0.27/11.46 # Proof object clause conjectures : 50
% 0.27/11.46 # Proof object formula conjectures : 3
% 0.27/11.46 # Proof object initial clauses used : 28
% 0.27/11.46 # Proof object initial formulas used : 14
% 0.27/11.46 # Proof object generating inferences : 47
% 0.27/11.46 # Proof object simplifying inferences : 59
% 0.27/11.46 # Training examples: 0 positive, 0 negative
% 0.27/11.46 # Parsed axioms : 18
% 0.27/11.46 # Removed by relevancy pruning/SinE : 0
% 0.27/11.46 # Initial clauses : 62
% 0.27/11.46 # Removed in clause preprocessing : 1
% 0.27/11.46 # Initial clauses in saturation : 61
% 0.27/11.46 # Processed clauses : 21709
% 0.27/11.46 # ...of these trivial : 177
% 0.27/11.46 # ...subsumed : 15281
% 0.27/11.46 # ...remaining for further processing : 6251
% 0.27/11.46 # Other redundant clauses eliminated : 821
% 0.27/11.46 # Clauses deleted for lack of memory : 171300
% 0.27/11.46 # Backward-subsumed : 1008
% 0.27/11.46 # Backward-rewritten : 2323
% 0.27/11.46 # Generated clauses : 312357
% 0.27/11.46 # ...of the previous two non-trivial : 304375
% 0.27/11.46 # Contextual simplify-reflections : 42760
% 0.27/11.46 # Paramodulations : 310728
% 0.27/11.46 # Factorizations : 281
% 0.27/11.46 # Equation resolutions : 1348
% 0.27/11.46 # Current number of processed clauses : 2918
% 0.27/11.46 # Positive orientable unit clauses : 14
% 0.27/11.46 # Positive unorientable unit clauses: 0
% 0.27/11.46 # Negative unit clauses : 3
% 0.27/11.46 # Non-unit-clauses : 2901
% 0.27/11.46 # Current number of unprocessed clauses: 24820
% 0.27/11.46 # ...number of literals in the above : 242897
% 0.27/11.46 # Current number of archived formulas : 0
% 0.27/11.46 # Current number of archived clauses : 3331
% 0.27/11.46 # Clause-clause subsumption calls (NU) : 7501192
% 0.27/11.46 # Rec. Clause-clause subsumption calls : 334137
% 0.27/11.46 # Non-unit clause-clause subsumptions : 58311
% 0.27/11.46 # Unit Clause-clause subsumption calls : 5546
% 0.27/11.46 # Rewrite failures with RHS unbound : 0
% 0.27/11.46 # BW rewrite match attempts : 7
% 0.27/11.46 # BW rewrite match successes : 6
% 0.27/11.46 # Condensation attempts : 0
% 0.27/11.46 # Condensation successes : 0
% 0.27/11.46 # Termbank termtop insertions : 15341256
% 0.27/11.46
% 0.27/11.46 # -------------------------------------------------
% 0.27/11.46 # User time : 9.944 s
% 0.27/11.46 # System time : 0.104 s
% 0.27/11.46 # Total time : 10.048 s
% 0.27/11.46 # Maximum resident set size: 133876 pages
% 0.27/23.40 eprover: CPU time limit exceeded, terminating
% 0.27/23.41 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.41 eprover: No such file or directory
% 0.27/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.42 eprover: No such file or directory
% 0.27/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.42 eprover: No such file or directory
% 0.27/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.43 eprover: No such file or directory
% 0.27/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.44 eprover: No such file or directory
% 0.27/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.44 eprover: CPU time limit exceeded, terminating
% 0.27/23.44 eprover: No such file or directory
% 0.27/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.45 eprover: No such file or directory
% 0.27/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.45 eprover: No such file or directory
% 0.27/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.27/23.46 eprover: No such file or directory
% 0.27/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.46 eprover: No such file or directory
% 0.27/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.27/23.46 eprover: No such file or directory
% 0.27/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.46 eprover: No such file or directory
% 0.27/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.27/23.47 eprover: No such file or directory
% 0.27/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.47 eprover: No such file or directory
% 0.27/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.27/23.47 eprover: No such file or directory
% 0.27/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.27/23.47 eprover: No such file or directory
% 0.27/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.27/23.48 eprover: No such file or directory
% 0.27/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.27/23.48 eprover: No such file or directory
% 0.27/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.27/23.48 eprover: No such file or directory
% 0.27/23.49 eprover: CPU time limit exceeded, terminating
% 0.27/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.27/23.49 eprover: No such file or directory
% 0.27/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.50 eprover: No such file or directory
% 0.27/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.50 eprover: No such file or directory
% 0.27/23.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.51 eprover: No such file or directory
% 0.27/23.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.51 eprover: No such file or directory
% 0.27/23.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.52 eprover: No such file or directory
% 0.27/23.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.52 eprover: No such file or directory
% 0.27/23.53 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.53 eprover: No such file or directory
% 0.27/23.53 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.53 eprover: No such file or directory
% 0.27/23.54 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.54 eprover: No such file or directory
% 0.27/23.54 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.54 eprover: No such file or directory
% 0.27/23.55 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.27/23.55 eprover: No such file or directory
%------------------------------------------------------------------------------