%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GRA002+2 : TPTP v8.1.0. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n029.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:15:22 EDT 2022
% Result : Theorem 12.54s 2.97s
% Output : CNFRefutation 12.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 20
% Syntax : Number of clauses : 81 ( 13 unt; 26 nHn; 79 RR)
% Number of literals : 285 ( 87 equ; 180 neg)
% Maximal clause size : 9 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 2 prp; 0-3 aty)
% Number of functors : 15 ( 15 usr; 7 con; 0-4 aty)
% Number of variables : 211 ( 60 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_59,plain,
( triangle(X1,X2,X3)
| ~ edge(X3)
| ~ edge(X2)
| ~ edge(X1)
| ~ sequential(X3,X1)
| ~ sequential(X2,X3)
| ~ sequential(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9qf4xpnt/lgb.p',i_0_59) ).
cnf(i_0_47,plain,
( edge(X1)
| ~ sequential(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9qf4xpnt/lgb.p',i_0_47) ).
cnf(i_0_48,plain,
( number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1)
| ~ path(X2,X3,X1)
| ~ triangle(esk10_1(X1),esk11_1(X1),X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9qf4xpnt/lgb.p',i_0_48) ).
cnf(i_0_49,plain,
( number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1)
| sequential(esk10_1(X1),esk11_1(X1))
| ~ path(X2,X3,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9qf4xpnt/lgb.p',i_0_49) ).
cnf(i_0_23,plain,
( edge(X1)
| ~ on_path(X1,X2)
| ~ path(X3,X4,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9qf4xpnt/lgb.p',i_0_23) ).
cnf(i_0_56,plain,
( path(X1,X2,X3)
| ~ shortest_path(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9qf4xpnt/lgb.p',i_0_56) ).
cnf(i_0_50,plain,
( number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1)
| on_path(esk11_1(X1),X1)
| ~ path(X2,X3,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9qf4xpnt/lgb.p',i_0_50) ).
cnf(i_0_26,plain,
( minus(length_of(X1),n1) = number_of_in(sequential_pairs,X1)
| ~ path(X2,X3,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9qf4xpnt/lgb.p',i_0_26) ).
cnf(i_0_43,plain,
( X1 = X2
| sequential(X1,X2)
| head_of(X1) != tail_of(X2)
| ~ edge(X2)
| ~ edge(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9qf4xpnt/lgb.p',i_0_43) ).
cnf(i_0_46,plain,
( edge(X1)
| ~ sequential(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9qf4xpnt/lgb.p',i_0_46) ).
cnf(i_0_18,negated_conjecture,
shortest_path(esk5_0,esk6_0,esk4_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9qf4xpnt/lgb.p',i_0_18) ).
cnf(i_0_51,plain,
( number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1)
| on_path(esk10_1(X1),X1)
| ~ path(X2,X3,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9qf4xpnt/lgb.p',i_0_51) ).
cnf(i_0_17,negated_conjecture,
~ less_or_equal(minus(length_of(esk4_0),n1),number_of_in(triangles,graph)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9qf4xpnt/lgb.p',i_0_17) ).
cnf(i_0_37,plain,
( precedes(X1,X2,X3)
| ~ on_path(X2,X3)
| ~ on_path(X1,X3)
| ~ sequential(X1,X2)
| ~ path(X4,X5,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9qf4xpnt/lgb.p',i_0_37) ).
cnf(i_0_12,plain,
less_or_equal(number_of_in(X1,X2),number_of_in(X1,graph)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9qf4xpnt/lgb.p',i_0_12) ).
cnf(i_0_1,lemma,
( head_of(esk1_4(X1,X2,X3,X4)) = tail_of(X3)
| ~ complete
| ~ shortest_path(X1,X2,X5)
| ~ precedes(X3,X4,X5) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9qf4xpnt/lgb.p',i_0_1) ).
cnf(i_0_19,negated_conjecture,
complete,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9qf4xpnt/lgb.p',i_0_19) ).
cnf(i_0_3,lemma,
( edge(esk1_4(X1,X2,X3,X4))
| ~ complete
| ~ shortest_path(X1,X2,X5)
| ~ precedes(X3,X4,X5) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9qf4xpnt/lgb.p',i_0_3) ).
cnf(i_0_2,lemma,
( tail_of(esk1_4(X1,X2,X3,X4)) = head_of(X4)
| ~ complete
| ~ shortest_path(X1,X2,X5)
| ~ precedes(X3,X4,X5) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9qf4xpnt/lgb.p',i_0_2) ).
cnf(i_0_20,plain,
( tail_of(X1) != head_of(X1)
| ~ edge(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9qf4xpnt/lgb.p',i_0_20) ).
cnf(c_0_80,plain,
( triangle(X1,X2,X3)
| ~ edge(X3)
| ~ edge(X2)
| ~ edge(X1)
| ~ sequential(X3,X1)
| ~ sequential(X2,X3)
| ~ sequential(X1,X2) ),
i_0_59 ).
cnf(c_0_81,plain,
( edge(X1)
| ~ sequential(X1,X2) ),
i_0_47 ).
cnf(c_0_82,plain,
( number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1)
| ~ path(X2,X3,X1)
| ~ triangle(esk10_1(X1),esk11_1(X1),X4) ),
i_0_48 ).
cnf(c_0_83,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_80,c_0_81]),c_0_81]),c_0_81]) ).
cnf(c_0_84,plain,
( number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1)
| sequential(esk10_1(X1),esk11_1(X1))
| ~ path(X2,X3,X1) ),
i_0_49 ).
cnf(c_0_85,plain,
( edge(X1)
| ~ on_path(X1,X2)
| ~ path(X3,X4,X2) ),
i_0_23 ).
cnf(c_0_86,plain,
( path(X1,X2,X3)
| ~ shortest_path(X1,X2,X3) ),
i_0_56 ).
cnf(c_0_87,plain,
( number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1)
| on_path(esk11_1(X1),X1)
| ~ path(X2,X3,X1) ),
i_0_50 ).
cnf(c_0_88,plain,
( minus(length_of(X1),n1) = number_of_in(sequential_pairs,X1)
| ~ path(X2,X3,X1) ),
i_0_26 ).
cnf(c_0_89,plain,
( number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1)
| ~ sequential(X2,esk10_1(X1))
| ~ sequential(esk11_1(X1),X2)
| ~ path(X3,X4,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_84]) ).
cnf(c_0_90,plain,
( X1 = X2
| sequential(X1,X2)
| head_of(X1) != tail_of(X2)
| ~ edge(X2)
| ~ edge(X1) ),
i_0_43 ).
cnf(c_0_91,plain,
( edge(X1)
| ~ sequential(X2,X1) ),
i_0_46 ).
cnf(c_0_92,plain,
( edge(X1)
| ~ on_path(X1,X2)
| ~ shortest_path(X3,X4,X2) ),
inference(spm,[status(thm)],[c_0_85,c_0_86]) ).
cnf(c_0_93,negated_conjecture,
shortest_path(esk5_0,esk6_0,esk4_0),
i_0_18 ).
cnf(c_0_94,plain,
( number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1)
| on_path(esk11_1(X1),X1)
| ~ shortest_path(X2,X3,X1) ),
inference(spm,[status(thm)],[c_0_87,c_0_86]) ).
cnf(c_0_95,plain,
( minus(length_of(X1),n1) = number_of_in(sequential_pairs,X1)
| ~ shortest_path(X2,X3,X1) ),
inference(spm,[status(thm)],[c_0_88,c_0_86]) ).
cnf(c_0_96,plain,
( number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1)
| on_path(esk10_1(X1),X1)
| ~ path(X2,X3,X1) ),
i_0_51 ).
cnf(c_0_97,plain,
( number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1)
| X2 = esk10_1(X1)
| head_of(X2) != tail_of(esk10_1(X1))
| ~ sequential(esk11_1(X1),X2)
| ~ edge(esk10_1(X1))
| ~ path(X3,X4,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_90]),c_0_91]) ).
cnf(c_0_98,negated_conjecture,
( edge(X1)
| ~ on_path(X1,esk4_0) ),
inference(spm,[status(thm)],[c_0_92,c_0_93]) ).
cnf(c_0_99,negated_conjecture,
( number_of_in(triangles,esk4_0) = number_of_in(sequential_pairs,esk4_0)
| on_path(esk11_1(esk4_0),esk4_0) ),
inference(spm,[status(thm)],[c_0_94,c_0_93]) ).
cnf(c_0_100,negated_conjecture,
~ less_or_equal(minus(length_of(esk4_0),n1),number_of_in(triangles,graph)),
i_0_17 ).
cnf(c_0_101,negated_conjecture,
minus(length_of(esk4_0),n1) = number_of_in(sequential_pairs,esk4_0),
inference(spm,[status(thm)],[c_0_95,c_0_93]) ).
cnf(c_0_102,plain,
( number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1)
| on_path(esk10_1(X1),X1)
| ~ shortest_path(X2,X3,X1) ),
inference(spm,[status(thm)],[c_0_96,c_0_86]) ).
cnf(c_0_103,plain,
( precedes(X1,X2,X3)
| ~ on_path(X2,X3)
| ~ on_path(X1,X3)
| ~ sequential(X1,X2)
| ~ path(X4,X5,X3) ),
i_0_37 ).
cnf(c_0_104,plain,
( number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1)
| esk11_1(X1) = X2
| X2 = esk10_1(X1)
| head_of(X2) != tail_of(esk10_1(X1))
| head_of(esk11_1(X1)) != tail_of(X2)
| ~ edge(esk10_1(X1))
| ~ edge(esk11_1(X1))
| ~ edge(X2)
| ~ path(X3,X4,X1) ),
inference(spm,[status(thm)],[c_0_97,c_0_90]) ).
cnf(c_0_105,plain,
less_or_equal(number_of_in(X1,X2),number_of_in(X1,graph)),
i_0_12 ).
cnf(c_0_106,negated_conjecture,
( number_of_in(triangles,esk4_0) = number_of_in(sequential_pairs,esk4_0)
| edge(esk11_1(esk4_0)) ),
inference(spm,[status(thm)],[c_0_98,c_0_99]) ).
cnf(c_0_107,negated_conjecture,
~ less_or_equal(number_of_in(sequential_pairs,esk4_0),number_of_in(triangles,graph)),
inference(rw,[status(thm)],[c_0_100,c_0_101]) ).
cnf(c_0_108,negated_conjecture,
( number_of_in(triangles,esk4_0) = number_of_in(sequential_pairs,esk4_0)
| on_path(esk10_1(esk4_0),esk4_0) ),
inference(spm,[status(thm)],[c_0_102,c_0_93]) ).
cnf(c_0_109,lemma,
( head_of(esk1_4(X1,X2,X3,X4)) = tail_of(X3)
| ~ complete
| ~ shortest_path(X1,X2,X5)
| ~ precedes(X3,X4,X5) ),
i_0_1 ).
cnf(c_0_110,negated_conjecture,
complete,
i_0_19 ).
cnf(c_0_111,plain,
( precedes(X1,X2,X3)
| ~ sequential(X1,X2)
| ~ on_path(X2,X3)
| ~ on_path(X1,X3)
| ~ shortest_path(X4,X5,X3) ),
inference(spm,[status(thm)],[c_0_103,c_0_86]) ).
cnf(c_0_112,lemma,
( edge(esk1_4(X1,X2,X3,X4))
| ~ complete
| ~ shortest_path(X1,X2,X5)
| ~ precedes(X3,X4,X5) ),
i_0_3 ).
cnf(c_0_113,plain,
( number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1)
| X2 = esk10_1(X1)
| esk11_1(X1) = X2
| head_of(X2) != tail_of(esk10_1(X1))
| head_of(esk11_1(X1)) != tail_of(X2)
| ~ edge(esk10_1(X1))
| ~ edge(esk11_1(X1))
| ~ edge(X2)
| ~ shortest_path(X3,X4,X1) ),
inference(spm,[status(thm)],[c_0_104,c_0_86]) ).
cnf(c_0_114,plain,
edge(esk11_1(esk4_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_106]),c_0_107]) ).
cnf(c_0_115,negated_conjecture,
( number_of_in(triangles,esk4_0) = number_of_in(sequential_pairs,esk4_0)
| edge(esk10_1(esk4_0)) ),
inference(spm,[status(thm)],[c_0_98,c_0_108]) ).
cnf(c_0_116,lemma,
( head_of(esk1_4(X1,X2,X3,X4)) = tail_of(X3)
| ~ precedes(X3,X4,X5)
| ~ shortest_path(X1,X2,X5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_109,c_0_110])]) ).
cnf(c_0_117,negated_conjecture,
( precedes(X1,X2,esk4_0)
| ~ sequential(X1,X2)
| ~ on_path(X2,esk4_0)
| ~ on_path(X1,esk4_0) ),
inference(spm,[status(thm)],[c_0_111,c_0_93]) ).
cnf(c_0_118,lemma,
( edge(esk1_4(X1,X2,X3,X4))
| ~ precedes(X3,X4,X5)
| ~ shortest_path(X1,X2,X5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_112,c_0_110])]) ).
cnf(c_0_119,lemma,
( tail_of(esk1_4(X1,X2,X3,X4)) = head_of(X4)
| ~ complete
| ~ shortest_path(X1,X2,X5)
| ~ precedes(X3,X4,X5) ),
i_0_2 ).
cnf(c_0_120,negated_conjecture,
( number_of_in(triangles,esk4_0) = number_of_in(sequential_pairs,esk4_0)
| esk11_1(esk4_0) = X1
| X1 = esk10_1(esk4_0)
| head_of(X1) != tail_of(esk10_1(esk4_0))
| tail_of(X1) != head_of(esk11_1(esk4_0))
| ~ edge(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_113,c_0_93]),c_0_114])]),c_0_115]) ).
cnf(c_0_121,lemma,
( head_of(esk1_4(X1,X2,X3,X4)) = tail_of(X3)
| ~ sequential(X3,X4)
| ~ on_path(X4,esk4_0)
| ~ on_path(X3,esk4_0)
| ~ shortest_path(X1,X2,esk4_0) ),
inference(spm,[status(thm)],[c_0_116,c_0_117]) ).
cnf(c_0_122,lemma,
( edge(esk1_4(X1,X2,X3,X4))
| ~ sequential(X3,X4)
| ~ on_path(X4,esk4_0)
| ~ on_path(X3,esk4_0)
| ~ shortest_path(X1,X2,esk4_0) ),
inference(spm,[status(thm)],[c_0_118,c_0_117]) ).
cnf(c_0_123,lemma,
( tail_of(esk1_4(X1,X2,X3,X4)) = head_of(X4)
| ~ precedes(X3,X4,X5)
| ~ shortest_path(X1,X2,X5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_119,c_0_110])]) ).
cnf(c_0_124,lemma,
( number_of_in(triangles,esk4_0) = number_of_in(sequential_pairs,esk4_0)
| esk1_4(X1,X2,X3,X4) = esk10_1(esk4_0)
| esk1_4(X1,X2,X3,X4) = esk11_1(esk4_0)
| tail_of(esk1_4(X1,X2,X3,X4)) != head_of(esk11_1(esk4_0))
| tail_of(X3) != tail_of(esk10_1(esk4_0))
| ~ sequential(X3,X4)
| ~ on_path(X4,esk4_0)
| ~ on_path(X3,esk4_0)
| ~ shortest_path(X1,X2,esk4_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_120,c_0_121]),c_0_122]) ).
cnf(c_0_125,lemma,
( tail_of(esk1_4(X1,X2,X3,X4)) = head_of(X4)
| ~ sequential(X3,X4)
| ~ on_path(X4,esk4_0)
| ~ on_path(X3,esk4_0)
| ~ shortest_path(X1,X2,esk4_0) ),
inference(spm,[status(thm)],[c_0_123,c_0_117]) ).
cnf(c_0_126,plain,
( tail_of(X1) != head_of(X1)
| ~ edge(X1) ),
i_0_20 ).
cnf(c_0_127,lemma,
( number_of_in(triangles,esk4_0) = number_of_in(sequential_pairs,esk4_0)
| esk1_4(X1,X2,X3,X4) = esk11_1(esk4_0)
| esk1_4(X1,X2,X3,X4) = esk10_1(esk4_0)
| head_of(X4) != head_of(esk11_1(esk4_0))
| tail_of(X3) != tail_of(esk10_1(esk4_0))
| ~ sequential(X3,X4)
| ~ on_path(X4,esk4_0)
| ~ on_path(X3,esk4_0)
| ~ shortest_path(X1,X2,esk4_0) ),
inference(spm,[status(thm)],[c_0_124,c_0_125]) ).
cnf(c_0_128,plain,
( head_of(esk1_4(X1,X2,X3,X4)) != head_of(X4)
| ~ sequential(X3,X4)
| ~ on_path(X4,esk4_0)
| ~ on_path(X3,esk4_0)
| ~ shortest_path(X1,X2,esk4_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_126,c_0_125]),c_0_122]) ).
cnf(c_0_129,lemma,
( number_of_in(triangles,esk4_0) = number_of_in(sequential_pairs,esk4_0)
| esk1_4(X1,X2,X3,X4) = esk11_1(esk4_0)
| tail_of(esk10_1(esk4_0)) = head_of(X4)
| head_of(X4) != head_of(esk11_1(esk4_0))
| tail_of(X3) != tail_of(esk10_1(esk4_0))
| ~ sequential(X3,X4)
| ~ on_path(X4,esk4_0)
| ~ on_path(X3,esk4_0)
| ~ shortest_path(X1,X2,esk4_0) ),
inference(spm,[status(thm)],[c_0_125,c_0_127]) ).
cnf(c_0_130,plain,
( tail_of(X1) != head_of(X2)
| ~ sequential(X1,X2)
| ~ on_path(X2,esk4_0)
| ~ on_path(X1,esk4_0)
| ~ shortest_path(X3,X4,esk4_0) ),
inference(spm,[status(thm)],[c_0_128,c_0_121]) ).
cnf(c_0_131,plain,
( number_of_in(triangles,esk4_0) = number_of_in(sequential_pairs,esk4_0)
| tail_of(esk10_1(esk4_0)) = head_of(X1)
| head_of(esk11_1(esk4_0)) != head_of(X1)
| tail_of(X2) != tail_of(esk10_1(esk4_0))
| ~ sequential(X2,X1)
| ~ on_path(X1,esk4_0)
| ~ on_path(X2,esk4_0)
| ~ shortest_path(X3,X4,esk4_0) ),
inference(spm,[status(thm)],[c_0_128,c_0_129]) ).
cnf(c_0_132,negated_conjecture,
( tail_of(X1) != head_of(X2)
| ~ sequential(X1,X2)
| ~ on_path(X2,esk4_0)
| ~ on_path(X1,esk4_0) ),
inference(spm,[status(thm)],[c_0_130,c_0_93]) ).
cnf(c_0_133,plain,
( number_of_in(triangles,X1) = number_of_in(sequential_pairs,X1)
| sequential(esk10_1(X1),esk11_1(X1))
| ~ shortest_path(X2,X3,X1) ),
inference(spm,[status(thm)],[c_0_84,c_0_86]) ).
cnf(c_0_134,negated_conjecture,
( number_of_in(triangles,esk4_0) = number_of_in(sequential_pairs,esk4_0)
| tail_of(esk10_1(esk4_0)) = head_of(X1)
| head_of(esk11_1(esk4_0)) != head_of(X1)
| tail_of(X2) != tail_of(esk10_1(esk4_0))
| ~ sequential(X2,X1)
| ~ on_path(X1,esk4_0)
| ~ on_path(X2,esk4_0) ),
inference(spm,[status(thm)],[c_0_131,c_0_93]) ).
cnf(c_0_135,negated_conjecture,
( number_of_in(triangles,esk4_0) = number_of_in(sequential_pairs,esk4_0)
| tail_of(X1) != head_of(esk11_1(esk4_0))
| ~ sequential(X1,esk11_1(esk4_0))
| ~ on_path(X1,esk4_0) ),
inference(spm,[status(thm)],[c_0_132,c_0_99]) ).
cnf(c_0_136,negated_conjecture,
( number_of_in(triangles,esk4_0) = number_of_in(sequential_pairs,esk4_0)
| sequential(esk10_1(esk4_0),esk11_1(esk4_0)) ),
inference(spm,[status(thm)],[c_0_133,c_0_93]) ).
cnf(c_0_137,negated_conjecture,
( number_of_in(triangles,esk4_0) = number_of_in(sequential_pairs,esk4_0)
| tail_of(esk10_1(esk4_0)) = head_of(X1)
| head_of(esk11_1(esk4_0)) != head_of(X1)
| ~ sequential(esk10_1(esk4_0),X1)
| ~ on_path(X1,esk4_0) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_134]),c_0_108]) ).
cnf(c_0_138,negated_conjecture,
( number_of_in(triangles,esk4_0) = number_of_in(sequential_pairs,esk4_0)
| tail_of(esk10_1(esk4_0)) != head_of(esk11_1(esk4_0)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_135,c_0_108]),c_0_136]) ).
cnf(c_0_139,negated_conjecture,
number_of_in(triangles,esk4_0) = number_of_in(sequential_pairs,esk4_0),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_137,c_0_136]),c_0_99]),c_0_138]) ).
cnf(c_0_140,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_139]),c_0_107]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : GRA002+2 : TPTP v8.1.0. Bugfixed v3.2.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n029.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 01:33:16 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.44 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.44 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.44 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.44 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 12.54/2.97 # ENIGMATIC: Solved by autoschedule-lgb:
% 12.54/2.97 # No SInE strategy applied
% 12.54/2.97 # Trying AutoSched0 for 150 seconds
% 12.54/2.97 # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y
% 12.54/2.97 # and selection function SelectMaxLComplexAvoidPosPred.
% 12.54/2.97 #
% 12.54/2.97 # Preprocessing time : 0.012 s
% 12.54/2.97
% 12.54/2.97 # Proof found!
% 12.54/2.97 # SZS status Theorem
% 12.54/2.97 # SZS output start CNFRefutation
% See solution above
% 12.54/2.97 # Training examples: 0 positive, 0 negative
% 12.54/2.97
% 12.54/2.97 # -------------------------------------------------
% 12.54/2.97 # User time : 0.686 s
% 12.54/2.97 # System time : 0.014 s
% 12.54/2.97 # Total time : 0.700 s
% 12.54/2.97 # Maximum resident set size: 7128 pages
% 12.54/2.97
%------------------------------------------------------------------------------