TSTP Solution File: PLA031-1.002 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : PLA031-1.002 : TPTP v8.1.0. Released v3.5.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n018.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 108.20s 108.37s
% Output : Refutation 108.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 21
% Syntax : Number of clauses : 44 ( 24 unt; 0 nHn; 44 RR)
% Number of literals : 69 ( 0 equ; 27 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-7 aty)
% Number of functors : 13 ( 13 usr; 13 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ s(u,v,w,x,y,u,z)
| s(truck1,v,w,x,y,u,z) ),
file('PLA031-1.002.p',unknown),
[] ).
cnf(2,axiom,
( ~ s(truck1,u,v,w,x,y,z)
| s(y,u,v,w,x,y,z) ),
file('PLA031-1.002.p',unknown),
[] ).
cnf(5,axiom,
( ~ s(u,v,w,x,y,v,z)
| s(u,truck1,w,x,y,v,z) ),
file('PLA031-1.002.p',unknown),
[] ).
cnf(6,axiom,
( ~ s(u,truck1,v,w,x,y,z)
| s(u,y,v,w,x,y,z) ),
file('PLA031-1.002.p',unknown),
[] ).
cnf(9,axiom,
( ~ s(u,v,w,x,y,w,z)
| s(u,v,truck1,x,y,w,z) ),
file('PLA031-1.002.p',unknown),
[] ).
cnf(10,axiom,
( ~ s(u,v,truck1,w,x,y,z)
| s(u,v,y,w,x,y,z) ),
file('PLA031-1.002.p',unknown),
[] ).
cnf(13,axiom,
( ~ neq(u,truck1)
| ~ s(v,w,x,y,u,y,z)
| s(v,w,x,truck1,u,y,z) ),
file('PLA031-1.002.p',unknown),
[] ).
cnf(14,axiom,
( ~ s(u,v,w,truck1,x,y,z)
| s(u,v,w,y,x,y,z) ),
file('PLA031-1.002.p',unknown),
[] ).
cnf(17,axiom,
( ~ neq(u,truck1)
| ~ s(v,w,x,u,y,y,z)
| s(v,w,x,u,truck1,y,z) ),
file('PLA031-1.002.p',unknown),
[] ).
cnf(18,axiom,
( ~ s(u,v,w,x,truck1,y,z)
| s(u,v,w,x,y,y,z) ),
file('PLA031-1.002.p',unknown),
[] ).
cnf(21,axiom,
( ~ link(u,v)
| ~ s(w,x,y,truck1,z,u,x1)
| s(w,x,y,truck1,z,v,x1) ),
file('PLA031-1.002.p',unknown),
[] ).
cnf(23,axiom,
( ~ link(u,v)
| ~ s(w,x,y,z,truck1,u,x1)
| s(w,x,y,z,truck1,v,x1) ),
file('PLA031-1.002.p',unknown),
[] ).
cnf(26,axiom,
( ~ path(u,v)
| ~ s(w,x,y,z,u,x1,x2)
| s(w,x,y,z,v,x1,x2) ),
file('PLA031-1.002.p',unknown),
[] ).
cnf(48,axiom,
neq(s1,truck1),
file('PLA031-1.002.p',unknown),
[] ).
cnf(81,axiom,
path(p2_1,s2),
file('PLA031-1.002.p',unknown),
[] ).
cnf(82,axiom,
path(s1,p2_1),
file('PLA031-1.002.p',unknown),
[] ).
cnf(85,axiom,
link(s1,s0),
file('PLA031-1.002.p',unknown),
[] ).
cnf(87,axiom,
link(s2,s1),
file('PLA031-1.002.p',unknown),
[] ).
cnf(89,axiom,
link(s0,s2),
file('PLA031-1.002.p',unknown),
[] ).
cnf(90,axiom,
s(s1,s1,s1,s1,s1,s2,s0),
file('PLA031-1.002.p',unknown),
[] ).
cnf(91,axiom,
~ s(s0,s0,s2,s2,u,s2,v),
file('PLA031-1.002.p',unknown),
[] ).
cnf(96,plain,
~ s(s0,s0,s2,truck1,u,s2,v),
inference(res,[status(thm),theory(equality)],[14,91]),
[iquote('0:Res:14.1,91.0')] ).
cnf(106,plain,
( ~ path(s1,u)
| s(s1,s1,s1,s1,u,s2,s0) ),
inference(res,[status(thm),theory(equality)],[90,26]),
[iquote('0:Res:90.0,26.1')] ).
cnf(107,plain,
s(s1,s1,s1,s1,p2_1,s2,s0),
inference(res,[status(thm),theory(equality)],[82,106]),
[iquote('0:Res:82.0,106.0')] ).
cnf(111,plain,
( ~ path(p2_1,u)
| s(s1,s1,s1,s1,u,s2,s0) ),
inference(res,[status(thm),theory(equality)],[107,26]),
[iquote('0:Res:107.0,26.1')] ).
cnf(127,plain,
s(s1,s1,s1,s1,s2,s2,s0),
inference(res,[status(thm),theory(equality)],[81,111]),
[iquote('0:Res:81.0,111.0')] ).
cnf(130,plain,
( ~ neq(s1,truck1)
| s(s1,s1,s1,s1,truck1,s2,s0) ),
inference(res,[status(thm),theory(equality)],[127,17]),
[iquote('0:Res:127.0,17.1')] ).
cnf(133,plain,
s(s1,s1,s1,s1,truck1,s2,s0),
inference(mrr,[status(thm)],[130,48]),
[iquote('0:MRR:130.0,48.0')] ).
cnf(141,plain,
( ~ link(s2,u)
| s(s1,s1,s1,s1,truck1,u,s0) ),
inference(res,[status(thm),theory(equality)],[133,23]),
[iquote('0:Res:133.0,23.1')] ).
cnf(265,plain,
s(s1,s1,s1,s1,truck1,s1,s0),
inference(res,[status(thm),theory(equality)],[87,141]),
[iquote('0:Res:87.0,141.0')] ).
cnf(270,plain,
s(s1,truck1,s1,s1,truck1,s1,s0),
inference(res,[status(thm),theory(equality)],[265,5]),
[iquote('0:Res:265.0,5.0')] ).
cnf(284,plain,
s(s1,truck1,truck1,s1,truck1,s1,s0),
inference(res,[status(thm),theory(equality)],[270,9]),
[iquote('0:Res:270.0,9.0')] ).
cnf(322,plain,
s(truck1,truck1,truck1,s1,truck1,s1,s0),
inference(res,[status(thm),theory(equality)],[284,1]),
[iquote('0:Res:284.0,1.0')] ).
cnf(384,plain,
s(truck1,truck1,truck1,s1,s1,s1,s0),
inference(res,[status(thm),theory(equality)],[322,18]),
[iquote('0:Res:322.0,18.0')] ).
cnf(442,plain,
( ~ neq(s1,truck1)
| s(truck1,truck1,truck1,truck1,s1,s1,s0) ),
inference(res,[status(thm),theory(equality)],[384,13]),
[iquote('0:Res:384.0,13.1')] ).
cnf(446,plain,
s(truck1,truck1,truck1,truck1,s1,s1,s0),
inference(mrr,[status(thm)],[442,48]),
[iquote('0:MRR:442.0,48.0')] ).
cnf(473,plain,
( ~ link(s1,u)
| s(truck1,truck1,truck1,truck1,s1,u,s0) ),
inference(res,[status(thm),theory(equality)],[446,21]),
[iquote('0:Res:446.0,21.1')] ).
cnf(10866,plain,
s(truck1,truck1,truck1,truck1,s1,s0,s0),
inference(res,[status(thm),theory(equality)],[85,473]),
[iquote('0:Res:85.0,473.0')] ).
cnf(10875,plain,
s(s0,truck1,truck1,truck1,s1,s0,s0),
inference(res,[status(thm),theory(equality)],[10866,2]),
[iquote('0:Res:10866.0,2.0')] ).
cnf(10915,plain,
s(s0,s0,truck1,truck1,s1,s0,s0),
inference(res,[status(thm),theory(equality)],[10875,6]),
[iquote('0:Res:10875.0,6.0')] ).
cnf(10996,plain,
( ~ link(s0,u)
| s(s0,s0,truck1,truck1,s1,u,s0) ),
inference(res,[status(thm),theory(equality)],[10915,21]),
[iquote('0:Res:10915.0,21.1')] ).
cnf(85585,plain,
s(s0,s0,truck1,truck1,s1,s2,s0),
inference(res,[status(thm),theory(equality)],[89,10996]),
[iquote('0:Res:89.0,10996.0')] ).
cnf(85590,plain,
s(s0,s0,s2,truck1,s1,s2,s0),
inference(res,[status(thm),theory(equality)],[85585,10]),
[iquote('0:Res:85585.0,10.0')] ).
cnf(85594,plain,
$false,
inference(mrr,[status(thm)],[85590,96]),
[iquote('0:MRR:85590.0,96.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : PLA031-1.002 : TPTP v8.1.0. Released v3.5.0.
% 0.07/0.14 % Command : run_spass %d %s
% 0.13/0.35 % Computer : n018.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Tue May 31 23:17:28 EDT 2022
% 0.13/0.35 % CPUTime :
% 108.20/108.37
% 108.20/108.37 SPASS V 3.9
% 108.20/108.37 SPASS beiseite: Proof found.
% 108.20/108.37 % SZS status Theorem
% 108.20/108.37 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 108.20/108.37 SPASS derived 82860 clauses, backtracked 0 clauses, performed 0 splits and kept 42214 clauses.
% 108.20/108.37 SPASS allocated 106226 KBytes.
% 108.20/108.37 SPASS spent 0:1:40.67 on the problem.
% 108.20/108.37 0:00:00.03 for the input.
% 108.20/108.37 0:00:00.00 for the FLOTTER CNF translation.
% 108.20/108.37 0:00:01.01 for inferences.
% 108.20/108.37 0:00:00.00 for the backtracking.
% 108.20/108.37 0:01:03.81 for the reduction.
% 108.20/108.37
% 108.20/108.37
% 108.20/108.37 Here is a proof with depth 19, length 44 :
% 108.20/108.37 % SZS output start Refutation
% See solution above
% 108.20/108.37 Formulae used in the proof : load1 load2 load5 load6 load9 load10 board1 board2 board5 board6 drive1 drive3 walk2 neq22 map6 map7 map10 map12 map14 init goal
% 108.20/108.37
%------------------------------------------------------------------------------