%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : PLA003-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n011.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:21 AM UTC 2026
% Result : Unsatisfiable 0.10s 10.39s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of formulae : 23 ( 11 unt; 0 def)
% Number of atoms : 35 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 29 ( 17 ~; 12 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 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 : 54 ( 10 sgn 23 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(climb_up,axiom,
! [VAR_0,VAR_1] :
( ~ can(monkey(VAR_0,floor,nothing),ladder(VAR_0,floor),VAR_1)
| can(monkey(VAR_0,ceiling,nothing),ladder(VAR_0,floor),VAR_1) ),
file('theBenchmark.p',climb_up) ).
cnf(c_1,plain,
( ~ can(monkey(A,floor,nothing),ladder(A,floor),B)
| can(monkey(A,ceiling,nothing),ladder(A,floor),B) ),
inference(clausify,[status(thm)],[climb_up]) ).
fof(go_holding_ladder,axiom,
! [VAR_0,VAR_1,VAR_2] :
( ~ can(monkey(VAR_2,floor,the_ladder),ladder(VAR_2,floor),VAR_1)
| can(monkey(VAR_0,floor,the_ladder),ladder(VAR_0,floor),VAR_1) ),
file('theBenchmark.p',go_holding_ladder) ).
cnf(c_3,plain,
( ~ can(monkey(C,floor,the_ladder),ladder(C,floor),B)
| can(monkey(A,floor,the_ladder),ladder(A,floor),B) ),
inference(clausify,[status(thm)],[go_holding_ladder]) ).
fof(go_holding_nothing,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3] :
( ~ can(monkey(VAR_3,floor,nothing),VAR_1,VAR_2)
| can(monkey(VAR_0,floor,nothing),VAR_1,VAR_2) ),
file('theBenchmark.p',go_holding_nothing) ).
cnf(c_5,plain,
( ~ can(monkey(D,floor,nothing),B,C)
| can(monkey(A,floor,nothing),B,C) ),
inference(clausify,[status(thm)],[go_holding_nothing]) ).
fof(drop_ladder,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3] :
( ~ can(monkey(VAR_0,VAR_1,the_ladder),ladder(VAR_0,VAR_3),VAR_2)
| can(monkey(VAR_0,VAR_1,nothing),ladder(VAR_0,floor),VAR_2) ),
file('theBenchmark.p',drop_ladder) ).
cnf(c_6,plain,
( ~ can(monkey(A,B,the_ladder),ladder(A,D),C)
| can(monkey(A,B,nothing),ladder(A,floor),C) ),
inference(clausify,[status(thm)],[drop_ladder]) ).
fof(grab_bananas,axiom,
! [VAR_0,VAR_1,VAR_2] :
( ~ can(monkey(VAR_0,VAR_1,nothing),VAR_2,bananas(VAR_0,VAR_1))
| can(monkey(VAR_0,VAR_1,the_bananas),VAR_2,bananas(VAR_0,VAR_1)) ),
file('theBenchmark.p',grab_bananas) ).
cnf(c_8,plain,
( ~ can(monkey(A,B,nothing),C,bananas(A,B))
| can(monkey(A,B,the_bananas),C,bananas(A,B)) ),
inference(clausify,[status(thm)],[grab_bananas]) ).
fof(grab_ladder,axiom,
! [VAR_0,VAR_1,VAR_2] :
( ~ can(monkey(VAR_0,VAR_1,nothing),ladder(VAR_0,VAR_1),VAR_2)
| can(monkey(VAR_0,VAR_1,the_ladder),ladder(VAR_0,VAR_1),VAR_2) ),
file('theBenchmark.p',grab_ladder) ).
cnf(c_9,plain,
( ~ can(monkey(A,B,nothing),ladder(A,B),C)
| can(monkey(A,B,the_ladder),ladder(A,B),C) ),
inference(clausify,[status(thm)],[grab_ladder]) ).
fof(initial_situation,axiom,
can(monkey(l0,floor,nothing),ladder(l1,floor),bananas(l2,ceiling)),
file('theBenchmark.p',initial_situation) ).
cnf(c_10,plain,
can(monkey(l0,floor,nothing),ladder(l1,floor),bananas(l2,ceiling)),
inference(clausify,[status(thm)],[initial_situation]) ).
fof(prove_the_monkey_can_get_the_bananas,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3] : ~ can(monkey(VAR_0,VAR_1,the_bananas),VAR_2,VAR_3),
file('theBenchmark.p',prove_the_monkey_can_get_the_bananas) ).
cnf(c_11,plain,
~ can(monkey(A,B,the_bananas),C,D),
inference(clausify,[status(thm)],[prove_the_monkey_can_get_the_bananas]) ).
cnf(c_12,plain,
~ can(monkey(A,B,nothing),C,bananas(A,B)),
inference(resolve,[status(thm)],[c_11,c_8]) ).
cnf(c_13,plain,
can(monkey(A,floor,nothing),ladder(l1,floor),bananas(l2,ceiling)),
inference(resolve,[status(thm)],[c_10,c_5]) ).
cnf(c_17,plain,
~ can(monkey(A,floor,nothing),ladder(A,floor),bananas(A,ceiling)),
inference(resolve,[status(thm)],[c_12,c_1]) ).
cnf(c_18,plain,
can(monkey(l1,floor,the_ladder),ladder(l1,floor),bananas(l2,ceiling)),
inference(resolve,[status(thm)],[c_13,c_9]) ).
cnf(c_22,plain,
~ can(monkey(A,floor,the_ladder),ladder(A,B),bananas(A,ceiling)),
inference(resolve,[status(thm)],[c_17,c_6]) ).
cnf(c_24,plain,
can(monkey(A,floor,the_ladder),ladder(A,floor),bananas(l2,ceiling)),
inference(resolve,[status(thm)],[c_18,c_3]) ).
cnf(c_25,plain,
$false,
inference(resolve,[status(thm)],[c_24,c_22]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : PLA003-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/10.38 % Computer : n011.cluster.edu
% 0.10/10.38 % Model : x86_64 x86_64
% 0.10/10.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/10.38 % Memory : 8046.5625MB
% 0.10/10.38 % OS : Linux 6.8.0-71-generic
% 0.10/10.38 % CPULimit : 300
% 0.10/10.38 % WCLimit : 300
% 0.10/10.38 % DateTime : Sat Sep 26 04:42:24 UTC 2026
% 0.10/10.38 % CPUTime :
% 0.10/10.38 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/10.38 % Process 3790192 was started by sandbox2 on n011,
% 0.10/10.38 % Sat Sep 26 04:42:24 2026
% 0.10/10.38 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.10/10.39
% 0.10/10.39 % From the command line: assign(max_seconds, 300).
% 0.10/10.39
% 0.10/10.39 % SZS status Unsatisfiable for theBenchmark
% 0.10/10.39
% 0.10/10.39 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.10/10.39 % Length of proof is 15.
% 0.10/10.39 % Level of proof is 4.
% 0.10/10.39 % Maximum clause weight is 28.000.
% 0.10/10.39 % Given clauses 15.
% 0.10/10.39
% 0.10/10.39 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------