%------------------------------------------------------------------------------
% File     : cvc5---1.0.5
% Problem  : PLA007-1 : TPTP v8.2.0. Released v1.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : do_cvc5 %s %d

% Computer : n013.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 May 29 17:38:24 EDT 2024

% Result   : Unsatisfiable 1.23s 1.40s
% Output   : Proof 1.23s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.13  % Problem    : PLA007-1 : TPTP v8.2.0. Released v1.1.0.
% 0.10/0.14  % Command    : do_cvc5 %s %d
% 0.14/0.35  % Computer : n013.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Sat May 25 23:22:24 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.21/0.50  %----Proving TF0_NAR, FOF, or CNF
% 0.21/0.50  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 1.23/1.40  % SZS status Unsatisfiable for /export/starexec/sandbox/tmp/tmp.Gyt24oXQHI/cvc5---1.0.5_27768.smt2
% 1.23/1.40  % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.Gyt24oXQHI/cvc5---1.0.5_27768.smt2
% 1.23/1.41  (assume a0 (forall ((X $$unsorted) (Y $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.and X Y) State) (not (tptp.holds X State)) (not (tptp.holds Y State)))))
% 1.23/1.41  (assume a1 (forall ((X $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.holding X) (tptp.do (tptp.pickup X) State)) (not (tptp.holds tptp.empty State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X tptp.table)))))
% 1.23/1.41  (assume a2 (forall ((Y $$unsorted) (X $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear Y) (tptp.do (tptp.pickup X) State)) (not (tptp.holds (tptp.on X Y) State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.holds tptp.empty State)))))
% 1.23/1.41  (assume a3 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.on X Y) (tptp.do (tptp.pickup Z) State)) (not (tptp.holds (tptp.on X Y) State)) (not (tptp.differ X Z)))))
% 1.23/1.41  (assume a4 (forall ((X $$unsorted) (Z $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear X) (tptp.do (tptp.pickup Z) State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X Z)))))
% 1.23/1.41  (assume a5 (forall ((X $$unsorted) (Y $$unsorted) (State $$unsorted)) (or (tptp.holds tptp.empty (tptp.do (tptp.putdown X Y) State)) (not (tptp.holds (tptp.holding X) State)) (not (tptp.holds (tptp.clear Y) State)))))
% 1.23/1.41  (assume a6 (forall ((X $$unsorted) (Y $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.on X Y) (tptp.do (tptp.putdown X Y) State)) (not (tptp.holds (tptp.holding X) State)) (not (tptp.holds (tptp.clear Y) State)))))
% 1.23/1.41  (assume a7 (forall ((X $$unsorted) (Y $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear X) (tptp.do (tptp.putdown X Y) State)) (not (tptp.holds (tptp.holding X) State)) (not (tptp.holds (tptp.clear Y) State)))))
% 1.23/1.41  (assume a8 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted) (W $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.on X Y) (tptp.do (tptp.putdown Z W) State)) (not (tptp.holds (tptp.on X Y) State)))))
% 1.23/1.41  (assume a9 (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear Z) (tptp.do (tptp.putdown X Y) State)) (not (tptp.holds (tptp.clear Z) State)) (not (tptp.differ Z Y)))))
% 1.23/1.41  (assume a10 (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.differ X Y) (not (tptp.differ Y X)))))
% 1.23/1.41  (assume a11 (tptp.differ tptp.a tptp.b))
% 1.23/1.41  (assume a12 (tptp.differ tptp.a tptp.c))
% 1.23/1.41  (assume a13 (tptp.differ tptp.a tptp.d))
% 1.23/1.41  (assume a14 (tptp.differ tptp.a tptp.table))
% 1.23/1.41  (assume a15 (tptp.differ tptp.b tptp.c))
% 1.23/1.41  (assume a16 (tptp.differ tptp.b tptp.d))
% 1.23/1.41  (assume a17 (tptp.differ tptp.b tptp.table))
% 1.23/1.41  (assume a18 (tptp.differ tptp.c tptp.d))
% 1.23/1.41  (assume a19 (tptp.differ tptp.c tptp.table))
% 1.23/1.41  (assume a20 (tptp.differ tptp.d tptp.table))
% 1.23/1.41  (assume a21 (tptp.holds (tptp.on tptp.a tptp.table) tptp.s0))
% 1.23/1.41  (assume a22 (tptp.holds (tptp.on tptp.b tptp.table) tptp.s0))
% 1.23/1.41  (assume a23 (tptp.holds (tptp.on tptp.c tptp.d) tptp.s0))
% 1.23/1.41  (assume a24 (tptp.holds (tptp.on tptp.d tptp.table) tptp.s0))
% 1.23/1.41  (assume a25 (tptp.holds (tptp.clear tptp.a) tptp.s0))
% 1.23/1.41  (assume a26 (tptp.holds (tptp.clear tptp.b) tptp.s0))
% 1.23/1.41  (assume a27 (tptp.holds (tptp.clear tptp.c) tptp.s0))
% 1.23/1.41  (assume a28 (tptp.holds tptp.empty tptp.s0))
% 1.23/1.41  (assume a29 (forall ((State $$unsorted)) (tptp.holds (tptp.clear tptp.table) State)))
% 1.23/1.41  (assume a30 (forall ((State $$unsorted)) (not (tptp.holds (tptp.on tptp.a tptp.d) State))))
% 1.23/1.41  (step t1 (cl (=> (forall ((State $$unsorted)) (not (tptp.holds (tptp.on tptp.a tptp.d) State))) (not (tptp.holds (tptp.on tptp.a tptp.d) (tptp.do (tptp.putdown tptp.a tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))))) (forall ((State $$unsorted)) (not (tptp.holds (tptp.on tptp.a tptp.d) State)))) :rule implies_neg1)
% 1.23/1.41  (anchor :step t2)
% 1.23/1.41  (assume t2.a0 (forall ((State $$unsorted)) (not (tptp.holds (tptp.on tptp.a tptp.d) State))))
% 1.23/1.41  (step t2.t1 (cl (or (not (forall ((State $$unsorted)) (not (tptp.holds (tptp.on tptp.a tptp.d) State)))) (not (tptp.holds (tptp.on tptp.a tptp.d) (tptp.do (tptp.putdown tptp.a tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))))))) :rule forall_inst :args ((:= State (tptp.do (tptp.putdown tptp.a tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))))))
% 1.23/1.41  (step t2.t2 (cl (not (forall ((State $$unsorted)) (not (tptp.holds (tptp.on tptp.a tptp.d) State)))) (not (tptp.holds (tptp.on tptp.a tptp.d) (tptp.do (tptp.putdown tptp.a tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))))) :rule or :premises (t2.t1))
% 1.23/1.41  (step t2.t3 (cl (not (tptp.holds (tptp.on tptp.a tptp.d) (tptp.do (tptp.putdown tptp.a tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))))) :rule resolution :premises (t2.t2 t2.a0))
% 1.23/1.41  (step t2 (cl (not (forall ((State $$unsorted)) (not (tptp.holds (tptp.on tptp.a tptp.d) State)))) (not (tptp.holds (tptp.on tptp.a tptp.d) (tptp.do (tptp.putdown tptp.a tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))))) :rule subproof :discharge (t2.a0))
% 1.23/1.41  (step t3 (cl (=> (forall ((State $$unsorted)) (not (tptp.holds (tptp.on tptp.a tptp.d) State))) (not (tptp.holds (tptp.on tptp.a tptp.d) (tptp.do (tptp.putdown tptp.a tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))))) (not (tptp.holds (tptp.on tptp.a tptp.d) (tptp.do (tptp.putdown tptp.a tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))))) :rule resolution :premises (t1 t2))
% 1.23/1.41  (step t4 (cl (=> (forall ((State $$unsorted)) (not (tptp.holds (tptp.on tptp.a tptp.d) State))) (not (tptp.holds (tptp.on tptp.a tptp.d) (tptp.do (tptp.putdown tptp.a tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))))) (not (not (tptp.holds (tptp.on tptp.a tptp.d) (tptp.do (tptp.putdown tptp.a tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))))))) :rule implies_neg2)
% 1.23/1.41  (step t5 (cl (=> (forall ((State $$unsorted)) (not (tptp.holds (tptp.on tptp.a tptp.d) State))) (not (tptp.holds (tptp.on tptp.a tptp.d) (tptp.do (tptp.putdown tptp.a tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))))) (=> (forall ((State $$unsorted)) (not (tptp.holds (tptp.on tptp.a tptp.d) State))) (not (tptp.holds (tptp.on tptp.a tptp.d) (tptp.do (tptp.putdown tptp.a tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))))))) :rule resolution :premises (t3 t4))
% 1.23/1.41  (step t6 (cl (=> (forall ((State $$unsorted)) (not (tptp.holds (tptp.on tptp.a tptp.d) State))) (not (tptp.holds (tptp.on tptp.a tptp.d) (tptp.do (tptp.putdown tptp.a tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))))))) :rule contraction :premises (t5))
% 1.23/1.41  (step t7 (cl (not (forall ((State $$unsorted)) (not (tptp.holds (tptp.on tptp.a tptp.d) State)))) (not (tptp.holds (tptp.on tptp.a tptp.d) (tptp.do (tptp.putdown tptp.a tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))))) :rule implies :premises (t6))
% 1.23/1.41  (step t8 (cl (not (or (tptp.holds (tptp.on tptp.a tptp.d) (tptp.do (tptp.putdown tptp.a tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) (not (tptp.holds (tptp.holding tptp.a) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) (not (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))))) (tptp.holds (tptp.on tptp.a tptp.d) (tptp.do (tptp.putdown tptp.a tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) (not (tptp.holds (tptp.holding tptp.a) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) (not (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))))) :rule or_pos)
% 1.23/1.41  (step t9 (cl (not (tptp.holds (tptp.holding tptp.a) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) (not (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) (tptp.holds (tptp.on tptp.a tptp.d) (tptp.do (tptp.putdown tptp.a tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) (not (or (tptp.holds (tptp.on tptp.a tptp.d) (tptp.do (tptp.putdown tptp.a tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) (not (tptp.holds (tptp.holding tptp.a) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) (not (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))))))) :rule reordering :premises (t8))
% 1.23/1.41  (step t10 (cl (not (or (tptp.holds (tptp.holding tptp.a) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.holds tptp.empty (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.differ tptp.a tptp.table)))) (tptp.holds (tptp.holding tptp.a) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.holds tptp.empty (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.differ tptp.a tptp.table))) :rule or_pos)
% 1.23/1.41  (step t11 (cl (not (tptp.differ tptp.a tptp.table)) (not (tptp.holds tptp.empty (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (tptp.holds (tptp.holding tptp.a) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (or (tptp.holds (tptp.holding tptp.a) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.holds tptp.empty (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.differ tptp.a tptp.table))))) :rule reordering :premises (t10))
% 1.23/1.41  (step t12 (cl (not (or (tptp.holds tptp.empty (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.holding tptp.c) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.clear tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) (tptp.holds tptp.empty (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.holding tptp.c) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.clear tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) :rule or_pos)
% 1.23/1.41  (step t13 (cl (not (tptp.holds (tptp.holding tptp.c) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (tptp.holds tptp.empty (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.clear tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (or (tptp.holds tptp.empty (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.holding tptp.c) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.clear tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))))) :rule reordering :premises (t12))
% 1.23/1.41  (step t14 (cl (not (or (tptp.holds (tptp.holding tptp.c) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds tptp.empty tptp.s0)) (not (tptp.holds (tptp.clear tptp.c) tptp.s0)) (not (tptp.differ tptp.c tptp.table)))) (tptp.holds (tptp.holding tptp.c) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds tptp.empty tptp.s0)) (not (tptp.holds (tptp.clear tptp.c) tptp.s0)) (not (tptp.differ tptp.c tptp.table))) :rule or_pos)
% 1.23/1.41  (step t15 (cl (not (tptp.differ tptp.c tptp.table)) (not (tptp.holds (tptp.clear tptp.c) tptp.s0)) (not (tptp.holds tptp.empty tptp.s0)) (tptp.holds (tptp.holding tptp.c) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (or (tptp.holds (tptp.holding tptp.c) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds tptp.empty tptp.s0)) (not (tptp.holds (tptp.clear tptp.c) tptp.s0)) (not (tptp.differ tptp.c tptp.table))))) :rule reordering :premises (t14))
% 1.23/1.41  (step t16 (cl (=> (forall ((X $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.holding X) (tptp.do (tptp.pickup X) State)) (not (tptp.holds tptp.empty State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X tptp.table)))) (or (tptp.holds (tptp.holding tptp.c) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds tptp.empty tptp.s0)) (not (tptp.holds (tptp.clear tptp.c) tptp.s0)) (not (tptp.differ tptp.c tptp.table)))) (forall ((X $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.holding X) (tptp.do (tptp.pickup X) State)) (not (tptp.holds tptp.empty State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X tptp.table))))) :rule implies_neg1)
% 1.23/1.41  (anchor :step t17)
% 1.23/1.41  (assume t17.a0 (forall ((X $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.holding X) (tptp.do (tptp.pickup X) State)) (not (tptp.holds tptp.empty State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X tptp.table)))))
% 1.23/1.41  (step t17.t1 (cl (or (not (forall ((X $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.holding X) (tptp.do (tptp.pickup X) State)) (not (tptp.holds tptp.empty State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X tptp.table))))) (or (tptp.holds (tptp.holding tptp.c) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds tptp.empty tptp.s0)) (not (tptp.holds (tptp.clear tptp.c) tptp.s0)) (not (tptp.differ tptp.c tptp.table))))) :rule forall_inst :args ((:= X tptp.c) (:= State tptp.s0)))
% 1.23/1.41  (step t17.t2 (cl (not (forall ((X $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.holding X) (tptp.do (tptp.pickup X) State)) (not (tptp.holds tptp.empty State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X tptp.table))))) (or (tptp.holds (tptp.holding tptp.c) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds tptp.empty tptp.s0)) (not (tptp.holds (tptp.clear tptp.c) tptp.s0)) (not (tptp.differ tptp.c tptp.table)))) :rule or :premises (t17.t1))
% 1.23/1.41  (step t17.t3 (cl (or (tptp.holds (tptp.holding tptp.c) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds tptp.empty tptp.s0)) (not (tptp.holds (tptp.clear tptp.c) tptp.s0)) (not (tptp.differ tptp.c tptp.table)))) :rule resolution :premises (t17.t2 t17.a0))
% 1.23/1.41  (step t17 (cl (not (forall ((X $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.holding X) (tptp.do (tptp.pickup X) State)) (not (tptp.holds tptp.empty State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X tptp.table))))) (or (tptp.holds (tptp.holding tptp.c) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds tptp.empty tptp.s0)) (not (tptp.holds (tptp.clear tptp.c) tptp.s0)) (not (tptp.differ tptp.c tptp.table)))) :rule subproof :discharge (t17.a0))
% 1.23/1.41  (step t18 (cl (=> (forall ((X $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.holding X) (tptp.do (tptp.pickup X) State)) (not (tptp.holds tptp.empty State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X tptp.table)))) (or (tptp.holds (tptp.holding tptp.c) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds tptp.empty tptp.s0)) (not (tptp.holds (tptp.clear tptp.c) tptp.s0)) (not (tptp.differ tptp.c tptp.table)))) (or (tptp.holds (tptp.holding tptp.c) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds tptp.empty tptp.s0)) (not (tptp.holds (tptp.clear tptp.c) tptp.s0)) (not (tptp.differ tptp.c tptp.table)))) :rule resolution :premises (t16 t17))
% 1.23/1.41  (step t19 (cl (=> (forall ((X $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.holding X) (tptp.do (tptp.pickup X) State)) (not (tptp.holds tptp.empty State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X tptp.table)))) (or (tptp.holds (tptp.holding tptp.c) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds tptp.empty tptp.s0)) (not (tptp.holds (tptp.clear tptp.c) tptp.s0)) (not (tptp.differ tptp.c tptp.table)))) (not (or (tptp.holds (tptp.holding tptp.c) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds tptp.empty tptp.s0)) (not (tptp.holds (tptp.clear tptp.c) tptp.s0)) (not (tptp.differ tptp.c tptp.table))))) :rule implies_neg2)
% 1.23/1.41  (step t20 (cl (=> (forall ((X $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.holding X) (tptp.do (tptp.pickup X) State)) (not (tptp.holds tptp.empty State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X tptp.table)))) (or (tptp.holds (tptp.holding tptp.c) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds tptp.empty tptp.s0)) (not (tptp.holds (tptp.clear tptp.c) tptp.s0)) (not (tptp.differ tptp.c tptp.table)))) (=> (forall ((X $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.holding X) (tptp.do (tptp.pickup X) State)) (not (tptp.holds tptp.empty State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X tptp.table)))) (or (tptp.holds (tptp.holding tptp.c) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds tptp.empty tptp.s0)) (not (tptp.holds (tptp.clear tptp.c) tptp.s0)) (not (tptp.differ tptp.c tptp.table))))) :rule resolution :premises (t18 t19))
% 1.23/1.41  (step t21 (cl (=> (forall ((X $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.holding X) (tptp.do (tptp.pickup X) State)) (not (tptp.holds tptp.empty State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X tptp.table)))) (or (tptp.holds (tptp.holding tptp.c) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds tptp.empty tptp.s0)) (not (tptp.holds (tptp.clear tptp.c) tptp.s0)) (not (tptp.differ tptp.c tptp.table))))) :rule contraction :premises (t20))
% 1.23/1.41  (step t22 (cl (not (forall ((X $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.holding X) (tptp.do (tptp.pickup X) State)) (not (tptp.holds tptp.empty State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X tptp.table))))) (or (tptp.holds (tptp.holding tptp.c) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds tptp.empty tptp.s0)) (not (tptp.holds (tptp.clear tptp.c) tptp.s0)) (not (tptp.differ tptp.c tptp.table)))) :rule implies :premises (t21))
% 1.23/1.41  (step t23 (cl (or (tptp.holds (tptp.holding tptp.c) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds tptp.empty tptp.s0)) (not (tptp.holds (tptp.clear tptp.c) tptp.s0)) (not (tptp.differ tptp.c tptp.table)))) :rule resolution :premises (t22 a1))
% 1.23/1.41  (step t24 (cl (tptp.holds (tptp.holding tptp.c) (tptp.do (tptp.pickup tptp.c) tptp.s0))) :rule resolution :premises (t15 a19 a27 a28 t23))
% 1.23/1.41  (step t25 (cl (not (or (tptp.holds (tptp.clear tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds (tptp.clear tptp.b) tptp.s0)) (not (tptp.differ tptp.b tptp.c)))) (tptp.holds (tptp.clear tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds (tptp.clear tptp.b) tptp.s0)) (not (tptp.differ tptp.b tptp.c))) :rule or_pos)
% 1.23/1.41  (step t26 (cl (not (tptp.differ tptp.b tptp.c)) (not (tptp.holds (tptp.clear tptp.b) tptp.s0)) (tptp.holds (tptp.clear tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (or (tptp.holds (tptp.clear tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds (tptp.clear tptp.b) tptp.s0)) (not (tptp.differ tptp.b tptp.c))))) :rule reordering :premises (t25))
% 1.23/1.41  (step t27 (cl (=> (forall ((X $$unsorted) (Z $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear X) (tptp.do (tptp.pickup Z) State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X Z)))) (or (tptp.holds (tptp.clear tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds (tptp.clear tptp.b) tptp.s0)) (not (tptp.differ tptp.b tptp.c)))) (forall ((X $$unsorted) (Z $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear X) (tptp.do (tptp.pickup Z) State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X Z))))) :rule implies_neg1)
% 1.23/1.41  (anchor :step t28)
% 1.23/1.41  (assume t28.a0 (forall ((X $$unsorted) (Z $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear X) (tptp.do (tptp.pickup Z) State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X Z)))))
% 1.23/1.41  (step t28.t1 (cl (or (not (forall ((X $$unsorted) (Z $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear X) (tptp.do (tptp.pickup Z) State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X Z))))) (or (tptp.holds (tptp.clear tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds (tptp.clear tptp.b) tptp.s0)) (not (tptp.differ tptp.b tptp.c))))) :rule forall_inst :args ((:= X tptp.b) (:= Z tptp.c) (:= State tptp.s0)))
% 1.23/1.41  (step t28.t2 (cl (not (forall ((X $$unsorted) (Z $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear X) (tptp.do (tptp.pickup Z) State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X Z))))) (or (tptp.holds (tptp.clear tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds (tptp.clear tptp.b) tptp.s0)) (not (tptp.differ tptp.b tptp.c)))) :rule or :premises (t28.t1))
% 1.23/1.41  (step t28.t3 (cl (or (tptp.holds (tptp.clear tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds (tptp.clear tptp.b) tptp.s0)) (not (tptp.differ tptp.b tptp.c)))) :rule resolution :premises (t28.t2 t28.a0))
% 1.23/1.41  (step t28 (cl (not (forall ((X $$unsorted) (Z $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear X) (tptp.do (tptp.pickup Z) State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X Z))))) (or (tptp.holds (tptp.clear tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds (tptp.clear tptp.b) tptp.s0)) (not (tptp.differ tptp.b tptp.c)))) :rule subproof :discharge (t28.a0))
% 1.23/1.41  (step t29 (cl (=> (forall ((X $$unsorted) (Z $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear X) (tptp.do (tptp.pickup Z) State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X Z)))) (or (tptp.holds (tptp.clear tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds (tptp.clear tptp.b) tptp.s0)) (not (tptp.differ tptp.b tptp.c)))) (or (tptp.holds (tptp.clear tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds (tptp.clear tptp.b) tptp.s0)) (not (tptp.differ tptp.b tptp.c)))) :rule resolution :premises (t27 t28))
% 1.23/1.41  (step t30 (cl (=> (forall ((X $$unsorted) (Z $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear X) (tptp.do (tptp.pickup Z) State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X Z)))) (or (tptp.holds (tptp.clear tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds (tptp.clear tptp.b) tptp.s0)) (not (tptp.differ tptp.b tptp.c)))) (not (or (tptp.holds (tptp.clear tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds (tptp.clear tptp.b) tptp.s0)) (not (tptp.differ tptp.b tptp.c))))) :rule implies_neg2)
% 1.23/1.41  (step t31 (cl (=> (forall ((X $$unsorted) (Z $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear X) (tptp.do (tptp.pickup Z) State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X Z)))) (or (tptp.holds (tptp.clear tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds (tptp.clear tptp.b) tptp.s0)) (not (tptp.differ tptp.b tptp.c)))) (=> (forall ((X $$unsorted) (Z $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear X) (tptp.do (tptp.pickup Z) State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X Z)))) (or (tptp.holds (tptp.clear tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds (tptp.clear tptp.b) tptp.s0)) (not (tptp.differ tptp.b tptp.c))))) :rule resolution :premises (t29 t30))
% 1.23/1.41  (step t32 (cl (=> (forall ((X $$unsorted) (Z $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear X) (tptp.do (tptp.pickup Z) State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X Z)))) (or (tptp.holds (tptp.clear tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds (tptp.clear tptp.b) tptp.s0)) (not (tptp.differ tptp.b tptp.c))))) :rule contraction :premises (t31))
% 1.23/1.41  (step t33 (cl (not (forall ((X $$unsorted) (Z $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear X) (tptp.do (tptp.pickup Z) State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X Z))))) (or (tptp.holds (tptp.clear tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds (tptp.clear tptp.b) tptp.s0)) (not (tptp.differ tptp.b tptp.c)))) :rule implies :premises (t32))
% 1.23/1.41  (step t34 (cl (or (tptp.holds (tptp.clear tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds (tptp.clear tptp.b) tptp.s0)) (not (tptp.differ tptp.b tptp.c)))) :rule resolution :premises (t33 a4))
% 1.23/1.41  (step t35 (cl (tptp.holds (tptp.clear tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))) :rule resolution :premises (t26 a15 a26 t34))
% 1.23/1.41  (step t36 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (State $$unsorted)) (or (tptp.holds tptp.empty (tptp.do (tptp.putdown X Y) State)) (not (tptp.holds (tptp.holding X) State)) (not (tptp.holds (tptp.clear Y) State)))) (or (tptp.holds tptp.empty (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.holding tptp.c) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.clear tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) (forall ((X $$unsorted) (Y $$unsorted) (State $$unsorted)) (or (tptp.holds tptp.empty (tptp.do (tptp.putdown X Y) State)) (not (tptp.holds (tptp.holding X) State)) (not (tptp.holds (tptp.clear Y) State))))) :rule implies_neg1)
% 1.23/1.41  (anchor :step t37)
% 1.23/1.41  (assume t37.a0 (forall ((X $$unsorted) (Y $$unsorted) (State $$unsorted)) (or (tptp.holds tptp.empty (tptp.do (tptp.putdown X Y) State)) (not (tptp.holds (tptp.holding X) State)) (not (tptp.holds (tptp.clear Y) State)))))
% 1.23/1.41  (step t37.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (State $$unsorted)) (or (tptp.holds tptp.empty (tptp.do (tptp.putdown X Y) State)) (not (tptp.holds (tptp.holding X) State)) (not (tptp.holds (tptp.clear Y) State))))) (or (tptp.holds tptp.empty (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.holding tptp.c) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.clear tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))))) :rule forall_inst :args ((:= X tptp.c) (:= Y tptp.b) (:= State (tptp.do (tptp.pickup tptp.c) tptp.s0))))
% 1.23/1.41  (step t37.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (State $$unsorted)) (or (tptp.holds tptp.empty (tptp.do (tptp.putdown X Y) State)) (not (tptp.holds (tptp.holding X) State)) (not (tptp.holds (tptp.clear Y) State))))) (or (tptp.holds tptp.empty (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.holding tptp.c) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.clear tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) :rule or :premises (t37.t1))
% 1.23/1.41  (step t37.t3 (cl (or (tptp.holds tptp.empty (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.holding tptp.c) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.clear tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) :rule resolution :premises (t37.t2 t37.a0))
% 1.23/1.41  (step t37 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (State $$unsorted)) (or (tptp.holds tptp.empty (tptp.do (tptp.putdown X Y) State)) (not (tptp.holds (tptp.holding X) State)) (not (tptp.holds (tptp.clear Y) State))))) (or (tptp.holds tptp.empty (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.holding tptp.c) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.clear tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) :rule subproof :discharge (t37.a0))
% 1.23/1.41  (step t38 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (State $$unsorted)) (or (tptp.holds tptp.empty (tptp.do (tptp.putdown X Y) State)) (not (tptp.holds (tptp.holding X) State)) (not (tptp.holds (tptp.clear Y) State)))) (or (tptp.holds tptp.empty (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.holding tptp.c) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.clear tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) (or (tptp.holds tptp.empty (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.holding tptp.c) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.clear tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) :rule resolution :premises (t36 t37))
% 1.23/1.41  (step t39 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (State $$unsorted)) (or (tptp.holds tptp.empty (tptp.do (tptp.putdown X Y) State)) (not (tptp.holds (tptp.holding X) State)) (not (tptp.holds (tptp.clear Y) State)))) (or (tptp.holds tptp.empty (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.holding tptp.c) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.clear tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) (not (or (tptp.holds tptp.empty (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.holding tptp.c) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.clear tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))))) :rule implies_neg2)
% 1.23/1.41  (step t40 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (State $$unsorted)) (or (tptp.holds tptp.empty (tptp.do (tptp.putdown X Y) State)) (not (tptp.holds (tptp.holding X) State)) (not (tptp.holds (tptp.clear Y) State)))) (or (tptp.holds tptp.empty (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.holding tptp.c) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.clear tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) (=> (forall ((X $$unsorted) (Y $$unsorted) (State $$unsorted)) (or (tptp.holds tptp.empty (tptp.do (tptp.putdown X Y) State)) (not (tptp.holds (tptp.holding X) State)) (not (tptp.holds (tptp.clear Y) State)))) (or (tptp.holds tptp.empty (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.holding tptp.c) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.clear tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))))) :rule resolution :premises (t38 t39))
% 1.23/1.41  (step t41 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (State $$unsorted)) (or (tptp.holds tptp.empty (tptp.do (tptp.putdown X Y) State)) (not (tptp.holds (tptp.holding X) State)) (not (tptp.holds (tptp.clear Y) State)))) (or (tptp.holds tptp.empty (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.holding tptp.c) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.clear tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))))) :rule contraction :premises (t40))
% 1.23/1.41  (step t42 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (State $$unsorted)) (or (tptp.holds tptp.empty (tptp.do (tptp.putdown X Y) State)) (not (tptp.holds (tptp.holding X) State)) (not (tptp.holds (tptp.clear Y) State))))) (or (tptp.holds tptp.empty (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.holding tptp.c) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.clear tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) :rule implies :premises (t41))
% 1.23/1.41  (step t43 (cl (or (tptp.holds tptp.empty (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.holding tptp.c) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.clear tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) :rule resolution :premises (t42 a5))
% 1.23/1.41  (step t44 (cl (tptp.holds tptp.empty (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) :rule resolution :premises (t13 t24 t35 t43))
% 1.23/1.41  (step t45 (cl (not (or (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.differ tptp.a tptp.b)))) (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.differ tptp.a tptp.b))) :rule or_pos)
% 1.23/1.41  (step t46 (cl (not (tptp.differ tptp.a tptp.b)) (not (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (or (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.differ tptp.a tptp.b))))) :rule reordering :premises (t45))
% 1.23/1.41  (step t47 (cl (not (or (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds (tptp.clear tptp.a) tptp.s0)) (not (tptp.differ tptp.a tptp.c)))) (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds (tptp.clear tptp.a) tptp.s0)) (not (tptp.differ tptp.a tptp.c))) :rule or_pos)
% 1.23/1.41  (step t48 (cl (not (tptp.differ tptp.a tptp.c)) (not (tptp.holds (tptp.clear tptp.a) tptp.s0)) (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (or (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds (tptp.clear tptp.a) tptp.s0)) (not (tptp.differ tptp.a tptp.c))))) :rule reordering :premises (t47))
% 1.23/1.41  (step t49 (cl (=> (forall ((X $$unsorted) (Z $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear X) (tptp.do (tptp.pickup Z) State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X Z)))) (or (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds (tptp.clear tptp.a) tptp.s0)) (not (tptp.differ tptp.a tptp.c)))) (forall ((X $$unsorted) (Z $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear X) (tptp.do (tptp.pickup Z) State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X Z))))) :rule implies_neg1)
% 1.23/1.41  (anchor :step t50)
% 1.23/1.41  (assume t50.a0 (forall ((X $$unsorted) (Z $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear X) (tptp.do (tptp.pickup Z) State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X Z)))))
% 1.23/1.41  (step t50.t1 (cl (or (not (forall ((X $$unsorted) (Z $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear X) (tptp.do (tptp.pickup Z) State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X Z))))) (or (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds (tptp.clear tptp.a) tptp.s0)) (not (tptp.differ tptp.a tptp.c))))) :rule forall_inst :args ((:= X tptp.a) (:= Z tptp.c) (:= State tptp.s0)))
% 1.23/1.41  (step t50.t2 (cl (not (forall ((X $$unsorted) (Z $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear X) (tptp.do (tptp.pickup Z) State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X Z))))) (or (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds (tptp.clear tptp.a) tptp.s0)) (not (tptp.differ tptp.a tptp.c)))) :rule or :premises (t50.t1))
% 1.23/1.41  (step t50.t3 (cl (or (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds (tptp.clear tptp.a) tptp.s0)) (not (tptp.differ tptp.a tptp.c)))) :rule resolution :premises (t50.t2 t50.a0))
% 1.23/1.41  (step t50 (cl (not (forall ((X $$unsorted) (Z $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear X) (tptp.do (tptp.pickup Z) State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X Z))))) (or (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds (tptp.clear tptp.a) tptp.s0)) (not (tptp.differ tptp.a tptp.c)))) :rule subproof :discharge (t50.a0))
% 1.23/1.41  (step t51 (cl (=> (forall ((X $$unsorted) (Z $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear X) (tptp.do (tptp.pickup Z) State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X Z)))) (or (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds (tptp.clear tptp.a) tptp.s0)) (not (tptp.differ tptp.a tptp.c)))) (or (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds (tptp.clear tptp.a) tptp.s0)) (not (tptp.differ tptp.a tptp.c)))) :rule resolution :premises (t49 t50))
% 1.23/1.41  (step t52 (cl (=> (forall ((X $$unsorted) (Z $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear X) (tptp.do (tptp.pickup Z) State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X Z)))) (or (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds (tptp.clear tptp.a) tptp.s0)) (not (tptp.differ tptp.a tptp.c)))) (not (or (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds (tptp.clear tptp.a) tptp.s0)) (not (tptp.differ tptp.a tptp.c))))) :rule implies_neg2)
% 1.23/1.41  (step t53 (cl (=> (forall ((X $$unsorted) (Z $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear X) (tptp.do (tptp.pickup Z) State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X Z)))) (or (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds (tptp.clear tptp.a) tptp.s0)) (not (tptp.differ tptp.a tptp.c)))) (=> (forall ((X $$unsorted) (Z $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear X) (tptp.do (tptp.pickup Z) State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X Z)))) (or (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds (tptp.clear tptp.a) tptp.s0)) (not (tptp.differ tptp.a tptp.c))))) :rule resolution :premises (t51 t52))
% 1.23/1.41  (step t54 (cl (=> (forall ((X $$unsorted) (Z $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear X) (tptp.do (tptp.pickup Z) State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X Z)))) (or (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds (tptp.clear tptp.a) tptp.s0)) (not (tptp.differ tptp.a tptp.c))))) :rule contraction :premises (t53))
% 1.23/1.41  (step t55 (cl (not (forall ((X $$unsorted) (Z $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear X) (tptp.do (tptp.pickup Z) State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X Z))))) (or (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds (tptp.clear tptp.a) tptp.s0)) (not (tptp.differ tptp.a tptp.c)))) :rule implies :premises (t54))
% 1.23/1.41  (step t56 (cl (or (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds (tptp.clear tptp.a) tptp.s0)) (not (tptp.differ tptp.a tptp.c)))) :rule resolution :premises (t55 a4))
% 1.23/1.41  (step t57 (cl (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.pickup tptp.c) tptp.s0))) :rule resolution :premises (t48 a12 a25 t56))
% 1.23/1.41  (step t58 (cl (=> (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear Z) (tptp.do (tptp.putdown X Y) State)) (not (tptp.holds (tptp.clear Z) State)) (not (tptp.differ Z Y)))) (or (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.differ tptp.a tptp.b)))) (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear Z) (tptp.do (tptp.putdown X Y) State)) (not (tptp.holds (tptp.clear Z) State)) (not (tptp.differ Z Y))))) :rule implies_neg1)
% 1.23/1.41  (anchor :step t59)
% 1.23/1.41  (assume t59.a0 (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear Z) (tptp.do (tptp.putdown X Y) State)) (not (tptp.holds (tptp.clear Z) State)) (not (tptp.differ Z Y)))))
% 1.23/1.41  (step t59.t1 (cl (or (not (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear Z) (tptp.do (tptp.putdown X Y) State)) (not (tptp.holds (tptp.clear Z) State)) (not (tptp.differ Z Y))))) (or (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.differ tptp.a tptp.b))))) :rule forall_inst :args ((:= Z tptp.a) (:= X tptp.c) (:= Y tptp.b) (:= State (tptp.do (tptp.pickup tptp.c) tptp.s0))))
% 1.23/1.41  (step t59.t2 (cl (not (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear Z) (tptp.do (tptp.putdown X Y) State)) (not (tptp.holds (tptp.clear Z) State)) (not (tptp.differ Z Y))))) (or (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.differ tptp.a tptp.b)))) :rule or :premises (t59.t1))
% 1.23/1.41  (step t59.t3 (cl (or (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.differ tptp.a tptp.b)))) :rule resolution :premises (t59.t2 t59.a0))
% 1.23/1.41  (step t59 (cl (not (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear Z) (tptp.do (tptp.putdown X Y) State)) (not (tptp.holds (tptp.clear Z) State)) (not (tptp.differ Z Y))))) (or (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.differ tptp.a tptp.b)))) :rule subproof :discharge (t59.a0))
% 1.23/1.41  (step t60 (cl (=> (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear Z) (tptp.do (tptp.putdown X Y) State)) (not (tptp.holds (tptp.clear Z) State)) (not (tptp.differ Z Y)))) (or (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.differ tptp.a tptp.b)))) (or (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.differ tptp.a tptp.b)))) :rule resolution :premises (t58 t59))
% 1.23/1.41  (step t61 (cl (=> (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear Z) (tptp.do (tptp.putdown X Y) State)) (not (tptp.holds (tptp.clear Z) State)) (not (tptp.differ Z Y)))) (or (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.differ tptp.a tptp.b)))) (not (or (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.differ tptp.a tptp.b))))) :rule implies_neg2)
% 1.23/1.41  (step t62 (cl (=> (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear Z) (tptp.do (tptp.putdown X Y) State)) (not (tptp.holds (tptp.clear Z) State)) (not (tptp.differ Z Y)))) (or (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.differ tptp.a tptp.b)))) (=> (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear Z) (tptp.do (tptp.putdown X Y) State)) (not (tptp.holds (tptp.clear Z) State)) (not (tptp.differ Z Y)))) (or (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.differ tptp.a tptp.b))))) :rule resolution :premises (t60 t61))
% 1.23/1.41  (step t63 (cl (=> (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear Z) (tptp.do (tptp.putdown X Y) State)) (not (tptp.holds (tptp.clear Z) State)) (not (tptp.differ Z Y)))) (or (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.differ tptp.a tptp.b))))) :rule contraction :premises (t62))
% 1.23/1.41  (step t64 (cl (not (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear Z) (tptp.do (tptp.putdown X Y) State)) (not (tptp.holds (tptp.clear Z) State)) (not (tptp.differ Z Y))))) (or (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.differ tptp.a tptp.b)))) :rule implies :premises (t63))
% 1.23/1.41  (step t65 (cl (or (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.differ tptp.a tptp.b)))) :rule resolution :premises (t64 a9))
% 1.23/1.41  (step t66 (cl (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) :rule resolution :premises (t46 a11 t57 t65))
% 1.23/1.41  (step t67 (cl (=> (forall ((X $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.holding X) (tptp.do (tptp.pickup X) State)) (not (tptp.holds tptp.empty State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X tptp.table)))) (or (tptp.holds (tptp.holding tptp.a) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.holds tptp.empty (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.differ tptp.a tptp.table)))) (forall ((X $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.holding X) (tptp.do (tptp.pickup X) State)) (not (tptp.holds tptp.empty State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X tptp.table))))) :rule implies_neg1)
% 1.23/1.41  (anchor :step t68)
% 1.23/1.41  (assume t68.a0 (forall ((X $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.holding X) (tptp.do (tptp.pickup X) State)) (not (tptp.holds tptp.empty State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X tptp.table)))))
% 1.23/1.41  (step t68.t1 (cl (or (not (forall ((X $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.holding X) (tptp.do (tptp.pickup X) State)) (not (tptp.holds tptp.empty State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X tptp.table))))) (or (tptp.holds (tptp.holding tptp.a) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.holds tptp.empty (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.differ tptp.a tptp.table))))) :rule forall_inst :args ((:= X tptp.a) (:= State (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))))
% 1.23/1.41  (step t68.t2 (cl (not (forall ((X $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.holding X) (tptp.do (tptp.pickup X) State)) (not (tptp.holds tptp.empty State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X tptp.table))))) (or (tptp.holds (tptp.holding tptp.a) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.holds tptp.empty (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.differ tptp.a tptp.table)))) :rule or :premises (t68.t1))
% 1.23/1.41  (step t68.t3 (cl (or (tptp.holds (tptp.holding tptp.a) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.holds tptp.empty (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.differ tptp.a tptp.table)))) :rule resolution :premises (t68.t2 t68.a0))
% 1.23/1.41  (step t68 (cl (not (forall ((X $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.holding X) (tptp.do (tptp.pickup X) State)) (not (tptp.holds tptp.empty State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X tptp.table))))) (or (tptp.holds (tptp.holding tptp.a) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.holds tptp.empty (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.differ tptp.a tptp.table)))) :rule subproof :discharge (t68.a0))
% 1.23/1.41  (step t69 (cl (=> (forall ((X $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.holding X) (tptp.do (tptp.pickup X) State)) (not (tptp.holds tptp.empty State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X tptp.table)))) (or (tptp.holds (tptp.holding tptp.a) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.holds tptp.empty (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.differ tptp.a tptp.table)))) (or (tptp.holds (tptp.holding tptp.a) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.holds tptp.empty (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.differ tptp.a tptp.table)))) :rule resolution :premises (t67 t68))
% 1.23/1.41  (step t70 (cl (=> (forall ((X $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.holding X) (tptp.do (tptp.pickup X) State)) (not (tptp.holds tptp.empty State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X tptp.table)))) (or (tptp.holds (tptp.holding tptp.a) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.holds tptp.empty (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.differ tptp.a tptp.table)))) (not (or (tptp.holds (tptp.holding tptp.a) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.holds tptp.empty (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.differ tptp.a tptp.table))))) :rule implies_neg2)
% 1.23/1.41  (step t71 (cl (=> (forall ((X $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.holding X) (tptp.do (tptp.pickup X) State)) (not (tptp.holds tptp.empty State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X tptp.table)))) (or (tptp.holds (tptp.holding tptp.a) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.holds tptp.empty (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.differ tptp.a tptp.table)))) (=> (forall ((X $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.holding X) (tptp.do (tptp.pickup X) State)) (not (tptp.holds tptp.empty State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X tptp.table)))) (or (tptp.holds (tptp.holding tptp.a) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.holds tptp.empty (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.differ tptp.a tptp.table))))) :rule resolution :premises (t69 t70))
% 1.23/1.41  (step t72 (cl (=> (forall ((X $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.holding X) (tptp.do (tptp.pickup X) State)) (not (tptp.holds tptp.empty State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X tptp.table)))) (or (tptp.holds (tptp.holding tptp.a) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.holds tptp.empty (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.differ tptp.a tptp.table))))) :rule contraction :premises (t71))
% 1.23/1.41  (step t73 (cl (not (forall ((X $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.holding X) (tptp.do (tptp.pickup X) State)) (not (tptp.holds tptp.empty State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X tptp.table))))) (or (tptp.holds (tptp.holding tptp.a) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.holds tptp.empty (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.differ tptp.a tptp.table)))) :rule implies :premises (t72))
% 1.23/1.41  (step t74 (cl (or (tptp.holds (tptp.holding tptp.a) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.holds tptp.empty (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.holds (tptp.clear tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.differ tptp.a tptp.table)))) :rule resolution :premises (t73 a1))
% 1.23/1.41  (step t75 (cl (tptp.holds (tptp.holding tptp.a) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) :rule resolution :premises (t11 a14 t44 t66 t74))
% 1.23/1.41  (step t76 (cl (not (or (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.differ tptp.d tptp.a)))) (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.differ tptp.d tptp.a))) :rule or_pos)
% 1.23/1.41  (step t77 (cl (not (tptp.differ tptp.d tptp.a)) (not (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (or (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.differ tptp.d tptp.a))))) :rule reordering :premises (t76))
% 1.23/1.41  (step t78 (cl (not (or (tptp.differ tptp.d tptp.a) (not (tptp.differ tptp.a tptp.d)))) (tptp.differ tptp.d tptp.a) (not (tptp.differ tptp.a tptp.d))) :rule or_pos)
% 1.23/1.41  (step t79 (cl (not (tptp.differ tptp.a tptp.d)) (tptp.differ tptp.d tptp.a) (not (or (tptp.differ tptp.d tptp.a) (not (tptp.differ tptp.a tptp.d))))) :rule reordering :premises (t78))
% 1.23/1.41  (step t80 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.differ X Y) (not (tptp.differ Y X)))) (or (tptp.differ tptp.d tptp.a) (not (tptp.differ tptp.a tptp.d)))) (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.differ X Y) (not (tptp.differ Y X))))) :rule implies_neg1)
% 1.23/1.41  (anchor :step t81)
% 1.23/1.41  (assume t81.a0 (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.differ X Y) (not (tptp.differ Y X)))))
% 1.23/1.41  (step t81.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.differ X Y) (not (tptp.differ Y X))))) (or (tptp.differ tptp.d tptp.a) (not (tptp.differ tptp.a tptp.d))))) :rule forall_inst :args ((:= X tptp.d) (:= Y tptp.a)))
% 1.23/1.41  (step t81.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.differ X Y) (not (tptp.differ Y X))))) (or (tptp.differ tptp.d tptp.a) (not (tptp.differ tptp.a tptp.d)))) :rule or :premises (t81.t1))
% 1.23/1.41  (step t81.t3 (cl (or (tptp.differ tptp.d tptp.a) (not (tptp.differ tptp.a tptp.d)))) :rule resolution :premises (t81.t2 t81.a0))
% 1.23/1.41  (step t81 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.differ X Y) (not (tptp.differ Y X))))) (or (tptp.differ tptp.d tptp.a) (not (tptp.differ tptp.a tptp.d)))) :rule subproof :discharge (t81.a0))
% 1.23/1.41  (step t82 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.differ X Y) (not (tptp.differ Y X)))) (or (tptp.differ tptp.d tptp.a) (not (tptp.differ tptp.a tptp.d)))) (or (tptp.differ tptp.d tptp.a) (not (tptp.differ tptp.a tptp.d)))) :rule resolution :premises (t80 t81))
% 1.23/1.41  (step t83 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.differ X Y) (not (tptp.differ Y X)))) (or (tptp.differ tptp.d tptp.a) (not (tptp.differ tptp.a tptp.d)))) (not (or (tptp.differ tptp.d tptp.a) (not (tptp.differ tptp.a tptp.d))))) :rule implies_neg2)
% 1.23/1.41  (step t84 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.differ X Y) (not (tptp.differ Y X)))) (or (tptp.differ tptp.d tptp.a) (not (tptp.differ tptp.a tptp.d)))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.differ X Y) (not (tptp.differ Y X)))) (or (tptp.differ tptp.d tptp.a) (not (tptp.differ tptp.a tptp.d))))) :rule resolution :premises (t82 t83))
% 1.23/1.41  (step t85 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.differ X Y) (not (tptp.differ Y X)))) (or (tptp.differ tptp.d tptp.a) (not (tptp.differ tptp.a tptp.d))))) :rule contraction :premises (t84))
% 1.23/1.41  (step t86 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.differ X Y) (not (tptp.differ Y X))))) (or (tptp.differ tptp.d tptp.a) (not (tptp.differ tptp.a tptp.d)))) :rule implies :premises (t85))
% 1.23/1.41  (step t87 (cl (or (tptp.differ tptp.d tptp.a) (not (tptp.differ tptp.a tptp.d)))) :rule resolution :premises (t86 a10))
% 1.23/1.41  (step t88 (cl (tptp.differ tptp.d tptp.a)) :rule resolution :premises (t79 a13 t87))
% 1.23/1.41  (step t89 (cl (not (or (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.differ tptp.d tptp.b)))) (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.differ tptp.d tptp.b))) :rule or_pos)
% 1.23/1.41  (step t90 (cl (not (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.differ tptp.d tptp.b)) (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (or (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.differ tptp.d tptp.b))))) :rule reordering :premises (t89))
% 1.23/1.41  (step t91 (cl (not (or (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds (tptp.on tptp.c tptp.d) tptp.s0)) (not (tptp.holds (tptp.clear tptp.c) tptp.s0)) (not (tptp.holds tptp.empty tptp.s0)))) (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds (tptp.on tptp.c tptp.d) tptp.s0)) (not (tptp.holds (tptp.clear tptp.c) tptp.s0)) (not (tptp.holds tptp.empty tptp.s0))) :rule or_pos)
% 1.23/1.41  (step t92 (cl (not (tptp.holds (tptp.on tptp.c tptp.d) tptp.s0)) (not (tptp.holds (tptp.clear tptp.c) tptp.s0)) (not (tptp.holds tptp.empty tptp.s0)) (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (or (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds (tptp.on tptp.c tptp.d) tptp.s0)) (not (tptp.holds (tptp.clear tptp.c) tptp.s0)) (not (tptp.holds tptp.empty tptp.s0))))) :rule reordering :premises (t91))
% 1.23/1.41  (step t93 (cl (=> (forall ((Y $$unsorted) (X $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear Y) (tptp.do (tptp.pickup X) State)) (not (tptp.holds (tptp.on X Y) State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.holds tptp.empty State)))) (or (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds (tptp.on tptp.c tptp.d) tptp.s0)) (not (tptp.holds (tptp.clear tptp.c) tptp.s0)) (not (tptp.holds tptp.empty tptp.s0)))) (forall ((Y $$unsorted) (X $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear Y) (tptp.do (tptp.pickup X) State)) (not (tptp.holds (tptp.on X Y) State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.holds tptp.empty State))))) :rule implies_neg1)
% 1.23/1.41  (anchor :step t94)
% 1.23/1.41  (assume t94.a0 (forall ((Y $$unsorted) (X $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear Y) (tptp.do (tptp.pickup X) State)) (not (tptp.holds (tptp.on X Y) State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.holds tptp.empty State)))))
% 1.23/1.41  (step t94.t1 (cl (or (not (forall ((Y $$unsorted) (X $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear Y) (tptp.do (tptp.pickup X) State)) (not (tptp.holds (tptp.on X Y) State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.holds tptp.empty State))))) (or (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds (tptp.on tptp.c tptp.d) tptp.s0)) (not (tptp.holds (tptp.clear tptp.c) tptp.s0)) (not (tptp.holds tptp.empty tptp.s0))))) :rule forall_inst :args ((:= Y tptp.d) (:= X tptp.c) (:= State tptp.s0)))
% 1.23/1.41  (step t94.t2 (cl (not (forall ((Y $$unsorted) (X $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear Y) (tptp.do (tptp.pickup X) State)) (not (tptp.holds (tptp.on X Y) State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.holds tptp.empty State))))) (or (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds (tptp.on tptp.c tptp.d) tptp.s0)) (not (tptp.holds (tptp.clear tptp.c) tptp.s0)) (not (tptp.holds tptp.empty tptp.s0)))) :rule or :premises (t94.t1))
% 1.23/1.41  (step t94.t3 (cl (or (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds (tptp.on tptp.c tptp.d) tptp.s0)) (not (tptp.holds (tptp.clear tptp.c) tptp.s0)) (not (tptp.holds tptp.empty tptp.s0)))) :rule resolution :premises (t94.t2 t94.a0))
% 1.23/1.41  (step t94 (cl (not (forall ((Y $$unsorted) (X $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear Y) (tptp.do (tptp.pickup X) State)) (not (tptp.holds (tptp.on X Y) State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.holds tptp.empty State))))) (or (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds (tptp.on tptp.c tptp.d) tptp.s0)) (not (tptp.holds (tptp.clear tptp.c) tptp.s0)) (not (tptp.holds tptp.empty tptp.s0)))) :rule subproof :discharge (t94.a0))
% 1.23/1.41  (step t95 (cl (=> (forall ((Y $$unsorted) (X $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear Y) (tptp.do (tptp.pickup X) State)) (not (tptp.holds (tptp.on X Y) State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.holds tptp.empty State)))) (or (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds (tptp.on tptp.c tptp.d) tptp.s0)) (not (tptp.holds (tptp.clear tptp.c) tptp.s0)) (not (tptp.holds tptp.empty tptp.s0)))) (or (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds (tptp.on tptp.c tptp.d) tptp.s0)) (not (tptp.holds (tptp.clear tptp.c) tptp.s0)) (not (tptp.holds tptp.empty tptp.s0)))) :rule resolution :premises (t93 t94))
% 1.23/1.41  (step t96 (cl (=> (forall ((Y $$unsorted) (X $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear Y) (tptp.do (tptp.pickup X) State)) (not (tptp.holds (tptp.on X Y) State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.holds tptp.empty State)))) (or (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds (tptp.on tptp.c tptp.d) tptp.s0)) (not (tptp.holds (tptp.clear tptp.c) tptp.s0)) (not (tptp.holds tptp.empty tptp.s0)))) (not (or (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds (tptp.on tptp.c tptp.d) tptp.s0)) (not (tptp.holds (tptp.clear tptp.c) tptp.s0)) (not (tptp.holds tptp.empty tptp.s0))))) :rule implies_neg2)
% 1.23/1.41  (step t97 (cl (=> (forall ((Y $$unsorted) (X $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear Y) (tptp.do (tptp.pickup X) State)) (not (tptp.holds (tptp.on X Y) State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.holds tptp.empty State)))) (or (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds (tptp.on tptp.c tptp.d) tptp.s0)) (not (tptp.holds (tptp.clear tptp.c) tptp.s0)) (not (tptp.holds tptp.empty tptp.s0)))) (=> (forall ((Y $$unsorted) (X $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear Y) (tptp.do (tptp.pickup X) State)) (not (tptp.holds (tptp.on X Y) State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.holds tptp.empty State)))) (or (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds (tptp.on tptp.c tptp.d) tptp.s0)) (not (tptp.holds (tptp.clear tptp.c) tptp.s0)) (not (tptp.holds tptp.empty tptp.s0))))) :rule resolution :premises (t95 t96))
% 1.23/1.41  (step t98 (cl (=> (forall ((Y $$unsorted) (X $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear Y) (tptp.do (tptp.pickup X) State)) (not (tptp.holds (tptp.on X Y) State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.holds tptp.empty State)))) (or (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds (tptp.on tptp.c tptp.d) tptp.s0)) (not (tptp.holds (tptp.clear tptp.c) tptp.s0)) (not (tptp.holds tptp.empty tptp.s0))))) :rule contraction :premises (t97))
% 1.23/1.41  (step t99 (cl (not (forall ((Y $$unsorted) (X $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear Y) (tptp.do (tptp.pickup X) State)) (not (tptp.holds (tptp.on X Y) State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.holds tptp.empty State))))) (or (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds (tptp.on tptp.c tptp.d) tptp.s0)) (not (tptp.holds (tptp.clear tptp.c) tptp.s0)) (not (tptp.holds tptp.empty tptp.s0)))) :rule implies :premises (t98))
% 1.23/1.41  (step t100 (cl (or (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.c) tptp.s0)) (not (tptp.holds (tptp.on tptp.c tptp.d) tptp.s0)) (not (tptp.holds (tptp.clear tptp.c) tptp.s0)) (not (tptp.holds tptp.empty tptp.s0)))) :rule resolution :premises (t99 a2))
% 1.23/1.41  (step t101 (cl (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.c) tptp.s0))) :rule resolution :premises (t92 a23 a27 a28 t100))
% 1.23/1.41  (step t102 (cl (not (or (tptp.differ tptp.d tptp.b) (not (tptp.differ tptp.b tptp.d)))) (tptp.differ tptp.d tptp.b) (not (tptp.differ tptp.b tptp.d))) :rule or_pos)
% 1.23/1.41  (step t103 (cl (not (tptp.differ tptp.b tptp.d)) (tptp.differ tptp.d tptp.b) (not (or (tptp.differ tptp.d tptp.b) (not (tptp.differ tptp.b tptp.d))))) :rule reordering :premises (t102))
% 1.23/1.41  (step t104 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.differ X Y) (not (tptp.differ Y X)))) (or (tptp.differ tptp.d tptp.b) (not (tptp.differ tptp.b tptp.d)))) (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.differ X Y) (not (tptp.differ Y X))))) :rule implies_neg1)
% 1.23/1.41  (anchor :step t105)
% 1.23/1.41  (assume t105.a0 (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.differ X Y) (not (tptp.differ Y X)))))
% 1.23/1.41  (step t105.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.differ X Y) (not (tptp.differ Y X))))) (or (tptp.differ tptp.d tptp.b) (not (tptp.differ tptp.b tptp.d))))) :rule forall_inst :args ((:= X tptp.d) (:= Y tptp.b)))
% 1.23/1.41  (step t105.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.differ X Y) (not (tptp.differ Y X))))) (or (tptp.differ tptp.d tptp.b) (not (tptp.differ tptp.b tptp.d)))) :rule or :premises (t105.t1))
% 1.23/1.41  (step t105.t3 (cl (or (tptp.differ tptp.d tptp.b) (not (tptp.differ tptp.b tptp.d)))) :rule resolution :premises (t105.t2 t105.a0))
% 1.23/1.41  (step t105 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.differ X Y) (not (tptp.differ Y X))))) (or (tptp.differ tptp.d tptp.b) (not (tptp.differ tptp.b tptp.d)))) :rule subproof :discharge (t105.a0))
% 1.23/1.41  (step t106 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.differ X Y) (not (tptp.differ Y X)))) (or (tptp.differ tptp.d tptp.b) (not (tptp.differ tptp.b tptp.d)))) (or (tptp.differ tptp.d tptp.b) (not (tptp.differ tptp.b tptp.d)))) :rule resolution :premises (t104 t105))
% 1.23/1.41  (step t107 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.differ X Y) (not (tptp.differ Y X)))) (or (tptp.differ tptp.d tptp.b) (not (tptp.differ tptp.b tptp.d)))) (not (or (tptp.differ tptp.d tptp.b) (not (tptp.differ tptp.b tptp.d))))) :rule implies_neg2)
% 1.23/1.41  (step t108 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.differ X Y) (not (tptp.differ Y X)))) (or (tptp.differ tptp.d tptp.b) (not (tptp.differ tptp.b tptp.d)))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.differ X Y) (not (tptp.differ Y X)))) (or (tptp.differ tptp.d tptp.b) (not (tptp.differ tptp.b tptp.d))))) :rule resolution :premises (t106 t107))
% 1.23/1.41  (step t109 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.differ X Y) (not (tptp.differ Y X)))) (or (tptp.differ tptp.d tptp.b) (not (tptp.differ tptp.b tptp.d))))) :rule contraction :premises (t108))
% 1.23/1.41  (step t110 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.differ X Y) (not (tptp.differ Y X))))) (or (tptp.differ tptp.d tptp.b) (not (tptp.differ tptp.b tptp.d)))) :rule implies :premises (t109))
% 1.23/1.41  (step t111 (cl (or (tptp.differ tptp.d tptp.b) (not (tptp.differ tptp.b tptp.d)))) :rule resolution :premises (t110 a10))
% 1.23/1.41  (step t112 (cl (tptp.differ tptp.d tptp.b)) :rule resolution :premises (t103 a16 t111))
% 1.23/1.41  (step t113 (cl (=> (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear Z) (tptp.do (tptp.putdown X Y) State)) (not (tptp.holds (tptp.clear Z) State)) (not (tptp.differ Z Y)))) (or (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.differ tptp.d tptp.b)))) (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear Z) (tptp.do (tptp.putdown X Y) State)) (not (tptp.holds (tptp.clear Z) State)) (not (tptp.differ Z Y))))) :rule implies_neg1)
% 1.23/1.41  (anchor :step t114)
% 1.23/1.41  (assume t114.a0 (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear Z) (tptp.do (tptp.putdown X Y) State)) (not (tptp.holds (tptp.clear Z) State)) (not (tptp.differ Z Y)))))
% 1.23/1.41  (step t114.t1 (cl (or (not (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear Z) (tptp.do (tptp.putdown X Y) State)) (not (tptp.holds (tptp.clear Z) State)) (not (tptp.differ Z Y))))) (or (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.differ tptp.d tptp.b))))) :rule forall_inst :args ((:= Z tptp.d) (:= X tptp.c) (:= Y tptp.b) (:= State (tptp.do (tptp.pickup tptp.c) tptp.s0))))
% 1.23/1.41  (step t114.t2 (cl (not (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear Z) (tptp.do (tptp.putdown X Y) State)) (not (tptp.holds (tptp.clear Z) State)) (not (tptp.differ Z Y))))) (or (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.differ tptp.d tptp.b)))) :rule or :premises (t114.t1))
% 1.23/1.41  (step t114.t3 (cl (or (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.differ tptp.d tptp.b)))) :rule resolution :premises (t114.t2 t114.a0))
% 1.23/1.41  (step t114 (cl (not (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear Z) (tptp.do (tptp.putdown X Y) State)) (not (tptp.holds (tptp.clear Z) State)) (not (tptp.differ Z Y))))) (or (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.differ tptp.d tptp.b)))) :rule subproof :discharge (t114.a0))
% 1.23/1.41  (step t115 (cl (=> (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear Z) (tptp.do (tptp.putdown X Y) State)) (not (tptp.holds (tptp.clear Z) State)) (not (tptp.differ Z Y)))) (or (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.differ tptp.d tptp.b)))) (or (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.differ tptp.d tptp.b)))) :rule resolution :premises (t113 t114))
% 1.23/1.41  (step t116 (cl (=> (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear Z) (tptp.do (tptp.putdown X Y) State)) (not (tptp.holds (tptp.clear Z) State)) (not (tptp.differ Z Y)))) (or (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.differ tptp.d tptp.b)))) (not (or (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.differ tptp.d tptp.b))))) :rule implies_neg2)
% 1.23/1.41  (step t117 (cl (=> (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear Z) (tptp.do (tptp.putdown X Y) State)) (not (tptp.holds (tptp.clear Z) State)) (not (tptp.differ Z Y)))) (or (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.differ tptp.d tptp.b)))) (=> (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear Z) (tptp.do (tptp.putdown X Y) State)) (not (tptp.holds (tptp.clear Z) State)) (not (tptp.differ Z Y)))) (or (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.differ tptp.d tptp.b))))) :rule resolution :premises (t115 t116))
% 1.23/1.41  (step t118 (cl (=> (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear Z) (tptp.do (tptp.putdown X Y) State)) (not (tptp.holds (tptp.clear Z) State)) (not (tptp.differ Z Y)))) (or (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.differ tptp.d tptp.b))))) :rule contraction :premises (t117))
% 1.23/1.41  (step t119 (cl (not (forall ((Z $$unsorted) (X $$unsorted) (Y $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear Z) (tptp.do (tptp.putdown X Y) State)) (not (tptp.holds (tptp.clear Z) State)) (not (tptp.differ Z Y))))) (or (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.differ tptp.d tptp.b)))) :rule implies :premises (t118))
% 1.23/1.41  (step t120 (cl (or (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.differ tptp.d tptp.b)))) :rule resolution :premises (t119 a9))
% 1.23/1.41  (step t121 (cl (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) :rule resolution :premises (t90 t101 t112 t120))
% 1.23/1.41  (step t122 (cl (=> (forall ((X $$unsorted) (Z $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear X) (tptp.do (tptp.pickup Z) State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X Z)))) (or (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.differ tptp.d tptp.a)))) (forall ((X $$unsorted) (Z $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear X) (tptp.do (tptp.pickup Z) State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X Z))))) :rule implies_neg1)
% 1.23/1.41  (anchor :step t123)
% 1.23/1.41  (assume t123.a0 (forall ((X $$unsorted) (Z $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear X) (tptp.do (tptp.pickup Z) State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X Z)))))
% 1.23/1.41  (step t123.t1 (cl (or (not (forall ((X $$unsorted) (Z $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear X) (tptp.do (tptp.pickup Z) State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X Z))))) (or (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.differ tptp.d tptp.a))))) :rule forall_inst :args ((:= X tptp.d) (:= Z tptp.a) (:= State (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))))
% 1.23/1.41  (step t123.t2 (cl (not (forall ((X $$unsorted) (Z $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear X) (tptp.do (tptp.pickup Z) State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X Z))))) (or (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.differ tptp.d tptp.a)))) :rule or :premises (t123.t1))
% 1.23/1.41  (step t123.t3 (cl (or (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.differ tptp.d tptp.a)))) :rule resolution :premises (t123.t2 t123.a0))
% 1.23/1.41  (step t123 (cl (not (forall ((X $$unsorted) (Z $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear X) (tptp.do (tptp.pickup Z) State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X Z))))) (or (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.differ tptp.d tptp.a)))) :rule subproof :discharge (t123.a0))
% 1.23/1.41  (step t124 (cl (=> (forall ((X $$unsorted) (Z $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear X) (tptp.do (tptp.pickup Z) State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X Z)))) (or (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.differ tptp.d tptp.a)))) (or (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.differ tptp.d tptp.a)))) :rule resolution :premises (t122 t123))
% 1.23/1.41  (step t125 (cl (=> (forall ((X $$unsorted) (Z $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear X) (tptp.do (tptp.pickup Z) State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X Z)))) (or (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.differ tptp.d tptp.a)))) (not (or (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.differ tptp.d tptp.a))))) :rule implies_neg2)
% 1.23/1.41  (step t126 (cl (=> (forall ((X $$unsorted) (Z $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear X) (tptp.do (tptp.pickup Z) State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X Z)))) (or (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.differ tptp.d tptp.a)))) (=> (forall ((X $$unsorted) (Z $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear X) (tptp.do (tptp.pickup Z) State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X Z)))) (or (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.differ tptp.d tptp.a))))) :rule resolution :premises (t124 t125))
% 1.23/1.41  (step t127 (cl (=> (forall ((X $$unsorted) (Z $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear X) (tptp.do (tptp.pickup Z) State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X Z)))) (or (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.differ tptp.d tptp.a))))) :rule contraction :premises (t126))
% 1.23/1.41  (step t128 (cl (not (forall ((X $$unsorted) (Z $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.clear X) (tptp.do (tptp.pickup Z) State)) (not (tptp.holds (tptp.clear X) State)) (not (tptp.differ X Z))))) (or (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.differ tptp.d tptp.a)))) :rule implies :premises (t127))
% 1.23/1.41  (step t129 (cl (or (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) (not (tptp.differ tptp.d tptp.a)))) :rule resolution :premises (t128 a4))
% 1.23/1.41  (step t130 (cl (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) :rule resolution :premises (t77 t88 t121 t129))
% 1.23/1.41  (step t131 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.on X Y) (tptp.do (tptp.putdown X Y) State)) (not (tptp.holds (tptp.holding X) State)) (not (tptp.holds (tptp.clear Y) State)))) (or (tptp.holds (tptp.on tptp.a tptp.d) (tptp.do (tptp.putdown tptp.a tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) (not (tptp.holds (tptp.holding tptp.a) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) (not (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))))) (forall ((X $$unsorted) (Y $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.on X Y) (tptp.do (tptp.putdown X Y) State)) (not (tptp.holds (tptp.holding X) State)) (not (tptp.holds (tptp.clear Y) State))))) :rule implies_neg1)
% 1.23/1.41  (anchor :step t132)
% 1.23/1.41  (assume t132.a0 (forall ((X $$unsorted) (Y $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.on X Y) (tptp.do (tptp.putdown X Y) State)) (not (tptp.holds (tptp.holding X) State)) (not (tptp.holds (tptp.clear Y) State)))))
% 1.23/1.41  (step t132.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.on X Y) (tptp.do (tptp.putdown X Y) State)) (not (tptp.holds (tptp.holding X) State)) (not (tptp.holds (tptp.clear Y) State))))) (or (tptp.holds (tptp.on tptp.a tptp.d) (tptp.do (tptp.putdown tptp.a tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) (not (tptp.holds (tptp.holding tptp.a) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) (not (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))))))) :rule forall_inst :args ((:= X tptp.a) (:= Y tptp.d) (:= State (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))))
% 1.23/1.41  (step t132.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.on X Y) (tptp.do (tptp.putdown X Y) State)) (not (tptp.holds (tptp.holding X) State)) (not (tptp.holds (tptp.clear Y) State))))) (or (tptp.holds (tptp.on tptp.a tptp.d) (tptp.do (tptp.putdown tptp.a tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) (not (tptp.holds (tptp.holding tptp.a) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) (not (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))))) :rule or :premises (t132.t1))
% 1.23/1.41  (step t132.t3 (cl (or (tptp.holds (tptp.on tptp.a tptp.d) (tptp.do (tptp.putdown tptp.a tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) (not (tptp.holds (tptp.holding tptp.a) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) (not (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))))) :rule resolution :premises (t132.t2 t132.a0))
% 1.23/1.41  (step t132 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.on X Y) (tptp.do (tptp.putdown X Y) State)) (not (tptp.holds (tptp.holding X) State)) (not (tptp.holds (tptp.clear Y) State))))) (or (tptp.holds (tptp.on tptp.a tptp.d) (tptp.do (tptp.putdown tptp.a tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) (not (tptp.holds (tptp.holding tptp.a) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) (not (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))))) :rule subproof :discharge (t132.a0))
% 1.23/1.41  (step t133 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.on X Y) (tptp.do (tptp.putdown X Y) State)) (not (tptp.holds (tptp.holding X) State)) (not (tptp.holds (tptp.clear Y) State)))) (or (tptp.holds (tptp.on tptp.a tptp.d) (tptp.do (tptp.putdown tptp.a tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) (not (tptp.holds (tptp.holding tptp.a) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) (not (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))))) (or (tptp.holds (tptp.on tptp.a tptp.d) (tptp.do (tptp.putdown tptp.a tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) (not (tptp.holds (tptp.holding tptp.a) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) (not (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))))) :rule resolution :premises (t131 t132))
% 1.23/1.41  (step t134 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.on X Y) (tptp.do (tptp.putdown X Y) State)) (not (tptp.holds (tptp.holding X) State)) (not (tptp.holds (tptp.clear Y) State)))) (or (tptp.holds (tptp.on tptp.a tptp.d) (tptp.do (tptp.putdown tptp.a tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) (not (tptp.holds (tptp.holding tptp.a) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) (not (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))))) (not (or (tptp.holds (tptp.on tptp.a tptp.d) (tptp.do (tptp.putdown tptp.a tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) (not (tptp.holds (tptp.holding tptp.a) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) (not (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))))))) :rule implies_neg2)
% 1.23/1.41  (step t135 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.on X Y) (tptp.do (tptp.putdown X Y) State)) (not (tptp.holds (tptp.holding X) State)) (not (tptp.holds (tptp.clear Y) State)))) (or (tptp.holds (tptp.on tptp.a tptp.d) (tptp.do (tptp.putdown tptp.a tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) (not (tptp.holds (tptp.holding tptp.a) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) (not (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))))) (=> (forall ((X $$unsorted) (Y $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.on X Y) (tptp.do (tptp.putdown X Y) State)) (not (tptp.holds (tptp.holding X) State)) (not (tptp.holds (tptp.clear Y) State)))) (or (tptp.holds (tptp.on tptp.a tptp.d) (tptp.do (tptp.putdown tptp.a tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) (not (tptp.holds (tptp.holding tptp.a) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) (not (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))))))) :rule resolution :premises (t133 t134))
% 1.23/1.41  (step t136 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.on X Y) (tptp.do (tptp.putdown X Y) State)) (not (tptp.holds (tptp.holding X) State)) (not (tptp.holds (tptp.clear Y) State)))) (or (tptp.holds (tptp.on tptp.a tptp.d) (tptp.do (tptp.putdown tptp.a tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) (not (tptp.holds (tptp.holding tptp.a) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) (not (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))))))) :rule contraction :premises (t135))
% 1.23/1.41  (step t137 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (State $$unsorted)) (or (tptp.holds (tptp.on X Y) (tptp.do (tptp.putdown X Y) State)) (not (tptp.holds (tptp.holding X) State)) (not (tptp.holds (tptp.clear Y) State))))) (or (tptp.holds (tptp.on tptp.a tptp.d) (tptp.do (tptp.putdown tptp.a tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) (not (tptp.holds (tptp.holding tptp.a) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) (not (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))))) :rule implies :premises (t136))
% 1.23/1.41  (step t138 (cl (or (tptp.holds (tptp.on tptp.a tptp.d) (tptp.do (tptp.putdown tptp.a tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) (not (tptp.holds (tptp.holding tptp.a) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) (not (tptp.holds (tptp.clear tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0))))))) :rule resolution :premises (t137 a6))
% 1.23/1.41  (step t139 (cl (tptp.holds (tptp.on tptp.a tptp.d) (tptp.do (tptp.putdown tptp.a tptp.d) (tptp.do (tptp.pickup tptp.a) (tptp.do (tptp.putdown tptp.c tptp.b) (tptp.do (tptp.pickup tptp.c) tptp.s0)))))) :rule resolution :premises (t9 t75 t130 t138))
% 1.23/1.41  (step t140 (cl) :rule resolution :premises (t7 t139 a30))
% 1.23/1.41  
% 1.23/1.41  % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.Gyt24oXQHI/cvc5---1.0.5_27768.smt2
% 1.23/1.41  % cvc5---1.0.5 exiting
% 1.23/1.42  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------