TSTP Solution File: GRA005+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : GRA005+1 : TPTP v8.1.0. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n024.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:22:08 EDT 2022
% Result : Theorem 0.20s 0.51s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of clauses : 10 ( 6 unt; 0 nHn; 10 RR)
% Number of literals : 18 ( 0 equ; 13 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 12 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
precedes(skc8,skc7,skc6),
file('GRA005+1.p',unknown),
[] ).
cnf(3,axiom,
shortest_path(skc10,skc11,skc6),
file('GRA005+1.p',unknown),
[] ).
cnf(5,axiom,
equal(tail_of(skc9),tail_of(skc8)),
file('GRA005+1.p',unknown),
[] ).
cnf(6,axiom,
equal(head_of(skc9),head_of(skc7)),
file('GRA005+1.p',unknown),
[] ).
cnf(58,axiom,
( ~ equal(head_of(u),head_of(v))
| ~ equal(tail_of(u),tail_of(w))
| ~ shortest_path(x,y,z)
| ~ precedes(w,v,z) ),
file('GRA005+1.p',unknown),
[] ).
cnf(95,plain,
( ~ equal(tail_of(skc9),tail_of(u))
| ~ precedes(u,skc7,v)
| ~ shortest_path(w,x,v) ),
inference(res,[status(thm),theory(equality)],[6,58]),
[iquote('0:Res:6.0,58.1')] ).
cnf(134,plain,
( ~ equal(tail_of(skc8),tail_of(u))
| ~ shortest_path(v,w,x)
| ~ precedes(u,skc7,x) ),
inference(rew,[status(thm),theory(equality)],[5,95]),
[iquote('0:Rew:5.0,95.0')] ).
cnf(152,plain,
( ~ equal(tail_of(skc8),tail_of(skc8))
| ~ shortest_path(u,v,skc6) ),
inference(res,[status(thm),theory(equality)],[2,134]),
[iquote('0:Res:2.0,134.1')] ).
cnf(177,plain,
~ shortest_path(u,v,skc6),
inference(obv,[status(thm),theory(equality)],[152]),
[iquote('0:Obv:152.0')] ).
cnf(178,plain,
$false,
inference(unc,[status(thm)],[177,3]),
[iquote('0:UnC:177.0,3.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRA005+1 : TPTP v8.1.0. Bugfixed v3.2.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.14/0.35 % Computer : n024.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 00:54:21 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.20/0.51
% 0.20/0.51 SPASS V 3.9
% 0.20/0.51 SPASS beiseite: Proof found.
% 0.20/0.51 % SZS status Theorem
% 0.20/0.51 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.51 SPASS derived 72 clauses, backtracked 0 clauses, performed 0 splits and kept 111 clauses.
% 0.20/0.51 SPASS allocated 98318 KBytes.
% 0.20/0.51 SPASS spent 0:00:00.15 on the problem.
% 0.20/0.51 0:00:00.04 for the input.
% 0.20/0.51 0:00:00.08 for the FLOTTER CNF translation.
% 0.20/0.51 0:00:00.00 for inferences.
% 0.20/0.51 0:00:00.00 for the backtracking.
% 0.20/0.51 0:00:00.00 for the reduction.
% 0.20/0.51
% 0.20/0.51
% 0.20/0.51 Here is a proof with depth 2, length 10 :
% 0.20/0.51 % SZS output start Refutation
% See solution above
% 0.20/0.51 Formulae used in the proof : no_short_cut_edge shortest_path_properties
% 0.20/0.51
%------------------------------------------------------------------------------