%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : GRA005+1 : TPTP v9.3.1. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% Computer : n012.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun Sep 27 07:18:21 AM UTC 2026
% Result : Theorem 4.74s 2.55s
% Output : Refutation 5.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 18
% Syntax : Number of formulae : 38 ( 3 unt; 0 typ; 0 def)
% Number of atoms : 224 ( 64 equ; 0 cnn)
% Maximal formula atoms : 14 ( 5 avg)
% Number of connectives : 658 ( 22 ~; 6 |; 122 &; 450 @)
% ( 3 <=>; 50 =>; 2 <=; 3 <~>)
% Maximal formula depth : 19 ( 11 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 25 ( 23 usr; 8 con; 0-3 aty)
% Number of variables : 151 ( 0 ^; 126 !; 25 ?; 151 :)
% Comments :
%------------------------------------------------------------------------------
thf(shortest_path_decl,type,
shortest_path: $i > $i > $i > $o ).
thf(precedes_decl,type,
precedes: $i > $i > $i > $o ).
thf(edge_decl,type,
edge: $i > $o ).
thf(tail_of_decl,type,
tail_of: $i > $i ).
thf(head_of_decl,type,
head_of: $i > $i ).
thf(path_decl,type,
path: $i > $i > $i > $o ).
thf(number_of_in_decl,type,
number_of_in: $i > $i > $i ).
thf(sequential_pairs_decl,type,
sequential_pairs: $i ).
thf(minus_decl,type,
minus: $i > $i > $i ).
thf(length_of_decl,type,
length_of: $i > $i ).
thf(n1_decl,type,
n1: $i ).
thf(less_or_equal_decl,type,
less_or_equal: $i > $i > $o ).
thf(graph_decl,type,
graph: $i ).
thf(edges_decl,type,
edges: $i ).
thf(on_path_decl,type,
on_path: $i > $i > $o ).
thf(sequential_decl,type,
sequential: $i > $i > $o ).
thf(triangle_decl,type,
triangle: $i > $i > $i > $o ).
thf(triangles_decl,type,
triangles: $i ).
thf(vertex_decl,type,
vertex: $i > $o ).
thf(path_cons_decl,type,
path_cons: $i > $i > $i ).
thf(empty_decl,type,
empty: $i ).
thf(in_path_decl,type,
in_path: $i > $i > $o ).
thf(complete_decl,type,
complete: $o ).
thf(12,axiom,
! [A: $i] :
( ( A @ edge )
=> ( ( A @ head_of )
!= ( A @ tail_of ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',no_loops) ).
thf(101,plain,
! [A: $i] :
( ( A @ edge )
=> ( ( A @ head_of )
!= ( A @ tail_of ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[12]) ).
thf(10,axiom,
! [A: $i,B: $i,C: $i,D: $i] :
( ( ( C @ ( D @ in_path ) )
& ( C @ ( B @ ( A @ path ) ) ) )
=> ( ? [E: $i] :
( ( ( D
= ( E @ tail_of ) )
| ( D
= ( E @ head_of ) ) )
& ( C @ ( E @ on_path ) ) )
& ( D @ vertex ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',in_path_properties) ).
thf(85,plain,
! [A: $i,B: $i,C: $i,D: $i] :
( ( ( C @ ( D @ in_path ) )
& ( C @ ( B @ ( A @ path ) ) ) )
=> ( ? [E: $i] :
( ( ( D
= ( E @ tail_of ) )
| ( D
= ( E @ head_of ) ) )
& ( C @ ( E @ on_path ) ) )
& ( D @ vertex ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[10]) ).
thf(19,axiom,
! [A: $i,B: $i,C: $i] :
( ( C @ ( B @ ( A @ triangle ) ) )
<=> ( ( A @ ( C @ sequential ) )
& ( C @ ( B @ sequential ) )
& ( B @ ( A @ sequential ) )
& ( C @ edge )
& ( B @ edge )
& ( A @ edge ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',triangle_defn) ).
thf(156,plain,
! [A: $i,B: $i,C: $i] :
( ( ( ( A @ ( C @ sequential ) )
& ( C @ ( B @ sequential ) )
& ( B @ ( A @ sequential ) )
& ( C @ edge )
& ( B @ edge )
& ( A @ edge ) )
=> ( C @ ( B @ ( A @ triangle ) ) ) )
& ( ( C @ ( B @ ( A @ triangle ) ) )
=> ( ( A @ ( C @ sequential ) )
& ( C @ ( B @ sequential ) )
& ( B @ ( A @ sequential ) )
& ( C @ edge )
& ( B @ edge )
& ( A @ edge ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[19]) ).
thf(7,axiom,
! [A: $i,B: $i] :
( ( B @ ( A @ sequential ) )
<=> ( ( ( A @ head_of )
= ( B @ tail_of ) )
& ( A != B )
& ( B @ edge )
& ( A @ edge ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sequential_defn) ).
thf(49,plain,
! [A: $i,B: $i] :
( ( ( ( ( A @ head_of )
= ( B @ tail_of ) )
& ( A != B )
& ( B @ edge )
& ( A @ edge ) )
=> ( B @ ( A @ sequential ) ) )
& ( ( B @ ( A @ sequential ) )
=> ( ( ( A @ head_of )
= ( B @ tail_of ) )
& ( A != B )
& ( B @ edge )
& ( A @ edge ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(11,axiom,
! [A: $i,B: $i,C: $i] :
( ( A @ ( C @ ( B @ path ) ) )
=> ! [D: $i,E: $i] :
( ( A @ ( E @ ( D @ precedes ) ) )
=> ( ( ( E @ ( D @ sequential ) )
<~> ? [F: $i] :
( ( A @ ( E @ ( F @ precedes ) ) )
& ( F @ ( D @ sequential ) ) ) )
& ( A @ ( E @ on_path ) )
& ( A @ ( D @ on_path ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',precedes_properties) ).
thf(91,plain,
! [A: $i,B: $i,C: $i] :
( ( A @ ( C @ ( B @ path ) ) )
=> ! [D: $i,E: $i] :
( ( A @ ( E @ ( D @ precedes ) ) )
=> ( ~ ( ( ? [F: $i] :
( ( A @ ( E @ ( F @ precedes ) ) )
& ( F @ ( D @ sequential ) ) )
=> ( E @ ( D @ sequential ) ) )
& ( ( E @ ( D @ sequential ) )
=> ? [F: $i] :
( ( A @ ( E @ ( F @ precedes ) ) )
& ( F @ ( D @ sequential ) ) ) ) )
& ( A @ ( E @ on_path ) )
& ( A @ ( D @ on_path ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[11]) ).
thf(5,axiom,
! [A: $i,B: $i,C: $i] :
( ( C @ ( B @ ( A @ path ) ) )
=> ( ( C @ length_of )
= ( C @ ( edges @ number_of_in ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',length_defn) ).
thf(35,plain,
! [A: $i,B: $i,C: $i] :
( ( C @ ( B @ ( A @ path ) ) )
=> ( ( C @ length_of )
= ( C @ ( edges @ number_of_in ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(14,axiom,
! [A: $i,B: $i,C: $i] :
( ( C @ ( B @ ( A @ shortest_path ) ) )
<=> ( ! [D: $i] :
( ( D @ ( B @ ( A @ path ) ) )
=> ( D @ length_of @ ( C @ length_of @ less_or_equal ) ) )
& ( A != B )
& ( C @ ( B @ ( A @ path ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',shortest_path_defn) ).
thf(112,plain,
! [A: $i,B: $i,C: $i] :
( ( ( ! [D: $i] :
( ( D @ ( B @ ( A @ path ) ) )
=> ( D @ length_of @ ( C @ length_of @ less_or_equal ) ) )
& ( A != B )
& ( C @ ( B @ ( A @ path ) ) ) )
=> ( C @ ( B @ ( A @ shortest_path ) ) ) )
& ( ( C @ ( B @ ( A @ shortest_path ) ) )
=> ( ! [D: $i] :
( ( D @ ( B @ ( A @ path ) ) )
=> ( D @ length_of @ ( C @ length_of @ less_or_equal ) ) )
& ( A != B )
& ( C @ ( B @ ( A @ path ) ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[14]) ).
thf(9,axiom,
! [A: $i,B: $i,C: $i] :
( ( C @ ( B @ ( A @ path ) ) )
=> ( ? [D: $i] :
( ( ( ( C
= ( empty @ ( D @ path_cons ) ) )
& ( B
= ( D @ head_of ) ) )
<~> ? [E: $i] :
( ( C
= ( E @ ( D @ path_cons ) ) )
& ( E @ ( B @ ( D @ head_of @ path ) ) ) ) )
& ( A
= ( D @ tail_of ) )
& ( D @ edge ) )
& ( B @ vertex )
& ( A @ vertex ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',path_properties) ).
thf(67,plain,
! [A: $i,B: $i,C: $i] :
( ( C @ ( B @ ( A @ path ) ) )
=> ( ? [D: $i] :
( ~ ( ( ? [E: $i] :
( ( C
= ( E @ ( D @ path_cons ) ) )
& ( E @ ( B @ ( D @ head_of @ path ) ) ) )
=> ( ( C
= ( empty @ ( D @ path_cons ) ) )
& ( B
= ( D @ head_of ) ) ) )
& ( ( ( C
= ( empty @ ( D @ path_cons ) ) )
& ( B
= ( D @ head_of ) ) )
=> ? [E: $i] :
( ( C
= ( E @ ( D @ path_cons ) ) )
& ( E @ ( B @ ( D @ head_of @ path ) ) ) ) ) )
& ( A
= ( D @ tail_of ) )
& ( D @ edge ) )
& ( B @ vertex )
& ( A @ vertex ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).
thf(13,axiom,
! [A: $i,B: $i,C: $i] :
( ( C @ ( B @ ( A @ path ) ) )
<= ( ? [D: $i] :
( ( ? [E: $i] :
( ( C
= ( E @ ( D @ path_cons ) ) )
& ( E @ ( B @ ( D @ head_of @ path ) ) ) )
| ( ( C
= ( empty @ ( D @ path_cons ) ) )
& ( B
= ( D @ head_of ) ) ) )
& ( A
= ( D @ tail_of ) )
& ( D @ edge ) )
& ( B @ vertex )
& ( A @ vertex ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',path_defn) ).
thf(104,plain,
! [A: $i,B: $i,C: $i] :
( ( ? [D: $i] :
( ( ? [E: $i] :
( ( C
= ( E @ ( D @ path_cons ) ) )
& ( E @ ( B @ ( D @ head_of @ path ) ) ) )
| ( ( C
= ( empty @ ( D @ path_cons ) ) )
& ( B
= ( D @ head_of ) ) ) )
& ( A
= ( D @ tail_of ) )
& ( D @ edge ) )
& ( B @ vertex )
& ( A @ vertex ) )
=> ( C @ ( B @ ( A @ path ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[13]) ).
thf(3,axiom,
! [A: $i,B: $i,C: $i] :
( ( C @ ( B @ ( A @ path ) ) )
=> ( ( C @ ( sequential_pairs @ number_of_in ) )
= ( n1 @ ( C @ length_of @ minus ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',path_length_sequential_pairs) ).
thf(30,plain,
! [A: $i,B: $i,C: $i] :
( ( C @ ( B @ ( A @ path ) ) )
=> ( ( C @ ( sequential_pairs @ number_of_in ) )
= ( n1 @ ( C @ length_of @ minus ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(1,conjecture,
! [A: $i,B: $i,C: $i,D: $i,E: $i] :
( ( ( E @ ( D @ ( C @ precedes ) ) )
& ( E @ ( B @ ( A @ shortest_path ) ) ) )
=> ~ ? [F: $i] :
( ( ( F @ head_of )
= ( D @ head_of ) )
& ( ( F @ tail_of )
= ( C @ tail_of ) )
& ( F @ edge ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',no_short_cut_edge) ).
thf(2,negated_conjecture,
~ ! [A: $i,B: $i,C: $i,D: $i,E: $i] :
( ( ( E @ ( D @ ( C @ precedes ) ) )
& ( E @ ( B @ ( A @ shortest_path ) ) ) )
=> ~ ? [F: $i] :
( ( ( F @ head_of )
= ( D @ head_of ) )
& ( ( F @ tail_of )
= ( C @ tail_of ) )
& ( F @ edge ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(20,plain,
~ ! [A: $i,B: $i,C: $i,D: $i,E: $i] :
( ( ( E @ ( D @ ( C @ precedes ) ) )
& ( E @ ( B @ ( A @ shortest_path ) ) ) )
=> ~ ? [F: $i] :
( ( ( F @ head_of )
= ( D @ head_of ) )
& ( ( F @ tail_of )
= ( C @ tail_of ) )
& ( F @ edge ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(18,axiom,
! [A: $i] :
( ( A @ edge )
=> ( ( A @ tail_of @ vertex )
& ( A @ head_of @ vertex ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',edge_ends_are_vertices) ).
thf(152,plain,
! [A: $i] :
( ( A @ edge )
=> ( ( A @ tail_of @ vertex )
& ( A @ head_of @ vertex ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[18]) ).
thf(6,axiom,
! [A: $i,B: $i,C: $i] :
( ( ! [D: $i,E: $i] :
( ( ( E @ ( D @ sequential ) )
& ( A @ ( E @ on_path ) )
& ( A @ ( D @ on_path ) ) )
=> ? [F: $i] : ( F @ ( E @ ( D @ triangle ) ) ) )
& ( A @ ( C @ ( B @ path ) ) ) )
=> ( ( A @ ( sequential_pairs @ number_of_in ) )
= ( A @ ( triangles @ number_of_in ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sequential_pairs_and_triangles) ).
thf(38,plain,
! [A: $i,B: $i,C: $i] :
( ( ! [D: $i,E: $i] :
( ( ( E @ ( D @ sequential ) )
& ( A @ ( E @ on_path ) )
& ( A @ ( D @ on_path ) ) )
=> ? [F: $i] : ( F @ ( E @ ( D @ triangle ) ) ) )
& ( A @ ( C @ ( B @ path ) ) ) )
=> ( ( A @ ( sequential_pairs @ number_of_in ) )
= ( A @ ( triangles @ number_of_in ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(4,axiom,
! [A: $i,B: $i] : ( graph @ ( A @ number_of_in ) @ ( B @ ( A @ number_of_in ) @ less_or_equal ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',graph_has_them_all) ).
thf(33,plain,
! [A: $i,B: $i] : ( graph @ ( A @ number_of_in ) @ ( B @ ( A @ number_of_in ) @ less_or_equal ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(15,axiom,
! [A: $i,B: $i,C: $i] :
( ( A @ ( C @ ( B @ path ) ) )
=> ! [D: $i,E: $i] :
( ( A @ ( E @ ( D @ precedes ) ) )
<= ( ( ? [F: $i] :
( ( A @ ( E @ ( F @ precedes ) ) )
& ( F @ ( D @ sequential ) ) )
| ( E @ ( D @ sequential ) ) )
& ( A @ ( E @ on_path ) )
& ( A @ ( D @ on_path ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',precedes_defn) ).
thf(126,plain,
! [A: $i,B: $i,C: $i] :
( ( A @ ( C @ ( B @ path ) ) )
=> ! [D: $i,E: $i] :
( ( ( ? [F: $i] :
( ( A @ ( E @ ( F @ precedes ) ) )
& ( F @ ( D @ sequential ) ) )
| ( E @ ( D @ sequential ) ) )
& ( A @ ( E @ on_path ) )
& ( A @ ( D @ on_path ) ) )
=> ( A @ ( E @ ( D @ precedes ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[15]) ).
thf(17,axiom,
( complete
=> ! [A: $i,B: $i] :
( ( ( A != B )
& ( B @ vertex )
& ( A @ vertex ) )
=> ? [C: $i] :
( ( ( ( B
= ( C @ tail_of ) )
& ( A
= ( C @ head_of ) ) )
<~> ( ( A
= ( C @ tail_of ) )
& ( B
= ( C @ head_of ) ) ) )
& ( C @ edge ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',complete_properties) ).
thf(136,plain,
( complete
=> ! [A: $i,B: $i] :
( ( ( A != B )
& ( B @ vertex )
& ( A @ vertex ) )
=> ? [C: $i] :
( ~ ( ( ( ( A
= ( C @ tail_of ) )
& ( B
= ( C @ head_of ) ) )
=> ( ( B
= ( C @ tail_of ) )
& ( A
= ( C @ head_of ) ) ) )
& ( ( ( B
= ( C @ tail_of ) )
& ( A
= ( C @ head_of ) ) )
=> ( ( A
= ( C @ tail_of ) )
& ( B
= ( C @ head_of ) ) ) ) )
& ( C @ edge ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[17]) ).
thf(16,axiom,
! [A: $i,B: $i,C: $i,D: $i] :
( ( ( C @ ( D @ on_path ) )
& ( C @ ( B @ ( A @ path ) ) ) )
=> ( ( C @ ( D @ tail_of @ in_path ) )
& ( C @ ( D @ head_of @ in_path ) )
& ( D @ edge ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',on_path_properties) ).
thf(131,plain,
! [A: $i,B: $i,C: $i,D: $i] :
( ( ( C @ ( D @ on_path ) )
& ( C @ ( B @ ( A @ path ) ) ) )
=> ( ( C @ ( D @ tail_of @ in_path ) )
& ( C @ ( D @ head_of @ in_path ) )
& ( D @ edge ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[16]) ).
thf(8,axiom,
! [A: $i,B: $i,C: $i,D: $i,E: $i] :
( ( ( E @ ( D @ ( C @ precedes ) ) )
& ( E @ ( B @ ( A @ shortest_path ) ) ) )
=> ( ~ ( E @ ( C @ ( D @ precedes ) ) )
& ~ ? [F: $i] :
( ( ( F @ head_of )
= ( D @ head_of ) )
& ( ( F @ tail_of )
= ( C @ tail_of ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',shortest_path_properties) ).
thf(62,plain,
! [A: $i,B: $i,C: $i,D: $i,E: $i] :
( ( ( E @ ( D @ ( C @ precedes ) ) )
& ( E @ ( B @ ( A @ shortest_path ) ) ) )
=> ( ~ ( E @ ( C @ ( D @ precedes ) ) )
& ~ ? [F: $i] :
( ( ( F @ head_of )
= ( D @ head_of ) )
& ( ( F @ tail_of )
= ( C @ tail_of ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).
thf(167,plain,
$false,
inference(e,[status(thm)],[101,85,156,49,91,35,112,67,104,30,20,152,38,33,126,136,131,62]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRA005+1 : TPTP v9.3.1. Bugfixed v3.2.0.
% 0.00/0.07 % Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% 0.12/0.40 % Computer : n012.cluster.edu
% 0.12/0.40 % Model : x86_64 x86_64
% 0.12/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.40 % Memory : 8046.5625MB
% 0.12/0.40 % OS : Linux 6.8.0-71-generic
% 0.12/0.40 % CPULimit : 300
% 0.12/0.40 % WCLimit : 300
% 0.12/0.40 % DateTime : Fri Sep 25 13:47:54 UTC 2026
% 0.12/0.40 % CPUTime :
% 0.12/0.40 Running java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% 0.74/0.87 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.17/1.05 % [INFO] Parsing done (176ms).
% 1.17/1.06 % [INFO] Running in sequential loop mode.
% 1.90/1.41 % [INFO] eprover registered as external prover.
% 1.90/1.41 % [INFO] Scanning for conjecture ...
% 2.07/1.51 % [INFO] Found a conjecture (or negated_conjecture) and 17 axioms. Running axiom selection ...
% 2.07/1.58 % [INFO] Axiom selection finished. Selected 17 axioms (removed 0 axioms).
% 2.27/1.63 % [INFO] Problem is first-order (TPTP FOF).
% 2.27/1.64 % [INFO] Type checking passed.
% 2.27/1.65 % [CONFIG] Using configuration: timeout(300) with strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>. Searching for refutation ...
% 4.74/2.54 % External prover 'e' found a proof!
% 4.74/2.54 % [INFO] Killing All external provers ...
% 4.74/2.55 % Time passed: 2028ms (effective reasoning time: 1475ms)
% 4.74/2.55 % Solved by strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>
% 4.74/2.55 % Axioms used in derivation (17): path_defn, sequential_defn, graph_has_them_all, path_properties, sequential_pairs_and_triangles, edge_ends_are_vertices, no_loops, length_defn, triangle_defn, complete_properties, shortest_path_defn, in_path_properties, precedes_properties, on_path_properties, path_length_sequential_pairs, shortest_path_properties, precedes_defn
% 4.74/2.55 % No. of inferences in proof: 38
% 4.74/2.55 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 2028 ms resp. 1475 ms w/o parsing
% 5.10/2.62 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 5.10/2.62 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------