TSTP Solution File: GRA002+1 by Fampire---1.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Fampire---1.3
% Problem : GRA002+1 : TPTP v8.1.0. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp
% Command : FlotterOnTPTP.pl -f oldtptp -s vampire -t %d %s
% Computer : n025.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:22 EDT 2022
% Result : Unknown 0.18s 0.45s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : GRA002+1 : TPTP v8.1.0. Bugfixed v3.2.0.
% 0.06/0.12 % Command : FlotterOnTPTP.pl -f oldtptp -s vampire -t %d %s
% 0.12/0.33 % Computer : n025.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 00:10:27 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.33 cs: Command not found.
% 0.18/0.44
% 0.18/0.44 ERROR: Cannot translate to DFG with tptp4X
% 0.18/0.44 %------------------------------------------------------------------------------
% 0.18/0.44 % File : GRA002+1 : TPTP v8.0.0. Bugfixed v3.2.0.
% 0.18/0.44 % Domain : Graph Theory
% 0.18/0.44 % Problem : Maximal shortest path length in terms of triangles
% 0.18/0.44 % Version : Especial.
% 0.18/0.44 % English : In a complete directed graph, the maximal length of a shortest
% 0.18/0.44 % path between two vertices is the number of triangles in the
% 0.18/0.44 % graph minus 1.
% 0.18/0.44
% 0.18/0.44 % Refs :
% 0.18/0.44 % Source : [TPTP]
% 0.18/0.44 % Names :
% 0.18/0.44
% 0.18/0.44 % Status : Theorem
% 0.18/0.44 % Rating : 0.75 v7.5.0, 0.84 v7.4.0, 0.77 v7.3.0, 0.76 v7.1.0, 0.74 v7.0.0, 0.77 v6.4.0, 0.73 v6.3.0, 0.75 v6.2.0, 0.84 v6.1.0, 0.90 v6.0.0, 0.87 v5.5.0, 0.93 v5.4.0, 0.96 v5.2.0, 0.95 v5.0.0, 0.96 v3.7.0, 0.95 v3.3.0, 0.93 v3.2.0
% 0.18/0.44
% 0.18/0.44 % Syntax : Number of formulae : 18 ( 1 unt; 0 def)
% 0.18/0.44 % Number of atoms : 93 ( 24 equ)
% 0.18/0.44 % Maximal formula atoms : 9 ( 5 avg)
% 0.18/0.44 % Number of connectives : 81 ( 6 ~; 3 |; 46 &)
% 0.18/0.44 % ( 3 <=>; 18 =>; 2 <=; 3 <~>)
% 0.18/0.44 % Maximal formula depth : 13 ( 9 avg)
% 0.18/0.44 % Maximal term depth : 3 ( 1 avg)
% 0.18/0.44 % Number of predicates : 12 ( 11 usr; 1 prp; 0-3 aty)
% 0.18/0.44 % Number of functors : 12 ( 12 usr; 6 con; 0-2 aty)
% 0.18/0.44 % Number of variables : 68 ( 58 !; 10 ?)
% 0.18/0.44 % SPC : FOF_THM_RFO_SEQ
% 0.18/0.44
% 0.18/0.44 % Comments :
% 0.18/0.44 % Bugfixes : v3.2.0 - Bugfix to GRA001+0.ax
% 0.18/0.44 %------------------------------------------------------------------------------
% 0.18/0.44 %----Include axioms for directed graphs and paths
% 0.18/0.44 %------------------------------------------------------------------------------
% 0.18/0.44 begin_problem(SomeProblem).
% 0.18/0.44 list_of_descriptions.
% 0.18/0.44 name({* BLAH *}).
% 0.18/0.44 author({* BLAH *}).
% 0.18/0.44 status(unknown).
% 0.18/0.44 description({* BLAH *}).
% 0.18/0.44 end_of_list.
% 0.18/0.44 list_of_symbols.
% 0.18/0.44 functions[(edges__dfg,0),(empty__dfg,0),(graph__dfg,0),(head_of__dfg,1),(length_of__dfg,1),(minus__dfg,2),(n1__dfg,0),(number_of_in__dfg,2),(path_cons__dfg,2),(sequential_pairs__dfg,0),(tail_of__dfg,1),(triangles__dfg,0)].
% 0.18/0.44 predicates[(complete__dfg,0),(edge__dfg,1),(in_path__dfg,2),(less_or_equal__dfg,2),(on_path__dfg,2),(path__dfg,3),(precedes__dfg,3),(sequential__dfg,2),(shortest_path__dfg,3),(triangle__dfg,3),(vertex__dfg,1)].
% 0.18/0.44 end_of_list.
% 0.18/0.44
% 0.18/0.44 list_of_formulae(axioms).
% 0.18/0.44
% 0.18/0.44 formula(
% 0.18/0.44 forall([E],
% 0.18/0.44 implies(
% 0.18/0.44 edge__dfg(E),
% 0.18/0.44 not(
% 0.18/0.44 equal(head_of__dfg(E),tail_of__dfg(E))))),
% 0.18/0.44 no_loops).
% 0.18/0.44
% 0.18/0.44 formula(
% 0.18/0.44 forall([E],
% 0.18/0.44 implies(
% 0.18/0.44 edge__dfg(E),
% 0.18/0.44 and(
% 0.18/0.44 vertex__dfg(head_of__dfg(E)),
% 0.18/0.44 vertex__dfg(tail_of__dfg(E))))),
% 0.18/0.44 edge_ends_are_vertices).
% 0.18/0.44
% 0.18/0.44 formula(
% 0.18/0.44 implies(
% 0.18/0.44 complete__dfg,
% 0.18/0.44 forall([V1,V2],
% 0.18/0.44 implies(
% 0.18/0.44 and(
% 0.18/0.44 vertex__dfg(V1),
% 0.18/0.44 and(
% 0.18/0.44 vertex__dfg(V2),
% 0.18/0.44 not(
% 0.18/0.44 equal(V1,V2)))),
% 0.18/0.44 exists([E],
% 0.18/0.44 and(
% 0.18/0.44 edge__dfg(E),
% 0.18/0.44 ERROR: (JJ misuse): Not a DFG connective
%------------------------------------------------------------------------------