%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : PLA003-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n029.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.18s 0.40s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 15 ( 9 unt; 0 nHn; 15 RR)
% Number of literals : 21 ( 0 equ; 9 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 15 ( 15 usr; 12 con; 0-3 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ can(monkey(u,floor,nothing),ladder(u,floor),v)
| can(monkey(u,ceiling,nothing),ladder(u,floor),v) ),
file('PLA003-1.p',unknown),
[] ).
cnf(3,axiom,
( ~ can(monkey(u,floor,the_ladder),ladder(u,floor),v)
| can(monkey(w,floor,the_ladder),ladder(w,floor),v) ),
file('PLA003-1.p',unknown),
[] ).
cnf(5,axiom,
( ~ can(monkey(u,floor,nothing),v,w)
| can(monkey(x,floor,nothing),v,w) ),
file('PLA003-1.p',unknown),
[] ).
cnf(6,axiom,
( ~ can(monkey(u,v,the_ladder),ladder(u,w),x)
| can(monkey(u,v,nothing),ladder(u,floor),x) ),
file('PLA003-1.p',unknown),
[] ).
cnf(8,axiom,
( ~ can(monkey(u,v,nothing),w,bananas(u,v))
| can(monkey(u,v,the_bananas),w,bananas(u,v)) ),
file('PLA003-1.p',unknown),
[] ).
cnf(9,axiom,
( ~ can(monkey(u,v,nothing),ladder(u,v),w)
| can(monkey(u,v,the_ladder),ladder(u,v),w) ),
file('PLA003-1.p',unknown),
[] ).
cnf(10,axiom,
can(monkey(l0,floor,nothing),ladder(l1,floor),bananas(l2,ceiling)),
file('PLA003-1.p',unknown),
[] ).
cnf(11,axiom,
~ can(monkey(u,v,the_bananas),w,x),
file('PLA003-1.p',unknown),
[] ).
cnf(12,plain,
~ can(monkey(u,v,nothing),w,bananas(u,v)),
inference(mrr,[status(thm)],[8,11]),
[iquote('0:MRR:8.1,11.0')] ).
cnf(15,plain,
~ can(monkey(u,floor,nothing),ladder(u,floor),bananas(u,ceiling)),
inference(res,[status(thm),theory(equality)],[1,12]),
[iquote('0:Res:1.1,12.0')] ).
cnf(17,plain,
can(monkey(u,floor,nothing),ladder(l1,floor),bananas(l2,ceiling)),
inference(res,[status(thm),theory(equality)],[10,5]),
[iquote('0:Res:10.0,5.0')] ).
cnf(22,plain,
can(monkey(l1,floor,the_ladder),ladder(l1,floor),bananas(l2,ceiling)),
inference(res,[status(thm),theory(equality)],[17,9]),
[iquote('0:Res:17.0,9.0')] ).
cnf(24,plain,
can(monkey(u,floor,the_ladder),ladder(u,floor),bananas(l2,ceiling)),
inference(res,[status(thm),theory(equality)],[22,3]),
[iquote('0:Res:22.0,3.0')] ).
cnf(25,plain,
can(monkey(u,floor,nothing),ladder(u,floor),bananas(l2,ceiling)),
inference(res,[status(thm),theory(equality)],[24,6]),
[iquote('0:Res:24.0,6.0')] ).
cnf(27,plain,
$false,
inference(unc,[status(thm)],[25,15]),
[iquote('0:UnC:25.0,15.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : PLA003-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n029.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 21:00:45 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.40
% 0.18/0.40 SPASS V 3.9
% 0.18/0.40 SPASS beiseite: Proof found.
% 0.18/0.40 % SZS status Theorem
% 0.18/0.40 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.40 SPASS derived 14 clauses, backtracked 0 clauses, performed 0 splits and kept 17 clauses.
% 0.18/0.40 SPASS allocated 63113 KBytes.
% 0.18/0.40 SPASS spent 0:00:00.06 on the problem.
% 0.18/0.40 0:00:00.03 for the input.
% 0.18/0.40 0:00:00.00 for the FLOTTER CNF translation.
% 0.18/0.40 0:00:00.00 for inferences.
% 0.18/0.40 0:00:00.00 for the backtracking.
% 0.18/0.40 0:00:00.00 for the reduction.
% 0.18/0.40
% 0.18/0.40
% 0.18/0.40 Here is a proof with depth 4, length 15 :
% 0.18/0.40 % SZS output start Refutation
% See solution above
% 0.18/0.40 Formulae used in the proof : climb_up go_holding_ladder go_holding_nothing drop_ladder grab_bananas grab_ladder initial_situation prove_the_monkey_can_get_the_bananas
% 0.18/0.40
%------------------------------------------------------------------------------