%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : PLA003-1 : TPTP v9.2.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n004.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 : 300s
% DateTime : Tue May 5 05:01:18 PM UTC 2026
% Result : Unsatisfiable 1.24s 1.71s
% Output : CNFRefutation 1.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 23 ( 10 unt; 0 nHn; 15 RR)
% Number of literals : 36 ( 0 equ; 17 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 : 56 ( 16 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(go_holding_ladder,axiom,
( can(monkey(X1,floor,the_ladder),ladder(X1,floor),X2)
| ~ can(monkey(X3,floor,the_ladder),ladder(X3,floor),X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',go_holding_ladder) ).
cnf(grab_ladder,axiom,
( can(monkey(X1,X2,the_ladder),ladder(X1,X2),X3)
| ~ can(monkey(X1,X2,nothing),ladder(X1,X2),X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',grab_ladder) ).
cnf(go_holding_nothing,axiom,
( can(monkey(X1,floor,nothing),X2,X3)
| ~ can(monkey(X4,floor,nothing),X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',go_holding_nothing) ).
cnf(initial_situation,hypothesis,
can(monkey(l0,floor,nothing),ladder(l1,floor),bananas(l2,ceiling)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',initial_situation) ).
cnf(grab_bananas,axiom,
( can(monkey(X1,X2,the_bananas),X3,bananas(X1,X2))
| ~ can(monkey(X1,X2,nothing),X3,bananas(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',grab_bananas) ).
cnf(prove_the_monkey_can_get_the_bananas,negated_conjecture,
~ can(monkey(X1,X2,the_bananas),X3,X4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_the_monkey_can_get_the_bananas) ).
cnf(climb_up,axiom,
( can(monkey(X1,ceiling,nothing),ladder(X1,floor),X2)
| ~ can(monkey(X1,floor,nothing),ladder(X1,floor),X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',climb_up) ).
cnf(drop_ladder,axiom,
( can(monkey(X1,X2,nothing),ladder(X1,floor),X3)
| ~ can(monkey(X1,X2,the_ladder),ladder(X1,X4),X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',drop_ladder) ).
cnf(c_0_8,axiom,
( can(monkey(X1,floor,the_ladder),ladder(X1,floor),X2)
| ~ can(monkey(X3,floor,the_ladder),ladder(X3,floor),X2) ),
go_holding_ladder ).
cnf(c_0_9,axiom,
( can(monkey(X1,X2,the_ladder),ladder(X1,X2),X3)
| ~ can(monkey(X1,X2,nothing),ladder(X1,X2),X3) ),
grab_ladder ).
cnf(c_0_10,axiom,
( can(monkey(X1,floor,nothing),X2,X3)
| ~ can(monkey(X4,floor,nothing),X2,X3) ),
go_holding_nothing ).
cnf(c_0_11,hypothesis,
can(monkey(l0,floor,nothing),ladder(l1,floor),bananas(l2,ceiling)),
initial_situation ).
cnf(c_0_12,axiom,
( can(monkey(X1,X2,the_bananas),X3,bananas(X1,X2))
| ~ can(monkey(X1,X2,nothing),X3,bananas(X1,X2)) ),
grab_bananas ).
cnf(c_0_13,negated_conjecture,
~ can(monkey(X1,X2,the_bananas),X3,X4),
prove_the_monkey_can_get_the_bananas ).
cnf(c_0_14,plain,
( can(monkey(X1,floor,the_ladder),ladder(X1,floor),X2)
| ~ can(monkey(X3,floor,nothing),ladder(X3,floor),X2) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_15,hypothesis,
can(monkey(X1,floor,nothing),ladder(l1,floor),bananas(l2,ceiling)),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
~ can(monkey(X1,X2,nothing),X3,bananas(X1,X2)),
inference(sr,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,axiom,
( can(monkey(X1,ceiling,nothing),ladder(X1,floor),X2)
| ~ can(monkey(X1,floor,nothing),ladder(X1,floor),X2) ),
climb_up ).
cnf(c_0_18,axiom,
( can(monkey(X1,X2,nothing),ladder(X1,floor),X3)
| ~ can(monkey(X1,X2,the_ladder),ladder(X1,X4),X3) ),
drop_ladder ).
cnf(c_0_19,hypothesis,
can(monkey(X1,floor,the_ladder),ladder(X1,floor),bananas(l2,ceiling)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
~ can(monkey(X1,floor,nothing),ladder(X1,floor),bananas(X1,ceiling)),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,hypothesis,
can(monkey(X1,floor,nothing),ladder(X1,floor),bananas(l2,ceiling)),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,hypothesis,
$false,
inference(spm,[status(thm)],[c_0_20,c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : PLA003-1 : TPTP v9.2.1. Released v1.0.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.14/0.33 % Computer : n004.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Tue May 5 01:25:47 EDT 2026
% 0.14/0.33 % CPUTime :
% 0.14/0.34 % start to proof: theBenchmark
% 1.24/1.71 % Version : CSE_E---1.7
% 1.24/1.71 % Problem : theBenchmark.p
% 1.24/1.71 % SZS status Unsatisfiable for theBenchmark.p
% 1.24/1.71 % SZS output start CNFRefutation
% See solution above
% 1.24/1.71 % Total time : 1.371s
%------------------------------------------------------------------------------