%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : PLA003-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n012.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun Sep 27 08:20:03 AM UTC 2026
% Result : Unsatisfiable 9.46s 1.77s
% Output : CNFRefutation 9.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 23 ( 11 unt; 0 nHn; 15 RR)
% Number of literals : 35 ( 0 equ; 15 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 : 11 ( 11 usr; 8 con; 0-3 aty)
% Number of variables : 53 ( 16 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(climb_up,axiom,
( ~ can(monkey(X0,floor,nothing),ladder(X0,floor),X1)
| can(monkey(X0,ceiling,nothing),ladder(X0,floor),X1) ) ).
cnf(go_holding_ladder,axiom,
( ~ can(monkey(X2,floor,'the$uladder'),ladder(X2,floor),X1)
| can(monkey(X0,floor,'the$uladder'),ladder(X0,floor),X1) ) ).
cnf(go_holding_nothing,axiom,
( ~ can(monkey(X3,floor,nothing),X1,X2)
| can(monkey(X0,floor,nothing),X1,X2) ) ).
cnf(drop_ladder,axiom,
( ~ can(monkey(X0,X1,'the$uladder'),ladder(X0,X3),X2)
| can(monkey(X0,X1,nothing),ladder(X0,floor),X2) ) ).
cnf(grab_bananas,axiom,
( ~ can(monkey(X0,X1,nothing),X2,bananas(X0,X1))
| can(monkey(X0,X1,'the$ubananas'),X2,bananas(X0,X1)) ) ).
cnf(grab_ladder,axiom,
( ~ can(monkey(X0,X1,nothing),ladder(X0,X1),X2)
| can(monkey(X0,X1,'the$uladder'),ladder(X0,X1),X2) ) ).
cnf(initial_situation,hypothesis,
can(monkey(l0,floor,nothing),ladder(l1,floor),bananas(l2,ceiling)) ).
cnf(prove_the_monkey_can_get_the_bananas,negated_conjecture,
~ can(monkey(X0,X1,'the$ubananas'),X2,X3) ).
cnf(c0,plain,
( ~ can(monkey(X0,floor,nothing),ladder(X0,floor),X1)
| can(monkey(X0,ceiling,nothing),ladder(X0,floor),X1) ),
inference(clausification,[status(esa)],[climb_up]) ).
cnf(c2,plain,
( ~ can(monkey(X2,floor,'the$uladder'),ladder(X2,floor),X1)
| can(monkey(X0,floor,'the$uladder'),ladder(X0,floor),X1) ),
inference(clausification,[status(esa)],[go_holding_ladder]) ).
cnf(c4,plain,
( ~ can(monkey(X3,floor,nothing),X1,X2)
| can(monkey(X0,floor,nothing),X1,X2) ),
inference(clausification,[status(esa)],[go_holding_nothing]) ).
cnf(c5,plain,
( ~ can(monkey(X0,X1,'the$uladder'),ladder(X0,X3),X2)
| can(monkey(X0,X1,nothing),ladder(X0,floor),X2) ),
inference(clausification,[status(esa)],[drop_ladder]) ).
cnf(c7,plain,
( ~ can(monkey(X0,X1,nothing),X2,bananas(X0,X1))
| can(monkey(X0,X1,'the$ubananas'),X2,bananas(X0,X1)) ),
inference(clausification,[status(esa)],[grab_bananas]) ).
cnf(c8,plain,
( ~ can(monkey(X0,X1,nothing),ladder(X0,X1),X2)
| can(monkey(X0,X1,'the$uladder'),ladder(X0,X1),X2) ),
inference(clausification,[status(esa)],[grab_ladder]) ).
cnf(c9,plain,
can(monkey(l0,floor,nothing),ladder(l1,floor),bananas(l2,ceiling)),
inference(clausification,[status(esa)],[initial_situation]) ).
cnf(c10,plain,
~ can(monkey(X0,X1,'the$ubananas'),X2,X3),
inference(clausification,[status(esa)],[prove_the_monkey_can_get_the_bananas]) ).
cnf(d0,plain,
~ can(monkey(X0,X1,nothing),X2,bananas(X0,X1)),
inference(resolution,[status(thm)],[c10,c7]) ).
cnf(d1,plain,
can(monkey(X0,floor,nothing),ladder(l1,floor),bananas(l2,ceiling)),
inference(resolution,[status(thm)],[c9,c4]) ).
cnf(d2,plain,
can(monkey(l1,floor,'the$uladder'),ladder(l1,floor),bananas(l2,ceiling)),
inference(resolution,[status(thm)],[d1,c8]) ).
cnf(d3,plain,
can(monkey(X0,floor,'the$uladder'),ladder(X0,floor),bananas(l2,ceiling)),
inference(resolution,[status(thm)],[d2,c2]) ).
cnf(d4,plain,
can(monkey(X0,floor,nothing),ladder(X0,floor),bananas(l2,ceiling)),
inference(resolution,[status(thm)],[d3,c5]) ).
cnf(d5,plain,
can(monkey(X0,ceiling,nothing),ladder(X0,floor),bananas(l2,ceiling)),
inference(resolution,[status(thm)],[d4,c0]) ).
cnf(d6,plain,
$false,
inference(resolution,[status(thm)],[d5,d0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : PLA003-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.02 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.02/0.29 % Computer : n012.cluster.edu
% 0.02/0.29 % Model : x86_64 x86_64
% 0.02/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.02/0.29 % Memory : 8046.5625MB
% 0.02/0.29 % OS : Linux 6.8.0-71-generic
% 0.02/0.29 % CPULimit : 300
% 0.02/0.29 % WCLimit : 300
% 0.02/0.29 % DateTime : Sat Sep 26 04:42:07 UTC 2026
% 0.02/0.30 % CPUTime :
% 0.02/0.30 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.46/1.77 % SZS status Unsatisfiable for theBenchmark.p
% 9.46/1.77 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------