TSTP Solution File: PLA002-2 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : PLA002-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n021.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:17 EDT 2022
% Result : Unsatisfiable 0.19s 0.41s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 13
% Syntax : Number of clauses : 33 ( 6 unt; 1 nHn; 33 RR)
% Number of literals : 77 ( 0 equ; 58 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 8 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ situation(u)
| ~ situation(v)
| cold(u)
| warm(v) ),
file('PLA002-2.p',unknown),
[] ).
cnf(5,axiom,
( ~ situation(u)
| ~ at(b,u)
| at(a,drive(a,u)) ),
file('PLA002-2.p',unknown),
[] ).
cnf(7,axiom,
( ~ situation(u)
| ~ cold(u)
| ~ at(c,u)
| at(b,skate(b,u)) ),
file('PLA002-2.p',unknown),
[] ).
cnf(9,axiom,
( ~ situation(u)
| ~ warm(u)
| ~ at(d,u)
| at(b,climb(b,u)) ),
file('PLA002-2.p',unknown),
[] ).
cnf(11,axiom,
( ~ situation(u)
| ~ at(d,u)
| at(c,go(c,u)) ),
file('PLA002-2.p',unknown),
[] ).
cnf(15,axiom,
( ~ situation(u)
| ~ at(f,u)
| at(d,go(d,u)) ),
file('PLA002-2.p',unknown),
[] ).
cnf(16,axiom,
situation(s0),
file('PLA002-2.p',unknown),
[] ).
cnf(18,axiom,
( ~ situation(u)
| situation(drive(v,u)) ),
file('PLA002-2.p',unknown),
[] ).
cnf(19,axiom,
( ~ situation(u)
| situation(climb(v,u)) ),
file('PLA002-2.p',unknown),
[] ).
cnf(20,axiom,
( ~ situation(u)
| situation(skate(v,u)) ),
file('PLA002-2.p',unknown),
[] ).
cnf(21,axiom,
( ~ situation(u)
| situation(go(v,u)) ),
file('PLA002-2.p',unknown),
[] ).
cnf(22,axiom,
at(f,s0),
file('PLA002-2.p',unknown),
[] ).
cnf(23,axiom,
( ~ situation(u)
| ~ at(a,u) ),
file('PLA002-2.p',unknown),
[] ).
cnf(33,plain,
( ~ situation(u)
| warm(u) ),
inference(spt,[spt(split,[position(s1)])],[1]),
[iquote('1:Spt:1.1,1.3')] ).
cnf(34,plain,
( ~ situation(u)
| ~ at(d,u)
| at(b,climb(b,u)) ),
inference(mrr,[status(thm)],[9,33]),
[iquote('1:MRR:9.1,33.1')] ).
cnf(36,plain,
( ~ situation(u)
| ~ situation(drive(a,u))
| ~ at(b,u) ),
inference(res,[status(thm),theory(equality)],[5,23]),
[iquote('0:Res:5.2,23.1')] ).
cnf(37,plain,
( ~ situation(u)
| ~ at(b,u) ),
inference(ssi,[status(thm)],[36,18]),
[iquote('0:SSi:36.1,18.1')] ).
cnf(38,plain,
( ~ situation(u)
| ~ situation(climb(b,u))
| ~ at(d,u) ),
inference(res,[status(thm),theory(equality)],[34,37]),
[iquote('1:Res:34.2,37.1')] ).
cnf(39,plain,
( ~ situation(u)
| ~ at(d,u) ),
inference(ssi,[status(thm)],[38,19]),
[iquote('1:SSi:38.1,19.1')] ).
cnf(41,plain,
( ~ situation(u)
| ~ situation(go(d,u))
| ~ at(f,u) ),
inference(res,[status(thm),theory(equality)],[15,39]),
[iquote('1:Res:15.2,39.1')] ).
cnf(43,plain,
( ~ situation(u)
| ~ at(f,u) ),
inference(ssi,[status(thm)],[41,21]),
[iquote('1:SSi:41.1,21.1')] ).
cnf(46,plain,
~ situation(s0),
inference(res,[status(thm),theory(equality)],[22,43]),
[iquote('1:Res:22.0,43.1')] ).
cnf(47,plain,
$false,
inference(ssi,[status(thm)],[46,16]),
[iquote('1:SSi:46.0,16.0')] ).
cnf(48,plain,
( ~ situation(u)
| cold(u) ),
inference(spt,[spt(split,[position(s2)])],[1]),
[iquote('1:Spt:47.0,1.0,1.2')] ).
cnf(49,plain,
( ~ situation(u)
| ~ at(c,u)
| at(b,skate(b,u)) ),
inference(mrr,[status(thm)],[7,48]),
[iquote('1:MRR:7.1,48.1')] ).
cnf(50,plain,
( ~ situation(u)
| ~ situation(skate(b,u))
| ~ at(c,u) ),
inference(res,[status(thm),theory(equality)],[49,37]),
[iquote('1:Res:49.2,37.1')] ).
cnf(51,plain,
( ~ situation(u)
| ~ at(c,u) ),
inference(ssi,[status(thm)],[50,20]),
[iquote('1:SSi:50.1,20.1')] ).
cnf(53,plain,
( ~ situation(u)
| ~ situation(go(c,u))
| ~ at(d,u) ),
inference(res,[status(thm),theory(equality)],[11,51]),
[iquote('1:Res:11.2,51.1')] ).
cnf(55,plain,
( ~ situation(u)
| ~ at(d,u) ),
inference(ssi,[status(thm)],[53,21]),
[iquote('1:SSi:53.1,21.1')] ).
cnf(56,plain,
( ~ situation(u)
| ~ situation(go(d,u))
| ~ at(f,u) ),
inference(res,[status(thm),theory(equality)],[15,55]),
[iquote('1:Res:15.2,55.1')] ).
cnf(57,plain,
( ~ situation(u)
| ~ at(f,u) ),
inference(ssi,[status(thm)],[56,21]),
[iquote('1:SSi:56.1,21.1')] ).
cnf(58,plain,
~ situation(s0),
inference(res,[status(thm),theory(equality)],[22,57]),
[iquote('1:Res:22.0,57.1')] ).
cnf(59,plain,
$false,
inference(ssi,[status(thm)],[58,16]),
[iquote('1:SSi:58.0,16.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : PLA002-2 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n021.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue May 31 19:31:45 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.41
% 0.19/0.41 SPASS V 3.9
% 0.19/0.41 SPASS beiseite: Proof found.
% 0.19/0.41 % SZS status Theorem
% 0.19/0.41 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.41 SPASS derived 15 clauses, backtracked 10 clauses, performed 1 splits and kept 45 clauses.
% 0.19/0.41 SPASS allocated 75643 KBytes.
% 0.19/0.41 SPASS spent 0:00:00.06 on the problem.
% 0.19/0.41 0:00:00.03 for the input.
% 0.19/0.41 0:00:00.00 for the FLOTTER CNF translation.
% 0.19/0.41 0:00:00.00 for inferences.
% 0.19/0.41 0:00:00.00 for the backtracking.
% 0.19/0.41 0:00:00.00 for the reduction.
% 0.19/0.41
% 0.19/0.41
% 0.19/0.41 Here is a proof with depth 5, length 33 :
% 0.19/0.41 % SZS output start Refutation
% See solution above
% 0.19/0.41 Formulae used in the proof : warm_or_cold drive_b_to_a cross_river_c_to_b climb_mountain_d_to_b go_d_to_c go_f_to_d initial_situation drive_situation climb_situation skate_situation go_situation initial prove_you_can_get_to_a_in_a_situation
% 0.19/0.41
%------------------------------------------------------------------------------