%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : PLA003-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n023.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 : Wed Jul 27 13:10:44 EDT 2022
% Result : Unsatisfiable 1.82s 2.04s
% Output : Refutation 1.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 15 ( 9 unt; 0 nHn; 9 RR)
% Number of literals : 21 ( 0 equ; 7 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 : 27 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( can(monkey(A,ceiling,nothing),ladder(A,floor),B)
| ~ can(monkey(A,floor,nothing),ladder(A,floor),B) ),
file('PLA003-1.p',unknown),
[] ).
cnf(3,axiom,
( can(monkey(A,floor,the_ladder),ladder(A,floor),B)
| ~ can(monkey(C,floor,the_ladder),ladder(C,floor),B) ),
file('PLA003-1.p',unknown),
[] ).
cnf(5,axiom,
( can(monkey(A,floor,nothing),B,C)
| ~ can(monkey(D,floor,nothing),B,C) ),
file('PLA003-1.p',unknown),
[] ).
cnf(6,axiom,
( can(monkey(A,B,nothing),ladder(A,floor),C)
| ~ can(monkey(A,B,the_ladder),ladder(A,D),C) ),
file('PLA003-1.p',unknown),
[] ).
cnf(8,axiom,
( can(monkey(A,B,the_bananas),C,bananas(A,B))
| ~ can(monkey(A,B,nothing),C,bananas(A,B)) ),
file('PLA003-1.p',unknown),
[] ).
cnf(9,axiom,
( can(monkey(A,B,the_ladder),ladder(A,B),C)
| ~ can(monkey(A,B,nothing),ladder(A,B),C) ),
file('PLA003-1.p',unknown),
[] ).
cnf(10,axiom,
~ can(monkey(A,B,the_bananas),C,D),
file('PLA003-1.p',unknown),
[] ).
cnf(11,axiom,
can(monkey(l0,floor,nothing),ladder(l1,floor),bananas(l2,ceiling)),
file('PLA003-1.p',unknown),
[] ).
cnf(12,plain,
can(monkey(A,floor,nothing),ladder(l1,floor),bananas(l2,ceiling)),
inference(hyper,[status(thm)],[11,5]),
[iquote('hyper,11,5')] ).
cnf(13,plain,
can(monkey(l1,floor,the_ladder),ladder(l1,floor),bananas(l2,ceiling)),
inference(hyper,[status(thm)],[12,9]),
[iquote('hyper,12,9')] ).
cnf(15,plain,
can(monkey(A,floor,the_ladder),ladder(A,floor),bananas(l2,ceiling)),
inference(hyper,[status(thm)],[13,3]),
[iquote('hyper,13,3')] ).
cnf(16,plain,
can(monkey(A,floor,nothing),ladder(A,floor),bananas(l2,ceiling)),
inference(hyper,[status(thm)],[15,6]),
[iquote('hyper,15,6')] ).
cnf(18,plain,
can(monkey(A,ceiling,nothing),ladder(A,floor),bananas(l2,ceiling)),
inference(hyper,[status(thm)],[16,1]),
[iquote('hyper,16,1')] ).
cnf(19,plain,
can(monkey(l2,ceiling,the_bananas),ladder(l2,floor),bananas(l2,ceiling)),
inference(hyper,[status(thm)],[18,8]),
[iquote('hyper,18,8')] ).
cnf(20,plain,
$false,
inference(binary,[status(thm)],[19,10]),
[iquote('binary,19.1,10.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : PLA003-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n023.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 : 300
% 0.12/0.33 % DateTime : Wed Jul 27 02:49:33 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.82/2.04 ----- Otter 3.3f, August 2004 -----
% 1.82/2.04 The process was started by sandbox2 on n023.cluster.edu,
% 1.82/2.04 Wed Jul 27 02:49:33 2022
% 1.82/2.04 The command was "./otter". The process ID is 4831.
% 1.82/2.04
% 1.82/2.04 set(prolog_style_variables).
% 1.82/2.04 set(auto).
% 1.82/2.04 dependent: set(auto1).
% 1.82/2.04 dependent: set(process_input).
% 1.82/2.04 dependent: clear(print_kept).
% 1.82/2.04 dependent: clear(print_new_demod).
% 1.82/2.04 dependent: clear(print_back_demod).
% 1.82/2.04 dependent: clear(print_back_sub).
% 1.82/2.04 dependent: set(control_memory).
% 1.82/2.04 dependent: assign(max_mem, 12000).
% 1.82/2.04 dependent: assign(pick_given_ratio, 4).
% 1.82/2.04 dependent: assign(stats_level, 1).
% 1.82/2.04 dependent: assign(max_seconds, 10800).
% 1.82/2.04 clear(print_given).
% 1.82/2.04
% 1.82/2.04 list(usable).
% 1.82/2.04 0 [] can(monkey(Location1,ceiling,nothing),ladder(Location1,floor),Bananas)| -can(monkey(Location1,floor,nothing),ladder(Location1,floor),Bananas).
% 1.82/2.04 0 [] can(monkey(Location1,floor,nothing),ladder(Location1,floor),Bananas)| -can(monkey(Location1,ceiling,nothing),ladder(Location1,floor),Bananas).
% 1.82/2.04 0 [] can(monkey(Location2,floor,the_ladder),ladder(Location2,floor),Bananas)| -can(monkey(Location1,floor,the_ladder),ladder(Location1,floor),Bananas).
% 1.82/2.04 0 [] can(monkey(Location2,floor,the_bananas),Ladder,bananas(Location2,floor))| -can(monkey(Location1,floor,the_bananas),Ladder,bananas(Location1,floor)).
% 1.82/2.04 0 [] can(monkey(Location2,floor,nothing),Ladder,Bananas)| -can(monkey(Location1,floor,nothing),Ladder,Bananas).
% 1.82/2.04 0 [] can(monkey(Location,Height,nothing),ladder(Location,floor),Bananas)| -can(monkey(Location,Height,the_ladder),ladder(Location,Any_height),Bananas).
% 1.82/2.04 0 [] can(monkey(Location,Height,nothing),Ladder,bananas(Location,floor))| -can(monkey(Location,Height,the_bananas),Ladder,bananas(Location,Height)).
% 1.82/2.04 0 [] can(monkey(Location,Height,the_bananas),Ladder,bananas(Location,Height))| -can(monkey(Location,Height,nothing),Ladder,bananas(Location,Height)).
% 1.82/2.04 0 [] can(monkey(Location,Height,the_ladder),ladder(Location,Height),Bananas)| -can(monkey(Location,Height,nothing),ladder(Location,Height),Bananas).
% 1.82/2.04 0 [] can(monkey(l0,floor,nothing),ladder(l1,floor),bananas(l2,ceiling)).
% 1.82/2.04 0 [] -can(monkey(Somewhere,Some_height,the_bananas),Ladder,What).
% 1.82/2.04 end_of_list.
% 1.82/2.04
% 1.82/2.04 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=2.
% 1.82/2.04
% 1.82/2.04 This is a Horn set without equality. The strategy will
% 1.82/2.04 be hyperresolution, with satellites in sos and nuclei
% 1.82/2.04 in usable.
% 1.82/2.04
% 1.82/2.04 dependent: set(hyper_res).
% 1.82/2.04 dependent: clear(order_hyper).
% 1.82/2.04
% 1.82/2.04 ------------> process usable:
% 1.82/2.04 ** KEPT (pick-wt=18): 1 [] can(monkey(A,ceiling,nothing),ladder(A,floor),B)| -can(monkey(A,floor,nothing),ladder(A,floor),B).
% 1.82/2.04 ** KEPT (pick-wt=18): 2 [] can(monkey(A,floor,nothing),ladder(A,floor),B)| -can(monkey(A,ceiling,nothing),ladder(A,floor),B).
% 1.82/2.04 ** KEPT (pick-wt=18): 3 [] can(monkey(A,floor,the_ladder),ladder(A,floor),B)| -can(monkey(C,floor,the_ladder),ladder(C,floor),B).
% 1.82/2.04 ** KEPT (pick-wt=18): 4 [] can(monkey(A,floor,the_bananas),B,bananas(A,floor))| -can(monkey(C,floor,the_bananas),B,bananas(C,floor)).
% 1.82/2.04 ** KEPT (pick-wt=14): 5 [] can(monkey(A,floor,nothing),B,C)| -can(monkey(D,floor,nothing),B,C).
% 1.82/2.04 ** KEPT (pick-wt=18): 6 [] can(monkey(A,B,nothing),ladder(A,floor),C)| -can(monkey(A,B,the_ladder),ladder(A,D),C).
% 1.82/2.04 ** KEPT (pick-wt=18): 7 [] can(monkey(A,B,nothing),C,bananas(A,floor))| -can(monkey(A,B,the_bananas),C,bananas(A,B)).
% 1.82/2.04 ** KEPT (pick-wt=18): 8 [] can(monkey(A,B,the_bananas),C,bananas(A,B))| -can(monkey(A,B,nothing),C,bananas(A,B)).
% 1.82/2.04 ** KEPT (pick-wt=18): 9 [] can(monkey(A,B,the_ladder),ladder(A,B),C)| -can(monkey(A,B,nothing),ladder(A,B),C).
% 1.82/2.04 ** KEPT (pick-wt=7): 10 [] -can(monkey(A,B,the_bananas),C,D).
% 1.82/2.04 10 back subsumes 7.
% 1.82/2.04 10 back subsumes 4.
% 1.82/2.04
% 1.82/2.04 ------------> process sos:
% 1.82/2.04 ** KEPT (pick-wt=11): 11 [] can(monkey(l0,floor,nothing),ladder(l1,floor),bananas(l2,ceiling)).
% 1.82/2.04
% 1.82/2.04 ======= end of input processing =======
% 1.82/2.04
% 1.82/2.04 =========== start of search ===========
% 1.82/2.04
% 1.82/2.04 -------- PROOF --------
% 1.82/2.04
% 1.82/2.04 ----> UNIT CONFLICT at 0.00 sec ----> 20 [binary,19.1,10.1] $F.
% 1.82/2.04
% 1.82/2.04 Length of proof is 6. Level of proof is 6.
% 1.82/2.04
% 1.82/2.04 ---------------- PROOF ----------------
% 1.82/2.04 % SZS status Unsatisfiable
% 1.82/2.04 % SZS output start Refutation
% See solution above
% 1.82/2.04 ------------ end of proof -------------
% 1.82/2.04
% 1.82/2.04
% 1.82/2.04 Search stopped by max_proofs option.
% 1.82/2.04
% 1.82/2.04
% 1.82/2.04 Search stopped by max_proofs option.
% 1.82/2.04
% 1.82/2.04 ============ end of search ============
% 1.82/2.04
% 1.82/2.04 -------------- statistics -------------
% 1.82/2.04 clauses given 8
% 1.82/2.04 clauses generated 16
% 1.82/2.04 clauses kept 19
% 1.82/2.04 clauses forward subsumed 8
% 1.82/2.04 clauses back subsumed 7
% 1.82/2.04 Kbytes malloced 976
% 1.82/2.04
% 1.82/2.04 ----------- times (seconds) -----------
% 1.82/2.04 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.82/2.04 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.82/2.04 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.82/2.04
% 1.82/2.04 That finishes the proof of the theorem.
% 1.82/2.04
% 1.82/2.04 Process 4831 finished Wed Jul 27 02:49:35 2022
% 1.82/2.04 Otter interrupted
% 1.82/2.04 PROOF FOUND
%------------------------------------------------------------------------------