TSTP Solution File: GRA007+2 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : GRA007+2 : TPTP v8.1.0. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n017.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:09 EDT 2022
% Result : Theorem 0.18s 0.58s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 18
% Syntax : Number of clauses : 58 ( 14 unt; 14 nHn; 58 RR)
% Number of literals : 183 ( 0 equ; 114 neg)
% Maximal clause size : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 10 usr; 2 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 11 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
complete,
file('GRA007+2.p',unknown),
[] ).
cnf(2,axiom,
precedes(skc7,skc6,skc5),
file('GRA007+2.p',unknown),
[] ).
cnf(3,axiom,
shortest_path(skc8,skc9,skc5),
file('GRA007+2.p',unknown),
[] ).
cnf(4,axiom,
edge(skf12(u,v)),
file('GRA007+2.p',unknown),
[] ).
cnf(6,axiom,
( ~ edge(u)
| vertex(head_of(u)) ),
file('GRA007+2.p',unknown),
[] ).
cnf(7,axiom,
( ~ edge(u)
| vertex(tail_of(u)) ),
file('GRA007+2.p',unknown),
[] ).
cnf(22,axiom,
( ~ skP0(u,v,w)
| equal(w,head_of(v)) ),
file('GRA007+2.p',unknown),
[] ).
cnf(23,axiom,
( ~ skP0(u,v,w)
| equal(u,tail_of(v)) ),
file('GRA007+2.p',unknown),
[] ).
cnf(26,axiom,
( ~ shortest_path(u,v,w)
| path(u,v,w) ),
file('GRA007+2.p',unknown),
[] ).
cnf(30,axiom,
( ~ on_path(u,v)
| ~ path(w,x,v)
| edge(u) ),
file('GRA007+2.p',unknown),
[] ).
cnf(36,axiom,
( ~ precedes(u,v,w)
| ~ path(x,y,w)
| on_path(u,w) ),
file('GRA007+2.p',unknown),
[] ).
cnf(37,axiom,
( ~ precedes(u,v,w)
| ~ path(x,y,w)
| on_path(v,w) ),
file('GRA007+2.p',unknown),
[] ).
cnf(40,axiom,
( ~ edge(u)
| ~ equal(head_of(u),tail_of(skc7))
| ~ equal(tail_of(u),head_of(skc6)) ),
file('GRA007+2.p',unknown),
[] ).
cnf(48,axiom,
( ~ edge(u)
| ~ edge(v)
| ~ equal(head_of(u),tail_of(v))
| sequential(u,v)
| equal(u,v) ),
file('GRA007+2.p',unknown),
[] ).
cnf(57,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('GRA007+2.p',unknown),
[] ).
cnf(60,axiom,
( ~ vertex(u)
| ~ vertex(v)
| ~ complete
| equal(tail_of(skf12(u,v)),u)
| equal(u,v)
| skP0(v,skf12(u,v),u) ),
file('GRA007+2.p',unknown),
[] ).
cnf(61,axiom,
( ~ vertex(u)
| ~ vertex(v)
| ~ complete
| equal(head_of(skf12(u,v)),v)
| equal(u,v)
| skP0(v,skf12(u,v),u) ),
file('GRA007+2.p',unknown),
[] ).
cnf(64,axiom,
( ~ sequential(u,v)
| ~ precedes(v,w,x)
| ~ path(y,z,x)
| ~ on_path(u,x)
| ~ on_path(w,x)
| precedes(u,w,x) ),
file('GRA007+2.p',unknown),
[] ).
cnf(69,plain,
( ~ vertex(u)
| ~ vertex(v)
| equal(v,u)
| equal(tail_of(skf12(v,u)),v)
| skP0(u,skf12(v,u),v) ),
inference(mrr,[status(thm)],[60,1]),
[iquote('0:MRR:60.2,1.0')] ).
cnf(70,plain,
( ~ vertex(u)
| ~ vertex(v)
| equal(v,u)
| equal(head_of(skf12(v,u)),u)
| skP0(u,skf12(v,u),v) ),
inference(mrr,[status(thm)],[61,1]),
[iquote('0:MRR:61.2,1.0')] ).
cnf(72,plain,
( ~ on_path(u,v)
| ~ sequential(u,w)
| ~ path(x,y,v)
| ~ precedes(w,z,v)
| precedes(u,z,v) ),
inference(mrr,[status(thm)],[64,37]),
[iquote('0:MRR:64.4,37.2')] ).
cnf(75,plain,
path(skc8,skc9,skc5),
inference(res,[status(thm),theory(equality)],[3,26]),
[iquote('0:Res:3.0,26.0')] ).
cnf(79,plain,
( ~ equal(head_of(u),head_of(v))
| ~ equal(tail_of(u),tail_of(w))
| ~ precedes(w,v,skc5) ),
inference(res,[status(thm),theory(equality)],[3,57]),
[iquote('0:Res:3.0,57.3')] ).
cnf(82,plain,
( ~ path(u,v,skc5)
| on_path(skc7,skc5) ),
inference(res,[status(thm),theory(equality)],[2,36]),
[iquote('0:Res:2.0,36.1')] ).
cnf(83,plain,
( ~ path(u,v,skc5)
| on_path(skc6,skc5) ),
inference(res,[status(thm),theory(equality)],[2,37]),
[iquote('0:Res:2.0,37.1')] ).
cnf(86,plain,
( ~ on_path(u,skc5)
| ~ sequential(u,skc7)
| ~ path(v,w,skc5)
| precedes(u,skc6,skc5) ),
inference(res,[status(thm),theory(equality)],[2,72]),
[iquote('0:Res:2.0,72.1')] ).
cnf(93,plain,
( ~ equal(head_of(u),head_of(skc6))
| ~ equal(tail_of(u),tail_of(skc7)) ),
inference(res,[status(thm),theory(equality)],[2,79]),
[iquote('0:Res:2.0,79.2')] ).
cnf(99,plain,
on_path(skc6,skc5),
inference(res,[status(thm),theory(equality)],[75,83]),
[iquote('0:Res:75.0,83.0')] ).
cnf(100,plain,
on_path(skc7,skc5),
inference(res,[status(thm),theory(equality)],[75,82]),
[iquote('0:Res:75.0,82.0')] ).
cnf(108,plain,
( ~ on_path(u,skc5)
| edge(u) ),
inference(res,[status(thm),theory(equality)],[75,30]),
[iquote('0:Res:75.0,30.1')] ).
cnf(109,plain,
edge(skc6),
inference(res,[status(thm),theory(equality)],[99,108]),
[iquote('0:Res:99.0,108.0')] ).
cnf(110,plain,
edge(skc7),
inference(res,[status(thm),theory(equality)],[100,108]),
[iquote('0:Res:100.0,108.0')] ).
cnf(113,plain,
~ equal(tail_of(skc7),tail_of(skc6)),
inference(eqr,[status(thm),theory(equality)],[93]),
[iquote('0:EqR:93.0')] ).
cnf(169,plain,
( ~ on_path(u,skc5)
| ~ sequential(u,skc7)
| precedes(u,skc6,skc5) ),
inference(res,[status(thm),theory(equality)],[75,86]),
[iquote('0:Res:75.0,86.2')] ).
cnf(183,plain,
( ~ equal(tail_of(u),tail_of(v))
| ~ precedes(v,u,skc5) ),
inference(eqr,[status(thm),theory(equality)],[79]),
[iquote('0:EqR:79.0')] ).
cnf(187,plain,
( ~ on_path(u,skc5)
| ~ sequential(u,skc7)
| ~ equal(tail_of(skc6),tail_of(u)) ),
inference(res,[status(thm),theory(equality)],[169,183]),
[iquote('0:Res:169.2,183.1')] ).
cnf(188,plain,
( ~ sequential(skc6,skc7)
| ~ equal(tail_of(skc6),tail_of(skc6)) ),
inference(res,[status(thm),theory(equality)],[99,187]),
[iquote('0:Res:99.0,187.0')] ).
cnf(191,plain,
~ sequential(skc6,skc7),
inference(obv,[status(thm),theory(equality)],[188]),
[iquote('0:Obv:188.1')] ).
cnf(243,plain,
( ~ vertex(u)
| ~ vertex(v)
| equal(v,u)
| equal(head_of(skf12(v,u)),u)
| equal(head_of(skf12(v,u)),v) ),
inference(res,[status(thm),theory(equality)],[70,22]),
[iquote('0:Res:70.4,22.0')] ).
cnf(244,plain,
( ~ vertex(u)
| ~ vertex(v)
| equal(v,u)
| equal(head_of(skf12(v,u)),u)
| equal(tail_of(skf12(v,u)),u) ),
inference(res,[status(thm),theory(equality)],[70,23]),
[iquote('0:Res:70.4,23.0')] ).
cnf(277,plain,
( ~ vertex(u)
| ~ vertex(v)
| ~ equal(u,head_of(skc6))
| ~ equal(tail_of(skf12(v,u)),tail_of(skc7))
| equal(v,u)
| equal(head_of(skf12(v,u)),v) ),
inference(spl,[status(thm),theory(equality)],[243,93]),
[iquote('0:SpL:243.3,93.0')] ).
cnf(284,plain,
( ~ vertex(u)
| ~ vertex(v)
| ~ edge(skf12(v,u))
| ~ equal(v,tail_of(skc7))
| ~ equal(tail_of(skf12(v,u)),head_of(skc6))
| equal(v,u)
| equal(head_of(skf12(v,u)),u) ),
inference(spl,[status(thm),theory(equality)],[243,40]),
[iquote('0:SpL:243.4,40.1')] ).
cnf(296,plain,
( ~ vertex(u)
| ~ vertex(v)
| ~ edge(skf12(v,u))
| ~ equal(v,tail_of(skc7))
| ~ equal(u,head_of(skc6))
| equal(v,u)
| equal(head_of(skf12(v,u)),u) ),
inference(rew,[status(thm),theory(equality)],[244,284]),
[iquote('0:Rew:244.4,284.4')] ).
cnf(297,plain,
( ~ vertex(u)
| ~ vertex(v)
| ~ equal(v,tail_of(skc7))
| ~ equal(u,head_of(skc6))
| equal(v,u)
| equal(head_of(skf12(v,u)),u) ),
inference(ssi,[status(thm)],[296,4]),
[iquote('0:SSi:296.2,4.0')] ).
cnf(302,plain,
( ~ vertex(u)
| ~ vertex(v)
| equal(v,u)
| equal(tail_of(skf12(v,u)),v)
| equal(head_of(skf12(v,u)),v) ),
inference(res,[status(thm),theory(equality)],[69,22]),
[iquote('0:Res:69.4,22.0')] ).
cnf(310,plain,
( ~ vertex(u)
| ~ vertex(v)
| ~ equal(u,head_of(skc6))
| ~ equal(v,tail_of(skc7))
| equal(v,u)
| equal(head_of(skf12(v,u)),v) ),
inference(rew,[status(thm),theory(equality)],[302,277]),
[iquote('0:Rew:302.3,277.3')] ).
cnf(314,plain,
( ~ vertex(u)
| ~ vertex(v)
| ~ equal(u,head_of(skc6))
| ~ equal(v,tail_of(skc7))
| equal(v,u)
| equal(u,v) ),
inference(rew,[status(thm),theory(equality)],[297,310]),
[iquote('0:Rew:297.5,310.5')] ).
cnf(315,plain,
( ~ vertex(u)
| ~ vertex(v)
| ~ equal(u,head_of(skc6))
| ~ equal(v,tail_of(skc7))
| equal(u,v) ),
inference(obv,[status(thm),theory(equality)],[314]),
[iquote('0:Obv:314.4')] ).
cnf(386,plain,
( ~ vertex(head_of(skc6))
| ~ vertex(u)
| ~ equal(u,tail_of(skc7))
| equal(head_of(skc6),u) ),
inference(eqr,[status(thm),theory(equality)],[315]),
[iquote('0:EqR:315.2')] ).
cnf(387,plain,
( ~ vertex(u)
| ~ equal(u,tail_of(skc7))
| equal(head_of(skc6),u) ),
inference(ssi,[status(thm)],[386,6,109]),
[iquote('0:SSi:386.0,6.0,109.1')] ).
cnf(499,plain,
( ~ edge(skc6)
| ~ edge(skc7)
| ~ equal(head_of(skc6),tail_of(skc7))
| equal(skc7,skc6) ),
inference(res,[status(thm),theory(equality)],[48,191]),
[iquote('0:Res:48.3,191.0')] ).
cnf(500,plain,
( ~ equal(head_of(skc6),tail_of(skc7))
| equal(skc7,skc6) ),
inference(ssi,[status(thm)],[499,110,109]),
[iquote('0:SSi:499.1,499.0,110.0,109.0')] ).
cnf(662,plain,
( ~ vertex(u)
| ~ equal(u,tail_of(skc7))
| ~ equal(u,tail_of(skc7))
| equal(skc7,skc6) ),
inference(spl,[status(thm),theory(equality)],[387,500]),
[iquote('0:SpL:387.2,500.0')] ).
cnf(692,plain,
( ~ vertex(u)
| ~ equal(u,tail_of(skc7))
| equal(skc7,skc6) ),
inference(obv,[status(thm),theory(equality)],[662]),
[iquote('0:Obv:662.1')] ).
cnf(736,plain,
( ~ vertex(tail_of(skc7))
| equal(skc7,skc6) ),
inference(eqr,[status(thm),theory(equality)],[692]),
[iquote('0:EqR:692.1')] ).
cnf(737,plain,
equal(skc7,skc6),
inference(ssi,[status(thm)],[736,7,110]),
[iquote('0:SSi:736.0,7.0,110.1')] ).
cnf(752,plain,
~ equal(tail_of(skc6),tail_of(skc6)),
inference(rew,[status(thm),theory(equality)],[737,113]),
[iquote('0:Rew:737.0,113.0')] ).
cnf(854,plain,
$false,
inference(obv,[status(thm),theory(equality)],[752]),
[iquote('0:Obv:752.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : GRA007+2 : TPTP v8.1.0. Bugfixed v3.2.0.
% 0.10/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n017.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 02:39:55 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.58
% 0.18/0.58 SPASS V 3.9
% 0.18/0.58 SPASS beiseite: Proof found.
% 0.18/0.58 % SZS status Theorem
% 0.18/0.58 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.58 SPASS derived 649 clauses, backtracked 83 clauses, performed 3 splits and kept 406 clauses.
% 0.18/0.58 SPASS allocated 98531 KBytes.
% 0.18/0.58 SPASS spent 0:00:00.23 on the problem.
% 0.18/0.58 0:00:00.03 for the input.
% 0.18/0.58 0:00:00.07 for the FLOTTER CNF translation.
% 0.18/0.58 0:00:00.01 for inferences.
% 0.18/0.58 0:00:00.00 for the backtracking.
% 0.18/0.58 0:00:00.09 for the reduction.
% 0.18/0.58
% 0.18/0.58
% 0.18/0.58 Here is a proof with depth 7, length 58 :
% 0.18/0.58 % SZS output start Refutation
% See solution above
% 0.18/0.58 Formulae used in the proof : back_edge complete_properties shortest_path_defn path_properties edge_ends_are_vertices on_path_properties precedes_properties sequential_defn shortest_path_properties precedes_defn
% 0.18/0.58
%------------------------------------------------------------------------------