%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : GRA005+1 : TPTP v8.1.0. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n032.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:16:07 EDT 2022
% Result : Theorem 0.18s 1.36s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of formulae : 13 ( 5 unt; 0 def)
% Number of atoms : 41 ( 18 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 49 ( 21 ~; 11 |; 14 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-1 aty)
% Number of variables : 34 ( 2 sgn 21 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(no_short_cut_edge,conjecture,
! [X2,X3,X7,X8,X4] :
( ( shortest_path(X2,X3,X4)
& precedes(X7,X8,X4) )
=> ~ ? [X9] :
( edge(X9)
& tail_of(X9) = tail_of(X7)
& head_of(X9) = head_of(X8) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',no_short_cut_edge) ).
fof(shortest_path_properties,axiom,
! [X2,X3,X7,X8,X4] :
( ( shortest_path(X2,X3,X4)
& precedes(X7,X8,X4) )
=> ( ~ ? [X9] :
( tail_of(X9) = tail_of(X7)
& head_of(X9) = head_of(X8) )
& ~ precedes(X8,X7,X4) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRA001+0.ax',shortest_path_properties) ).
fof(c_0_2,negated_conjecture,
~ ! [X2,X3,X7,X8,X4] :
( ( shortest_path(X2,X3,X4)
& precedes(X7,X8,X4) )
=> ~ ? [X9] :
( edge(X9)
& tail_of(X9) = tail_of(X7)
& head_of(X9) = head_of(X8) ) ),
inference(assume_negation,[status(cth)],[no_short_cut_edge]) ).
fof(c_0_3,plain,
! [X10,X11,X12,X13,X14,X15] :
( ( tail_of(X15) != tail_of(X12)
| head_of(X15) != head_of(X13)
| ~ shortest_path(X10,X11,X14)
| ~ precedes(X12,X13,X14) )
& ( ~ precedes(X13,X12,X14)
| ~ shortest_path(X10,X11,X14)
| ~ precedes(X12,X13,X14) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[shortest_path_properties])])])])])])]) ).
fof(c_0_4,negated_conjecture,
( shortest_path(esk1_0,esk2_0,esk5_0)
& precedes(esk3_0,esk4_0,esk5_0)
& edge(esk6_0)
& tail_of(esk6_0) = tail_of(esk3_0)
& head_of(esk6_0) = head_of(esk4_0) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])]) ).
cnf(c_0_5,plain,
( ~ precedes(X1,X2,X3)
| ~ shortest_path(X4,X5,X3)
| head_of(X6) != head_of(X2)
| tail_of(X6) != tail_of(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
shortest_path(esk1_0,esk2_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( head_of(X1) != head_of(X2)
| tail_of(X3) != tail_of(X2)
| ~ precedes(X3,X1,esk5_0) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,negated_conjecture,
precedes(esk3_0,esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,negated_conjecture,
( head_of(esk4_0) != head_of(X1)
| tail_of(esk3_0) != tail_of(X1) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,negated_conjecture,
tail_of(esk6_0) = tail_of(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_11,negated_conjecture,
head_of(esk6_0) = head_of(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_12,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : GRA005+1 : TPTP v8.1.0. Bugfixed v3.2.0.
% 0.00/0.11 % Command : run_ET %s %d
% 0.11/0.30 % Computer : n032.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 300
% 0.11/0.30 % WCLimit : 600
% 0.11/0.30 % DateTime : Tue May 31 00:47:28 EDT 2022
% 0.11/0.30 % CPUTime :
% 0.18/1.36 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.18/1.36 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.18/1.36 # Preprocessing time : 0.013 s
% 0.18/1.36
% 0.18/1.36 # Proof found!
% 0.18/1.36 # SZS status Theorem
% 0.18/1.36 # SZS output start CNFRefutation
% See solution above
% 0.18/1.36 # Proof object total steps : 13
% 0.18/1.36 # Proof object clause steps : 8
% 0.18/1.36 # Proof object formula steps : 5
% 0.18/1.36 # Proof object conjectures : 10
% 0.18/1.36 # Proof object clause conjectures : 7
% 0.18/1.36 # Proof object formula conjectures : 3
% 0.18/1.36 # Proof object initial clauses used : 5
% 0.18/1.36 # Proof object initial formulas used : 2
% 0.18/1.36 # Proof object generating inferences : 3
% 0.18/1.36 # Proof object simplifying inferences : 2
% 0.18/1.36 # Training examples: 0 positive, 0 negative
% 0.18/1.36 # Parsed axioms : 18
% 0.18/1.36 # Removed by relevancy pruning/SinE : 12
% 0.18/1.36 # Initial clauses : 20
% 0.18/1.36 # Removed in clause preprocessing : 0
% 0.18/1.36 # Initial clauses in saturation : 20
% 0.18/1.36 # Processed clauses : 29
% 0.18/1.36 # ...of these trivial : 0
% 0.18/1.36 # ...subsumed : 0
% 0.18/1.36 # ...remaining for further processing : 29
% 0.18/1.36 # Other redundant clauses eliminated : 1
% 0.18/1.36 # Clauses deleted for lack of memory : 0
% 0.18/1.36 # Backward-subsumed : 0
% 0.18/1.36 # Backward-rewritten : 0
% 0.18/1.36 # Generated clauses : 12
% 0.18/1.36 # ...of the previous two non-trivial : 11
% 0.18/1.36 # Contextual simplify-reflections : 1
% 0.18/1.36 # Paramodulations : 10
% 0.18/1.36 # Factorizations : 0
% 0.18/1.36 # Equation resolutions : 2
% 0.18/1.36 # Current number of processed clauses : 28
% 0.18/1.36 # Positive orientable unit clauses : 5
% 0.18/1.36 # Positive unorientable unit clauses: 0
% 0.18/1.36 # Negative unit clauses : 3
% 0.18/1.36 # Non-unit-clauses : 20
% 0.18/1.36 # Current number of unprocessed clauses: 2
% 0.18/1.36 # ...number of literals in the above : 5
% 0.18/1.36 # Current number of archived formulas : 0
% 0.18/1.36 # Current number of archived clauses : 0
% 0.18/1.36 # Clause-clause subsumption calls (NU) : 24
% 0.18/1.36 # Rec. Clause-clause subsumption calls : 10
% 0.18/1.36 # Non-unit clause-clause subsumptions : 1
% 0.18/1.36 # Unit Clause-clause subsumption calls : 10
% 0.18/1.36 # Rewrite failures with RHS unbound : 0
% 0.18/1.36 # BW rewrite match attempts : 0
% 0.18/1.36 # BW rewrite match successes : 0
% 0.18/1.36 # Condensation attempts : 0
% 0.18/1.36 # Condensation successes : 0
% 0.18/1.36 # Termbank termtop insertions : 1798
% 0.18/1.36
% 0.18/1.36 # -------------------------------------------------
% 0.18/1.36 # User time : 0.011 s
% 0.18/1.36 # System time : 0.003 s
% 0.18/1.36 # Total time : 0.014 s
% 0.18/1.36 # Maximum resident set size: 2724 pages
%------------------------------------------------------------------------------