TSTP Solution File: GRA007+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GRA007+2 : TPTP v8.1.0. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n025.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:23 EDT 2022
% Result : Theorem 6.91s 2.49s
% Output : CNFRefutation 6.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 19
% Syntax : Number of clauses : 80 ( 19 unt; 24 nHn; 80 RR)
% Number of literals : 226 ( 73 equ; 120 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 2 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 151 ( 54 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_55,plain,
( path(X1,X2,X3)
| ~ shortest_path(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_44u4mbv/lgb.p',i_0_55) ).
cnf(i_0_3,negated_conjecture,
shortest_path(esk1_0,esk2_0,esk5_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_44u4mbv/lgb.p',i_0_3) ).
cnf(i_0_41,plain,
( on_path(X1,X2)
| ~ precedes(X1,X3,X2)
| ~ path(X4,X5,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_44u4mbv/lgb.p',i_0_41) ).
cnf(i_0_40,plain,
( on_path(X1,X2)
| ~ precedes(X3,X1,X2)
| ~ path(X4,X5,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_44u4mbv/lgb.p',i_0_40) ).
cnf(i_0_20,plain,
( in_path(tail_of(X1),X2)
| ~ on_path(X1,X2)
| ~ path(X3,X4,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_44u4mbv/lgb.p',i_0_20) ).
cnf(i_0_2,negated_conjecture,
precedes(esk3_0,esk4_0,esk5_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_44u4mbv/lgb.p',i_0_2) ).
cnf(i_0_21,plain,
( in_path(head_of(X1),X2)
| ~ on_path(X1,X2)
| ~ path(X3,X4,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_44u4mbv/lgb.p',i_0_21) ).
cnf(i_0_16,plain,
( vertex(X1)
| ~ in_path(X1,X2)
| ~ path(X3,X4,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_44u4mbv/lgb.p',i_0_16) ).
cnf(i_0_6,plain,
( X1 = X2
| tail_of(esk6_2(X2,X1)) = X1
| head_of(esk6_2(X2,X1)) = X1
| ~ complete
| ~ vertex(X2)
| ~ vertex(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_44u4mbv/lgb.p',i_0_6) ).
cnf(i_0_4,negated_conjecture,
complete,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_44u4mbv/lgb.p',i_0_4) ).
cnf(i_0_7,plain,
( X1 = X2
| tail_of(esk6_2(X1,X2)) = X1
| head_of(esk6_2(X1,X2)) = X1
| ~ complete
| ~ vertex(X2)
| ~ vertex(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_44u4mbv/lgb.p',i_0_7) ).
cnf(i_0_10,plain,
( X1 = X2
| edge(esk6_2(X1,X2))
| ~ complete
| ~ vertex(X2)
| ~ vertex(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_44u4mbv/lgb.p',i_0_10) ).
cnf(i_0_57,plain,
( tail_of(X1) != tail_of(X2)
| head_of(X1) != head_of(X3)
| ~ shortest_path(X4,X5,X6)
| ~ precedes(X2,X3,X6) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_44u4mbv/lgb.p',i_0_57) ).
cnf(i_0_1,negated_conjecture,
( tail_of(X1) != head_of(esk4_0)
| head_of(X1) != tail_of(esk3_0)
| ~ edge(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_44u4mbv/lgb.p',i_0_1) ).
cnf(i_0_22,plain,
( edge(X1)
| ~ on_path(X1,X2)
| ~ path(X3,X4,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_44u4mbv/lgb.p',i_0_22) ).
cnf(i_0_36,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-_44u4mbv/lgb.p',i_0_36) ).
cnf(i_0_42,plain,
( X1 = X2
| sequential(X1,X2)
| head_of(X1) != tail_of(X2)
| ~ edge(X2)
| ~ edge(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_44u4mbv/lgb.p',i_0_42) ).
cnf(i_0_56,plain,
( ~ shortest_path(X1,X2,X3)
| ~ precedes(X4,X5,X3)
| ~ precedes(X5,X4,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_44u4mbv/lgb.p',i_0_56) ).
cnf(i_0_18,plain,
( tail_of(X1) != head_of(X1)
| ~ edge(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_44u4mbv/lgb.p',i_0_18) ).
cnf(c_0_77,plain,
( path(X1,X2,X3)
| ~ shortest_path(X1,X2,X3) ),
i_0_55 ).
cnf(c_0_78,negated_conjecture,
shortest_path(esk1_0,esk2_0,esk5_0),
i_0_3 ).
cnf(c_0_79,plain,
( on_path(X1,X2)
| ~ precedes(X1,X3,X2)
| ~ path(X4,X5,X2) ),
i_0_41 ).
cnf(c_0_80,negated_conjecture,
path(esk1_0,esk2_0,esk5_0),
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_81,plain,
( on_path(X1,X2)
| ~ precedes(X3,X1,X2)
| ~ path(X4,X5,X2) ),
i_0_40 ).
cnf(c_0_82,plain,
( in_path(tail_of(X1),X2)
| ~ on_path(X1,X2)
| ~ path(X3,X4,X2) ),
i_0_20 ).
cnf(c_0_83,negated_conjecture,
( on_path(X1,esk5_0)
| ~ precedes(X1,X2,esk5_0) ),
inference(spm,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_84,negated_conjecture,
precedes(esk3_0,esk4_0,esk5_0),
i_0_2 ).
cnf(c_0_85,plain,
( in_path(head_of(X1),X2)
| ~ on_path(X1,X2)
| ~ path(X3,X4,X2) ),
i_0_21 ).
cnf(c_0_86,negated_conjecture,
( on_path(X1,esk5_0)
| ~ precedes(X2,X1,esk5_0) ),
inference(spm,[status(thm)],[c_0_81,c_0_80]) ).
cnf(c_0_87,plain,
( vertex(X1)
| ~ in_path(X1,X2)
| ~ path(X3,X4,X2) ),
i_0_16 ).
cnf(c_0_88,negated_conjecture,
( in_path(tail_of(X1),esk5_0)
| ~ on_path(X1,esk5_0) ),
inference(spm,[status(thm)],[c_0_82,c_0_80]) ).
cnf(c_0_89,negated_conjecture,
on_path(esk3_0,esk5_0),
inference(spm,[status(thm)],[c_0_83,c_0_84]) ).
cnf(c_0_90,negated_conjecture,
( in_path(head_of(X1),esk5_0)
| ~ on_path(X1,esk5_0) ),
inference(spm,[status(thm)],[c_0_85,c_0_80]) ).
cnf(c_0_91,negated_conjecture,
on_path(esk4_0,esk5_0),
inference(spm,[status(thm)],[c_0_86,c_0_84]) ).
cnf(c_0_92,plain,
( X1 = X2
| tail_of(esk6_2(X2,X1)) = X1
| head_of(esk6_2(X2,X1)) = X1
| ~ complete
| ~ vertex(X2)
| ~ vertex(X1) ),
i_0_6 ).
cnf(c_0_93,negated_conjecture,
complete,
i_0_4 ).
cnf(c_0_94,negated_conjecture,
( vertex(X1)
| ~ in_path(X1,esk5_0) ),
inference(spm,[status(thm)],[c_0_87,c_0_80]) ).
cnf(c_0_95,negated_conjecture,
in_path(tail_of(esk3_0),esk5_0),
inference(spm,[status(thm)],[c_0_88,c_0_89]) ).
cnf(c_0_96,plain,
( X1 = X2
| tail_of(esk6_2(X1,X2)) = X1
| head_of(esk6_2(X1,X2)) = X1
| ~ complete
| ~ vertex(X2)
| ~ vertex(X1) ),
i_0_7 ).
cnf(c_0_97,negated_conjecture,
in_path(head_of(esk4_0),esk5_0),
inference(spm,[status(thm)],[c_0_90,c_0_91]) ).
cnf(c_0_98,plain,
( head_of(esk6_2(X1,X2)) = X2
| tail_of(esk6_2(X1,X2)) = X2
| X2 = X1
| ~ vertex(X1)
| ~ vertex(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_92,c_0_93])]) ).
cnf(c_0_99,negated_conjecture,
vertex(tail_of(esk3_0)),
inference(spm,[status(thm)],[c_0_94,c_0_95]) ).
cnf(c_0_100,plain,
( X1 = X2
| edge(esk6_2(X1,X2))
| ~ complete
| ~ vertex(X2)
| ~ vertex(X1) ),
i_0_10 ).
cnf(c_0_101,plain,
( head_of(esk6_2(X1,X2)) = X1
| tail_of(esk6_2(X1,X2)) = X1
| X1 = X2
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_96,c_0_93])]) ).
cnf(c_0_102,negated_conjecture,
vertex(head_of(esk4_0)),
inference(spm,[status(thm)],[c_0_94,c_0_97]) ).
cnf(c_0_103,plain,
( head_of(esk6_2(X1,tail_of(esk3_0))) = tail_of(esk3_0)
| tail_of(esk6_2(X1,tail_of(esk3_0))) = tail_of(esk3_0)
| tail_of(esk3_0) = X1
| ~ vertex(X1) ),
inference(spm,[status(thm)],[c_0_98,c_0_99]) ).
cnf(c_0_104,plain,
( X1 = X2
| edge(esk6_2(X1,X2))
| ~ vertex(X2)
| ~ vertex(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_100,c_0_93])]) ).
cnf(c_0_105,negated_conjecture,
( head_of(esk6_2(head_of(esk4_0),X1)) = head_of(esk4_0)
| tail_of(esk6_2(head_of(esk4_0),X1)) = head_of(esk4_0)
| head_of(esk4_0) = X1
| ~ vertex(X1) ),
inference(spm,[status(thm)],[c_0_101,c_0_102]) ).
cnf(c_0_106,plain,
( tail_of(X1) != tail_of(X2)
| head_of(X1) != head_of(X3)
| ~ shortest_path(X4,X5,X6)
| ~ precedes(X2,X3,X6) ),
i_0_57 ).
cnf(c_0_107,negated_conjecture,
( tail_of(esk6_2(head_of(esk4_0),tail_of(esk3_0))) = tail_of(esk3_0)
| head_of(esk6_2(head_of(esk4_0),tail_of(esk3_0))) = tail_of(esk3_0)
| tail_of(esk3_0) = head_of(esk4_0) ),
inference(spm,[status(thm)],[c_0_103,c_0_102]) ).
cnf(c_0_108,plain,
( X1 = tail_of(esk3_0)
| edge(esk6_2(X1,tail_of(esk3_0)))
| ~ vertex(X1) ),
inference(spm,[status(thm)],[c_0_104,c_0_99]) ).
cnf(c_0_109,negated_conjecture,
( tail_of(esk6_2(head_of(esk4_0),tail_of(esk3_0))) = head_of(esk4_0)
| head_of(esk6_2(head_of(esk4_0),tail_of(esk3_0))) = head_of(esk4_0)
| tail_of(esk3_0) = head_of(esk4_0) ),
inference(spm,[status(thm)],[c_0_105,c_0_99]) ).
cnf(c_0_110,plain,
( head_of(esk6_2(head_of(esk4_0),tail_of(esk3_0))) = tail_of(esk3_0)
| tail_of(esk3_0) = head_of(esk4_0)
| head_of(esk6_2(head_of(esk4_0),tail_of(esk3_0))) != head_of(X1)
| tail_of(esk3_0) != tail_of(X2)
| ~ precedes(X2,X1,X3)
| ~ shortest_path(X4,X5,X3) ),
inference(spm,[status(thm)],[c_0_106,c_0_107]) ).
cnf(c_0_111,negated_conjecture,
( tail_of(X1) != head_of(esk4_0)
| head_of(X1) != tail_of(esk3_0)
| ~ edge(X1) ),
i_0_1 ).
cnf(c_0_112,negated_conjecture,
( tail_of(esk3_0) = head_of(esk4_0)
| edge(esk6_2(head_of(esk4_0),tail_of(esk3_0))) ),
inference(spm,[status(thm)],[c_0_108,c_0_102]) ).
cnf(c_0_113,negated_conjecture,
( head_of(esk6_2(head_of(esk4_0),tail_of(esk3_0))) = head_of(esk4_0)
| head_of(esk6_2(head_of(esk4_0),tail_of(esk3_0))) = tail_of(esk3_0)
| tail_of(esk3_0) = head_of(esk4_0) ),
inference(spm,[status(thm)],[c_0_107,c_0_109]) ).
cnf(c_0_114,plain,
( head_of(esk6_2(head_of(esk4_0),tail_of(esk3_0))) = tail_of(esk3_0)
| tail_of(esk3_0) = head_of(esk4_0)
| head_of(esk6_2(head_of(esk4_0),tail_of(esk3_0))) != head_of(X1)
| ~ precedes(esk3_0,X1,X2)
| ~ shortest_path(X3,X4,X2) ),
inference(er,[status(thm)],[c_0_110]) ).
cnf(c_0_115,negated_conjecture,
( head_of(esk6_2(head_of(esk4_0),tail_of(esk3_0))) = head_of(esk4_0)
| tail_of(esk3_0) = head_of(esk4_0) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_109]),c_0_112]),c_0_113]) ).
cnf(c_0_116,negated_conjecture,
( tail_of(esk3_0) = head_of(esk4_0)
| head_of(esk4_0) != head_of(X1)
| ~ precedes(esk3_0,X1,X2)
| ~ shortest_path(X3,X4,X2) ),
inference(spm,[status(thm)],[c_0_114,c_0_115]) ).
cnf(c_0_117,negated_conjecture,
( tail_of(esk3_0) = head_of(esk4_0)
| ~ precedes(esk3_0,esk4_0,X1)
| ~ shortest_path(X2,X3,X1) ),
inference(er,[status(thm)],[c_0_116]) ).
cnf(c_0_118,plain,
( edge(X1)
| ~ on_path(X1,X2)
| ~ path(X3,X4,X2) ),
i_0_22 ).
cnf(c_0_119,plain,
( precedes(X1,X2,X3)
| ~ on_path(X2,X3)
| ~ on_path(X1,X3)
| ~ sequential(X1,X2)
| ~ path(X4,X5,X3) ),
i_0_36 ).
cnf(c_0_120,negated_conjecture,
( tail_of(esk3_0) = head_of(esk4_0)
| ~ shortest_path(X1,X2,esk5_0) ),
inference(spm,[status(thm)],[c_0_117,c_0_84]) ).
cnf(c_0_121,plain,
( edge(X1)
| ~ on_path(X1,esk5_0) ),
inference(spm,[status(thm)],[c_0_118,c_0_80]) ).
cnf(c_0_122,negated_conjecture,
( precedes(X1,X2,esk5_0)
| ~ sequential(X1,X2)
| ~ on_path(X2,esk5_0)
| ~ on_path(X1,esk5_0) ),
inference(spm,[status(thm)],[c_0_119,c_0_80]) ).
cnf(c_0_123,plain,
( X1 = X2
| sequential(X1,X2)
| head_of(X1) != tail_of(X2)
| ~ edge(X2)
| ~ edge(X1) ),
i_0_42 ).
cnf(c_0_124,negated_conjecture,
tail_of(esk3_0) = head_of(esk4_0),
inference(spm,[status(thm)],[c_0_120,c_0_78]) ).
cnf(c_0_125,plain,
edge(esk3_0),
inference(spm,[status(thm)],[c_0_121,c_0_89]) ).
cnf(c_0_126,negated_conjecture,
( precedes(X1,esk3_0,esk5_0)
| ~ sequential(X1,esk3_0)
| ~ on_path(X1,esk5_0) ),
inference(spm,[status(thm)],[c_0_122,c_0_89]) ).
cnf(c_0_127,plain,
( X1 = esk3_0
| sequential(X1,esk3_0)
| head_of(X1) != head_of(esk4_0)
| ~ edge(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_123,c_0_124]),c_0_125])]) ).
cnf(c_0_128,plain,
edge(esk4_0),
inference(spm,[status(thm)],[c_0_121,c_0_91]) ).
cnf(c_0_129,negated_conjecture,
( precedes(esk4_0,esk3_0,esk5_0)
| ~ sequential(esk4_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_126,c_0_91]) ).
cnf(c_0_130,plain,
( esk4_0 = esk3_0
| sequential(esk4_0,esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_127]),c_0_128])]) ).
cnf(c_0_131,plain,
( ~ shortest_path(X1,X2,X3)
| ~ precedes(X4,X5,X3)
| ~ precedes(X5,X4,X3) ),
i_0_56 ).
cnf(c_0_132,negated_conjecture,
( esk4_0 = esk3_0
| precedes(esk4_0,esk3_0,esk5_0) ),
inference(spm,[status(thm)],[c_0_129,c_0_130]) ).
cnf(c_0_133,plain,
( tail_of(X1) != head_of(X1)
| ~ edge(X1) ),
i_0_18 ).
cnf(c_0_134,plain,
( esk4_0 = esk3_0
| ~ shortest_path(X1,X2,esk5_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_131,c_0_132]),c_0_84])]) ).
cnf(c_0_135,plain,
head_of(esk4_0) != head_of(esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_133,c_0_124]),c_0_125])]) ).
cnf(c_0_136,negated_conjecture,
esk4_0 = esk3_0,
inference(spm,[status(thm)],[c_0_134,c_0_78]) ).
cnf(c_0_137,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_135,c_0_136])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRA007+2 : TPTP v8.1.0. Bugfixed v3.2.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.33 % Computer : n025.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Tue May 31 03:20:29 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 6.91/2.49 # ENIGMATIC: Solved by autoschedule-lgb:
% 6.91/2.49 # No SInE strategy applied
% 6.91/2.49 # Trying AutoSched0 for 150 seconds
% 6.91/2.49 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 6.91/2.49 # and selection function SelectCQArNTNpEqFirst.
% 6.91/2.49 #
% 6.91/2.49 # Preprocessing time : 0.024 s
% 6.91/2.49 # Presaturation interreduction done
% 6.91/2.49
% 6.91/2.49 # Proof found!
% 6.91/2.49 # SZS status Theorem
% 6.91/2.49 # SZS output start CNFRefutation
% See solution above
% 6.91/2.49 # Training examples: 0 positive, 0 negative
% 6.91/2.49
% 6.91/2.49 # -------------------------------------------------
% 6.91/2.49 # User time : 0.116 s
% 6.91/2.49 # System time : 0.005 s
% 6.91/2.49 # Total time : 0.121 s
% 6.91/2.49 # Maximum resident set size: 7124 pages
% 6.91/2.49
%------------------------------------------------------------------------------