TSTP Solution File: PLA006-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : PLA006-1 : TPTP v8.2.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n032.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 0.45s 0.69s
% Output : Proof 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : PLA006-1 : TPTP v8.2.0. Released v1.1.0.
% 0.09/0.11 % Command : do_cvc5 %s %d
% 0.10/0.31 % Computer : n032.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Sat May 25 23:31:53 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.15/0.41 %----Proving TF0_NAR, FOF, or CNF
% 0.15/0.41 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.45/0.69 % SZS status Unsatisfiable for /export/starexec/sandbox/tmp/tmp.iGvaitC9Kg/cvc5---1.0.5_21955.smt2
% 0.45/0.69 % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.iGvaitC9Kg/cvc5---1.0.5_21955.smt2
% 0.45/0.69 (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)))))
% 0.45/0.69 (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)))))
% 0.45/0.69 (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)))))
% 0.45/0.69 (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)))))
% 0.45/0.69 (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)))))
% 0.45/0.69 (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)))))
% 0.45/0.69 (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)))))
% 0.45/0.69 (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)))))
% 0.45/0.69 (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)))))
% 0.45/0.69 (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)))))
% 0.45/0.69 (assume a10 (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.differ X Y) (not (tptp.differ Y X)))))
% 0.45/0.69 (assume a11 (tptp.differ tptp.a tptp.b))
% 0.45/0.69 (assume a12 (tptp.differ tptp.a tptp.c))
% 0.45/0.69 (assume a13 (tptp.differ tptp.a tptp.d))
% 0.45/0.69 (assume a14 (tptp.differ tptp.a tptp.table))
% 0.45/0.69 (assume a15 (tptp.differ tptp.b tptp.c))
% 0.45/0.69 (assume a16 (tptp.differ tptp.b tptp.d))
% 0.45/0.69 (assume a17 (tptp.differ tptp.b tptp.table))
% 0.45/0.69 (assume a18 (tptp.differ tptp.c tptp.d))
% 0.45/0.69 (assume a19 (tptp.differ tptp.c tptp.table))
% 0.45/0.69 (assume a20 (tptp.differ tptp.d tptp.table))
% 0.45/0.69 (assume a21 (tptp.holds (tptp.on tptp.a tptp.table) tptp.s0))
% 0.45/0.69 (assume a22 (tptp.holds (tptp.on tptp.b tptp.table) tptp.s0))
% 0.45/0.69 (assume a23 (tptp.holds (tptp.on tptp.c tptp.d) tptp.s0))
% 0.45/0.69 (assume a24 (tptp.holds (tptp.on tptp.d tptp.table) tptp.s0))
% 0.45/0.69 (assume a25 (tptp.holds (tptp.clear tptp.a) tptp.s0))
% 0.45/0.69 (assume a26 (tptp.holds (tptp.clear tptp.b) tptp.s0))
% 0.45/0.69 (assume a27 (tptp.holds (tptp.clear tptp.c) tptp.s0))
% 0.45/0.69 (assume a28 (tptp.holds tptp.empty tptp.s0))
% 0.45/0.69 (assume a29 (forall ((State $$unsorted)) (tptp.holds (tptp.clear tptp.table) State)))
% 0.45/0.69 (assume a30 (forall ((State $$unsorted)) (not (tptp.holds (tptp.on tptp.c tptp.table) State))))
% 0.45/0.69 (step t1 (cl (=> (forall ((State $$unsorted)) (not (tptp.holds (tptp.on tptp.c tptp.table) State))) (not (tptp.holds (tptp.on tptp.c tptp.table) (tptp.do (tptp.putdown tptp.c tptp.table) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) (forall ((State $$unsorted)) (not (tptp.holds (tptp.on tptp.c tptp.table) State)))) :rule implies_neg1)
% 0.45/0.69 (anchor :step t2)
% 0.45/0.69 (assume t2.a0 (forall ((State $$unsorted)) (not (tptp.holds (tptp.on tptp.c tptp.table) State))))
% 0.45/0.69 (step t2.t1 (cl (or (not (forall ((State $$unsorted)) (not (tptp.holds (tptp.on tptp.c tptp.table) State)))) (not (tptp.holds (tptp.on tptp.c tptp.table) (tptp.do (tptp.putdown tptp.c tptp.table) (tptp.do (tptp.pickup tptp.c) tptp.s0)))))) :rule forall_inst :args ((:= State (tptp.do (tptp.putdown tptp.c tptp.table) (tptp.do (tptp.pickup tptp.c) tptp.s0)))))
% 0.45/0.69 (step t2.t2 (cl (not (forall ((State $$unsorted)) (not (tptp.holds (tptp.on tptp.c tptp.table) State)))) (not (tptp.holds (tptp.on tptp.c tptp.table) (tptp.do (tptp.putdown tptp.c tptp.table) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) :rule or :premises (t2.t1))
% 0.45/0.69 (step t2.t3 (cl (not (tptp.holds (tptp.on tptp.c tptp.table) (tptp.do (tptp.putdown tptp.c tptp.table) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) :rule resolution :premises (t2.t2 t2.a0))
% 0.45/0.69 (step t2 (cl (not (forall ((State $$unsorted)) (not (tptp.holds (tptp.on tptp.c tptp.table) State)))) (not (tptp.holds (tptp.on tptp.c tptp.table) (tptp.do (tptp.putdown tptp.c tptp.table) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) :rule subproof :discharge (t2.a0))
% 0.45/0.69 (step t3 (cl (=> (forall ((State $$unsorted)) (not (tptp.holds (tptp.on tptp.c tptp.table) State))) (not (tptp.holds (tptp.on tptp.c tptp.table) (tptp.do (tptp.putdown tptp.c tptp.table) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) (not (tptp.holds (tptp.on tptp.c tptp.table) (tptp.do (tptp.putdown tptp.c tptp.table) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) :rule resolution :premises (t1 t2))
% 0.45/0.69 (step t4 (cl (=> (forall ((State $$unsorted)) (not (tptp.holds (tptp.on tptp.c tptp.table) State))) (not (tptp.holds (tptp.on tptp.c tptp.table) (tptp.do (tptp.putdown tptp.c tptp.table) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) (not (not (tptp.holds (tptp.on tptp.c tptp.table) (tptp.do (tptp.putdown tptp.c tptp.table) (tptp.do (tptp.pickup tptp.c) tptp.s0)))))) :rule implies_neg2)
% 0.45/0.69 (step t5 (cl (=> (forall ((State $$unsorted)) (not (tptp.holds (tptp.on tptp.c tptp.table) State))) (not (tptp.holds (tptp.on tptp.c tptp.table) (tptp.do (tptp.putdown tptp.c tptp.table) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) (=> (forall ((State $$unsorted)) (not (tptp.holds (tptp.on tptp.c tptp.table) State))) (not (tptp.holds (tptp.on tptp.c tptp.table) (tptp.do (tptp.putdown tptp.c tptp.table) (tptp.do (tptp.pickup tptp.c) tptp.s0)))))) :rule resolution :premises (t3 t4))
% 0.45/0.69 (step t6 (cl (=> (forall ((State $$unsorted)) (not (tptp.holds (tptp.on tptp.c tptp.table) State))) (not (tptp.holds (tptp.on tptp.c tptp.table) (tptp.do (tptp.putdown tptp.c tptp.table) (tptp.do (tptp.pickup tptp.c) tptp.s0)))))) :rule contraction :premises (t5))
% 0.45/0.69 (step t7 (cl (not (forall ((State $$unsorted)) (not (tptp.holds (tptp.on tptp.c tptp.table) State)))) (not (tptp.holds (tptp.on tptp.c tptp.table) (tptp.do (tptp.putdown tptp.c tptp.table) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) :rule implies :premises (t6))
% 0.45/0.69 (step t8 (cl (not (or (tptp.holds (tptp.on tptp.c tptp.table) (tptp.do (tptp.putdown tptp.c tptp.table) (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.table) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) (tptp.holds (tptp.on tptp.c tptp.table) (tptp.do (tptp.putdown tptp.c tptp.table) (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.table) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) :rule or_pos)
% 0.45/0.69 (step t9 (cl (not (tptp.holds (tptp.holding tptp.c) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.clear tptp.table) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (tptp.holds (tptp.on tptp.c tptp.table) (tptp.do (tptp.putdown tptp.c tptp.table) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (or (tptp.holds (tptp.on tptp.c tptp.table) (tptp.do (tptp.putdown tptp.c tptp.table) (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.table) (tptp.do (tptp.pickup tptp.c) tptp.s0)))))) :rule reordering :premises (t8))
% 0.45/0.69 (step t10 (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)
% 0.45/0.69 (step t11 (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 (t10))
% 0.45/0.69 (step t12 (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)
% 0.45/0.69 (anchor :step t13)
% 0.45/0.69 (assume t13.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)))))
% 0.45/0.69 (step t13.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)))
% 0.45/0.69 (step t13.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 (t13.t1))
% 0.45/0.69 (step t13.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 (t13.t2 t13.a0))
% 0.45/0.69 (step t13 (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 (t13.a0))
% 0.45/0.69 (step t14 (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 (t12 t13))
% 0.45/0.69 (step t15 (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)
% 0.45/0.69 (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)))) (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 (t14 t15))
% 0.45/0.69 (step t17 (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 (t16))
% 0.45/0.69 (step t18 (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 (t17))
% 0.45/0.69 (step t19 (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 (t18 a1))
% 0.45/0.69 (step t20 (cl (tptp.holds (tptp.holding tptp.c) (tptp.do (tptp.pickup tptp.c) tptp.s0))) :rule resolution :premises (t11 a19 a27 a28 t19))
% 0.45/0.69 (step t21 (cl (=> (forall ((State $$unsorted)) (tptp.holds (tptp.clear tptp.table) State)) (tptp.holds (tptp.clear tptp.table) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (forall ((State $$unsorted)) (tptp.holds (tptp.clear tptp.table) State))) :rule implies_neg1)
% 0.45/0.69 (anchor :step t22)
% 0.45/0.69 (assume t22.a0 (forall ((State $$unsorted)) (tptp.holds (tptp.clear tptp.table) State)))
% 0.45/0.69 (step t22.t1 (cl (or (not (forall ((State $$unsorted)) (tptp.holds (tptp.clear tptp.table) State))) (tptp.holds (tptp.clear tptp.table) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) :rule forall_inst :args ((:= State (tptp.do (tptp.pickup tptp.c) tptp.s0))))
% 0.45/0.69 (step t22.t2 (cl (not (forall ((State $$unsorted)) (tptp.holds (tptp.clear tptp.table) State))) (tptp.holds (tptp.clear tptp.table) (tptp.do (tptp.pickup tptp.c) tptp.s0))) :rule or :premises (t22.t1))
% 0.45/0.69 (step t22.t3 (cl (tptp.holds (tptp.clear tptp.table) (tptp.do (tptp.pickup tptp.c) tptp.s0))) :rule resolution :premises (t22.t2 t22.a0))
% 0.45/0.69 (step t22 (cl (not (forall ((State $$unsorted)) (tptp.holds (tptp.clear tptp.table) State))) (tptp.holds (tptp.clear tptp.table) (tptp.do (tptp.pickup tptp.c) tptp.s0))) :rule subproof :discharge (t22.a0))
% 0.45/0.69 (step t23 (cl (=> (forall ((State $$unsorted)) (tptp.holds (tptp.clear tptp.table) State)) (tptp.holds (tptp.clear tptp.table) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (tptp.holds (tptp.clear tptp.table) (tptp.do (tptp.pickup tptp.c) tptp.s0))) :rule resolution :premises (t21 t22))
% 0.45/0.69 (step t24 (cl (=> (forall ((State $$unsorted)) (tptp.holds (tptp.clear tptp.table) State)) (tptp.holds (tptp.clear tptp.table) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (not (tptp.holds (tptp.clear tptp.table) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) :rule implies_neg2)
% 0.45/0.69 (step t25 (cl (=> (forall ((State $$unsorted)) (tptp.holds (tptp.clear tptp.table) State)) (tptp.holds (tptp.clear tptp.table) (tptp.do (tptp.pickup tptp.c) tptp.s0))) (=> (forall ((State $$unsorted)) (tptp.holds (tptp.clear tptp.table) State)) (tptp.holds (tptp.clear tptp.table) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) :rule resolution :premises (t23 t24))
% 0.45/0.69 (step t26 (cl (=> (forall ((State $$unsorted)) (tptp.holds (tptp.clear tptp.table) State)) (tptp.holds (tptp.clear tptp.table) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) :rule contraction :premises (t25))
% 0.45/0.69 (step t27 (cl (not (forall ((State $$unsorted)) (tptp.holds (tptp.clear tptp.table) State))) (tptp.holds (tptp.clear tptp.table) (tptp.do (tptp.pickup tptp.c) tptp.s0))) :rule implies :premises (t26))
% 0.45/0.69 (step t28 (cl (tptp.holds (tptp.clear tptp.table) (tptp.do (tptp.pickup tptp.c) tptp.s0))) :rule resolution :premises (t27 a29))
% 0.45/0.69 (step t29 (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.c tptp.table) (tptp.do (tptp.putdown tptp.c tptp.table) (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.table) (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)
% 0.45/0.69 (anchor :step t30)
% 0.45/0.69 (assume t30.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)))))
% 0.45/0.69 (step t30.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.c tptp.table) (tptp.do (tptp.putdown tptp.c tptp.table) (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.table) (tptp.do (tptp.pickup tptp.c) tptp.s0)))))) :rule forall_inst :args ((:= X tptp.c) (:= Y tptp.table) (:= State (tptp.do (tptp.pickup tptp.c) tptp.s0))))
% 0.45/0.69 (step t30.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.c tptp.table) (tptp.do (tptp.putdown tptp.c tptp.table) (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.table) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) :rule or :premises (t30.t1))
% 0.45/0.69 (step t30.t3 (cl (or (tptp.holds (tptp.on tptp.c tptp.table) (tptp.do (tptp.putdown tptp.c tptp.table) (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.table) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) :rule resolution :premises (t30.t2 t30.a0))
% 0.45/0.69 (step t30 (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.c tptp.table) (tptp.do (tptp.putdown tptp.c tptp.table) (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.table) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) :rule subproof :discharge (t30.a0))
% 0.45/0.69 (step t31 (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.c tptp.table) (tptp.do (tptp.putdown tptp.c tptp.table) (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.table) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) (or (tptp.holds (tptp.on tptp.c tptp.table) (tptp.do (tptp.putdown tptp.c tptp.table) (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.table) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) :rule resolution :premises (t29 t30))
% 0.45/0.69 (step t32 (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.c tptp.table) (tptp.do (tptp.putdown tptp.c tptp.table) (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.table) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) (not (or (tptp.holds (tptp.on tptp.c tptp.table) (tptp.do (tptp.putdown tptp.c tptp.table) (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.table) (tptp.do (tptp.pickup tptp.c) tptp.s0)))))) :rule implies_neg2)
% 0.45/0.69 (step t33 (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.c tptp.table) (tptp.do (tptp.putdown tptp.c tptp.table) (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.table) (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.c tptp.table) (tptp.do (tptp.putdown tptp.c tptp.table) (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.table) (tptp.do (tptp.pickup tptp.c) tptp.s0)))))) :rule resolution :premises (t31 t32))
% 0.45/0.69 (step t34 (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.c tptp.table) (tptp.do (tptp.putdown tptp.c tptp.table) (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.table) (tptp.do (tptp.pickup tptp.c) tptp.s0)))))) :rule contraction :premises (t33))
% 0.45/0.69 (step t35 (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.c tptp.table) (tptp.do (tptp.putdown tptp.c tptp.table) (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.table) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) :rule implies :premises (t34))
% 0.45/0.69 (step t36 (cl (or (tptp.holds (tptp.on tptp.c tptp.table) (tptp.do (tptp.putdown tptp.c tptp.table) (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.table) (tptp.do (tptp.pickup tptp.c) tptp.s0))))) :rule resolution :premises (t35 a6))
% 0.45/0.69 (step t37 (cl (tptp.holds (tptp.on tptp.c tptp.table) (tptp.do (tptp.putdown tptp.c tptp.table) (tptp.do (tptp.pickup tptp.c) tptp.s0)))) :rule resolution :premises (t9 t20 t28 t36))
% 0.45/0.69 (step t38 (cl) :rule resolution :premises (t7 t37 a30))
% 0.45/0.69
% 0.45/0.70 % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.iGvaitC9Kg/cvc5---1.0.5_21955.smt2
% 0.45/0.70 % cvc5---1.0.5 exiting
% 0.45/0.70 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------