TSTP Solution File: PLA031-1.001 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : PLA031-1.001 : TPTP v8.1.0. Released v3.5.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n022.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 : Mon Jul 18 17:32:24 EDT 2022
% Result : Unsatisfiable 71.22s 71.41s
% Output : Refutation 71.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 21
% Syntax : Number of clauses : 44 ( 25 unt; 0 nHn; 44 RR)
% Number of literals : 69 ( 0 equ; 28 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-6 aty)
% Number of functors : 14 ( 14 usr; 14 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(7,axiom,
( ~ s(u,v,w,x,y,v)
| s(u,truck2,w,x,y,v) ),
file('PLA031-1.001.p',unknown),
[] ).
cnf(8,axiom,
( ~ s(u,truck2,v,w,x,y)
| s(u,y,v,w,x,y) ),
file('PLA031-1.001.p',unknown),
[] ).
cnf(9,axiom,
( ~ neq(u,truck1)
| ~ s(v,w,x,u,x,y)
| s(v,w,truck1,u,x,y) ),
file('PLA031-1.001.p',unknown),
[] ).
cnf(10,axiom,
( ~ s(u,v,truck1,w,x,y)
| s(u,v,x,w,x,y) ),
file('PLA031-1.001.p',unknown),
[] ).
cnf(11,axiom,
( ~ neq(u,truck2)
| ~ s(v,w,x,u,y,x)
| s(v,w,truck2,u,y,x) ),
file('PLA031-1.001.p',unknown),
[] ).
cnf(12,axiom,
( ~ s(u,v,truck2,w,x,y)
| s(u,v,y,w,x,y) ),
file('PLA031-1.001.p',unknown),
[] ).
cnf(17,axiom,
( ~ link(u,v)
| ~ s(w,x,truck1,y,u,z)
| s(w,x,truck1,y,v,z) ),
file('PLA031-1.001.p',unknown),
[] ).
cnf(18,axiom,
( ~ link(u,v)
| ~ s(w,x,truck2,y,z,u)
| s(w,x,truck2,y,z,v) ),
file('PLA031-1.001.p',unknown),
[] ).
cnf(21,axiom,
( ~ path(u,v)
| ~ s(w,x,u,y,z,x1)
| s(w,x,v,y,z,x1) ),
file('PLA031-1.001.p',unknown),
[] ).
cnf(22,axiom,
( ~ path(u,v)
| ~ s(w,x,y,u,z,x1)
| s(w,x,y,v,z,x1) ),
file('PLA031-1.001.p',unknown),
[] ).
cnf(79,axiom,
neq(p2_1,truck1),
file('PLA031-1.001.p',unknown),
[] ).
cnf(80,axiom,
neq(p2_1,truck2),
file('PLA031-1.001.p',unknown),
[] ).
cnf(92,axiom,
path(p2_0,s2),
file('PLA031-1.001.p',unknown),
[] ).
cnf(93,axiom,
path(s0,p2_0),
file('PLA031-1.001.p',unknown),
[] ).
cnf(96,axiom,
path(p2_1,s2),
file('PLA031-1.001.p',unknown),
[] ).
cnf(97,axiom,
path(s1,p2_1),
file('PLA031-1.001.p',unknown),
[] ).
cnf(100,axiom,
link(s1,s0),
file('PLA031-1.001.p',unknown),
[] ).
cnf(101,axiom,
link(s0,s2),
file('PLA031-1.001.p',unknown),
[] ).
cnf(104,axiom,
link(s2,s1),
file('PLA031-1.001.p',unknown),
[] ).
cnf(105,axiom,
s(s2,s2,s0,s1,s0,s2),
file('PLA031-1.001.p',unknown),
[] ).
cnf(106,axiom,
~ s(s2,s1,s2,s2,s2,s0),
file('PLA031-1.001.p',unknown),
[] ).
cnf(109,plain,
( ~ path(u,s2)
| ~ s(s2,s1,s2,u,s2,s0) ),
inference(res,[status(thm),theory(equality)],[22,106]),
[iquote('0:Res:22.2,106.0')] ).
cnf(184,plain,
( ~ path(s1,u)
| s(s2,s2,s0,u,s0,s2) ),
inference(res,[status(thm),theory(equality)],[105,22]),
[iquote('0:Res:105.0,22.1')] ).
cnf(269,plain,
s(s2,s2,s0,p2_1,s0,s2),
inference(res,[status(thm),theory(equality)],[97,184]),
[iquote('0:Res:97.0,184.0')] ).
cnf(334,plain,
( ~ path(s0,u)
| s(s2,s2,u,p2_1,s0,s2) ),
inference(res,[status(thm),theory(equality)],[269,21]),
[iquote('0:Res:269.0,21.1')] ).
cnf(729,plain,
s(s2,s2,p2_0,p2_1,s0,s2),
inference(res,[status(thm),theory(equality)],[93,334]),
[iquote('0:Res:93.0,334.0')] ).
cnf(733,plain,
( ~ path(p2_0,u)
| s(s2,s2,u,p2_1,s0,s2) ),
inference(res,[status(thm),theory(equality)],[729,21]),
[iquote('0:Res:729.0,21.1')] ).
cnf(2258,plain,
s(s2,s2,s2,p2_1,s0,s2),
inference(res,[status(thm),theory(equality)],[92,733]),
[iquote('0:Res:92.0,733.0')] ).
cnf(2260,plain,
s(s2,truck2,s2,p2_1,s0,s2),
inference(res,[status(thm),theory(equality)],[2258,7]),
[iquote('0:Res:2258.0,7.0')] ).
cnf(2273,plain,
( ~ neq(p2_1,truck2)
| s(s2,truck2,truck2,p2_1,s0,s2) ),
inference(res,[status(thm),theory(equality)],[2260,11]),
[iquote('0:Res:2260.0,11.1')] ).
cnf(2276,plain,
s(s2,truck2,truck2,p2_1,s0,s2),
inference(mrr,[status(thm)],[2273,80]),
[iquote('0:MRR:2273.0,80.0')] ).
cnf(2300,plain,
( ~ link(s2,u)
| s(s2,truck2,truck2,p2_1,s0,u) ),
inference(res,[status(thm),theory(equality)],[2276,18]),
[iquote('0:Res:2276.0,18.1')] ).
cnf(11695,plain,
s(s2,truck2,truck2,p2_1,s0,s1),
inference(res,[status(thm),theory(equality)],[104,2300]),
[iquote('0:Res:104.0,2300.0')] ).
cnf(11718,plain,
s(s2,s1,truck2,p2_1,s0,s1),
inference(res,[status(thm),theory(equality)],[11695,8]),
[iquote('0:Res:11695.0,8.0')] ).
cnf(11744,plain,
( ~ link(s1,u)
| s(s2,s1,truck2,p2_1,s0,u) ),
inference(res,[status(thm),theory(equality)],[11718,18]),
[iquote('0:Res:11718.0,18.1')] ).
cnf(37850,plain,
s(s2,s1,truck2,p2_1,s0,s0),
inference(res,[status(thm),theory(equality)],[100,11744]),
[iquote('0:Res:100.0,11744.0')] ).
cnf(37862,plain,
s(s2,s1,s0,p2_1,s0,s0),
inference(res,[status(thm),theory(equality)],[37850,12]),
[iquote('0:Res:37850.0,12.0')] ).
cnf(37875,plain,
( ~ neq(p2_1,truck1)
| s(s2,s1,truck1,p2_1,s0,s0) ),
inference(res,[status(thm),theory(equality)],[37862,9]),
[iquote('0:Res:37862.0,9.1')] ).
cnf(37879,plain,
s(s2,s1,truck1,p2_1,s0,s0),
inference(mrr,[status(thm)],[37875,79]),
[iquote('0:MRR:37875.0,79.0')] ).
cnf(37888,plain,
( ~ link(s0,u)
| s(s2,s1,truck1,p2_1,u,s0) ),
inference(res,[status(thm),theory(equality)],[37879,17]),
[iquote('0:Res:37879.0,17.1')] ).
cnf(77208,plain,
s(s2,s1,truck1,p2_1,s2,s0),
inference(res,[status(thm),theory(equality)],[101,37888]),
[iquote('0:Res:101.0,37888.0')] ).
cnf(77211,plain,
s(s2,s1,s2,p2_1,s2,s0),
inference(res,[status(thm),theory(equality)],[77208,10]),
[iquote('0:Res:77208.0,10.0')] ).
cnf(77220,plain,
~ path(p2_1,s2),
inference(res,[status(thm),theory(equality)],[77211,109]),
[iquote('0:Res:77211.0,109.1')] ).
cnf(77225,plain,
$false,
inference(mrr,[status(thm)],[77220,96]),
[iquote('0:MRR:77220.0,96.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : PLA031-1.001 : TPTP v8.1.0. Released v3.5.0.
% 0.00/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n022.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 23:19:22 EDT 2022
% 0.12/0.33 % CPUTime :
% 71.22/71.41
% 71.22/71.41 SPASS V 3.9
% 71.22/71.41 SPASS beiseite: Proof found.
% 71.22/71.41 % SZS status Theorem
% 71.22/71.41 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 71.22/71.41 SPASS derived 74940 clauses, backtracked 0 clauses, performed 0 splits and kept 35533 clauses.
% 71.22/71.41 SPASS allocated 97629 KBytes.
% 71.22/71.41 SPASS spent 0:1:10.22 on the problem.
% 71.22/71.41 0:00:00.03 for the input.
% 71.22/71.41 0:00:00.00 for the FLOTTER CNF translation.
% 71.22/71.41 0:00:02.30 for inferences.
% 71.22/71.41 0:00:00.00 for the backtracking.
% 71.22/71.41 0:0:27.23 for the reduction.
% 71.22/71.41
% 71.22/71.41
% 71.22/71.41 Here is a proof with depth 19, length 44 :
% 71.22/71.41 % SZS output start Refutation
% See solution above
% 71.22/71.41 Formulae used in the proof : load7 load8 board1 board2 board3 board4 drive1 drive2 walk1 walk2 neq57 neq58 map6 map7 map10 map11 map14 map15 map18 init goal
% 71.22/71.41
%------------------------------------------------------------------------------