%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : GRA006+1 : TPTP v8.1.0. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n019.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:07 EDT 2022
% Result : Theorem 0.23s 1.42s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 10
% Syntax : Number of formulae : 91 ( 15 unt; 0 def)
% Number of atoms : 432 ( 145 equ)
% Maximal formula atoms : 37 ( 4 avg)
% Number of connectives : 556 ( 215 ~; 252 |; 68 &)
% ( 2 <=>; 14 =>; 1 <=; 4 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 2 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 7 con; 0-4 aty)
% Number of variables : 216 ( 43 sgn 84 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(edge_some_way,conjecture,
( complete
=> ! [X2,X3,X7,X8,X4] :
( ( shortest_path(X2,X3,X4)
& precedes(X7,X8,X4) )
=> ( ? [X9] :
( edge(X9)
& tail_of(X9) = tail_of(X7)
& head_of(X9) = head_of(X8) )
<~> ? [X9] :
( edge(X9)
& tail_of(X9) = head_of(X8)
& head_of(X9) = tail_of(X7) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',edge_some_way) ).
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/sandbox2/benchmark/Axioms/GRA001+0.ax',in_path_properties) ).
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/sandbox2/benchmark/Axioms/GRA001+0.ax',shortest_path_defn) ).
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/sandbox2/benchmark/Axioms/GRA001+0.ax',on_path_properties) ).
fof(precedes_properties,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/sandbox2/benchmark/Axioms/GRA001+0.ax',precedes_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/sandbox2/benchmark/Axioms/GRA001+0.ax',complete_properties) ).
fof(edge_ends_are_vertices,axiom,
! [X1] :
( edge(X1)
=> ( vertex(head_of(X1))
& vertex(tail_of(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRA001+0.ax',edge_ends_are_vertices) ).
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/sandbox2/benchmark/Axioms/GRA001+0.ax',shortest_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/sandbox2/benchmark/Axioms/GRA001+0.ax',precedes_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/sandbox2/benchmark/Axioms/GRA001+0.ax',sequential_defn) ).
fof(c_0_10,negated_conjecture,
~ ( complete
=> ! [X2,X3,X7,X8,X4] :
( ( shortest_path(X2,X3,X4)
& precedes(X7,X8,X4) )
=> ( ? [X9] :
( edge(X9)
& tail_of(X9) = tail_of(X7)
& head_of(X9) = head_of(X8) )
<~> ? [X9] :
( edge(X9)
& tail_of(X9) = head_of(X8)
& head_of(X9) = tail_of(X7) ) ) ) ),
inference(assume_negation,[status(cth)],[edge_some_way]) ).
fof(c_0_11,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_12,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_13,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_14,plain,
! [X10,X11,X12,X13,X14,X15] :
( ( on_path(X13,X10)
| ~ precedes(X13,X14,X10)
| ~ path(X11,X12,X10) )
& ( on_path(X14,X10)
| ~ precedes(X13,X14,X10)
| ~ path(X11,X12,X10) )
& ( ~ sequential(X13,X14)
| ~ sequential(X13,X15)
| ~ precedes(X15,X14,X10)
| ~ precedes(X13,X14,X10)
| ~ path(X11,X12,X10) )
& ( sequential(X13,esk5_3(X10,X13,X14))
| sequential(X13,X14)
| ~ precedes(X13,X14,X10)
| ~ path(X11,X12,X10) )
& ( precedes(esk5_3(X10,X13,X14),X14,X10)
| sequential(X13,X14)
| ~ precedes(X13,X14,X10)
| ~ path(X11,X12,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)],[inference(fof_simplification,[status(thm)],[precedes_properties])])])])])])])]) ).
fof(c_0_15,negated_conjecture,
! [X15,X17] :
( complete
& shortest_path(esk9_0,esk10_0,esk13_0)
& precedes(esk11_0,esk12_0,esk13_0)
& ( edge(esk14_0)
| ~ edge(X15)
| tail_of(X15) != tail_of(esk11_0)
| head_of(X15) != head_of(esk12_0) )
& ( tail_of(esk14_0) = head_of(esk12_0)
| ~ edge(X15)
| tail_of(X15) != tail_of(esk11_0)
| head_of(X15) != head_of(esk12_0) )
& ( head_of(esk14_0) = tail_of(esk11_0)
| ~ edge(X15)
| tail_of(X15) != tail_of(esk11_0)
| head_of(X15) != head_of(esk12_0) )
& ( edge(esk15_0)
| ~ edge(X17)
| tail_of(X17) != head_of(esk12_0)
| head_of(X17) != tail_of(esk11_0) )
& ( tail_of(esk15_0) = tail_of(esk11_0)
| ~ edge(X17)
| tail_of(X17) != head_of(esk12_0)
| head_of(X17) != tail_of(esk11_0) )
& ( head_of(esk15_0) = head_of(esk12_0)
| ~ edge(X17)
| tail_of(X17) != head_of(esk12_0)
| head_of(X17) != tail_of(esk11_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_10])])])])])])])]) ).
cnf(c_0_16,plain,
( vertex(X1)
| ~ in_path(X1,X2)
| ~ path(X3,X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( path(X1,X2,X3)
| ~ shortest_path(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
( in_path(head_of(X1),X2)
| ~ on_path(X1,X2)
| ~ path(X3,X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
( on_path(X5,X3)
| ~ path(X1,X2,X3)
| ~ precedes(X4,X5,X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,negated_conjecture,
precedes(esk11_0,esk12_0,esk13_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_21,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_22,plain,
( vertex(X1)
| ~ shortest_path(X2,X3,X4)
| ~ in_path(X1,X4) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,negated_conjecture,
shortest_path(esk9_0,esk10_0,esk13_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,plain,
( in_path(head_of(X1),X2)
| ~ shortest_path(X3,X4,X2)
| ~ on_path(X1,X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_17]) ).
cnf(c_0_25,negated_conjecture,
( on_path(esk12_0,esk13_0)
| ~ path(X1,X2,esk13_0) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,plain,
( on_path(X4,X3)
| ~ path(X1,X2,X3)
| ~ precedes(X4,X5,X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_27,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_21]) ).
cnf(c_0_28,negated_conjecture,
complete,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_29,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])])]) ).
cnf(c_0_30,negated_conjecture,
( vertex(X1)
| ~ in_path(X1,esk13_0) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_31,negated_conjecture,
( in_path(head_of(X1),esk13_0)
| ~ on_path(X1,esk13_0) ),
inference(spm,[status(thm)],[c_0_24,c_0_23]) ).
cnf(c_0_32,negated_conjecture,
( on_path(esk12_0,esk13_0)
| ~ shortest_path(X1,X2,esk13_0) ),
inference(spm,[status(thm)],[c_0_25,c_0_17]) ).
cnf(c_0_33,plain,
( edge(X1)
| ~ on_path(X1,X2)
| ~ path(X3,X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_34,negated_conjecture,
( on_path(esk11_0,esk13_0)
| ~ path(X1,X2,esk13_0) ),
inference(spm,[status(thm)],[c_0_26,c_0_20]) ).
fof(c_0_35,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_36,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_27,c_0_28])]) ).
cnf(c_0_37,plain,
( vertex(tail_of(X1))
| ~ edge(X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_38,negated_conjecture,
( vertex(head_of(X1))
| ~ on_path(X1,esk13_0) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_39,negated_conjecture,
on_path(esk12_0,esk13_0),
inference(spm,[status(thm)],[c_0_32,c_0_23]) ).
cnf(c_0_40,plain,
( edge(X1)
| ~ shortest_path(X2,X3,X4)
| ~ on_path(X1,X4) ),
inference(spm,[status(thm)],[c_0_33,c_0_17]) ).
cnf(c_0_41,negated_conjecture,
( on_path(esk11_0,esk13_0)
| ~ shortest_path(X1,X2,esk13_0) ),
inference(spm,[status(thm)],[c_0_34,c_0_17]) ).
cnf(c_0_42,plain,
( in_path(tail_of(X1),X2)
| ~ on_path(X1,X2)
| ~ path(X3,X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_43,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_35]) ).
cnf(c_0_44,plain,
( head_of(esk1_2(X1,tail_of(X2))) = tail_of(X2)
| head_of(esk1_2(X1,tail_of(X2))) = X1
| X1 = tail_of(X2)
| ~ vertex(X1)
| ~ edge(X2) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_45,negated_conjecture,
vertex(head_of(esk12_0)),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_46,negated_conjecture,
( edge(X1)
| ~ on_path(X1,esk13_0) ),
inference(spm,[status(thm)],[c_0_40,c_0_23]) ).
cnf(c_0_47,negated_conjecture,
on_path(esk11_0,esk13_0),
inference(spm,[status(thm)],[c_0_41,c_0_23]) ).
cnf(c_0_48,plain,
( in_path(tail_of(X1),X2)
| ~ shortest_path(X3,X4,X2)
| ~ on_path(X1,X2) ),
inference(spm,[status(thm)],[c_0_42,c_0_17]) ).
cnf(c_0_49,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_21]) ).
cnf(c_0_50,negated_conjecture,
( head_of(X1) != head_of(X2)
| tail_of(X3) != tail_of(X2)
| ~ precedes(X3,X1,esk13_0) ),
inference(spm,[status(thm)],[c_0_43,c_0_23]) ).
cnf(c_0_51,negated_conjecture,
( head_of(esk1_2(head_of(esk12_0),tail_of(X1))) = head_of(esk12_0)
| head_of(esk1_2(head_of(esk12_0),tail_of(X1))) = tail_of(X1)
| head_of(esk12_0) = tail_of(X1)
| ~ edge(X1) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_52,negated_conjecture,
edge(esk11_0),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_53,negated_conjecture,
( in_path(tail_of(X1),esk13_0)
| ~ on_path(X1,esk13_0) ),
inference(spm,[status(thm)],[c_0_48,c_0_23]) ).
cnf(c_0_54,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_49,c_0_28])]) ).
cnf(c_0_55,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_21]) ).
cnf(c_0_56,negated_conjecture,
( head_of(esk12_0) != head_of(X1)
| tail_of(esk11_0) != tail_of(X1) ),
inference(spm,[status(thm)],[c_0_50,c_0_20]) ).
cnf(c_0_57,negated_conjecture,
( head_of(esk1_2(head_of(esk12_0),tail_of(esk11_0))) = tail_of(esk11_0)
| head_of(esk1_2(head_of(esk12_0),tail_of(esk11_0))) = head_of(esk12_0)
| head_of(esk12_0) = tail_of(esk11_0) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_58,negated_conjecture,
( vertex(tail_of(X1))
| ~ on_path(X1,esk13_0) ),
inference(spm,[status(thm)],[c_0_30,c_0_53]) ).
fof(c_0_59,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])])])])])])]) ).
cnf(c_0_60,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_21]) ).
cnf(c_0_61,plain,
( X1 = X2
| edge(esk1_2(X1,X2))
| ~ complete
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_62,plain,
( tail_of(esk1_2(X1,tail_of(X2))) = tail_of(X2)
| tail_of(esk1_2(X1,tail_of(X2))) = X1
| X1 = tail_of(X2)
| ~ vertex(X1)
| ~ edge(X2) ),
inference(spm,[status(thm)],[c_0_54,c_0_37]) ).
cnf(c_0_63,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_55,c_0_28])]) ).
cnf(c_0_64,negated_conjecture,
( head_of(esk1_2(head_of(esk12_0),tail_of(esk11_0))) = tail_of(esk11_0)
| head_of(esk12_0) = tail_of(esk11_0)
| tail_of(esk1_2(head_of(esk12_0),tail_of(esk11_0))) != tail_of(esk11_0) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_65,negated_conjecture,
vertex(tail_of(esk11_0)),
inference(spm,[status(thm)],[c_0_58,c_0_47]) ).
cnf(c_0_66,plain,
( ~ precedes(X1,X2,X3)
| ~ shortest_path(X4,X5,X3)
| ~ precedes(X2,X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_67,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_59]) ).
cnf(c_0_68,negated_conjecture,
( head_of(esk15_0) = head_of(esk12_0)
| head_of(X1) != tail_of(esk11_0)
| tail_of(X1) != head_of(esk12_0)
| ~ edge(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_69,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_60,c_0_28])]) ).
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_28])]) ).
cnf(c_0_71,negated_conjecture,
( tail_of(esk1_2(head_of(esk12_0),tail_of(X1))) = head_of(esk12_0)
| tail_of(esk1_2(head_of(esk12_0),tail_of(X1))) = tail_of(X1)
| head_of(esk12_0) = tail_of(X1)
| ~ edge(X1) ),
inference(spm,[status(thm)],[c_0_62,c_0_45]) ).
cnf(c_0_72,negated_conjecture,
( tail_of(esk1_2(head_of(esk12_0),tail_of(esk11_0))) = head_of(esk12_0)
| head_of(esk12_0) = tail_of(esk11_0)
| tail_of(esk1_2(head_of(esk12_0),tail_of(esk11_0))) != tail_of(esk11_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_65]),c_0_45])]) ).
cnf(c_0_73,negated_conjecture,
( tail_of(esk15_0) = tail_of(esk11_0)
| head_of(X1) != tail_of(esk11_0)
| tail_of(X1) != head_of(esk12_0)
| ~ edge(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_74,negated_conjecture,
( ~ precedes(X1,X2,esk13_0)
| ~ precedes(X2,X1,esk13_0) ),
inference(spm,[status(thm)],[c_0_66,c_0_23]) ).
cnf(c_0_75,plain,
( precedes(X1,X2,X3)
| ~ shortest_path(X4,X5,X3)
| ~ sequential(X1,X2)
| ~ on_path(X2,X3)
| ~ on_path(X1,X3) ),
inference(spm,[status(thm)],[c_0_67,c_0_17]) ).
cnf(c_0_76,negated_conjecture,
( head_of(esk15_0) = head_of(esk12_0)
| tail_of(esk1_2(X1,X2)) = X2
| X1 = X2
| tail_of(esk1_2(X1,X2)) != head_of(esk12_0)
| X2 != tail_of(esk11_0)
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_70]) ).
cnf(c_0_77,negated_conjecture,
( tail_of(esk1_2(head_of(esk12_0),tail_of(esk11_0))) = head_of(esk12_0)
| head_of(esk12_0) = tail_of(esk11_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_52]),c_0_72]) ).
cnf(c_0_78,negated_conjecture,
( tail_of(esk15_0) = tail_of(esk11_0)
| tail_of(esk1_2(X1,X2)) = X2
| X1 = X2
| tail_of(esk1_2(X1,X2)) != head_of(esk12_0)
| X2 != tail_of(esk11_0)
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_69]),c_0_70]) ).
cnf(c_0_79,negated_conjecture,
~ precedes(esk12_0,esk11_0,esk13_0),
inference(spm,[status(thm)],[c_0_74,c_0_20]) ).
cnf(c_0_80,negated_conjecture,
( precedes(X1,X2,esk13_0)
| ~ sequential(X1,X2)
| ~ on_path(X2,esk13_0)
| ~ on_path(X1,esk13_0) ),
inference(spm,[status(thm)],[c_0_75,c_0_23]) ).
fof(c_0_81,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_82,negated_conjecture,
( head_of(esk12_0) = tail_of(esk11_0)
| head_of(esk15_0) = head_of(esk12_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_65]),c_0_45])]) ).
cnf(c_0_83,negated_conjecture,
( head_of(esk12_0) = tail_of(esk11_0)
| tail_of(esk15_0) = tail_of(esk11_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_77]),c_0_65]),c_0_45])]) ).
cnf(c_0_84,negated_conjecture,
~ sequential(esk12_0,esk11_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_47]),c_0_39])]) ).
cnf(c_0_85,plain,
( sequential(X1,X2)
| X1 = X2
| head_of(X1) != tail_of(X2)
| ~ edge(X2)
| ~ edge(X1) ),
inference(split_conjunct,[status(thm)],[c_0_81]) ).
cnf(c_0_86,negated_conjecture,
head_of(esk12_0) = tail_of(esk11_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_82]),c_0_83]) ).
cnf(c_0_87,negated_conjecture,
edge(esk12_0),
inference(spm,[status(thm)],[c_0_46,c_0_39]) ).
cnf(c_0_88,negated_conjecture,
tail_of(esk12_0) != tail_of(esk11_0),
inference(er,[status(thm)],[c_0_56]) ).
cnf(c_0_89,negated_conjecture,
esk12_0 = esk11_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_86]),c_0_52]),c_0_87])]) ).
cnf(c_0_90,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_88,c_0_89])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : GRA006+1 : TPTP v8.1.0. Bugfixed v3.2.0.
% 0.11/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n019.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue May 31 02:10:56 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.23/1.42 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.23/1.42 # Preprocessing time : 0.018 s
% 0.23/1.42
% 0.23/1.42 # Proof found!
% 0.23/1.42 # SZS status Theorem
% 0.23/1.42 # SZS output start CNFRefutation
% See solution above
% 0.23/1.42 # Proof object total steps : 91
% 0.23/1.42 # Proof object clause steps : 70
% 0.23/1.42 # Proof object formula steps : 21
% 0.23/1.42 # Proof object conjectures : 44
% 0.23/1.42 # Proof object clause conjectures : 41
% 0.23/1.42 # Proof object formula conjectures : 3
% 0.23/1.42 # Proof object initial clauses used : 22
% 0.23/1.42 # Proof object initial formulas used : 10
% 0.23/1.42 # Proof object generating inferences : 42
% 0.23/1.42 # Proof object simplifying inferences : 32
% 0.23/1.42 # Training examples: 0 positive, 0 negative
% 0.23/1.42 # Parsed axioms : 18
% 0.23/1.42 # Removed by relevancy pruning/SinE : 0
% 0.23/1.42 # Initial clauses : 68
% 0.23/1.42 # Removed in clause preprocessing : 1
% 0.23/1.42 # Initial clauses in saturation : 67
% 0.23/1.42 # Processed clauses : 724
% 0.23/1.42 # ...of these trivial : 67
% 0.23/1.42 # ...subsumed : 201
% 0.23/1.42 # ...remaining for further processing : 456
% 0.23/1.42 # Other redundant clauses eliminated : 37
% 0.23/1.42 # Clauses deleted for lack of memory : 0
% 0.23/1.42 # Backward-subsumed : 21
% 0.23/1.42 # Backward-rewritten : 129
% 0.23/1.42 # Generated clauses : 4511
% 0.23/1.42 # ...of the previous two non-trivial : 4235
% 0.23/1.42 # Contextual simplify-reflections : 157
% 0.23/1.42 # Paramodulations : 4376
% 0.23/1.42 # Factorizations : 72
% 0.23/1.42 # Equation resolutions : 60
% 0.23/1.42 # Current number of processed clauses : 303
% 0.23/1.42 # Positive orientable unit clauses : 16
% 0.23/1.42 # Positive unorientable unit clauses: 0
% 0.23/1.42 # Negative unit clauses : 3
% 0.23/1.42 # Non-unit-clauses : 284
% 0.23/1.42 # Current number of unprocessed clauses: 2096
% 0.23/1.42 # ...number of literals in the above : 15261
% 0.23/1.42 # Current number of archived formulas : 0
% 0.23/1.42 # Current number of archived clauses : 150
% 0.23/1.42 # Clause-clause subsumption calls (NU) : 28344
% 0.23/1.42 # Rec. Clause-clause subsumption calls : 9013
% 0.23/1.42 # Non-unit clause-clause subsumptions : 329
% 0.23/1.42 # Unit Clause-clause subsumption calls : 828
% 0.23/1.42 # Rewrite failures with RHS unbound : 0
% 0.23/1.42 # BW rewrite match attempts : 7
% 0.23/1.42 # BW rewrite match successes : 7
% 0.23/1.42 # Condensation attempts : 0
% 0.23/1.42 # Condensation successes : 0
% 0.23/1.42 # Termbank termtop insertions : 120768
% 0.23/1.42
% 0.23/1.42 # -------------------------------------------------
% 0.23/1.42 # User time : 0.133 s
% 0.23/1.42 # System time : 0.007 s
% 0.23/1.42 # Total time : 0.140 s
% 0.23/1.42 # Maximum resident set size: 6720 pages
% 0.23/23.42 eprover: CPU time limit exceeded, terminating
% 0.23/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.43 eprover: No such file or directory
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.46 eprover: CPU time limit exceeded, terminating
% 0.23/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.47 eprover: No such file or directory
% 0.23/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.47 eprover: No such file or directory
% 0.23/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.47 eprover: No such file or directory
% 0.23/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.47 eprover: No such file or directory
% 0.23/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.48 eprover: No such file or directory
% 0.23/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.48 eprover: No such file or directory
% 0.23/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.48 eprover: No such file or directory
% 0.23/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.48 eprover: No such file or directory
% 0.23/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.48 eprover: No such file or directory
% 0.23/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.49 eprover: No such file or directory
% 0.23/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.49 eprover: No such file or directory
% 0.23/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.49 eprover: No such file or directory
% 0.23/23.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.50 eprover: No such file or directory
% 0.23/23.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.50 eprover: No such file or directory
%------------------------------------------------------------------------------