TSTP Solution File: GRA004+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GRA004+1 : TPTP v8.1.0. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n027.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 8.04s 2.38s
% Output : CNFRefutation 8.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 12
% Syntax : Number of clauses : 54 ( 13 unt; 20 nHn; 54 RR)
% Number of literals : 153 ( 59 equ; 71 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-1 aty)
% Number of variables : 104 ( 46 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_50,plain,
( path(X1,X2,X3)
| ~ shortest_path(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e1jcdj2g/lgb.p',i_0_50) ).
cnf(i_0_56,negated_conjecture,
shortest_path(esk9_0,esk10_0,esk13_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e1jcdj2g/lgb.p',i_0_56) ).
cnf(i_0_36,plain,
( on_path(X1,X2)
| ~ path(X3,X4,X2)
| ~ precedes(X1,X5,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e1jcdj2g/lgb.p',i_0_36) ).
cnf(i_0_17,plain,
( edge(X1)
| ~ on_path(X1,X2)
| ~ path(X3,X4,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e1jcdj2g/lgb.p',i_0_17) ).
cnf(i_0_55,negated_conjecture,
precedes(esk11_0,esk12_0,esk13_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e1jcdj2g/lgb.p',i_0_55) ).
cnf(i_0_35,plain,
( on_path(X1,X2)
| ~ path(X3,X4,X2)
| ~ precedes(X5,X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e1jcdj2g/lgb.p',i_0_35) ).
cnf(i_0_31,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-e1jcdj2g/lgb.p',i_0_31) ).
cnf(i_0_37,plain,
( X1 = X2
| sequential(X1,X2)
| tail_of(X2) != head_of(X1)
| ~ edge(X2)
| ~ edge(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e1jcdj2g/lgb.p',i_0_37) ).
cnf(i_0_53,negated_conjecture,
( head_of(esk11_0) = head_of(esk12_0)
| head_of(esk14_0) = head_of(esk12_0)
| tail_of(esk11_0) = head_of(esk12_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e1jcdj2g/lgb.p',i_0_53) ).
cnf(i_0_51,plain,
( ~ precedes(X1,X2,X3)
| ~ precedes(X2,X1,X3)
| ~ shortest_path(X4,X5,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e1jcdj2g/lgb.p',i_0_51) ).
cnf(i_0_52,plain,
( head_of(X1) != head_of(X2)
| tail_of(X1) != tail_of(X3)
| ~ precedes(X3,X2,X4)
| ~ shortest_path(X5,X6,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e1jcdj2g/lgb.p',i_0_52) ).
cnf(i_0_54,negated_conjecture,
( head_of(esk11_0) = head_of(esk12_0)
| tail_of(esk11_0) = head_of(esk12_0)
| tail_of(esk14_0) = tail_of(esk11_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e1jcdj2g/lgb.p',i_0_54) ).
cnf(c_0_69,plain,
( path(X1,X2,X3)
| ~ shortest_path(X1,X2,X3) ),
i_0_50 ).
cnf(c_0_70,negated_conjecture,
shortest_path(esk9_0,esk10_0,esk13_0),
i_0_56 ).
cnf(c_0_71,plain,
( on_path(X1,X2)
| ~ path(X3,X4,X2)
| ~ precedes(X1,X5,X2) ),
i_0_36 ).
cnf(c_0_72,negated_conjecture,
path(esk9_0,esk10_0,esk13_0),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_73,plain,
( edge(X1)
| ~ on_path(X1,X2)
| ~ path(X3,X4,X2) ),
i_0_17 ).
cnf(c_0_74,negated_conjecture,
( on_path(X1,esk13_0)
| ~ precedes(X1,X2,esk13_0) ),
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_75,negated_conjecture,
precedes(esk11_0,esk12_0,esk13_0),
i_0_55 ).
cnf(c_0_76,plain,
( on_path(X1,X2)
| ~ path(X3,X4,X2)
| ~ precedes(X5,X1,X2) ),
i_0_35 ).
cnf(c_0_77,plain,
( precedes(X1,X2,X3)
| ~ on_path(X2,X3)
| ~ on_path(X1,X3)
| ~ sequential(X1,X2)
| ~ path(X4,X5,X3) ),
i_0_31 ).
cnf(c_0_78,negated_conjecture,
( edge(X1)
| ~ on_path(X1,esk13_0) ),
inference(spm,[status(thm)],[c_0_73,c_0_72]) ).
cnf(c_0_79,negated_conjecture,
on_path(esk11_0,esk13_0),
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_80,negated_conjecture,
( on_path(X1,esk13_0)
| ~ precedes(X2,X1,esk13_0) ),
inference(spm,[status(thm)],[c_0_76,c_0_72]) ).
cnf(c_0_81,negated_conjecture,
( precedes(X1,X2,esk13_0)
| ~ on_path(X2,esk13_0)
| ~ on_path(X1,esk13_0)
| ~ sequential(X1,X2) ),
inference(spm,[status(thm)],[c_0_77,c_0_72]) ).
cnf(c_0_82,plain,
( X1 = X2
| sequential(X1,X2)
| tail_of(X2) != head_of(X1)
| ~ edge(X2)
| ~ edge(X1) ),
i_0_37 ).
cnf(c_0_83,negated_conjecture,
( head_of(esk11_0) = head_of(esk12_0)
| head_of(esk14_0) = head_of(esk12_0)
| tail_of(esk11_0) = head_of(esk12_0) ),
i_0_53 ).
cnf(c_0_84,negated_conjecture,
edge(esk11_0),
inference(spm,[status(thm)],[c_0_78,c_0_79]) ).
cnf(c_0_85,negated_conjecture,
on_path(esk12_0,esk13_0),
inference(spm,[status(thm)],[c_0_80,c_0_75]) ).
cnf(c_0_86,negated_conjecture,
( precedes(X1,esk11_0,esk13_0)
| ~ on_path(X1,esk13_0)
| ~ sequential(X1,esk11_0) ),
inference(spm,[status(thm)],[c_0_81,c_0_79]) ).
cnf(c_0_87,negated_conjecture,
( head_of(esk14_0) = head_of(esk12_0)
| head_of(esk12_0) = head_of(esk11_0)
| X1 = esk11_0
| sequential(X1,esk11_0)
| head_of(esk12_0) != head_of(X1)
| ~ edge(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_84])]) ).
cnf(c_0_88,negated_conjecture,
edge(esk12_0),
inference(spm,[status(thm)],[c_0_78,c_0_85]) ).
cnf(c_0_89,negated_conjecture,
( precedes(esk12_0,esk11_0,esk13_0)
| ~ sequential(esk12_0,esk11_0) ),
inference(spm,[status(thm)],[c_0_86,c_0_85]) ).
cnf(c_0_90,negated_conjecture,
( head_of(esk12_0) = head_of(esk11_0)
| head_of(esk14_0) = head_of(esk12_0)
| esk12_0 = esk11_0
| sequential(esk12_0,esk11_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_87]),c_0_88])]) ).
cnf(c_0_91,plain,
( ~ precedes(X1,X2,X3)
| ~ precedes(X2,X1,X3)
| ~ shortest_path(X4,X5,X3) ),
i_0_51 ).
cnf(c_0_92,negated_conjecture,
( head_of(esk14_0) = head_of(esk12_0)
| head_of(esk12_0) = head_of(esk11_0)
| esk12_0 = esk11_0
| precedes(esk12_0,esk11_0,esk13_0) ),
inference(spm,[status(thm)],[c_0_89,c_0_90]) ).
cnf(c_0_93,plain,
( head_of(esk12_0) = head_of(esk11_0)
| head_of(esk14_0) = head_of(esk12_0)
| esk12_0 = esk11_0
| ~ shortest_path(X1,X2,esk13_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_92]),c_0_75])]) ).
cnf(c_0_94,plain,
( head_of(X1) != head_of(X2)
| tail_of(X1) != tail_of(X3)
| ~ precedes(X3,X2,X4)
| ~ shortest_path(X5,X6,X4) ),
i_0_52 ).
cnf(c_0_95,negated_conjecture,
( head_of(esk14_0) = head_of(esk12_0)
| head_of(esk12_0) = head_of(esk11_0)
| esk12_0 = esk11_0 ),
inference(spm,[status(thm)],[c_0_93,c_0_70]) ).
cnf(c_0_96,plain,
( head_of(esk12_0) = head_of(esk11_0)
| esk12_0 = esk11_0
| head_of(esk12_0) != head_of(X1)
| tail_of(esk14_0) != tail_of(X2)
| ~ precedes(X2,X1,X3)
| ~ shortest_path(X4,X5,X3) ),
inference(spm,[status(thm)],[c_0_94,c_0_95]) ).
cnf(c_0_97,plain,
( head_of(esk12_0) = head_of(esk11_0)
| esk12_0 = esk11_0
| tail_of(esk14_0) != tail_of(X1)
| ~ precedes(X1,esk12_0,X2)
| ~ shortest_path(X3,X4,X2) ),
inference(er,[status(thm)],[c_0_96]) ).
cnf(c_0_98,negated_conjecture,
( head_of(esk11_0) = head_of(esk12_0)
| tail_of(esk11_0) = head_of(esk12_0)
| tail_of(esk14_0) = tail_of(esk11_0) ),
i_0_54 ).
cnf(c_0_99,negated_conjecture,
( tail_of(esk11_0) = head_of(esk12_0)
| esk12_0 = esk11_0
| tail_of(esk11_0) != tail_of(X1)
| ~ precedes(X1,esk12_0,X2)
| ~ shortest_path(X3,X4,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_98]),c_0_94]) ).
cnf(c_0_100,negated_conjecture,
( tail_of(esk11_0) = head_of(esk12_0)
| esk12_0 = esk11_0
| ~ precedes(esk11_0,esk12_0,X1)
| ~ shortest_path(X2,X3,X1) ),
inference(er,[status(thm)],[c_0_99]) ).
cnf(c_0_101,negated_conjecture,
( tail_of(esk11_0) = head_of(esk12_0)
| esk12_0 = esk11_0
| ~ shortest_path(X1,X2,esk13_0) ),
inference(spm,[status(thm)],[c_0_100,c_0_75]) ).
cnf(c_0_102,negated_conjecture,
( tail_of(esk11_0) = head_of(esk12_0)
| esk12_0 = esk11_0 ),
inference(spm,[status(thm)],[c_0_101,c_0_70]) ).
cnf(c_0_103,plain,
( esk12_0 = esk11_0
| X1 = esk11_0
| sequential(X1,esk11_0)
| head_of(esk12_0) != head_of(X1)
| ~ edge(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_102]),c_0_84])]) ).
cnf(c_0_104,plain,
( esk12_0 = esk11_0
| sequential(esk12_0,esk11_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_103]),c_0_88])]) ).
cnf(c_0_105,negated_conjecture,
( esk12_0 = esk11_0
| precedes(esk12_0,esk11_0,esk13_0) ),
inference(spm,[status(thm)],[c_0_89,c_0_104]) ).
cnf(c_0_106,plain,
( esk12_0 = esk11_0
| ~ shortest_path(X1,X2,esk13_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_105]),c_0_75])]) ).
cnf(c_0_107,negated_conjecture,
esk12_0 = esk11_0,
inference(spm,[status(thm)],[c_0_106,c_0_70]) ).
cnf(c_0_108,negated_conjecture,
precedes(esk11_0,esk11_0,esk13_0),
inference(rw,[status(thm)],[c_0_75,c_0_107]) ).
cnf(c_0_109,plain,
~ shortest_path(X1,X2,esk13_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_108]),c_0_108])]) ).
cnf(c_0_110,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_70,c_0_109]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : GRA004+1 : TPTP v8.1.0. Bugfixed v3.2.0.
% 0.03/0.11 % Command : enigmatic-eprover.py %s %d 1
% 0.10/0.32 % Computer : n027.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 600
% 0.10/0.32 % DateTime : Tue May 31 03:50:33 EDT 2022
% 0.10/0.32 % CPUTime :
% 0.16/0.43 # ENIGMATIC: Selected SinE mode:
% 0.16/0.43 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.16/0.43 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.16/0.43 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.16/0.43 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.04/2.38 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.04/2.38 # No SInE strategy applied
% 8.04/2.38 # Trying AutoSched0 for 150 seconds
% 8.04/2.38 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 8.04/2.38 # and selection function SelectCQArNTNpEqFirst.
% 8.04/2.38 #
% 8.04/2.38 # Preprocessing time : 0.013 s
% 8.04/2.38 # Presaturation interreduction done
% 8.04/2.38
% 8.04/2.38 # Proof found!
% 8.04/2.38 # SZS status Theorem
% 8.04/2.38 # SZS output start CNFRefutation
% See solution above
% 8.04/2.38 # Training examples: 0 positive, 0 negative
% 8.04/2.38
% 8.04/2.38 # -------------------------------------------------
% 8.04/2.38 # User time : 0.022 s
% 8.04/2.38 # System time : 0.004 s
% 8.04/2.38 # Total time : 0.026 s
% 8.04/2.38 # Maximum resident set size: 7128 pages
% 8.04/2.38
%------------------------------------------------------------------------------