%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : GRA002+1 : TPTP v8.1.0. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n020.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:06 EDT 2022
% Result : Theorem 0.22s 1.40s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 29
% Number of leaves : 12
% Syntax : Number of formulae : 115 ( 11 unt; 0 def)
% Number of atoms : 517 ( 221 equ)
% Maximal formula atoms : 37 ( 4 avg)
% Number of connectives : 623 ( 221 ~; 331 |; 52 &)
% ( 3 <=>; 14 =>; 1 <=; 1 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 12 ( 10 usr; 2 prp; 0-3 aty)
% Number of functors : 16 ( 16 usr; 7 con; 0-3 aty)
% Number of variables : 195 ( 34 sgn 81 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(maximal_path_length,conjecture,
( complete
=> ! [X4,X2,X3] :
( shortest_path(X2,X3,X4)
=> less_or_equal(minus(length_of(X4),n1),number_of_in(triangles,graph)) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',maximal_path_length) ).
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(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(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.mepo_128.in',sequential_pairs_and_triangles) ).
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(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(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(no_loops,axiom,
! [X1] :
( edge(X1)
=> head_of(X1) != tail_of(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/GRA001+0.ax',no_loops) ).
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.mepo_128.in',triangle_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.mepo_128.in',path_length_sequential_pairs) ).
fof(graph_has_them_all,axiom,
! [X11,X12] : less_or_equal(number_of_in(X11,X12),number_of_in(X11,graph)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',graph_has_them_all) ).
fof(c_0_12,negated_conjecture,
~ ( complete
=> ! [X4,X2,X3] :
( shortest_path(X2,X3,X4)
=> less_or_equal(minus(length_of(X4),n1),number_of_in(triangles,graph)) ) ),
inference(assume_negation,[status(cth)],[maximal_path_length]) ).
fof(c_0_13,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,esk4_3(X11,X12,X13))
| ~ path(X11,X12,X13)
| X11 = X12
| shortest_path(X11,X12,X13) )
& ( ~ less_or_equal(length_of(X13),length_of(esk4_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_14,negated_conjecture,
( complete
& shortest_path(esk2_0,esk3_0,esk1_0)
& ~ less_or_equal(minus(length_of(esk1_0),n1),number_of_in(triangles,graph)) ),
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_12])])])])]) ).
fof(c_0_15,plain,
! [X4,X5] :
( ( edge(esk7_2(X4,X5))
| ~ vertex(X4)
| ~ vertex(X5)
| X4 = X5
| ~ complete )
& ( X4 != head_of(esk7_2(X4,X5))
| X5 != tail_of(esk7_2(X4,X5))
| X5 != head_of(esk7_2(X4,X5))
| X4 != tail_of(esk7_2(X4,X5))
| ~ vertex(X4)
| ~ vertex(X5)
| X4 = X5
| ~ complete )
& ( X5 = head_of(esk7_2(X4,X5))
| X4 = head_of(esk7_2(X4,X5))
| ~ vertex(X4)
| ~ vertex(X5)
| X4 = X5
| ~ complete )
& ( X4 = tail_of(esk7_2(X4,X5))
| X4 = head_of(esk7_2(X4,X5))
| ~ vertex(X4)
| ~ vertex(X5)
| X4 = X5
| ~ complete )
& ( X5 = head_of(esk7_2(X4,X5))
| X5 = tail_of(esk7_2(X4,X5))
| ~ vertex(X4)
| ~ vertex(X5)
| X4 = X5
| ~ complete )
& ( X4 = tail_of(esk7_2(X4,X5))
| X5 = tail_of(esk7_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])])])])])])])]) ).
fof(c_0_16,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_17,plain,
( path(X1,X2,X3)
| ~ shortest_path(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,negated_conjecture,
shortest_path(esk2_0,esk3_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_19,plain,
! [X10,X11,X12,X15] :
( ( on_path(esk5_1(X10),X10)
| ~ path(X11,X12,X10)
| number_of_in(sequential_pairs,X10) = number_of_in(triangles,X10) )
& ( on_path(esk6_1(X10),X10)
| ~ path(X11,X12,X10)
| number_of_in(sequential_pairs,X10) = number_of_in(triangles,X10) )
& ( sequential(esk5_1(X10),esk6_1(X10))
| ~ path(X11,X12,X10)
| number_of_in(sequential_pairs,X10) = number_of_in(triangles,X10) )
& ( ~ triangle(esk5_1(X10),esk6_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_20,plain,
( X1 = X2
| X1 = head_of(esk7_2(X1,X2))
| X2 = head_of(esk7_2(X1,X2))
| ~ complete
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,negated_conjecture,
complete,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_22,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_23,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_16]) ).
cnf(c_0_24,negated_conjecture,
path(esk2_0,esk3_0,esk1_0),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_25,plain,
( number_of_in(sequential_pairs,X1) = number_of_in(triangles,X1)
| on_path(esk6_1(X1),X1)
| ~ path(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,plain,
( head_of(esk7_2(X1,X2)) = X1
| head_of(esk7_2(X1,X2)) = X2
| X1 = X2
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]) ).
cnf(c_0_27,plain,
( vertex(tail_of(X1))
| ~ edge(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_28,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_29,plain,
( number_of_in(sequential_pairs,X1) = number_of_in(triangles,X1)
| sequential(esk5_1(X1),esk6_1(X1))
| ~ path(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_30,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_31,negated_conjecture,
( precedes(X1,X2,esk1_0)
| ~ sequential(X1,X2)
| ~ on_path(X2,esk1_0)
| ~ on_path(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_32,negated_conjecture,
( number_of_in(triangles,esk1_0) = number_of_in(sequential_pairs,esk1_0)
| on_path(esk6_1(esk1_0),esk1_0) ),
inference(spm,[status(thm)],[c_0_25,c_0_24]) ).
cnf(c_0_33,plain,
( number_of_in(sequential_pairs,X1) = number_of_in(triangles,X1)
| on_path(esk5_1(X1),X1)
| ~ path(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_34,plain,
( head_of(esk7_2(X1,tail_of(X2))) = tail_of(X2)
| head_of(esk7_2(X1,tail_of(X2))) = X1
| X1 = tail_of(X2)
| ~ vertex(X1)
| ~ edge(X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_35,plain,
( vertex(head_of(X1))
| ~ edge(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_36,plain,
( edge(X1)
| ~ sequential(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_37,negated_conjecture,
( number_of_in(triangles,esk1_0) = number_of_in(sequential_pairs,esk1_0)
| sequential(esk5_1(esk1_0),esk6_1(esk1_0)) ),
inference(spm,[status(thm)],[c_0_29,c_0_24]) ).
cnf(c_0_38,plain,
( X1 = X2
| X2 = tail_of(esk7_2(X1,X2))
| X1 = tail_of(esk7_2(X1,X2))
| ~ complete
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_39,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_30]) ).
cnf(c_0_40,negated_conjecture,
( number_of_in(triangles,esk1_0) = number_of_in(sequential_pairs,esk1_0)
| precedes(X1,esk6_1(esk1_0),esk1_0)
| ~ sequential(X1,esk6_1(esk1_0))
| ~ on_path(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_41,negated_conjecture,
( number_of_in(triangles,esk1_0) = number_of_in(sequential_pairs,esk1_0)
| on_path(esk5_1(esk1_0),esk1_0) ),
inference(spm,[status(thm)],[c_0_33,c_0_24]) ).
cnf(c_0_42,plain,
( head_of(esk7_2(head_of(X1),tail_of(X2))) = head_of(X1)
| head_of(esk7_2(head_of(X1),tail_of(X2))) = tail_of(X2)
| head_of(X1) = tail_of(X2)
| ~ edge(X2)
| ~ edge(X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_43,negated_conjecture,
( number_of_in(triangles,esk1_0) = number_of_in(sequential_pairs,esk1_0)
| edge(esk5_1(esk1_0)) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_44,plain,
( edge(X2)
| ~ sequential(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_45,plain,
( tail_of(esk7_2(X1,X2)) = X1
| tail_of(esk7_2(X1,X2)) = X2
| X1 = X2
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_21])]) ).
cnf(c_0_46,plain,
( X1 = X2
| X2 = tail_of(esk7_2(X1,X2))
| X2 = head_of(esk7_2(X1,X2))
| ~ complete
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_47,plain,
( X1 = X2
| edge(esk7_2(X1,X2))
| ~ complete
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_48,negated_conjecture,
( head_of(X1) != head_of(X2)
| tail_of(X3) != tail_of(X2)
| ~ precedes(X3,X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_39,c_0_18]) ).
cnf(c_0_49,negated_conjecture,
( number_of_in(triangles,esk1_0) = number_of_in(sequential_pairs,esk1_0)
| precedes(esk5_1(esk1_0),esk6_1(esk1_0),esk1_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_37]) ).
cnf(c_0_50,negated_conjecture,
( head_of(esk7_2(head_of(X1),tail_of(esk5_1(esk1_0)))) = tail_of(esk5_1(esk1_0))
| head_of(esk7_2(head_of(X1),tail_of(esk5_1(esk1_0)))) = head_of(X1)
| number_of_in(triangles,esk1_0) = number_of_in(sequential_pairs,esk1_0)
| head_of(X1) = tail_of(esk5_1(esk1_0))
| ~ edge(X1) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_51,negated_conjecture,
( number_of_in(triangles,esk1_0) = number_of_in(sequential_pairs,esk1_0)
| edge(esk6_1(esk1_0)) ),
inference(spm,[status(thm)],[c_0_44,c_0_37]) ).
fof(c_0_52,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_53,plain,
( tail_of(esk7_2(X1,tail_of(X2))) = tail_of(X2)
| tail_of(esk7_2(X1,tail_of(X2))) = X1
| X1 = tail_of(X2)
| ~ vertex(X1)
| ~ edge(X2) ),
inference(spm,[status(thm)],[c_0_45,c_0_27]) ).
cnf(c_0_54,plain,
( sequential(X1,X2)
| X1 = X2
| head_of(X1) != tail_of(X2)
| ~ edge(X2)
| ~ edge(X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_55,plain,
( tail_of(esk7_2(X1,X2)) = X2
| head_of(esk7_2(X1,X2)) = X2
| X1 = X2
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_21])]) ).
cnf(c_0_56,plain,
( X1 = X2
| edge(esk7_2(X1,X2))
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_21])]) ).
cnf(c_0_57,plain,
( X1 = X2
| X1 = head_of(esk7_2(X1,X2))
| X1 = tail_of(esk7_2(X1,X2))
| ~ complete
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_58,negated_conjecture,
( number_of_in(triangles,esk1_0) = number_of_in(sequential_pairs,esk1_0)
| head_of(esk6_1(esk1_0)) != head_of(X1)
| tail_of(esk5_1(esk1_0)) != tail_of(X1) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_59,negated_conjecture,
( head_of(esk7_2(head_of(esk6_1(esk1_0)),tail_of(esk5_1(esk1_0)))) = head_of(esk6_1(esk1_0))
| head_of(esk7_2(head_of(esk6_1(esk1_0)),tail_of(esk5_1(esk1_0)))) = tail_of(esk5_1(esk1_0))
| head_of(esk6_1(esk1_0)) = tail_of(esk5_1(esk1_0))
| number_of_in(triangles,esk1_0) = number_of_in(sequential_pairs,esk1_0) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_60,plain,
( head_of(X1) != tail_of(X1)
| ~ edge(X1) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_61,plain,
( tail_of(esk7_2(head_of(X1),tail_of(X2))) = head_of(X1)
| tail_of(esk7_2(head_of(X1),tail_of(X2))) = tail_of(X2)
| head_of(X1) = tail_of(X2)
| ~ edge(X2)
| ~ edge(X1) ),
inference(spm,[status(thm)],[c_0_53,c_0_35]) ).
cnf(c_0_62,plain,
( tail_of(esk7_2(X1,X2)) = X2
| esk7_2(X1,X2) = X3
| X1 = X2
| sequential(esk7_2(X1,X2),X3)
| tail_of(X3) != X2
| ~ vertex(X2)
| ~ vertex(X1)
| ~ edge(X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56]) ).
cnf(c_0_63,plain,
( tail_of(esk7_2(X1,X2)) = X1
| head_of(esk7_2(X1,X2)) = X1
| X1 = X2
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_21])]) ).
cnf(c_0_64,negated_conjecture,
( head_of(esk7_2(head_of(esk6_1(esk1_0)),tail_of(esk5_1(esk1_0)))) = tail_of(esk5_1(esk1_0))
| head_of(esk6_1(esk1_0)) = tail_of(esk5_1(esk1_0))
| number_of_in(triangles,esk1_0) = number_of_in(sequential_pairs,esk1_0)
| tail_of(esk7_2(head_of(esk6_1(esk1_0)),tail_of(esk5_1(esk1_0)))) != tail_of(esk5_1(esk1_0)) ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_65,negated_conjecture,
( head_of(esk7_2(head_of(esk6_1(esk1_0)),tail_of(esk5_1(esk1_0)))) = tail_of(esk5_1(esk1_0))
| number_of_in(triangles,esk1_0) = number_of_in(sequential_pairs,esk1_0)
| head_of(esk6_1(esk1_0)) = tail_of(esk5_1(esk1_0))
| tail_of(esk7_2(head_of(esk6_1(esk1_0)),tail_of(esk5_1(esk1_0)))) != head_of(esk6_1(esk1_0))
| ~ edge(esk7_2(head_of(esk6_1(esk1_0)),tail_of(esk5_1(esk1_0)))) ),
inference(spm,[status(thm)],[c_0_60,c_0_59]) ).
cnf(c_0_66,negated_conjecture,
( tail_of(esk7_2(head_of(X1),tail_of(esk5_1(esk1_0)))) = tail_of(esk5_1(esk1_0))
| tail_of(esk7_2(head_of(X1),tail_of(esk5_1(esk1_0)))) = head_of(X1)
| number_of_in(triangles,esk1_0) = number_of_in(sequential_pairs,esk1_0)
| head_of(X1) = tail_of(esk5_1(esk1_0))
| ~ edge(X1) ),
inference(spm,[status(thm)],[c_0_61,c_0_43]) ).
cnf(c_0_67,plain,
( tail_of(esk7_2(X1,tail_of(X2))) = tail_of(X2)
| esk7_2(X1,tail_of(X2)) = X2
| X1 = tail_of(X2)
| sequential(esk7_2(X1,tail_of(X2)),X2)
| ~ vertex(X1)
| ~ edge(X2) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_62]),c_0_27]) ).
cnf(c_0_68,negated_conjecture,
( tail_of(esk7_2(head_of(esk6_1(esk1_0)),tail_of(esk5_1(esk1_0)))) = head_of(esk6_1(esk1_0))
| number_of_in(triangles,esk1_0) = number_of_in(sequential_pairs,esk1_0)
| head_of(esk6_1(esk1_0)) = tail_of(esk5_1(esk1_0))
| ~ vertex(tail_of(esk5_1(esk1_0)))
| ~ vertex(head_of(esk6_1(esk1_0))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_45]) ).
cnf(c_0_69,negated_conjecture,
( head_of(esk6_1(esk1_0)) = tail_of(esk5_1(esk1_0))
| number_of_in(triangles,esk1_0) = number_of_in(sequential_pairs,esk1_0)
| vertex(tail_of(esk5_1(esk1_0)))
| tail_of(esk7_2(head_of(esk6_1(esk1_0)),tail_of(esk5_1(esk1_0)))) != head_of(esk6_1(esk1_0))
| ~ edge(esk7_2(head_of(esk6_1(esk1_0)),tail_of(esk5_1(esk1_0)))) ),
inference(spm,[status(thm)],[c_0_35,c_0_65]) ).
cnf(c_0_70,negated_conjecture,
( tail_of(esk7_2(head_of(esk6_1(esk1_0)),tail_of(esk5_1(esk1_0)))) = head_of(esk6_1(esk1_0))
| tail_of(esk7_2(head_of(esk6_1(esk1_0)),tail_of(esk5_1(esk1_0)))) = tail_of(esk5_1(esk1_0))
| head_of(esk6_1(esk1_0)) = tail_of(esk5_1(esk1_0))
| number_of_in(triangles,esk1_0) = number_of_in(sequential_pairs,esk1_0) ),
inference(spm,[status(thm)],[c_0_66,c_0_51]) ).
cnf(c_0_71,negated_conjecture,
( number_of_in(triangles,esk1_0) = number_of_in(sequential_pairs,esk1_0)
| head_of(esk6_1(esk1_0)) = tail_of(esk5_1(esk1_0))
| tail_of(esk7_2(head_of(esk6_1(esk1_0)),tail_of(esk5_1(esk1_0)))) != tail_of(esk5_1(esk1_0))
| ~ edge(esk7_2(head_of(esk6_1(esk1_0)),tail_of(esk5_1(esk1_0)))) ),
inference(spm,[status(thm)],[c_0_60,c_0_64]) ).
cnf(c_0_72,negated_conjecture,
( esk7_2(head_of(esk6_1(esk1_0)),tail_of(esk5_1(esk1_0))) = esk5_1(esk1_0)
| number_of_in(triangles,esk1_0) = number_of_in(sequential_pairs,esk1_0)
| head_of(esk6_1(esk1_0)) = tail_of(esk5_1(esk1_0))
| sequential(esk7_2(head_of(esk6_1(esk1_0)),tail_of(esk5_1(esk1_0))),esk5_1(esk1_0))
| ~ vertex(head_of(esk6_1(esk1_0))) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_27]),c_0_43]) ).
cnf(c_0_73,negated_conjecture,
( number_of_in(triangles,esk1_0) = number_of_in(sequential_pairs,esk1_0)
| head_of(esk6_1(esk1_0)) = tail_of(esk5_1(esk1_0))
| vertex(tail_of(esk5_1(esk1_0)))
| ~ edge(esk7_2(head_of(esk6_1(esk1_0)),tail_of(esk5_1(esk1_0)))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_71]) ).
cnf(c_0_74,negated_conjecture,
( esk7_2(head_of(esk6_1(esk1_0)),tail_of(esk5_1(esk1_0))) = esk5_1(esk1_0)
| head_of(esk6_1(esk1_0)) = tail_of(esk5_1(esk1_0))
| number_of_in(triangles,esk1_0) = number_of_in(sequential_pairs,esk1_0)
| edge(esk7_2(head_of(esk6_1(esk1_0)),tail_of(esk5_1(esk1_0))))
| ~ vertex(head_of(esk6_1(esk1_0))) ),
inference(spm,[status(thm)],[c_0_36,c_0_72]) ).
fof(c_0_75,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])])])])]) ).
cnf(c_0_76,negated_conjecture,
( esk7_2(head_of(esk6_1(esk1_0)),tail_of(esk5_1(esk1_0))) = esk5_1(esk1_0)
| head_of(esk6_1(esk1_0)) = tail_of(esk5_1(esk1_0))
| number_of_in(triangles,esk1_0) = number_of_in(sequential_pairs,esk1_0)
| vertex(tail_of(esk5_1(esk1_0)))
| ~ vertex(head_of(esk6_1(esk1_0))) ),
inference(spm,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_77,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_75]) ).
cnf(c_0_78,negated_conjecture,
( head_of(esk6_1(esk1_0)) = tail_of(esk5_1(esk1_0))
| number_of_in(triangles,esk1_0) = number_of_in(sequential_pairs,esk1_0)
| vertex(tail_of(esk5_1(esk1_0))) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_76]),c_0_27]),c_0_43]) ).
cnf(c_0_79,plain,
( number_of_in(sequential_pairs,X1) = number_of_in(triangles,X1)
| ~ path(X2,X3,X1)
| ~ triangle(esk5_1(X1),esk6_1(X1),X4) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_80,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_77,c_0_36]),c_0_36]),c_0_36]) ).
cnf(c_0_81,negated_conjecture,
( X1 = esk7_2(head_of(esk6_1(esk1_0)),tail_of(esk5_1(esk1_0)))
| number_of_in(triangles,esk1_0) = number_of_in(sequential_pairs,esk1_0)
| head_of(esk6_1(esk1_0)) = tail_of(esk5_1(esk1_0))
| sequential(X1,esk7_2(head_of(esk6_1(esk1_0)),tail_of(esk5_1(esk1_0))))
| head_of(esk6_1(esk1_0)) != head_of(X1)
| ~ edge(esk7_2(head_of(esk6_1(esk1_0)),tail_of(esk5_1(esk1_0))))
| ~ edge(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_70]),c_0_71]) ).
cnf(c_0_82,negated_conjecture,
( number_of_in(triangles,esk1_0) = number_of_in(sequential_pairs,esk1_0)
| vertex(tail_of(esk5_1(esk1_0))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_78]),c_0_51]) ).
cnf(c_0_83,plain,
( number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1)
| ~ sequential(X2,esk5_1(X1))
| ~ sequential(esk6_1(X1),X2)
| ~ path(X3,X4,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_29]) ).
cnf(c_0_84,negated_conjecture,
( X1 = esk7_2(head_of(esk6_1(esk1_0)),tail_of(esk5_1(esk1_0)))
| head_of(esk6_1(esk1_0)) = tail_of(esk5_1(esk1_0))
| number_of_in(triangles,esk1_0) = number_of_in(sequential_pairs,esk1_0)
| sequential(X1,esk7_2(head_of(esk6_1(esk1_0)),tail_of(esk5_1(esk1_0))))
| head_of(esk6_1(esk1_0)) != head_of(X1)
| ~ vertex(head_of(esk6_1(esk1_0)))
| ~ edge(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_56]),c_0_82]) ).
cnf(c_0_85,negated_conjecture,
( esk7_2(head_of(esk6_1(esk1_0)),tail_of(esk5_1(esk1_0))) = esk5_1(esk1_0)
| head_of(esk6_1(esk1_0)) = tail_of(esk5_1(esk1_0))
| number_of_in(triangles,esk1_0) = number_of_in(sequential_pairs,esk1_0)
| ~ sequential(esk6_1(esk1_0),esk7_2(head_of(esk6_1(esk1_0)),tail_of(esk5_1(esk1_0))))
| ~ path(X1,X2,esk1_0)
| ~ vertex(head_of(esk6_1(esk1_0))) ),
inference(spm,[status(thm)],[c_0_83,c_0_72]) ).
cnf(c_0_86,negated_conjecture,
( esk7_2(head_of(esk6_1(esk1_0)),tail_of(esk5_1(esk1_0))) = esk6_1(esk1_0)
| number_of_in(triangles,esk1_0) = number_of_in(sequential_pairs,esk1_0)
| head_of(esk6_1(esk1_0)) = tail_of(esk5_1(esk1_0))
| sequential(esk6_1(esk1_0),esk7_2(head_of(esk6_1(esk1_0)),tail_of(esk5_1(esk1_0))))
| ~ vertex(head_of(esk6_1(esk1_0))) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_84]),c_0_51]) ).
cnf(c_0_87,negated_conjecture,
( esk7_2(head_of(esk6_1(esk1_0)),tail_of(esk5_1(esk1_0))) = esk6_1(esk1_0)
| esk7_2(head_of(esk6_1(esk1_0)),tail_of(esk5_1(esk1_0))) = esk5_1(esk1_0)
| number_of_in(triangles,esk1_0) = number_of_in(sequential_pairs,esk1_0)
| head_of(esk6_1(esk1_0)) = tail_of(esk5_1(esk1_0))
| ~ path(X1,X2,esk1_0)
| ~ vertex(head_of(esk6_1(esk1_0))) ),
inference(spm,[status(thm)],[c_0_85,c_0_86]) ).
cnf(c_0_88,negated_conjecture,
( esk7_2(head_of(esk6_1(esk1_0)),tail_of(esk5_1(esk1_0))) = esk5_1(esk1_0)
| esk7_2(head_of(esk6_1(esk1_0)),tail_of(esk5_1(esk1_0))) = esk6_1(esk1_0)
| head_of(esk6_1(esk1_0)) = tail_of(esk5_1(esk1_0))
| number_of_in(triangles,esk1_0) = number_of_in(sequential_pairs,esk1_0)
| ~ vertex(head_of(esk6_1(esk1_0))) ),
inference(spm,[status(thm)],[c_0_87,c_0_24]) ).
cnf(c_0_89,negated_conjecture,
( esk7_2(head_of(esk6_1(esk1_0)),tail_of(esk5_1(esk1_0))) = esk5_1(esk1_0)
| number_of_in(triangles,esk1_0) = number_of_in(sequential_pairs,esk1_0)
| head_of(esk6_1(esk1_0)) = tail_of(esk5_1(esk1_0))
| esk6_1(esk1_0) != esk5_1(esk1_0)
| ~ vertex(head_of(esk6_1(esk1_0))) ),
inference(ef,[status(thm)],[c_0_88]) ).
cnf(c_0_90,plain,
( head_of(X1) = tail_of(X2)
| ~ sequential(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_91,negated_conjecture,
( head_of(esk6_1(esk1_0)) = tail_of(esk5_1(esk1_0))
| number_of_in(triangles,esk1_0) = number_of_in(sequential_pairs,esk1_0)
| esk6_1(esk1_0) != esk5_1(esk1_0)
| ~ vertex(head_of(esk6_1(esk1_0))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_89]),c_0_43]) ).
cnf(c_0_92,negated_conjecture,
( head_of(esk7_2(head_of(esk6_1(esk1_0)),tail_of(esk5_1(esk1_0)))) = tail_of(esk5_1(esk1_0))
| esk7_2(head_of(esk6_1(esk1_0)),tail_of(esk5_1(esk1_0))) = esk5_1(esk1_0)
| head_of(esk6_1(esk1_0)) = tail_of(esk5_1(esk1_0))
| number_of_in(triangles,esk1_0) = number_of_in(sequential_pairs,esk1_0)
| ~ vertex(head_of(esk6_1(esk1_0))) ),
inference(spm,[status(thm)],[c_0_90,c_0_72]) ).
cnf(c_0_93,negated_conjecture,
( number_of_in(triangles,esk1_0) = number_of_in(sequential_pairs,esk1_0)
| head_of(esk6_1(esk1_0)) = tail_of(esk5_1(esk1_0))
| esk6_1(esk1_0) != esk5_1(esk1_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_35]),c_0_51]) ).
cnf(c_0_94,negated_conjecture,
( tail_of(esk7_2(head_of(esk6_1(esk1_0)),tail_of(esk5_1(esk1_0)))) = head_of(esk6_1(esk1_0))
| esk7_2(head_of(esk6_1(esk1_0)),tail_of(esk5_1(esk1_0))) = esk6_1(esk1_0)
| head_of(esk6_1(esk1_0)) = tail_of(esk5_1(esk1_0))
| number_of_in(triangles,esk1_0) = number_of_in(sequential_pairs,esk1_0)
| ~ vertex(head_of(esk6_1(esk1_0))) ),
inference(spm,[status(thm)],[c_0_90,c_0_86]) ).
cnf(c_0_95,negated_conjecture,
( esk7_2(head_of(esk6_1(esk1_0)),tail_of(esk5_1(esk1_0))) = esk5_1(esk1_0)
| number_of_in(triangles,esk1_0) = number_of_in(sequential_pairs,esk1_0)
| head_of(esk6_1(esk1_0)) = tail_of(esk5_1(esk1_0))
| ~ vertex(head_of(esk6_1(esk1_0))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_88]),c_0_93]) ).
cnf(c_0_96,plain,
( ~ precedes(X1,X2,X3)
| ~ shortest_path(X4,X5,X3)
| ~ precedes(X2,X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_97,negated_conjecture,
( number_of_in(triangles,esk1_0) = number_of_in(sequential_pairs,esk1_0)
| head_of(esk6_1(esk1_0)) = tail_of(esk5_1(esk1_0))
| ~ vertex(head_of(esk6_1(esk1_0))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_95]),c_0_93]) ).
cnf(c_0_98,negated_conjecture,
( ~ precedes(X1,X2,esk1_0)
| ~ precedes(X2,X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_96,c_0_18]) ).
cnf(c_0_99,negated_conjecture,
( head_of(esk6_1(esk1_0)) = tail_of(esk5_1(esk1_0))
| number_of_in(triangles,esk1_0) = number_of_in(sequential_pairs,esk1_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_35]),c_0_51]) ).
cnf(c_0_100,negated_conjecture,
( number_of_in(triangles,esk1_0) = number_of_in(sequential_pairs,esk1_0)
| precedes(X1,esk5_1(esk1_0),esk1_0)
| ~ sequential(X1,esk5_1(esk1_0))
| ~ on_path(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_31,c_0_41]) ).
cnf(c_0_101,negated_conjecture,
( number_of_in(triangles,esk1_0) = number_of_in(sequential_pairs,esk1_0)
| ~ precedes(esk6_1(esk1_0),esk5_1(esk1_0),esk1_0) ),
inference(spm,[status(thm)],[c_0_98,c_0_49]) ).
fof(c_0_102,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_103,negated_conjecture,
( number_of_in(triangles,esk1_0) = number_of_in(sequential_pairs,esk1_0)
| esk6_1(esk1_0) = X1
| sequential(esk6_1(esk1_0),X1)
| tail_of(X1) != tail_of(esk5_1(esk1_0))
| ~ edge(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_99]),c_0_51]) ).
cnf(c_0_104,negated_conjecture,
( number_of_in(triangles,esk1_0) = number_of_in(sequential_pairs,esk1_0)
| ~ sequential(esk6_1(esk1_0),esk5_1(esk1_0)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_32]),c_0_101]) ).
cnf(c_0_105,plain,
( number_of_in(sequential_pairs,X1) = minus(length_of(X1),n1)
| ~ path(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_102]) ).
fof(c_0_106,plain,
! [X13,X14] : less_or_equal(number_of_in(X13,X14),number_of_in(X13,graph)),
inference(variable_rename,[status(thm)],[graph_has_them_all]) ).
cnf(c_0_107,negated_conjecture,
( number_of_in(triangles,esk1_0) = number_of_in(sequential_pairs,esk1_0)
| tail_of(esk6_1(esk1_0)) != tail_of(esk5_1(esk1_0)) ),
inference(er,[status(thm)],[c_0_58]) ).
cnf(c_0_108,negated_conjecture,
( number_of_in(triangles,esk1_0) = number_of_in(sequential_pairs,esk1_0)
| esk6_1(esk1_0) = esk5_1(esk1_0) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_103]),c_0_43]),c_0_104]) ).
cnf(c_0_109,negated_conjecture,
~ less_or_equal(minus(length_of(esk1_0),n1),number_of_in(triangles,graph)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_110,negated_conjecture,
minus(length_of(esk1_0),n1) = number_of_in(sequential_pairs,esk1_0),
inference(spm,[status(thm)],[c_0_105,c_0_24]) ).
cnf(c_0_111,plain,
less_or_equal(number_of_in(X1,X2),number_of_in(X1,graph)),
inference(split_conjunct,[status(thm)],[c_0_106]) ).
cnf(c_0_112,negated_conjecture,
number_of_in(triangles,esk1_0) = number_of_in(sequential_pairs,esk1_0),
inference(spm,[status(thm)],[c_0_107,c_0_108]) ).
cnf(c_0_113,negated_conjecture,
~ less_or_equal(number_of_in(sequential_pairs,esk1_0),number_of_in(triangles,graph)),
inference(rw,[status(thm)],[c_0_109,c_0_110]) ).
cnf(c_0_114,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_112]),c_0_113]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : GRA002+1 : TPTP v8.1.0. Bugfixed v3.2.0.
% 0.06/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n020.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 00:05:08 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.22/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.40 # Preprocessing time : 0.017 s
% 0.22/1.40
% 0.22/1.40 # Proof found!
% 0.22/1.40 # SZS status Theorem
% 0.22/1.40 # SZS output start CNFRefutation
% See solution above
% 0.22/1.40 # Proof object total steps : 115
% 0.22/1.40 # Proof object clause steps : 90
% 0.22/1.40 # Proof object formula steps : 25
% 0.22/1.40 # Proof object conjectures : 57
% 0.22/1.40 # Proof object clause conjectures : 54
% 0.22/1.40 # Proof object formula conjectures : 3
% 0.22/1.40 # Proof object initial clauses used : 26
% 0.22/1.40 # Proof object initial formulas used : 12
% 0.22/1.40 # Proof object generating inferences : 57
% 0.22/1.40 # Proof object simplifying inferences : 38
% 0.22/1.40 # Training examples: 0 positive, 0 negative
% 0.22/1.40 # Parsed axioms : 18
% 0.22/1.40 # Removed by relevancy pruning/SinE : 5
% 0.22/1.40 # Initial clauses : 44
% 0.22/1.40 # Removed in clause preprocessing : 1
% 0.22/1.40 # Initial clauses in saturation : 43
% 0.22/1.40 # Processed clauses : 1738
% 0.22/1.40 # ...of these trivial : 13
% 0.22/1.40 # ...subsumed : 718
% 0.22/1.40 # ...remaining for further processing : 1007
% 0.22/1.40 # Other redundant clauses eliminated : 8
% 0.22/1.40 # Clauses deleted for lack of memory : 0
% 0.22/1.40 # Backward-subsumed : 164
% 0.22/1.40 # Backward-rewritten : 561
% 0.22/1.40 # Generated clauses : 17835
% 0.22/1.40 # ...of the previous two non-trivial : 16159
% 0.22/1.40 # Contextual simplify-reflections : 1886
% 0.22/1.40 # Paramodulations : 17657
% 0.22/1.40 # Factorizations : 80
% 0.22/1.40 # Equation resolutions : 98
% 0.22/1.40 # Current number of processed clauses : 280
% 0.22/1.40 # Positive orientable unit clauses : 6
% 0.22/1.40 # Positive unorientable unit clauses: 0
% 0.22/1.40 # Negative unit clauses : 3
% 0.22/1.40 # Non-unit-clauses : 271
% 0.22/1.40 # Current number of unprocessed clauses: 386
% 0.22/1.40 # ...number of literals in the above : 4424
% 0.22/1.40 # Current number of archived formulas : 0
% 0.22/1.40 # Current number of archived clauses : 725
% 0.22/1.40 # Clause-clause subsumption calls (NU) : 256072
% 0.22/1.40 # Rec. Clause-clause subsumption calls : 25860
% 0.22/1.40 # Non-unit clause-clause subsumptions : 2756
% 0.22/1.40 # Unit Clause-clause subsumption calls : 131
% 0.22/1.40 # Rewrite failures with RHS unbound : 0
% 0.22/1.40 # BW rewrite match attempts : 2
% 0.22/1.40 # BW rewrite match successes : 2
% 0.22/1.40 # Condensation attempts : 0
% 0.22/1.40 # Condensation successes : 0
% 0.22/1.40 # Termbank termtop insertions : 889574
% 0.22/1.40
% 0.22/1.40 # -------------------------------------------------
% 0.22/1.40 # User time : 0.846 s
% 0.22/1.40 # System time : 0.011 s
% 0.22/1.40 # Total time : 0.857 s
% 0.22/1.40 # Maximum resident set size: 16788 pages
% 0.22/23.40 eprover: CPU time limit exceeded, terminating
% 0.22/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.42 eprover: No such file or directory
% 0.22/23.42 eprover: CPU time limit exceeded, terminating
% 0.22/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.42 eprover: No such file or directory
% 0.22/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.43 eprover: No such file or directory
% 0.22/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.43 eprover: No such file or directory
% 0.22/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.44 eprover: No such file or directory
% 0.22/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.44 eprover: No such file or directory
% 0.22/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.44 eprover: No such file or directory
% 0.22/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.44 eprover: No such file or directory
% 0.22/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.45 eprover: No such file or directory
% 0.22/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.45 eprover: No such file or directory
% 0.22/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.45 eprover: No such file or directory
% 0.22/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.45 eprover: No such file or directory
% 0.22/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.46 eprover: No such file or directory
% 0.22/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.46 eprover: No such file or directory
% 0.22/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.47 eprover: No such file or directory
% 0.22/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.47 eprover: No such file or directory
% 0.22/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.47 eprover: No such file or directory
% 0.22/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.47 eprover: No such file or directory
% 0.22/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.48 eprover: No such file or directory
% 0.22/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.48 eprover: No such file or directory
% 0.22/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.48 eprover: No such file or directory
% 0.22/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.49 eprover: No such file or directory
%------------------------------------------------------------------------------