%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GRA005+1 : TPTP v8.1.0. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n020.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.65s 2.32s
% Output : CNFRefutation 7.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 13 ( 9 unt; 0 nHn; 13 RR)
% Number of literals : 22 ( 12 equ; 13 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-1 aty)
% Number of variables : 16 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_57,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-0yk28uiy/input.p',i_0_57) ).
cnf(i_0_18,negated_conjecture,
precedes(esk5_0,esk6_0,esk7_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0yk28uiy/input.p',i_0_18) ).
cnf(i_0_15,negated_conjecture,
head_of(esk6_0) = head_of(esk8_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0yk28uiy/input.p',i_0_15) ).
cnf(i_0_16,negated_conjecture,
tail_of(esk5_0) = tail_of(esk8_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0yk28uiy/input.p',i_0_16) ).
cnf(i_0_19,negated_conjecture,
shortest_path(esk3_0,esk4_0,esk7_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0yk28uiy/input.p',i_0_19) ).
cnf(c_0_63,plain,
( head_of(X1) != head_of(X2)
| tail_of(X1) != tail_of(X3)
| ~ shortest_path(X4,X5,X6)
| ~ precedes(X3,X2,X6) ),
i_0_57 ).
cnf(c_0_64,negated_conjecture,
precedes(esk5_0,esk6_0,esk7_0),
i_0_18 ).
cnf(c_0_65,negated_conjecture,
head_of(esk6_0) = head_of(esk8_0),
i_0_15 ).
cnf(c_0_66,negated_conjecture,
tail_of(esk5_0) = tail_of(esk8_0),
i_0_16 ).
cnf(c_0_67,negated_conjecture,
( head_of(X1) != head_of(esk8_0)
| tail_of(X1) != tail_of(esk8_0)
| ~ shortest_path(X2,X3,esk7_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_65]),c_0_66]) ).
cnf(c_0_68,negated_conjecture,
shortest_path(esk3_0,esk4_0,esk7_0),
i_0_19 ).
cnf(c_0_69,negated_conjecture,
( head_of(X1) != head_of(esk8_0)
| tail_of(X1) != tail_of(esk8_0) ),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_70,negated_conjecture,
$false,
inference(er,[status(thm)],[c_0_69]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : GRA005+1 : TPTP v8.1.0. Bugfixed v3.2.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.32 % Computer : n020.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.17/0.32 % WCLimit : 600
% 0.17/0.32 % DateTime : Tue May 31 00:53:55 EDT 2022
% 0.17/0.33 % CPUTime :
% 0.18/0.43 # 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
% 7.65/2.32 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.65/2.32 # Version: 2.1pre011
% 7.65/2.32 # Preprocessing time : 0.018 s
% 7.65/2.32
% 7.65/2.32 # Proof found!
% 7.65/2.32 # SZS status Theorem
% 7.65/2.32 # SZS output start CNFRefutation
% See solution above
% 7.65/2.33 # Proof object total steps : 13
% 7.65/2.33 # Proof object clause steps : 8
% 7.65/2.33 # Proof object formula steps : 5
% 7.65/2.33 # Proof object conjectures : 11
% 7.65/2.33 # Proof object clause conjectures : 7
% 7.65/2.33 # Proof object formula conjectures : 4
% 7.65/2.33 # Proof object initial clauses used : 5
% 7.65/2.33 # Proof object initial formulas used : 5
% 7.65/2.33 # Proof object generating inferences : 3
% 7.65/2.33 # Proof object simplifying inferences : 2
% 7.65/2.33 # Training examples: 0 positive, 0 negative
% 7.65/2.33 # Parsed axioms : 63
% 7.65/2.33 # Removed by relevancy pruning/SinE : 0
% 7.65/2.33 # Initial clauses : 63
% 7.65/2.33 # Removed in clause preprocessing : 0
% 7.65/2.33 # Initial clauses in saturation : 63
% 7.65/2.33 # Processed clauses : 73
% 7.65/2.33 # ...of these trivial : 0
% 7.65/2.33 # ...subsumed : 0
% 7.65/2.33 # ...remaining for further processing : 73
% 7.65/2.33 # Other redundant clauses eliminated : 2
% 7.65/2.33 # Clauses deleted for lack of memory : 0
% 7.65/2.33 # Backward-subsumed : 1
% 7.65/2.33 # Backward-rewritten : 0
% 7.65/2.33 # Generated clauses : 121
% 7.65/2.33 # ...of the previous two non-trivial : 104
% 7.65/2.33 # Contextual simplify-reflections : 4
% 7.65/2.33 # Paramodulations : 117
% 7.65/2.33 # Factorizations : 0
% 7.65/2.33 # Equation resolutions : 4
% 7.65/2.33 # Propositional unsat checks : 0
% 7.65/2.33 # Propositional unsat check successes : 0
% 7.65/2.33 # Current number of processed clauses : 70
% 7.65/2.33 # Positive orientable unit clauses : 7
% 7.65/2.33 # Positive unorientable unit clauses: 0
% 7.65/2.33 # Negative unit clauses : 3
% 7.65/2.33 # Non-unit-clauses : 60
% 7.65/2.33 # Current number of unprocessed clauses: 94
% 7.65/2.33 # ...number of literals in the above : 412
% 7.65/2.33 # Current number of archived formulas : 0
% 7.65/2.33 # Current number of archived clauses : 1
% 7.65/2.33 # Clause-clause subsumption calls (NU) : 853
% 7.65/2.33 # Rec. Clause-clause subsumption calls : 321
% 7.65/2.33 # Non-unit clause-clause subsumptions : 5
% 7.65/2.33 # Unit Clause-clause subsumption calls : 88
% 7.65/2.33 # Rewrite failures with RHS unbound : 0
% 7.65/2.33 # BW rewrite match attempts : 0
% 7.65/2.33 # BW rewrite match successes : 0
% 7.65/2.33 # Condensation attempts : 0
% 7.65/2.33 # Condensation successes : 0
% 7.65/2.33 # Termbank termtop insertions : 3254
% 7.65/2.33
% 7.65/2.33 # -------------------------------------------------
% 7.65/2.33 # User time : 0.018 s
% 7.65/2.33 # System time : 0.005 s
% 7.65/2.33 # Total time : 0.023 s
% 7.65/2.33 # ...preprocessing : 0.018 s
% 7.65/2.33 # ...main loop : 0.005 s
% 7.65/2.33 # Maximum resident set size: 7128 pages
% 7.65/2.33
%------------------------------------------------------------------------------