TSTP Solution File: GRA008+2 by Fampire---1.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Fampire---1.3
% Problem : GRA008+2 : TPTP v8.1.0. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp
% Command : FlotterOnTPTP.pl -f oldtptp -s vampire -t %d %s
% Computer : n028.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:23 EDT 2022
% Result : Unknown 0.21s 0.47s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : GRA008+2 : TPTP v8.1.0. Bugfixed v3.2.0.
% 0.08/0.13 % Command : FlotterOnTPTP.pl -f oldtptp -s vampire -t %d %s
% 0.14/0.35 % Computer : n028.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Tue May 31 01:01:35 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.14/0.35 cs: Command not found.
% 0.21/0.47
% 0.21/0.47 ERROR: Cannot translate to DFG with tptp4X
% 0.21/0.47 %--------------------------------------------------------------------------
% 0.21/0.47 % File : GRA008+2 : TPTP v8.0.0. Bugfixed v3.2.0.
% 0.21/0.47 % Domain : Graph Theory
% 0.21/0.47 % Problem : Maximal shortest path length in terms of triangles
% 0.21/0.47 % Version : Augmented > Especial.
% 0.21/0.47 % English : In a complete graph with a shortest path P from V1 to V2 with
% 0.21/0.47 % edges E1 and E2, E1 preceding and sequential to E2, there is
% 0.21/0.47 % an edge E3 such that E1, E2, and E3 form a triangle.
% 0.21/0.47
% 0.21/0.47 % Refs :
% 0.21/0.47 % Source : [TPTP]
% 0.21/0.47 % Names :
% 0.21/0.47
% 0.21/0.47 % Status : Theorem
% 0.21/0.47 % Rating : 0.28 v7.5.0, 0.31 v7.4.0, 0.20 v7.3.0, 0.21 v7.2.0, 0.17 v7.1.0, 0.22 v7.0.0, 0.20 v6.4.0, 0.27 v6.3.0, 0.29 v6.2.0, 0.36 v6.1.0, 0.47 v6.0.0, 0.43 v5.5.0, 0.52 v5.4.0, 0.50 v5.3.0, 0.56 v5.2.0, 0.35 v5.1.0, 0.43 v5.0.0, 0.46 v4.1.0, 0.48 v4.0.1, 0.57 v4.0.0, 0.54 v3.7.0, 0.50 v3.5.0, 0.42 v3.4.0, 0.47 v3.3.0, 0.36 v3.2.0
% 0.21/0.47
% 0.21/0.47 % Syntax : Number of formulae : 19 ( 1 unt; 0 def)
% 0.21/0.47 % Number of atoms : 101 ( 26 equ)
% 0.21/0.47 % Maximal formula atoms : 9 ( 5 avg)
% 0.21/0.47 % Number of connectives : 88 ( 6 ~; 3 |; 51 &)
% 0.21/0.47 % ( 3 <=>; 20 =>; 2 <=; 3 <~>)
% 0.21/0.47 % Maximal formula depth : 13 ( 9 avg)
% 0.21/0.47 % Maximal term depth : 3 ( 1 avg)
% 0.21/0.47 % Number of predicates : 12 ( 11 usr; 1 prp; 0-3 aty)
% 0.21/0.47 % Number of functors : 12 ( 12 usr; 6 con; 0-2 aty)
% 0.21/0.47 % Number of variables : 77 ( 65 !; 12 ?)
% 0.21/0.47 % SPC : FOF_THM_RFO_SEQ
% 0.21/0.47
% 0.21/0.47 % Comments :
% 0.21/0.47 % Bugfixes : v3.2.0 - Bugfix to GRA001+0.ax
% 0.21/0.47 %--------------------------------------------------------------------------
% 0.21/0.47 %----Include axioms for directed graphs and paths
% 0.21/0.47 %------------------------------------------------------------------------------
% 0.21/0.47 begin_problem(SomeProblem).
% 0.21/0.47 list_of_descriptions.
% 0.21/0.47 name({* BLAH *}).
% 0.21/0.47 author({* BLAH *}).
% 0.21/0.47 status(unknown).
% 0.21/0.47 description({* BLAH *}).
% 0.21/0.47 end_of_list.
% 0.21/0.47 list_of_symbols.
% 0.21/0.47 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.21/0.47 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.21/0.47 end_of_list.
% 0.21/0.47
% 0.21/0.47 list_of_formulae(axioms).
% 0.21/0.47
% 0.21/0.47 formula(
% 0.21/0.47 forall([E],
% 0.21/0.47 implies(
% 0.21/0.47 edge__dfg(E),
% 0.21/0.47 not(
% 0.21/0.47 equal(head_of__dfg(E),tail_of__dfg(E))))),
% 0.21/0.47 no_loops).
% 0.21/0.47
% 0.21/0.47 formula(
% 0.21/0.47 forall([E],
% 0.21/0.47 implies(
% 0.21/0.47 edge__dfg(E),
% 0.21/0.47 and(
% 0.21/0.47 vertex__dfg(head_of__dfg(E)),
% 0.21/0.47 vertex__dfg(tail_of__dfg(E))))),
% 0.21/0.47 edge_ends_are_vertices).
% 0.21/0.47
% 0.21/0.47 formula(
% 0.21/0.47 implies(
% 0.21/0.47 complete__dfg,
% 0.21/0.47 forall([V1,V2],
% 0.21/0.47 implies(
% 0.21/0.47 and(
% 0.21/0.47 vertex__dfg(V1),
% 0.21/0.47 and(
% 0.21/0.47 vertex__dfg(V2),
% 0.21/0.47 not(
% 0.21/0.47 equal(V1,V2)))),
% 0.21/0.47 exists([E],
% 0.21/0.47 and(
% 0.21/0.47 edge__dfg(E),
% 0.21/0.47 ERROR: (JJ misuse): Not a DFG connective
%------------------------------------------------------------------------------