TSTP Solution File: GRA003+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GRA003+1 : TPTP v8.1.0. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n022.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 7.51s 2.37s
% Output : CNFRefutation 7.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of clauses : 42 ( 15 unt; 6 nHn; 42 RR)
% Number of literals : 96 ( 24 equ; 56 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-1 aty)
% Number of variables : 75 ( 33 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_50,plain,
( path(X1,X2,X3)
| ~ shortest_path(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-01zvb36c/input.p',i_0_50) ).
cnf(i_0_62,negated_conjecture,
shortest_path(esk9_0,esk10_0,esk13_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-01zvb36c/input.p',i_0_62) ).
cnf(i_0_28,plain,
( vertex(X1)
| ~ path(X2,X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-01zvb36c/input.p',i_0_28) ).
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-01zvb36c/input.p',i_0_35) ).
cnf(i_0_60,negated_conjecture,
( esk10_0 = esk9_0
| esk11_0 = esk12_0
| ~ vertex(esk9_0)
| ~ vertex(esk10_0)
| ~ edge(esk11_0)
| ~ edge(esk12_0)
| ~ path(esk9_0,esk10_0,esk13_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-01zvb36c/input.p',i_0_60) ).
cnf(i_0_29,plain,
( vertex(X1)
| ~ path(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-01zvb36c/input.p',i_0_29) ).
cnf(i_0_17,plain,
( edge(X1)
| ~ on_path(X1,X2)
| ~ path(X3,X4,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-01zvb36c/input.p',i_0_17) ).
cnf(i_0_61,negated_conjecture,
precedes(esk11_0,esk12_0,esk13_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-01zvb36c/input.p',i_0_61) ).
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-01zvb36c/input.p',i_0_36) ).
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-01zvb36c/input.p',i_0_52) ).
cnf(i_0_49,plain,
( X1 != X2
| ~ shortest_path(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-01zvb36c/input.p',i_0_49) ).
cnf(c_0_74,plain,
( path(X1,X2,X3)
| ~ shortest_path(X1,X2,X3) ),
i_0_50 ).
cnf(c_0_75,negated_conjecture,
shortest_path(esk9_0,esk10_0,esk13_0),
i_0_62 ).
cnf(c_0_76,plain,
( vertex(X1)
| ~ path(X2,X1,X3) ),
i_0_28 ).
cnf(c_0_77,negated_conjecture,
path(esk9_0,esk10_0,esk13_0),
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_78,plain,
( on_path(X1,X2)
| ~ path(X3,X4,X2)
| ~ precedes(X5,X1,X2) ),
i_0_35 ).
cnf(c_0_79,negated_conjecture,
( esk10_0 = esk9_0
| esk11_0 = esk12_0
| ~ vertex(esk9_0)
| ~ vertex(esk10_0)
| ~ edge(esk11_0)
| ~ edge(esk12_0)
| ~ path(esk9_0,esk10_0,esk13_0) ),
i_0_60 ).
cnf(c_0_80,plain,
vertex(esk10_0),
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_81,plain,
( vertex(X1)
| ~ path(X1,X2,X3) ),
i_0_29 ).
cnf(c_0_82,plain,
( edge(X1)
| ~ on_path(X1,X2)
| ~ path(X3,X4,X2) ),
i_0_17 ).
cnf(c_0_83,plain,
( on_path(X1,esk13_0)
| ~ precedes(X2,X1,esk13_0) ),
inference(spm,[status(thm)],[c_0_78,c_0_77]) ).
cnf(c_0_84,negated_conjecture,
precedes(esk11_0,esk12_0,esk13_0),
i_0_61 ).
cnf(c_0_85,plain,
( on_path(X1,X2)
| ~ path(X3,X4,X2)
| ~ precedes(X1,X5,X2) ),
i_0_36 ).
cnf(c_0_86,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_87,negated_conjecture,
( esk11_0 = esk12_0
| esk10_0 = esk9_0
| ~ edge(esk11_0)
| ~ edge(esk12_0)
| ~ vertex(esk9_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_79,c_0_77])]),c_0_80])]) ).
cnf(c_0_88,plain,
vertex(esk9_0),
inference(spm,[status(thm)],[c_0_81,c_0_77]) ).
cnf(c_0_89,plain,
( edge(X1)
| ~ on_path(X1,esk13_0) ),
inference(spm,[status(thm)],[c_0_82,c_0_77]) ).
cnf(c_0_90,negated_conjecture,
on_path(esk12_0,esk13_0),
inference(spm,[status(thm)],[c_0_83,c_0_84]) ).
cnf(c_0_91,plain,
( on_path(X1,esk13_0)
| ~ precedes(X1,X2,esk13_0) ),
inference(spm,[status(thm)],[c_0_85,c_0_77]) ).
cnf(c_0_92,negated_conjecture,
( head_of(X1) != head_of(X2)
| tail_of(X1) != tail_of(X3)
| ~ precedes(X3,X2,esk13_0) ),
inference(spm,[status(thm)],[c_0_86,c_0_75]) ).
cnf(c_0_93,negated_conjecture,
( esk10_0 = esk9_0
| esk11_0 = esk12_0
| ~ edge(esk11_0)
| ~ edge(esk12_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_87,c_0_88])]) ).
cnf(c_0_94,plain,
edge(esk12_0),
inference(spm,[status(thm)],[c_0_89,c_0_90]) ).
cnf(c_0_95,negated_conjecture,
on_path(esk11_0,esk13_0),
inference(spm,[status(thm)],[c_0_91,c_0_84]) ).
cnf(c_0_96,negated_conjecture,
( head_of(X1) != head_of(esk12_0)
| tail_of(X1) != tail_of(esk11_0) ),
inference(spm,[status(thm)],[c_0_92,c_0_84]) ).
cnf(c_0_97,negated_conjecture,
( esk11_0 = esk12_0
| esk10_0 = esk9_0
| ~ edge(esk11_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_93,c_0_94])]) ).
cnf(c_0_98,plain,
edge(esk11_0),
inference(spm,[status(thm)],[c_0_89,c_0_95]) ).
cnf(c_0_99,negated_conjecture,
head_of(esk11_0) != head_of(esk12_0),
inference(er,[status(thm)],[c_0_96]) ).
cnf(c_0_100,negated_conjecture,
( esk10_0 = esk9_0
| esk11_0 = esk12_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_97,c_0_98])]) ).
cnf(c_0_101,plain,
( X1 != X2
| ~ shortest_path(X1,X2,X3) ),
i_0_49 ).
cnf(c_0_102,negated_conjecture,
esk10_0 = esk9_0,
inference(spm,[status(thm)],[c_0_99,c_0_100]) ).
cnf(c_0_103,plain,
~ shortest_path(X1,X1,X2),
inference(er,[status(thm)],[c_0_101]) ).
cnf(c_0_104,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_75,c_0_102]),c_0_103]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRA003+1 : TPTP v8.1.0. Bugfixed v3.2.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n022.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 02:29:39 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.19/0.44 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.44 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.44 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.44 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.51/2.37 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.51/2.37 # Version: 2.1pre011
% 7.51/2.37 # Preprocessing time : 0.015 s
% 7.51/2.37
% 7.51/2.37 # Proof found!
% 7.51/2.37 # SZS status Theorem
% 7.51/2.37 # SZS output start CNFRefutation
% See solution above
% 7.51/2.37 # Proof object total steps : 42
% 7.51/2.37 # Proof object clause steps : 31
% 7.51/2.37 # Proof object formula steps : 11
% 7.51/2.37 # Proof object conjectures : 18
% 7.51/2.37 # Proof object clause conjectures : 15
% 7.51/2.37 # Proof object formula conjectures : 3
% 7.51/2.37 # Proof object initial clauses used : 11
% 7.51/2.37 # Proof object initial formulas used : 11
% 7.51/2.37 # Proof object generating inferences : 14
% 7.51/2.37 # Proof object simplifying inferences : 13
% 7.51/2.37 # Training examples: 0 positive, 0 negative
% 7.51/2.37 # Parsed axioms : 61
% 7.51/2.37 # Removed by relevancy pruning/SinE : 0
% 7.51/2.37 # Initial clauses : 61
% 7.51/2.37 # Removed in clause preprocessing : 0
% 7.51/2.37 # Initial clauses in saturation : 61
% 7.51/2.37 # Processed clauses : 123
% 7.51/2.37 # ...of these trivial : 0
% 7.51/2.37 # ...subsumed : 9
% 7.51/2.37 # ...remaining for further processing : 114
% 7.51/2.37 # Other redundant clauses eliminated : 2
% 7.51/2.37 # Clauses deleted for lack of memory : 0
% 7.51/2.37 # Backward-subsumed : 0
% 7.51/2.37 # Backward-rewritten : 9
% 7.51/2.37 # Generated clauses : 177
% 7.51/2.37 # ...of the previous two non-trivial : 165
% 7.51/2.37 # Contextual simplify-reflections : 21
% 7.51/2.37 # Paramodulations : 172
% 7.51/2.37 # Factorizations : 0
% 7.51/2.37 # Equation resolutions : 5
% 7.51/2.37 # Propositional unsat checks : 0
% 7.51/2.37 # Propositional unsat check successes : 0
% 7.51/2.37 # Current number of processed clauses : 103
% 7.51/2.37 # Positive orientable unit clauses : 11
% 7.51/2.37 # Positive unorientable unit clauses: 0
% 7.51/2.37 # Negative unit clauses : 4
% 7.51/2.37 # Non-unit-clauses : 88
% 7.51/2.37 # Current number of unprocessed clauses: 92
% 7.51/2.37 # ...number of literals in the above : 480
% 7.51/2.37 # Current number of archived formulas : 0
% 7.51/2.37 # Current number of archived clauses : 9
% 7.51/2.37 # Clause-clause subsumption calls (NU) : 2233
% 7.51/2.37 # Rec. Clause-clause subsumption calls : 640
% 7.51/2.37 # Non-unit clause-clause subsumptions : 28
% 7.51/2.37 # Unit Clause-clause subsumption calls : 310
% 7.51/2.37 # Rewrite failures with RHS unbound : 0
% 7.51/2.37 # BW rewrite match attempts : 5
% 7.51/2.37 # BW rewrite match successes : 5
% 7.51/2.37 # Condensation attempts : 0
% 7.51/2.37 # Condensation successes : 0
% 7.51/2.37 # Termbank termtop insertions : 4487
% 7.51/2.37
% 7.51/2.37 # -------------------------------------------------
% 7.51/2.37 # User time : 0.019 s
% 7.51/2.37 # System time : 0.002 s
% 7.51/2.37 # Total time : 0.021 s
% 7.51/2.37 # ...preprocessing : 0.015 s
% 7.51/2.37 # ...main loop : 0.006 s
% 7.51/2.37 # Maximum resident set size: 7128 pages
% 7.51/2.37
%------------------------------------------------------------------------------