TSTP Solution File: PLA020-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : PLA020-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n007.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:46 EDT 2022
% Result : Unsatisfiable 1.26s 1.67s
% Output : Refutation 1.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 5
% Syntax : Number of clauses : 7 ( 6 unt; 0 nHn; 7 RR)
% Number of literals : 10 ( 0 equ; 4 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 4 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
( holds(clear(A),do(pickup(B),C))
| ~ holds(on(B,A),C)
| ~ holds(clear(B),C)
| ~ holds(empty,C) ),
file('PLA020-1.p',unknown),
[] ).
cnf(12,axiom,
~ holds(clear(d),A),
file('PLA020-1.p',unknown),
[] ).
cnf(25,axiom,
holds(on(c,d),s0),
file('PLA020-1.p',unknown),
[] ).
cnf(29,axiom,
holds(clear(c),s0),
file('PLA020-1.p',unknown),
[] ).
cnf(30,axiom,
holds(empty,s0),
file('PLA020-1.p',unknown),
[] ).
cnf(137,plain,
holds(clear(d),do(pickup(c),s0)),
inference(hyper,[status(thm)],[29,3,25,30]),
[iquote('hyper,29,3,25,30')] ).
cnf(138,plain,
$false,
inference(binary,[status(thm)],[137,12]),
[iquote('binary,137.1,12.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : PLA020-1 : TPTP v8.1.0. Released v1.1.0.
% 0.06/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n007.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:12:01 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.26/1.67 ----- Otter 3.3f, August 2004 -----
% 1.26/1.67 The process was started by sandbox on n007.cluster.edu,
% 1.26/1.67 Wed Jul 27 02:12:01 2022
% 1.26/1.67 The command was "./otter". The process ID is 31885.
% 1.26/1.67
% 1.26/1.67 set(prolog_style_variables).
% 1.26/1.67 set(auto).
% 1.26/1.67 dependent: set(auto1).
% 1.26/1.67 dependent: set(process_input).
% 1.26/1.67 dependent: clear(print_kept).
% 1.26/1.67 dependent: clear(print_new_demod).
% 1.26/1.67 dependent: clear(print_back_demod).
% 1.26/1.67 dependent: clear(print_back_sub).
% 1.26/1.67 dependent: set(control_memory).
% 1.26/1.67 dependent: assign(max_mem, 12000).
% 1.26/1.67 dependent: assign(pick_given_ratio, 4).
% 1.26/1.67 dependent: assign(stats_level, 1).
% 1.26/1.67 dependent: assign(max_seconds, 10800).
% 1.26/1.67 clear(print_given).
% 1.26/1.67
% 1.26/1.67 list(usable).
% 1.26/1.67 0 [] holds(and(X,Y),State)| -holds(X,State)| -holds(Y,State).
% 1.26/1.67 0 [] holds(holding(X),do(pickup(X),State))| -holds(empty,State)| -holds(clear(X),State)| -differ(X,table).
% 1.26/1.67 0 [] holds(clear(Y),do(pickup(X),State))| -holds(on(X,Y),State)| -holds(clear(X),State)| -holds(empty,State).
% 1.26/1.67 0 [] holds(on(X,Y),do(pickup(Z),State))| -holds(on(X,Y),State)| -differ(X,Z).
% 1.26/1.67 0 [] holds(clear(X),do(pickup(Z),State))| -holds(clear(X),State)| -differ(X,Z).
% 1.26/1.67 0 [] holds(empty,do(putdown(X,Y),State))| -holds(holding(X),State)| -holds(clear(Y),State).
% 1.26/1.67 0 [] holds(on(X,Y),do(putdown(X,Y),State))| -holds(holding(X),State)| -holds(clear(Y),State).
% 1.26/1.67 0 [] holds(clear(X),do(putdown(X,Y),State))| -holds(holding(X),State)| -holds(clear(Y),State).
% 1.26/1.67 0 [] holds(on(X,Y),do(putdown(Z,W),State))| -holds(on(X,Y),State).
% 1.26/1.67 0 [] holds(clear(Z),do(putdown(X,Y),State))| -holds(clear(Z),State)| -differ(Z,Y).
% 1.26/1.67 0 [] differ(X,Y)| -differ(Y,X).
% 1.26/1.67 0 [] differ(a,b).
% 1.26/1.67 0 [] differ(a,c).
% 1.26/1.67 0 [] differ(a,d).
% 1.26/1.67 0 [] differ(a,table).
% 1.26/1.67 0 [] differ(b,c).
% 1.26/1.67 0 [] differ(b,d).
% 1.26/1.67 0 [] differ(b,table).
% 1.26/1.67 0 [] differ(c,d).
% 1.26/1.67 0 [] differ(c,table).
% 1.26/1.67 0 [] differ(d,table).
% 1.26/1.67 0 [] holds(on(a,table),s0).
% 1.26/1.67 0 [] holds(on(b,table),s0).
% 1.26/1.67 0 [] holds(on(c,d),s0).
% 1.26/1.67 0 [] holds(on(d,table),s0).
% 1.26/1.67 0 [] holds(clear(a),s0).
% 1.26/1.67 0 [] holds(clear(b),s0).
% 1.26/1.67 0 [] holds(clear(c),s0).
% 1.26/1.67 0 [] holds(empty,s0).
% 1.26/1.67 0 [] holds(clear(table),State).
% 1.26/1.67 0 [] -holds(clear(d),State).
% 1.26/1.67 end_of_list.
% 1.26/1.67
% 1.26/1.67 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=4.
% 1.26/1.67
% 1.26/1.67 This is a Horn set without equality. The strategy will
% 1.26/1.67 be hyperresolution, with satellites in sos and nuclei
% 1.26/1.67 in usable.
% 1.26/1.67
% 1.26/1.67 dependent: set(hyper_res).
% 1.26/1.67 dependent: clear(order_hyper).
% 1.26/1.67
% 1.26/1.67 ------------> process usable:
% 1.26/1.67 ** KEPT (pick-wt=11): 1 [] holds(and(A,B),C)| -holds(A,C)| -holds(B,C).
% 1.26/1.67 ** KEPT (pick-wt=17): 2 [] holds(holding(A),do(pickup(A),B))| -holds(empty,B)| -holds(clear(A),B)| -differ(A,table).
% 1.26/1.67 ** KEPT (pick-wt=19): 3 [] holds(clear(A),do(pickup(B),C))| -holds(on(B,A),C)| -holds(clear(B),C)| -holds(empty,C).
% 1.26/1.67 ** KEPT (pick-wt=16): 4 [] holds(on(A,B),do(pickup(C),D))| -holds(on(A,B),D)| -differ(A,C).
% 1.26/1.67 ** KEPT (pick-wt=14): 5 [] holds(clear(A),do(pickup(B),C))| -holds(clear(A),C)| -differ(A,B).
% 1.26/1.67 ** KEPT (pick-wt=15): 6 [] holds(empty,do(putdown(A,B),C))| -holds(holding(A),C)| -holds(clear(B),C).
% 1.26/1.67 ** KEPT (pick-wt=17): 7 [] holds(on(A,B),do(putdown(A,B),C))| -holds(holding(A),C)| -holds(clear(B),C).
% 1.26/1.67 ** KEPT (pick-wt=16): 8 [] holds(clear(A),do(putdown(A,B),C))| -holds(holding(A),C)| -holds(clear(B),C).
% 1.26/1.67 ** KEPT (pick-wt=14): 9 [] holds(on(A,B),do(putdown(C,D),E))| -holds(on(A,B),E).
% 1.26/1.67 ** KEPT (pick-wt=15): 10 [] holds(clear(A),do(putdown(B,C),D))| -holds(clear(A),D)| -differ(A,C).
% 1.26/1.67 ** KEPT (pick-wt=6): 11 [] differ(A,B)| -differ(B,A).
% 1.26/1.67 ** KEPT (pick-wt=4): 12 [] -holds(clear(d),A).
% 1.26/1.67
% 1.26/1.67 ------------> process sos:
% 1.26/1.67 ** KEPT (pick-wt=3): 13 [] differ(a,b).
% 1.26/1.67 ** KEPT (pick-wt=3): 14 [] differ(a,c).
% 1.26/1.67 ** KEPT (pick-wt=3): 15 [] differ(a,d).
% 1.26/1.67 ** KEPT (pick-wt=3): 16 [] differ(a,table).
% 1.26/1.67 ** KEPT (pick-wt=3): 17 [] differ(b,c).
% 1.26/1.67 ** KEPT (pick-wt=3): 18 [] differ(b,d).
% 1.26/1.67 ** KEPT (pick-wt=3): 19 [] differ(b,table).
% 1.26/1.67 ** KEPT (pick-wt=3): 20 [] differ(c,d).
% 1.26/1.67 ** KEPT (pick-wt=3): 21 [] differ(c,table).
% 1.26/1.67 ** KEPT (pick-wt=3): 22 [] differ(d,table).
% 1.26/1.67 ** KEPT (pick-wt=5): 23 [] holds(on(a,table),s0).
% 1.26/1.67 ** KEPT (pick-wt=5): 24 [] holds(on(b,table),s0).
% 1.26/1.67 ** KEPT (pick-wt=5): 25 [] holds(on(c,d),s0).
% 1.26/1.67 ** KEPT (pick-wt=5): 26 [] holds(on(d,table),s0).
% 1.26/1.67 ** KEPT (pick-wt=4): 27 [] holds(clear(a),s0).
% 1.26/1.67 ** KEPT (pick-wt=4): 28 [] holds(clear(b),s0).
% 1.26/1.67 ** KEPT (pick-wt=4): 29 [] holds(clear(c),s0).
% 1.26/1.67 ** KEPT (pick-wt=3): 30 [] holds(empty,s0).
% 1.26/1.67 ** KEPT (pick-wt=4): 31 [] holds(clear(table),A).
% 1.26/1.67
% 1.26/1.67 ======= end of input processing =======
% 1.26/1.67
% 1.26/1.67 =========== start of search ===========
% 1.26/1.67
% 1.26/1.67 -------- PROOF --------
% 1.26/1.67
% 1.26/1.67 ----> UNIT CONFLICT at 0.00 sec ----> 138 [binary,137.1,12.1] $F.
% 1.26/1.67
% 1.26/1.67 Length of proof is 1. Level of proof is 1.
% 1.26/1.67
% 1.26/1.67 ---------------- PROOF ----------------
% 1.26/1.67 % SZS status Unsatisfiable
% 1.26/1.67 % SZS output start Refutation
% See solution above
% 1.26/1.67 ------------ end of proof -------------
% 1.26/1.67
% 1.26/1.67
% 1.26/1.67 Search stopped by max_proofs option.
% 1.26/1.67
% 1.26/1.67
% 1.26/1.67 Search stopped by max_proofs option.
% 1.26/1.67
% 1.26/1.67 ============ end of search ============
% 1.26/1.67
% 1.26/1.67 -------------- statistics -------------
% 1.26/1.67 clauses given 28
% 1.26/1.67 clauses generated 125
% 1.26/1.67 clauses kept 137
% 1.26/1.67 clauses forward subsumed 19
% 1.26/1.67 clauses back subsumed 0
% 1.26/1.67 Kbytes malloced 976
% 1.26/1.67
% 1.26/1.67 ----------- times (seconds) -----------
% 1.26/1.67 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.26/1.67 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.26/1.67 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.26/1.67
% 1.26/1.67 That finishes the proof of the theorem.
% 1.26/1.67
% 1.26/1.67 Process 31885 finished Wed Jul 27 02:12:02 2022
% 1.26/1.67 Otter interrupted
% 1.26/1.67 PROOF FOUND
%------------------------------------------------------------------------------