TSTP Solution File: GRA009+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GRA009+2 : TPTP v8.1.0. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n018.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:24 EDT 2022
% Result : Theorem 9.28s 2.44s
% Output : CNFRefutation 9.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 23
% Syntax : Number of clauses : 91 ( 23 unt; 27 nHn; 91 RR)
% Number of literals : 290 ( 99 equ; 174 neg)
% Maximal clause size : 8 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 2 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 150 ( 32 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_56,plain,
( path(X1,X2,X3)
| ~ shortest_path(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ayizkvkp/input.p',i_0_56) ).
cnf(i_0_5,negated_conjecture,
shortest_path(esk2_0,esk3_0,esk1_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ayizkvkp/input.p',i_0_5) ).
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-ayizkvkp/input.p',i_0_37) ).
cnf(i_0_58,plain,
( head_of(X1) != head_of(X2)
| tail_of(X1) != tail_of(X3)
| ~ shortest_path(X4,X5,X6)
| ~ precedes(X3,X2,X6) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ayizkvkp/input.p',i_0_58) ).
cnf(i_0_7,plain,
( X1 = X2
| tail_of(esk6_2(X1,X2)) = X2
| tail_of(esk6_2(X1,X2)) = X1
| ~ complete
| ~ vertex(X2)
| ~ vertex(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ayizkvkp/input.p',i_0_7) ).
cnf(i_0_6,negated_conjecture,
complete,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ayizkvkp/input.p',i_0_6) ).
cnf(i_0_18,plain,
( vertex(X1)
| ~ in_path(X1,X2)
| ~ path(X3,X4,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ayizkvkp/input.p',i_0_18) ).
cnf(i_0_22,plain,
( in_path(head_of(X1),X2)
| ~ on_path(X1,X2)
| ~ path(X3,X4,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ayizkvkp/input.p',i_0_22) ).
cnf(i_0_13,plain,
( vertex(tail_of(X1))
| ~ edge(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ayizkvkp/input.p',i_0_13) ).
cnf(i_0_47,plain,
( edge(X1)
| ~ sequential(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ayizkvkp/input.p',i_0_47) ).
cnf(i_0_2,negated_conjecture,
sequential(esk4_0,esk5_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ayizkvkp/input.p',i_0_2) ).
cnf(i_0_3,negated_conjecture,
on_path(esk5_0,esk1_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ayizkvkp/input.p',i_0_3) ).
cnf(i_0_4,negated_conjecture,
on_path(esk4_0,esk1_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ayizkvkp/input.p',i_0_4) ).
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-ayizkvkp/input.p',i_0_59) ).
cnf(i_0_12,plain,
( X1 = X2
| edge(esk6_2(X1,X2))
| ~ complete
| ~ vertex(X2)
| ~ vertex(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ayizkvkp/input.p',i_0_12) ).
cnf(i_0_46,plain,
( edge(X1)
| ~ sequential(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ayizkvkp/input.p',i_0_46) ).
cnf(i_0_20,plain,
( head_of(X1) != tail_of(X1)
| ~ edge(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ayizkvkp/input.p',i_0_20) ).
cnf(i_0_1,negated_conjecture,
~ triangle(esk4_0,esk5_0,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ayizkvkp/input.p',i_0_1) ).
cnf(i_0_43,plain,
( X1 = X2
| sequential(X1,X2)
| tail_of(X2) != head_of(X1)
| ~ edge(X2)
| ~ edge(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ayizkvkp/input.p',i_0_43) ).
cnf(i_0_9,plain,
( X1 = X2
| head_of(esk6_2(X1,X2)) = X1
| tail_of(esk6_2(X1,X2)) = X1
| ~ complete
| ~ vertex(X2)
| ~ vertex(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ayizkvkp/input.p',i_0_9) ).
cnf(i_0_8,plain,
( X1 = X2
| head_of(esk6_2(X2,X1)) = X1
| tail_of(esk6_2(X2,X1)) = X1
| ~ complete
| ~ vertex(X2)
| ~ vertex(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ayizkvkp/input.p',i_0_8) ).
cnf(i_0_44,plain,
( tail_of(X1) = head_of(X2)
| ~ sequential(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ayizkvkp/input.p',i_0_44) ).
cnf(i_0_57,plain,
( ~ shortest_path(X1,X2,X3)
| ~ precedes(X4,X5,X3)
| ~ precedes(X5,X4,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ayizkvkp/input.p',i_0_57) ).
cnf(c_0_83,plain,
( path(X1,X2,X3)
| ~ shortest_path(X1,X2,X3) ),
i_0_56 ).
cnf(c_0_84,negated_conjecture,
shortest_path(esk2_0,esk3_0,esk1_0),
i_0_5 ).
cnf(c_0_85,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_86,negated_conjecture,
path(esk2_0,esk3_0,esk1_0),
inference(spm,[status(thm)],[c_0_83,c_0_84]) ).
cnf(c_0_87,plain,
( head_of(X1) != head_of(X2)
| tail_of(X1) != tail_of(X3)
| ~ shortest_path(X4,X5,X6)
| ~ precedes(X3,X2,X6) ),
i_0_58 ).
cnf(c_0_88,plain,
( precedes(X1,X2,esk1_0)
| ~ sequential(X1,X2)
| ~ on_path(X2,esk1_0)
| ~ on_path(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_85,c_0_86]) ).
cnf(c_0_89,plain,
( X1 = X2
| tail_of(esk6_2(X1,X2)) = X2
| tail_of(esk6_2(X1,X2)) = X1
| ~ complete
| ~ vertex(X2)
| ~ vertex(X1) ),
i_0_7 ).
cnf(c_0_90,negated_conjecture,
complete,
i_0_6 ).
cnf(c_0_91,plain,
( vertex(X1)
| ~ in_path(X1,X2)
| ~ path(X3,X4,X2) ),
i_0_18 ).
cnf(c_0_92,plain,
( in_path(head_of(X1),X2)
| ~ on_path(X1,X2)
| ~ path(X3,X4,X2) ),
i_0_22 ).
cnf(c_0_93,plain,
( head_of(X1) != head_of(X2)
| tail_of(X1) != tail_of(X3)
| ~ shortest_path(X4,X5,esk1_0)
| ~ sequential(X3,X2)
| ~ on_path(X2,esk1_0)
| ~ on_path(X3,esk1_0) ),
inference(spm,[status(thm)],[c_0_87,c_0_88]) ).
cnf(c_0_94,plain,
( tail_of(esk6_2(X1,X2)) = X1
| tail_of(esk6_2(X1,X2)) = X2
| X1 = X2
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_89,c_0_90])]) ).
cnf(c_0_95,plain,
( vertex(tail_of(X1))
| ~ edge(X1) ),
i_0_13 ).
cnf(c_0_96,plain,
( edge(X1)
| ~ sequential(X1,X2) ),
i_0_47 ).
cnf(c_0_97,negated_conjecture,
sequential(esk4_0,esk5_0),
i_0_2 ).
cnf(c_0_98,plain,
( vertex(X1)
| ~ in_path(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_91,c_0_86]) ).
cnf(c_0_99,plain,
( in_path(head_of(X1),esk1_0)
| ~ on_path(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_92,c_0_86]) ).
cnf(c_0_100,negated_conjecture,
( head_of(X1) != head_of(X2)
| tail_of(X1) != tail_of(X3)
| ~ sequential(X3,X2)
| ~ on_path(X2,esk1_0)
| ~ on_path(X3,esk1_0) ),
inference(spm,[status(thm)],[c_0_93,c_0_84]) ).
cnf(c_0_101,negated_conjecture,
on_path(esk5_0,esk1_0),
i_0_3 ).
cnf(c_0_102,plain,
( tail_of(esk6_2(X1,tail_of(X2))) = tail_of(X2)
| tail_of(esk6_2(X1,tail_of(X2))) = X1
| X1 = tail_of(X2)
| ~ edge(X2)
| ~ vertex(X1) ),
inference(spm,[status(thm)],[c_0_94,c_0_95]) ).
cnf(c_0_103,negated_conjecture,
edge(esk4_0),
inference(spm,[status(thm)],[c_0_96,c_0_97]) ).
cnf(c_0_104,plain,
( vertex(head_of(X1))
| ~ on_path(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_98,c_0_99]) ).
cnf(c_0_105,negated_conjecture,
( head_of(X1) != head_of(esk5_0)
| tail_of(X1) != tail_of(X2)
| ~ sequential(X2,esk5_0)
| ~ on_path(X2,esk1_0) ),
inference(spm,[status(thm)],[c_0_100,c_0_101]) ).
cnf(c_0_106,negated_conjecture,
on_path(esk4_0,esk1_0),
i_0_4 ).
cnf(c_0_107,negated_conjecture,
( tail_of(esk6_2(X1,tail_of(esk4_0))) = tail_of(esk4_0)
| tail_of(esk6_2(X1,tail_of(esk4_0))) = X1
| X1 = tail_of(esk4_0)
| ~ vertex(X1) ),
inference(spm,[status(thm)],[c_0_102,c_0_103]) ).
cnf(c_0_108,negated_conjecture,
vertex(head_of(esk5_0)),
inference(spm,[status(thm)],[c_0_104,c_0_101]) ).
cnf(c_0_109,negated_conjecture,
( head_of(X1) != head_of(esk5_0)
| tail_of(X1) != tail_of(esk4_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_106]),c_0_97])]) ).
cnf(c_0_110,negated_conjecture,
( tail_of(esk6_2(head_of(esk5_0),tail_of(esk4_0))) = head_of(esk5_0)
| tail_of(esk6_2(head_of(esk5_0),tail_of(esk4_0))) = tail_of(esk4_0)
| tail_of(esk4_0) = head_of(esk5_0) ),
inference(spm,[status(thm)],[c_0_107,c_0_108]) ).
cnf(c_0_111,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_112,plain,
( X1 = X2
| edge(esk6_2(X1,X2))
| ~ complete
| ~ vertex(X2)
| ~ vertex(X1) ),
i_0_12 ).
cnf(c_0_113,plain,
( edge(X1)
| ~ sequential(X2,X1) ),
i_0_46 ).
cnf(c_0_114,plain,
( head_of(X1) != tail_of(X1)
| ~ edge(X1) ),
i_0_20 ).
cnf(c_0_115,negated_conjecture,
( tail_of(esk6_2(head_of(esk5_0),tail_of(esk4_0))) = head_of(esk5_0)
| tail_of(esk4_0) = head_of(esk5_0)
| head_of(esk6_2(head_of(esk5_0),tail_of(esk4_0))) != head_of(esk5_0) ),
inference(spm,[status(thm)],[c_0_109,c_0_110]) ).
cnf(c_0_116,negated_conjecture,
~ triangle(esk4_0,esk5_0,X1),
i_0_1 ).
cnf(c_0_117,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_111,c_0_96]),c_0_96]),c_0_96]) ).
cnf(c_0_118,plain,
( X1 = X2
| sequential(X1,X2)
| tail_of(X2) != head_of(X1)
| ~ edge(X2)
| ~ edge(X1) ),
i_0_43 ).
cnf(c_0_119,plain,
( X1 = X2
| edge(esk6_2(X1,X2))
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_112,c_0_90])]) ).
cnf(c_0_120,negated_conjecture,
edge(esk5_0),
inference(spm,[status(thm)],[c_0_113,c_0_97]) ).
cnf(c_0_121,plain,
( X1 = X2
| head_of(esk6_2(X1,X2)) = X1
| tail_of(esk6_2(X1,X2)) = X1
| ~ complete
| ~ vertex(X2)
| ~ vertex(X1) ),
i_0_9 ).
cnf(c_0_122,plain,
( tail_of(esk4_0) = head_of(esk5_0)
| head_of(esk6_2(head_of(esk5_0),tail_of(esk4_0))) != head_of(esk5_0)
| ~ edge(esk6_2(head_of(esk5_0),tail_of(esk4_0))) ),
inference(spm,[status(thm)],[c_0_114,c_0_115]) ).
cnf(c_0_123,negated_conjecture,
( ~ sequential(X1,esk4_0)
| ~ sequential(esk5_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_116,c_0_117]),c_0_97])]) ).
cnf(c_0_124,plain,
( esk6_2(X1,X2) = X3
| X1 = X2
| sequential(esk6_2(X1,X2),X3)
| tail_of(X3) != head_of(esk6_2(X1,X2))
| ~ edge(X3)
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(spm,[status(thm)],[c_0_118,c_0_119]) ).
cnf(c_0_125,plain,
( esk5_0 = X1
| sequential(esk5_0,X1)
| tail_of(X1) != head_of(esk5_0)
| ~ edge(X1) ),
inference(spm,[status(thm)],[c_0_118,c_0_120]) ).
cnf(c_0_126,plain,
( tail_of(esk6_2(X1,X2)) = X1
| head_of(esk6_2(X1,X2)) = X1
| X1 = X2
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_121,c_0_90])]) ).
cnf(c_0_127,plain,
( X1 = X2
| head_of(esk6_2(X2,X1)) = X1
| tail_of(esk6_2(X2,X1)) = X1
| ~ complete
| ~ vertex(X2)
| ~ vertex(X1) ),
i_0_8 ).
cnf(c_0_128,plain,
( tail_of(esk4_0) = head_of(esk5_0)
| head_of(esk6_2(head_of(esk5_0),tail_of(esk4_0))) != head_of(esk5_0)
| ~ vertex(tail_of(esk4_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_122,c_0_119]),c_0_108])]) ).
cnf(c_0_129,negated_conjecture,
( esk6_2(X1,X2) = esk4_0
| X1 = X2
| head_of(esk6_2(X1,X2)) != tail_of(esk4_0)
| ~ vertex(X2)
| ~ vertex(X1)
| ~ sequential(esk5_0,esk6_2(X1,X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_123,c_0_124]),c_0_103])]) ).
cnf(c_0_130,plain,
( head_of(esk6_2(X1,X2)) = X1
| esk6_2(X1,X2) = esk5_0
| X1 = X2
| sequential(esk5_0,esk6_2(X1,X2))
| X1 != head_of(esk5_0)
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_125,c_0_126]),c_0_119]) ).
cnf(c_0_131,plain,
( tail_of(esk6_2(X1,X2)) = X2
| head_of(esk6_2(X1,X2)) = X2
| X2 = X1
| ~ vertex(X1)
| ~ vertex(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_127,c_0_90])]) ).
cnf(c_0_132,plain,
( tail_of(esk6_2(head_of(esk5_0),tail_of(esk4_0))) = head_of(esk5_0)
| tail_of(esk4_0) = head_of(esk5_0)
| ~ vertex(tail_of(esk4_0)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_126,c_0_110]),c_0_108])]),c_0_128]) ).
cnf(c_0_133,plain,
( tail_of(X1) = head_of(X2)
| ~ sequential(X2,X1) ),
i_0_44 ).
cnf(c_0_134,plain,
( ~ shortest_path(X1,X2,X3)
| ~ precedes(X4,X5,X3)
| ~ precedes(X5,X4,X3) ),
i_0_57 ).
cnf(c_0_135,negated_conjecture,
( head_of(esk6_2(X1,X2)) = X1
| esk6_2(X1,X2) = esk5_0
| esk6_2(X1,X2) = esk4_0
| X1 = X2
| head_of(esk6_2(X1,X2)) != tail_of(esk4_0)
| X1 != head_of(esk5_0)
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(spm,[status(thm)],[c_0_129,c_0_130]) ).
cnf(c_0_136,plain,
( head_of(esk6_2(head_of(esk5_0),tail_of(esk4_0))) = tail_of(esk4_0)
| tail_of(esk4_0) = head_of(esk5_0)
| ~ vertex(tail_of(esk4_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_131,c_0_132]),c_0_108])]) ).
cnf(c_0_137,negated_conjecture,
tail_of(esk5_0) = head_of(esk4_0),
inference(spm,[status(thm)],[c_0_133,c_0_97]) ).
cnf(c_0_138,plain,
( ~ precedes(X1,X2,esk1_0)
| ~ shortest_path(X3,X4,esk1_0)
| ~ sequential(X2,X1)
| ~ on_path(X1,esk1_0)
| ~ on_path(X2,esk1_0) ),
inference(spm,[status(thm)],[c_0_134,c_0_88]) ).
cnf(c_0_139,negated_conjecture,
( esk6_2(head_of(esk5_0),tail_of(esk4_0)) = esk4_0
| esk6_2(head_of(esk5_0),tail_of(esk4_0)) = esk5_0
| tail_of(esk4_0) = head_of(esk5_0)
| ~ vertex(tail_of(esk4_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_135,c_0_136]),c_0_108])]) ).
cnf(c_0_140,negated_conjecture,
tail_of(esk4_0) != head_of(esk4_0),
inference(spm,[status(thm)],[c_0_109,c_0_137]) ).
cnf(c_0_141,plain,
( ~ shortest_path(X1,X2,esk1_0)
| ~ sequential(X3,X4)
| ~ sequential(X4,X3)
| ~ on_path(X4,esk1_0)
| ~ on_path(X3,esk1_0) ),
inference(spm,[status(thm)],[c_0_138,c_0_88]) ).
cnf(c_0_142,plain,
( esk6_2(head_of(esk5_0),tail_of(esk4_0)) = esk4_0
| tail_of(esk4_0) = head_of(esk5_0)
| ~ vertex(tail_of(esk4_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_131,c_0_139]),c_0_137]),c_0_108])]),c_0_140]) ).
cnf(c_0_143,plain,
head_of(esk5_0) != head_of(esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_114,c_0_137]),c_0_120])]) ).
cnf(c_0_144,negated_conjecture,
( ~ sequential(X1,X2)
| ~ sequential(X2,X1)
| ~ on_path(X2,esk1_0)
| ~ on_path(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_141,c_0_84]) ).
cnf(c_0_145,plain,
( tail_of(esk4_0) = head_of(esk5_0)
| ~ vertex(tail_of(esk4_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_126,c_0_142]),c_0_108])]),c_0_143]) ).
cnf(c_0_146,negated_conjecture,
( ~ sequential(X1,esk5_0)
| ~ sequential(esk5_0,X1)
| ~ on_path(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_144,c_0_101]) ).
cnf(c_0_147,plain,
tail_of(esk4_0) = head_of(esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_145,c_0_95]),c_0_103])]) ).
cnf(c_0_148,negated_conjecture,
~ sequential(esk5_0,esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_146,c_0_106]),c_0_97])]) ).
cnf(c_0_149,plain,
esk5_0 = esk4_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_125,c_0_147]),c_0_103])]),c_0_148]) ).
cnf(c_0_150,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_143,c_0_149])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRA009+2 : TPTP v8.1.0. Bugfixed v3.2.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n018.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon May 30 22:34:59 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.46 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 9.28/2.44 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 9.28/2.44 # Version: 2.1pre011
% 9.28/2.44 # Preprocessing time : 0.010 s
% 9.28/2.44
% 9.28/2.44 # Proof found!
% 9.28/2.44 # SZS status Theorem
% 9.28/2.44 # SZS output start CNFRefutation
% See solution above
% 9.28/2.44 # Proof object total steps : 91
% 9.28/2.44 # Proof object clause steps : 68
% 9.28/2.44 # Proof object formula steps : 23
% 9.28/2.44 # Proof object conjectures : 31
% 9.28/2.44 # Proof object clause conjectures : 25
% 9.28/2.44 # Proof object formula conjectures : 6
% 9.28/2.44 # Proof object initial clauses used : 23
% 9.28/2.44 # Proof object initial formulas used : 23
% 9.28/2.44 # Proof object generating inferences : 39
% 9.28/2.44 # Proof object simplifying inferences : 45
% 9.28/2.44 # Training examples: 0 positive, 0 negative
% 9.28/2.44 # Parsed axioms : 64
% 9.28/2.44 # Removed by relevancy pruning/SinE : 0
% 9.28/2.44 # Initial clauses : 64
% 9.28/2.44 # Removed in clause preprocessing : 0
% 9.28/2.44 # Initial clauses in saturation : 64
% 9.28/2.44 # Processed clauses : 1726
% 9.28/2.44 # ...of these trivial : 48
% 9.28/2.44 # ...subsumed : 585
% 9.28/2.44 # ...remaining for further processing : 1093
% 9.28/2.44 # Other redundant clauses eliminated : 29
% 9.28/2.44 # Clauses deleted for lack of memory : 0
% 9.28/2.44 # Backward-subsumed : 123
% 9.28/2.44 # Backward-rewritten : 451
% 9.28/2.44 # Generated clauses : 6617
% 9.28/2.44 # ...of the previous two non-trivial : 6217
% 9.28/2.44 # Contextual simplify-reflections : 840
% 9.28/2.44 # Paramodulations : 6482
% 9.28/2.44 # Factorizations : 53
% 9.28/2.44 # Equation resolutions : 82
% 9.28/2.44 # Propositional unsat checks : 0
% 9.28/2.44 # Propositional unsat check successes : 0
% 9.28/2.44 # Current number of processed clauses : 517
% 9.28/2.44 # Positive orientable unit clauses : 14
% 9.28/2.44 # Positive unorientable unit clauses: 0
% 9.28/2.44 # Negative unit clauses : 2
% 9.28/2.44 # Non-unit-clauses : 501
% 9.28/2.44 # Current number of unprocessed clauses: 1618
% 9.28/2.44 # ...number of literals in the above : 11445
% 9.28/2.44 # Current number of archived formulas : 0
% 9.28/2.44 # Current number of archived clauses : 574
% 9.28/2.44 # Clause-clause subsumption calls (NU) : 133575
% 9.28/2.44 # Rec. Clause-clause subsumption calls : 19117
% 9.28/2.44 # Non-unit clause-clause subsumptions : 1386
% 9.28/2.44 # Unit Clause-clause subsumption calls : 1037
% 9.28/2.44 # Rewrite failures with RHS unbound : 0
% 9.28/2.44 # BW rewrite match attempts : 3
% 9.28/2.44 # BW rewrite match successes : 3
% 9.28/2.44 # Condensation attempts : 0
% 9.28/2.44 # Condensation successes : 0
% 9.28/2.44 # Termbank termtop insertions : 165212
% 9.28/2.44
% 9.28/2.44 # -------------------------------------------------
% 9.28/2.44 # User time : 0.231 s
% 9.28/2.44 # System time : 0.005 s
% 9.28/2.44 # Total time : 0.236 s
% 9.28/2.44 # ...preprocessing : 0.010 s
% 9.28/2.44 # ...main loop : 0.226 s
% 9.28/2.44 # Maximum resident set size: 9200 pages
% 9.28/2.44
%------------------------------------------------------------------------------