TSTP Solution File: NUM430+1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : NUM430+1 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n017.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:33:23 EDT 2024
% Result : Theorem 0.40s 0.71s
% Output : Proof 0.40s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.15 % Problem : NUM430+1 : TPTP v8.2.0. Released v4.0.0.
% 0.16/0.17 % Command : do_cvc5 %s %d
% 0.16/0.40 % Computer : n017.cluster.edu
% 0.16/0.40 % Model : x86_64 x86_64
% 0.16/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.40 % Memory : 8042.1875MB
% 0.16/0.40 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.40 % CPULimit : 300
% 0.16/0.40 % WCLimit : 300
% 0.16/0.40 % DateTime : Tue May 28 03:33:09 EDT 2024
% 0.16/0.41 % CPUTime :
% 0.39/0.55 %----Proving TF0_NAR, FOF, or CNF
% 0.40/0.71 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.40/0.71 % SZS status Theorem for /export/starexec/sandbox2/tmp/tmp.K503LsWleh/cvc5---1.0.5_20282.smt2
% 0.40/0.71 % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.K503LsWleh/cvc5---1.0.5_20282.smt2
% 0.40/0.71 (assume a0 (forall ((W0 $$unsorted)) (=> (tptp.aInteger0 W0) true)))
% 0.40/0.71 (assume a1 (tptp.aInteger0 tptp.sz00))
% 0.40/0.71 (assume a2 (tptp.aInteger0 tptp.sz10))
% 0.40/0.71 (assume a3 (forall ((W0 $$unsorted)) (=> (tptp.aInteger0 W0) (tptp.aInteger0 (tptp.smndt0 W0)))))
% 0.40/0.71 (assume a4 (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aInteger0 W0) (tptp.aInteger0 W1)) (tptp.aInteger0 (tptp.sdtpldt0 W0 W1)))))
% 0.40/0.71 (assume a5 (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aInteger0 W0) (tptp.aInteger0 W1)) (tptp.aInteger0 (tptp.sdtasdt0 W0 W1)))))
% 0.40/0.71 (assume a6 (forall ((W0 $$unsorted) (W1 $$unsorted) (W2 $$unsorted)) (=> (and (tptp.aInteger0 W0) (tptp.aInteger0 W1) (tptp.aInteger0 W2)) (= (tptp.sdtpldt0 W0 (tptp.sdtpldt0 W1 W2)) (tptp.sdtpldt0 (tptp.sdtpldt0 W0 W1) W2)))))
% 0.40/0.71 (assume a7 (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aInteger0 W0) (tptp.aInteger0 W1)) (= (tptp.sdtpldt0 W0 W1) (tptp.sdtpldt0 W1 W0)))))
% 0.40/0.71 (assume a8 (forall ((W0 $$unsorted)) (=> (tptp.aInteger0 W0) (and (= (tptp.sdtpldt0 W0 tptp.sz00) W0) (= W0 (tptp.sdtpldt0 tptp.sz00 W0))))))
% 0.40/0.71 (assume a9 (forall ((W0 $$unsorted)) (=> (tptp.aInteger0 W0) (and (= (tptp.sdtpldt0 W0 (tptp.smndt0 W0)) tptp.sz00) (= tptp.sz00 (tptp.sdtpldt0 (tptp.smndt0 W0) W0))))))
% 0.40/0.71 (assume a10 (forall ((W0 $$unsorted) (W1 $$unsorted) (W2 $$unsorted)) (=> (and (tptp.aInteger0 W0) (tptp.aInteger0 W1) (tptp.aInteger0 W2)) (= (tptp.sdtasdt0 W0 (tptp.sdtasdt0 W1 W2)) (tptp.sdtasdt0 (tptp.sdtasdt0 W0 W1) W2)))))
% 0.40/0.71 (assume a11 (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aInteger0 W0) (tptp.aInteger0 W1)) (= (tptp.sdtasdt0 W0 W1) (tptp.sdtasdt0 W1 W0)))))
% 0.40/0.71 (assume a12 (forall ((W0 $$unsorted)) (=> (tptp.aInteger0 W0) (and (= (tptp.sdtasdt0 W0 tptp.sz10) W0) (= W0 (tptp.sdtasdt0 tptp.sz10 W0))))))
% 0.40/0.71 (assume a13 (forall ((W0 $$unsorted) (W1 $$unsorted) (W2 $$unsorted)) (=> (and (tptp.aInteger0 W0) (tptp.aInteger0 W1) (tptp.aInteger0 W2)) (and (= (tptp.sdtasdt0 W0 (tptp.sdtpldt0 W1 W2)) (tptp.sdtpldt0 (tptp.sdtasdt0 W0 W1) (tptp.sdtasdt0 W0 W2))) (= (tptp.sdtasdt0 (tptp.sdtpldt0 W0 W1) W2) (tptp.sdtpldt0 (tptp.sdtasdt0 W0 W2) (tptp.sdtasdt0 W1 W2)))))))
% 0.40/0.71 (assume a14 (forall ((W0 $$unsorted)) (=> (tptp.aInteger0 W0) (and (= (tptp.sdtasdt0 W0 tptp.sz00) tptp.sz00) (= tptp.sz00 (tptp.sdtasdt0 tptp.sz00 W0))))))
% 0.40/0.71 (assume a15 (forall ((W0 $$unsorted)) (=> (tptp.aInteger0 W0) (and (= (tptp.sdtasdt0 (tptp.smndt0 tptp.sz10) W0) (tptp.smndt0 W0)) (= (tptp.smndt0 W0) (tptp.sdtasdt0 W0 (tptp.smndt0 tptp.sz10)))))))
% 0.40/0.71 (assume a16 (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aInteger0 W0) (tptp.aInteger0 W1)) (=> (= (tptp.sdtasdt0 W0 W1) tptp.sz00) (or (= W0 tptp.sz00) (= W1 tptp.sz00))))))
% 0.40/0.71 (assume a17 (forall ((W0 $$unsorted)) (=> (tptp.aInteger0 W0) (forall ((W1 $$unsorted)) (= (tptp.aDivisorOf0 W1 W0) (and (tptp.aInteger0 W1) (not (= W1 tptp.sz00)) (exists ((W2 $$unsorted)) (and (tptp.aInteger0 W2) (= (tptp.sdtasdt0 W1 W2) W0)))))))))
% 0.40/0.71 (assume a18 (forall ((W0 $$unsorted) (W1 $$unsorted) (W2 $$unsorted)) (=> (and (tptp.aInteger0 W0) (tptp.aInteger0 W1) (tptp.aInteger0 W2) (not (= W2 tptp.sz00))) (= (tptp.sdteqdtlpzmzozddtrp0 W0 W1 W2) (tptp.aDivisorOf0 W2 (tptp.sdtpldt0 W0 (tptp.smndt0 W1)))))))
% 0.40/0.71 (assume a19 (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aInteger0 W0) (tptp.aInteger0 W1) (not (= W1 tptp.sz00))) (tptp.sdteqdtlpzmzozddtrp0 W0 W0 W1))))
% 0.40/0.71 (assume a20 (forall ((W0 $$unsorted) (W1 $$unsorted) (W2 $$unsorted)) (=> (and (tptp.aInteger0 W0) (tptp.aInteger0 W1) (tptp.aInteger0 W2) (not (= W2 tptp.sz00))) (=> (tptp.sdteqdtlpzmzozddtrp0 W0 W1 W2) (tptp.sdteqdtlpzmzozddtrp0 W1 W0 W2)))))
% 0.40/0.71 (assume a21 (and (tptp.aInteger0 tptp.xa) (tptp.aInteger0 tptp.xb) (tptp.aInteger0 tptp.xq) (not (= tptp.xq tptp.sz00)) (tptp.aInteger0 tptp.xc)))
% 0.40/0.71 (assume a22 (and (tptp.sdteqdtlpzmzozddtrp0 tptp.xa tptp.xb tptp.xq) (tptp.sdteqdtlpzmzozddtrp0 tptp.xb tptp.xc tptp.xq)))
% 0.40/0.71 (assume a23 (and (tptp.aInteger0 tptp.xn) (= (tptp.sdtasdt0 tptp.xq tptp.xn) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))))
% 0.40/0.71 (assume a24 (not (exists ((W0 $$unsorted)) (and (tptp.aInteger0 W0) (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))))))
% 0.40/0.71 (assume a25 true)
% 0.40/0.71 (step t1 (cl (not (or (not (tptp.aInteger0 (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))) (= (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))) (and (tptp.aInteger0 tptp.xq) (not (= tptp.sz00 tptp.xq)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)) (tptp.sdtasdt0 tptp.xq W2)))))))))) (not (tptp.aInteger0 (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))) (= (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))) (and (tptp.aInteger0 tptp.xq) (not (= tptp.sz00 tptp.xq)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)) (tptp.sdtasdt0 tptp.xq W2))))))))) :rule or_pos)
% 0.40/0.71 (step t2 (cl (not (tptp.aInteger0 (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))) (= (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))) (and (tptp.aInteger0 tptp.xq) (not (= tptp.sz00 tptp.xq)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)) (tptp.sdtasdt0 tptp.xq W2)))))))) (not (or (not (tptp.aInteger0 (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))) (= (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))) (and (tptp.aInteger0 tptp.xq) (not (= tptp.sz00 tptp.xq)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)) (tptp.sdtasdt0 tptp.xq W2))))))))))) :rule reordering :premises (t1))
% 0.40/0.71 (step t3 (cl (not (= (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))) (and (tptp.aInteger0 tptp.xq) (not (= tptp.sz00 tptp.xq)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)) (tptp.sdtasdt0 tptp.xq W2))))))))) (not (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))) (and (tptp.aInteger0 tptp.xq) (not (= tptp.sz00 tptp.xq)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)) (tptp.sdtasdt0 tptp.xq W2)))))))) :rule equiv_pos2)
% 0.40/0.71 (step t4 (cl (not (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))) (and (tptp.aInteger0 tptp.xq) (not (= tptp.sz00 tptp.xq)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)) (tptp.sdtasdt0 tptp.xq W2))))))) (not (= (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))) (and (tptp.aInteger0 tptp.xq) (not (= tptp.sz00 tptp.xq)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)) (tptp.sdtasdt0 tptp.xq W2)))))))))) :rule reordering :premises (t3))
% 0.40/0.71 (step t5 (cl (not (= (tptp.sdteqdtlpzmzozddtrp0 tptp.xb tptp.xc tptp.xq) (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))))) (not (tptp.sdteqdtlpzmzozddtrp0 tptp.xb tptp.xc tptp.xq)) (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))) :rule equiv_pos2)
% 0.40/0.71 (step t6 (cl (not (tptp.sdteqdtlpzmzozddtrp0 tptp.xb tptp.xc tptp.xq)) (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))) (not (= (tptp.sdteqdtlpzmzozddtrp0 tptp.xb tptp.xc tptp.xq) (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))))) :rule reordering :premises (t5))
% 0.40/0.71 (step t7 (cl (tptp.sdteqdtlpzmzozddtrp0 tptp.xb tptp.xc tptp.xq)) :rule and :premises (a22))
% 0.40/0.71 (step t8 (cl (not (or (not (tptp.aInteger0 tptp.xb)) (not (tptp.aInteger0 tptp.xc)) (not (tptp.aInteger0 tptp.xq)) (= tptp.sz00 tptp.xq) (= (tptp.sdteqdtlpzmzozddtrp0 tptp.xb tptp.xc tptp.xq) (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))))) (not (tptp.aInteger0 tptp.xb)) (not (tptp.aInteger0 tptp.xc)) (not (tptp.aInteger0 tptp.xq)) (= tptp.sz00 tptp.xq) (= (tptp.sdteqdtlpzmzozddtrp0 tptp.xb tptp.xc tptp.xq) (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))))) :rule or_pos)
% 0.40/0.71 (step t9 (cl (= tptp.sz00 tptp.xq) (not (tptp.aInteger0 tptp.xb)) (not (tptp.aInteger0 tptp.xq)) (not (tptp.aInteger0 tptp.xc)) (= (tptp.sdteqdtlpzmzozddtrp0 tptp.xb tptp.xc tptp.xq) (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))) (not (or (not (tptp.aInteger0 tptp.xb)) (not (tptp.aInteger0 tptp.xc)) (not (tptp.aInteger0 tptp.xq)) (= tptp.sz00 tptp.xq) (= (tptp.sdteqdtlpzmzozddtrp0 tptp.xb tptp.xc tptp.xq) (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))))))) :rule reordering :premises (t8))
% 0.40/0.71 (step t10 (cl (not (= (and (tptp.aInteger0 tptp.xa) (tptp.aInteger0 tptp.xb) (tptp.aInteger0 tptp.xq) (not (= tptp.xq tptp.sz00)) (tptp.aInteger0 tptp.xc)) (and (tptp.aInteger0 tptp.xa) (tptp.aInteger0 tptp.xb) (tptp.aInteger0 tptp.xq) (not (= tptp.sz00 tptp.xq)) (tptp.aInteger0 tptp.xc)))) (not (and (tptp.aInteger0 tptp.xa) (tptp.aInteger0 tptp.xb) (tptp.aInteger0 tptp.xq) (not (= tptp.xq tptp.sz00)) (tptp.aInteger0 tptp.xc))) (and (tptp.aInteger0 tptp.xa) (tptp.aInteger0 tptp.xb) (tptp.aInteger0 tptp.xq) (not (= tptp.sz00 tptp.xq)) (tptp.aInteger0 tptp.xc))) :rule equiv_pos2)
% 0.40/0.71 (step t11 (cl (= (tptp.aInteger0 tptp.xa) (tptp.aInteger0 tptp.xa))) :rule refl)
% 0.40/0.71 (step t12 (cl (= (tptp.aInteger0 tptp.xb) (tptp.aInteger0 tptp.xb))) :rule refl)
% 0.40/0.71 (step t13 (cl (= (tptp.aInteger0 tptp.xq) (tptp.aInteger0 tptp.xq))) :rule refl)
% 0.40/0.71 (step t14 (cl (= (= tptp.xq tptp.sz00) (= tptp.sz00 tptp.xq))) :rule all_simplify)
% 0.40/0.71 (step t15 (cl (= (not (= tptp.xq tptp.sz00)) (not (= tptp.sz00 tptp.xq)))) :rule cong :premises (t14))
% 0.40/0.71 (step t16 (cl (= (tptp.aInteger0 tptp.xc) (tptp.aInteger0 tptp.xc))) :rule refl)
% 0.40/0.71 (step t17 (cl (= (and (tptp.aInteger0 tptp.xa) (tptp.aInteger0 tptp.xb) (tptp.aInteger0 tptp.xq) (not (= tptp.xq tptp.sz00)) (tptp.aInteger0 tptp.xc)) (and (tptp.aInteger0 tptp.xa) (tptp.aInteger0 tptp.xb) (tptp.aInteger0 tptp.xq) (not (= tptp.sz00 tptp.xq)) (tptp.aInteger0 tptp.xc)))) :rule cong :premises (t11 t12 t13 t15 t16))
% 0.40/0.71 (step t18 (cl (and (tptp.aInteger0 tptp.xa) (tptp.aInteger0 tptp.xb) (tptp.aInteger0 tptp.xq) (not (= tptp.sz00 tptp.xq)) (tptp.aInteger0 tptp.xc))) :rule resolution :premises (t10 t17 a21))
% 0.40/0.71 (step t19 (cl (not (= tptp.sz00 tptp.xq))) :rule and :premises (t18))
% 0.40/0.71 (step t20 (cl (tptp.aInteger0 tptp.xb)) :rule and :premises (t18))
% 0.40/0.71 (step t21 (cl (tptp.aInteger0 tptp.xq)) :rule and :premises (t18))
% 0.40/0.71 (step t22 (cl (tptp.aInteger0 tptp.xc)) :rule and :premises (t18))
% 0.40/0.71 (step t23 (cl (=> (forall ((W0 $$unsorted) (W1 $$unsorted) (W2 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (not (tptp.aInteger0 W2)) (= tptp.sz00 W2) (= (tptp.sdteqdtlpzmzozddtrp0 W0 W1 W2) (tptp.aDivisorOf0 W2 (tptp.sdtpldt0 W0 (tptp.smndt0 W1)))))) (or (not (tptp.aInteger0 tptp.xb)) (not (tptp.aInteger0 tptp.xc)) (not (tptp.aInteger0 tptp.xq)) (= tptp.sz00 tptp.xq) (= (tptp.sdteqdtlpzmzozddtrp0 tptp.xb tptp.xc tptp.xq) (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))))) (forall ((W0 $$unsorted) (W1 $$unsorted) (W2 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (not (tptp.aInteger0 W2)) (= tptp.sz00 W2) (= (tptp.sdteqdtlpzmzozddtrp0 W0 W1 W2) (tptp.aDivisorOf0 W2 (tptp.sdtpldt0 W0 (tptp.smndt0 W1))))))) :rule implies_neg1)
% 0.40/0.71 (anchor :step t24)
% 0.40/0.71 (assume t24.a0 (forall ((W0 $$unsorted) (W1 $$unsorted) (W2 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (not (tptp.aInteger0 W2)) (= tptp.sz00 W2) (= (tptp.sdteqdtlpzmzozddtrp0 W0 W1 W2) (tptp.aDivisorOf0 W2 (tptp.sdtpldt0 W0 (tptp.smndt0 W1)))))))
% 0.40/0.71 (step t24.t1 (cl (or (not (forall ((W0 $$unsorted) (W1 $$unsorted) (W2 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (not (tptp.aInteger0 W2)) (= tptp.sz00 W2) (= (tptp.sdteqdtlpzmzozddtrp0 W0 W1 W2) (tptp.aDivisorOf0 W2 (tptp.sdtpldt0 W0 (tptp.smndt0 W1))))))) (or (not (tptp.aInteger0 tptp.xb)) (not (tptp.aInteger0 tptp.xc)) (not (tptp.aInteger0 tptp.xq)) (= tptp.sz00 tptp.xq) (= (tptp.sdteqdtlpzmzozddtrp0 tptp.xb tptp.xc tptp.xq) (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))))))) :rule forall_inst :args ((:= W0 tptp.xb) (:= W1 tptp.xc) (:= W2 tptp.xq)))
% 0.40/0.71 (step t24.t2 (cl (not (forall ((W0 $$unsorted) (W1 $$unsorted) (W2 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (not (tptp.aInteger0 W2)) (= tptp.sz00 W2) (= (tptp.sdteqdtlpzmzozddtrp0 W0 W1 W2) (tptp.aDivisorOf0 W2 (tptp.sdtpldt0 W0 (tptp.smndt0 W1))))))) (or (not (tptp.aInteger0 tptp.xb)) (not (tptp.aInteger0 tptp.xc)) (not (tptp.aInteger0 tptp.xq)) (= tptp.sz00 tptp.xq) (= (tptp.sdteqdtlpzmzozddtrp0 tptp.xb tptp.xc tptp.xq) (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))))) :rule or :premises (t24.t1))
% 0.40/0.71 (step t24.t3 (cl (or (not (tptp.aInteger0 tptp.xb)) (not (tptp.aInteger0 tptp.xc)) (not (tptp.aInteger0 tptp.xq)) (= tptp.sz00 tptp.xq) (= (tptp.sdteqdtlpzmzozddtrp0 tptp.xb tptp.xc tptp.xq) (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))))) :rule resolution :premises (t24.t2 t24.a0))
% 0.40/0.71 (step t24 (cl (not (forall ((W0 $$unsorted) (W1 $$unsorted) (W2 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (not (tptp.aInteger0 W2)) (= tptp.sz00 W2) (= (tptp.sdteqdtlpzmzozddtrp0 W0 W1 W2) (tptp.aDivisorOf0 W2 (tptp.sdtpldt0 W0 (tptp.smndt0 W1))))))) (or (not (tptp.aInteger0 tptp.xb)) (not (tptp.aInteger0 tptp.xc)) (not (tptp.aInteger0 tptp.xq)) (= tptp.sz00 tptp.xq) (= (tptp.sdteqdtlpzmzozddtrp0 tptp.xb tptp.xc tptp.xq) (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))))) :rule subproof :discharge (t24.a0))
% 0.40/0.71 (step t25 (cl (=> (forall ((W0 $$unsorted) (W1 $$unsorted) (W2 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (not (tptp.aInteger0 W2)) (= tptp.sz00 W2) (= (tptp.sdteqdtlpzmzozddtrp0 W0 W1 W2) (tptp.aDivisorOf0 W2 (tptp.sdtpldt0 W0 (tptp.smndt0 W1)))))) (or (not (tptp.aInteger0 tptp.xb)) (not (tptp.aInteger0 tptp.xc)) (not (tptp.aInteger0 tptp.xq)) (= tptp.sz00 tptp.xq) (= (tptp.sdteqdtlpzmzozddtrp0 tptp.xb tptp.xc tptp.xq) (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))))) (or (not (tptp.aInteger0 tptp.xb)) (not (tptp.aInteger0 tptp.xc)) (not (tptp.aInteger0 tptp.xq)) (= tptp.sz00 tptp.xq) (= (tptp.sdteqdtlpzmzozddtrp0 tptp.xb tptp.xc tptp.xq) (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))))) :rule resolution :premises (t23 t24))
% 0.40/0.71 (step t26 (cl (=> (forall ((W0 $$unsorted) (W1 $$unsorted) (W2 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (not (tptp.aInteger0 W2)) (= tptp.sz00 W2) (= (tptp.sdteqdtlpzmzozddtrp0 W0 W1 W2) (tptp.aDivisorOf0 W2 (tptp.sdtpldt0 W0 (tptp.smndt0 W1)))))) (or (not (tptp.aInteger0 tptp.xb)) (not (tptp.aInteger0 tptp.xc)) (not (tptp.aInteger0 tptp.xq)) (= tptp.sz00 tptp.xq) (= (tptp.sdteqdtlpzmzozddtrp0 tptp.xb tptp.xc tptp.xq) (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))))) (not (or (not (tptp.aInteger0 tptp.xb)) (not (tptp.aInteger0 tptp.xc)) (not (tptp.aInteger0 tptp.xq)) (= tptp.sz00 tptp.xq) (= (tptp.sdteqdtlpzmzozddtrp0 tptp.xb tptp.xc tptp.xq) (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))))))) :rule implies_neg2)
% 0.40/0.71 (step t27 (cl (=> (forall ((W0 $$unsorted) (W1 $$unsorted) (W2 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (not (tptp.aInteger0 W2)) (= tptp.sz00 W2) (= (tptp.sdteqdtlpzmzozddtrp0 W0 W1 W2) (tptp.aDivisorOf0 W2 (tptp.sdtpldt0 W0 (tptp.smndt0 W1)))))) (or (not (tptp.aInteger0 tptp.xb)) (not (tptp.aInteger0 tptp.xc)) (not (tptp.aInteger0 tptp.xq)) (= tptp.sz00 tptp.xq) (= (tptp.sdteqdtlpzmzozddtrp0 tptp.xb tptp.xc tptp.xq) (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))))) (=> (forall ((W0 $$unsorted) (W1 $$unsorted) (W2 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (not (tptp.aInteger0 W2)) (= tptp.sz00 W2) (= (tptp.sdteqdtlpzmzozddtrp0 W0 W1 W2) (tptp.aDivisorOf0 W2 (tptp.sdtpldt0 W0 (tptp.smndt0 W1)))))) (or (not (tptp.aInteger0 tptp.xb)) (not (tptp.aInteger0 tptp.xc)) (not (tptp.aInteger0 tptp.xq)) (= tptp.sz00 tptp.xq) (= (tptp.sdteqdtlpzmzozddtrp0 tptp.xb tptp.xc tptp.xq) (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))))))) :rule resolution :premises (t25 t26))
% 0.40/0.71 (step t28 (cl (=> (forall ((W0 $$unsorted) (W1 $$unsorted) (W2 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (not (tptp.aInteger0 W2)) (= tptp.sz00 W2) (= (tptp.sdteqdtlpzmzozddtrp0 W0 W1 W2) (tptp.aDivisorOf0 W2 (tptp.sdtpldt0 W0 (tptp.smndt0 W1)))))) (or (not (tptp.aInteger0 tptp.xb)) (not (tptp.aInteger0 tptp.xc)) (not (tptp.aInteger0 tptp.xq)) (= tptp.sz00 tptp.xq) (= (tptp.sdteqdtlpzmzozddtrp0 tptp.xb tptp.xc tptp.xq) (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))))))) :rule contraction :premises (t27))
% 0.40/0.71 (step t29 (cl (not (forall ((W0 $$unsorted) (W1 $$unsorted) (W2 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (not (tptp.aInteger0 W2)) (= tptp.sz00 W2) (= (tptp.sdteqdtlpzmzozddtrp0 W0 W1 W2) (tptp.aDivisorOf0 W2 (tptp.sdtpldt0 W0 (tptp.smndt0 W1))))))) (or (not (tptp.aInteger0 tptp.xb)) (not (tptp.aInteger0 tptp.xc)) (not (tptp.aInteger0 tptp.xq)) (= tptp.sz00 tptp.xq) (= (tptp.sdteqdtlpzmzozddtrp0 tptp.xb tptp.xc tptp.xq) (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))))) :rule implies :premises (t28))
% 0.40/0.71 (step t30 (cl (not (= (forall ((W0 $$unsorted) (W1 $$unsorted) (W2 $$unsorted)) (=> (and (tptp.aInteger0 W0) (tptp.aInteger0 W1) (tptp.aInteger0 W2) (not (= W2 tptp.sz00))) (= (tptp.sdteqdtlpzmzozddtrp0 W0 W1 W2) (tptp.aDivisorOf0 W2 (tptp.sdtpldt0 W0 (tptp.smndt0 W1)))))) (forall ((W0 $$unsorted) (W1 $$unsorted) (W2 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (not (tptp.aInteger0 W2)) (= tptp.sz00 W2) (= (tptp.sdteqdtlpzmzozddtrp0 W0 W1 W2) (tptp.aDivisorOf0 W2 (tptp.sdtpldt0 W0 (tptp.smndt0 W1)))))))) (not (forall ((W0 $$unsorted) (W1 $$unsorted) (W2 $$unsorted)) (=> (and (tptp.aInteger0 W0) (tptp.aInteger0 W1) (tptp.aInteger0 W2) (not (= W2 tptp.sz00))) (= (tptp.sdteqdtlpzmzozddtrp0 W0 W1 W2) (tptp.aDivisorOf0 W2 (tptp.sdtpldt0 W0 (tptp.smndt0 W1))))))) (forall ((W0 $$unsorted) (W1 $$unsorted) (W2 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (not (tptp.aInteger0 W2)) (= tptp.sz00 W2) (= (tptp.sdteqdtlpzmzozddtrp0 W0 W1 W2) (tptp.aDivisorOf0 W2 (tptp.sdtpldt0 W0 (tptp.smndt0 W1))))))) :rule equiv_pos2)
% 0.40/0.71 (anchor :step t31 :args ((W0 $$unsorted) (:= W0 W0) (W1 $$unsorted) (:= W1 W1) (W2 $$unsorted) (:= W2 W2)))
% 0.40/0.71 (step t31.t1 (cl (= W0 W0)) :rule refl)
% 0.40/0.71 (step t31.t2 (cl (= W1 W1)) :rule refl)
% 0.40/0.71 (step t31.t3 (cl (= W2 W2)) :rule refl)
% 0.40/0.71 (step t31.t4 (cl (= (tptp.aInteger0 W0) (tptp.aInteger0 W0))) :rule refl)
% 0.40/0.71 (step t31.t5 (cl (= (tptp.aInteger0 W1) (tptp.aInteger0 W1))) :rule refl)
% 0.40/0.71 (step t31.t6 (cl (= (tptp.aInteger0 W2) (tptp.aInteger0 W2))) :rule refl)
% 0.40/0.71 (step t31.t7 (cl (= (= W2 tptp.sz00) (= tptp.sz00 W2))) :rule all_simplify)
% 0.40/0.71 (step t31.t8 (cl (= (not (= W2 tptp.sz00)) (not (= tptp.sz00 W2)))) :rule cong :premises (t31.t7))
% 0.40/0.71 (step t31.t9 (cl (= (and (tptp.aInteger0 W0) (tptp.aInteger0 W1) (tptp.aInteger0 W2) (not (= W2 tptp.sz00))) (and (tptp.aInteger0 W0) (tptp.aInteger0 W1) (tptp.aInteger0 W2) (not (= tptp.sz00 W2))))) :rule cong :premises (t31.t4 t31.t5 t31.t6 t31.t8))
% 0.40/0.71 (step t31.t10 (cl (= (= (tptp.sdteqdtlpzmzozddtrp0 W0 W1 W2) (tptp.aDivisorOf0 W2 (tptp.sdtpldt0 W0 (tptp.smndt0 W1)))) (= (tptp.sdteqdtlpzmzozddtrp0 W0 W1 W2) (tptp.aDivisorOf0 W2 (tptp.sdtpldt0 W0 (tptp.smndt0 W1)))))) :rule refl)
% 0.40/0.71 (step t31.t11 (cl (= (=> (and (tptp.aInteger0 W0) (tptp.aInteger0 W1) (tptp.aInteger0 W2) (not (= W2 tptp.sz00))) (= (tptp.sdteqdtlpzmzozddtrp0 W0 W1 W2) (tptp.aDivisorOf0 W2 (tptp.sdtpldt0 W0 (tptp.smndt0 W1))))) (=> (and (tptp.aInteger0 W0) (tptp.aInteger0 W1) (tptp.aInteger0 W2) (not (= tptp.sz00 W2))) (= (tptp.sdteqdtlpzmzozddtrp0 W0 W1 W2) (tptp.aDivisorOf0 W2 (tptp.sdtpldt0 W0 (tptp.smndt0 W1))))))) :rule cong :premises (t31.t9 t31.t10))
% 0.40/0.71 (step t31 (cl (= (forall ((W0 $$unsorted) (W1 $$unsorted) (W2 $$unsorted)) (=> (and (tptp.aInteger0 W0) (tptp.aInteger0 W1) (tptp.aInteger0 W2) (not (= W2 tptp.sz00))) (= (tptp.sdteqdtlpzmzozddtrp0 W0 W1 W2) (tptp.aDivisorOf0 W2 (tptp.sdtpldt0 W0 (tptp.smndt0 W1)))))) (forall ((W0 $$unsorted) (W1 $$unsorted) (W2 $$unsorted)) (=> (and (tptp.aInteger0 W0) (tptp.aInteger0 W1) (tptp.aInteger0 W2) (not (= tptp.sz00 W2))) (= (tptp.sdteqdtlpzmzozddtrp0 W0 W1 W2) (tptp.aDivisorOf0 W2 (tptp.sdtpldt0 W0 (tptp.smndt0 W1)))))))) :rule bind)
% 0.40/0.71 (step t32 (cl (= (forall ((W0 $$unsorted) (W1 $$unsorted) (W2 $$unsorted)) (=> (and (tptp.aInteger0 W0) (tptp.aInteger0 W1) (tptp.aInteger0 W2) (not (= tptp.sz00 W2))) (= (tptp.sdteqdtlpzmzozddtrp0 W0 W1 W2) (tptp.aDivisorOf0 W2 (tptp.sdtpldt0 W0 (tptp.smndt0 W1)))))) (forall ((W0 $$unsorted) (W1 $$unsorted) (W2 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (not (tptp.aInteger0 W2)) (= tptp.sz00 W2) (= (tptp.sdteqdtlpzmzozddtrp0 W0 W1 W2) (tptp.aDivisorOf0 W2 (tptp.sdtpldt0 W0 (tptp.smndt0 W1)))))))) :rule all_simplify)
% 0.40/0.71 (step t33 (cl (= (forall ((W0 $$unsorted) (W1 $$unsorted) (W2 $$unsorted)) (=> (and (tptp.aInteger0 W0) (tptp.aInteger0 W1) (tptp.aInteger0 W2) (not (= W2 tptp.sz00))) (= (tptp.sdteqdtlpzmzozddtrp0 W0 W1 W2) (tptp.aDivisorOf0 W2 (tptp.sdtpldt0 W0 (tptp.smndt0 W1)))))) (forall ((W0 $$unsorted) (W1 $$unsorted) (W2 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (not (tptp.aInteger0 W2)) (= tptp.sz00 W2) (= (tptp.sdteqdtlpzmzozddtrp0 W0 W1 W2) (tptp.aDivisorOf0 W2 (tptp.sdtpldt0 W0 (tptp.smndt0 W1)))))))) :rule trans :premises (t31 t32))
% 0.40/0.71 (step t34 (cl (forall ((W0 $$unsorted) (W1 $$unsorted) (W2 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (not (tptp.aInteger0 W2)) (= tptp.sz00 W2) (= (tptp.sdteqdtlpzmzozddtrp0 W0 W1 W2) (tptp.aDivisorOf0 W2 (tptp.sdtpldt0 W0 (tptp.smndt0 W1))))))) :rule resolution :premises (t30 t33 a18))
% 0.40/0.71 (step t35 (cl (or (not (tptp.aInteger0 tptp.xb)) (not (tptp.aInteger0 tptp.xc)) (not (tptp.aInteger0 tptp.xq)) (= tptp.sz00 tptp.xq) (= (tptp.sdteqdtlpzmzozddtrp0 tptp.xb tptp.xc tptp.xq) (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))))) :rule resolution :premises (t29 t34))
% 0.40/0.71 (step t36 (cl (= (tptp.sdteqdtlpzmzozddtrp0 tptp.xb tptp.xc tptp.xq) (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))))) :rule resolution :premises (t9 t19 t20 t21 t22 t35))
% 0.40/0.71 (step t37 (cl (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))) :rule resolution :premises (t6 t7 t36))
% 0.40/0.71 (step t38 (cl (not (and (tptp.aInteger0 tptp.xq) (not (= tptp.sz00 tptp.xq)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)) (tptp.sdtasdt0 tptp.xq W2)))))))) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)) (tptp.sdtasdt0 tptp.xq W2))))))) :rule and_pos)
% 0.40/0.71 (step t39 (cl (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)) (tptp.sdtasdt0 tptp.xq W2)))))) (not (and (tptp.aInteger0 tptp.xq) (not (= tptp.sz00 tptp.xq)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)) (tptp.sdtasdt0 tptp.xq W2))))))))) :rule reordering :premises (t38))
% 0.40/0.71 (step t40 (cl (= (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))))) (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtasdt0 tptp.xq W2) (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))))))) :rule hole :args ((forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))))) (= W0 W2)))
% 0.40/0.71 (step t41 (cl (= (= (= (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtasdt0 tptp.xq W2) (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))))) (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)) (tptp.sdtasdt0 tptp.xq W2)))))) true) (= (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtasdt0 tptp.xq W2) (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))))) (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)) (tptp.sdtasdt0 tptp.xq W2)))))))) :rule equiv_simplify)
% 0.40/0.71 (step t42 (cl (not (= (= (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtasdt0 tptp.xq W2) (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))))) (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)) (tptp.sdtasdt0 tptp.xq W2)))))) true)) (= (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtasdt0 tptp.xq W2) (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))))) (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)) (tptp.sdtasdt0 tptp.xq W2))))))) :rule equiv1 :premises (t41))
% 0.40/0.71 (step t43 (cl (= (= (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtasdt0 tptp.xq W2) (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))))) (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)) (tptp.sdtasdt0 tptp.xq W2)))))) (= (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)) (tptp.sdtasdt0 tptp.xq W2))))) (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtasdt0 tptp.xq W2) (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))))))))) :rule all_simplify)
% 0.40/0.71 (step t44 (cl (= (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)) (tptp.sdtasdt0 tptp.xq W2))))) (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)) (tptp.sdtasdt0 tptp.xq W2))))))) :rule refl)
% 0.40/0.71 (anchor :step t45 :args ((W2 $$unsorted) (:= W2 W2)))
% 0.40/0.71 (step t45.t1 (cl (= W2 W2)) :rule refl)
% 0.40/0.71 (step t45.t2 (cl (= (not (tptp.aInteger0 W2)) (not (tptp.aInteger0 W2)))) :rule refl)
% 0.40/0.71 (step t45.t3 (cl (= (= (tptp.sdtasdt0 tptp.xq W2) (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))) (= (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)) (tptp.sdtasdt0 tptp.xq W2)))) :rule all_simplify)
% 0.40/0.71 (step t45.t4 (cl (= (not (= (tptp.sdtasdt0 tptp.xq W2) (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))) (not (= (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)) (tptp.sdtasdt0 tptp.xq W2))))) :rule cong :premises (t45.t3))
% 0.40/0.71 (step t45.t5 (cl (= (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtasdt0 tptp.xq W2) (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))))) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)) (tptp.sdtasdt0 tptp.xq W2)))))) :rule cong :premises (t45.t2 t45.t4))
% 0.40/0.71 (step t45 (cl (= (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtasdt0 tptp.xq W2) (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))))) (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)) (tptp.sdtasdt0 tptp.xq W2))))))) :rule bind)
% 0.40/0.71 (step t46 (cl (= (= (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)) (tptp.sdtasdt0 tptp.xq W2))))) (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtasdt0 tptp.xq W2) (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))))))) (= (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)) (tptp.sdtasdt0 tptp.xq W2))))) (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)) (tptp.sdtasdt0 tptp.xq W2)))))))) :rule cong :premises (t44 t45))
% 0.40/0.71 (step t47 (cl (= (= (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)) (tptp.sdtasdt0 tptp.xq W2))))) (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)) (tptp.sdtasdt0 tptp.xq W2)))))) true)) :rule all_simplify)
% 0.40/0.71 (step t48 (cl (= (= (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)) (tptp.sdtasdt0 tptp.xq W2))))) (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtasdt0 tptp.xq W2) (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))))))) true)) :rule trans :premises (t46 t47))
% 0.40/0.71 (step t49 (cl (= (= (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtasdt0 tptp.xq W2) (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))))) (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)) (tptp.sdtasdt0 tptp.xq W2)))))) true)) :rule trans :premises (t43 t48))
% 0.40/0.71 (step t50 (cl (= (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtasdt0 tptp.xq W2) (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))))) (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)) (tptp.sdtasdt0 tptp.xq W2))))))) :rule resolution :premises (t42 t49))
% 0.40/0.71 (step t51 (cl (= (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))))) (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)) (tptp.sdtasdt0 tptp.xq W2))))))) :rule trans :premises (t40 t50))
% 0.40/0.71 (step t52 (cl (not (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))))))) (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)) (tptp.sdtasdt0 tptp.xq W2)))))) :rule equiv1 :premises (t51))
% 0.40/0.71 (step t53 (cl (not (= (not (exists ((W0 $$unsorted)) (and (tptp.aInteger0 W0) (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))))) (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))))))) (not (not (exists ((W0 $$unsorted)) (and (tptp.aInteger0 W0) (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))))))) (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))))))) :rule equiv_pos2)
% 0.40/0.71 (step t54 (cl (= (exists ((W0 $$unsorted)) (and (tptp.aInteger0 W0) (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))))) (not (forall ((W0 $$unsorted)) (not (and (tptp.aInteger0 W0) (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))))))))) :rule all_simplify)
% 0.40/0.71 (step t55 (cl (= (forall ((W0 $$unsorted)) (not (and (tptp.aInteger0 W0) (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))))) (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))))))) :rule all_simplify)
% 0.40/0.71 (step t56 (cl (= (not (forall ((W0 $$unsorted)) (not (and (tptp.aInteger0 W0) (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))))))) (not (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))))))))) :rule cong :premises (t55))
% 0.40/0.71 (step t57 (cl (= (exists ((W0 $$unsorted)) (and (tptp.aInteger0 W0) (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))))) (not (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))))))))) :rule trans :premises (t54 t56))
% 0.40/0.71 (step t58 (cl (= (not (exists ((W0 $$unsorted)) (and (tptp.aInteger0 W0) (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))))) (not (not (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))))))))) :rule cong :premises (t57))
% 0.40/0.71 (step t59 (cl (= (not (not (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))))))) (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))))))) :rule all_simplify)
% 0.40/0.71 (step t60 (cl (= (not (exists ((W0 $$unsorted)) (and (tptp.aInteger0 W0) (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))))) (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))))))) :rule trans :premises (t58 t59))
% 0.40/0.71 (step t61 (cl (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))))))) :rule resolution :premises (t53 t60 a24))
% 0.40/0.71 (step t62 (cl (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)) (tptp.sdtasdt0 tptp.xq W2)))))) :rule resolution :premises (t52 t61))
% 0.40/0.71 (step t63 (cl (not (and (tptp.aInteger0 tptp.xq) (not (= tptp.sz00 tptp.xq)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)) (tptp.sdtasdt0 tptp.xq W2))))))))) :rule resolution :premises (t39 t62))
% 0.40/0.71 (step t64 (cl (not (= (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))) (and (tptp.aInteger0 tptp.xq) (not (= tptp.sz00 tptp.xq)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)) (tptp.sdtasdt0 tptp.xq W2)))))))))) :rule resolution :premises (t4 t37 t63))
% 0.40/0.71 (step t65 (cl (not (or (not (tptp.aInteger0 tptp.xb)) (not (tptp.aInteger0 (tptp.smndt0 tptp.xc))) (tptp.aInteger0 (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))))) (not (tptp.aInteger0 tptp.xb)) (not (tptp.aInteger0 (tptp.smndt0 tptp.xc))) (tptp.aInteger0 (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))) :rule or_pos)
% 0.40/0.71 (step t66 (cl (not (tptp.aInteger0 tptp.xb)) (not (tptp.aInteger0 (tptp.smndt0 tptp.xc))) (tptp.aInteger0 (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))) (not (or (not (tptp.aInteger0 tptp.xb)) (not (tptp.aInteger0 (tptp.smndt0 tptp.xc))) (tptp.aInteger0 (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))))) :rule reordering :premises (t65))
% 0.40/0.71 (step t67 (cl (not (or (not (tptp.aInteger0 tptp.xc)) (tptp.aInteger0 (tptp.smndt0 tptp.xc)))) (not (tptp.aInteger0 tptp.xc)) (tptp.aInteger0 (tptp.smndt0 tptp.xc))) :rule or_pos)
% 0.40/0.71 (step t68 (cl (not (tptp.aInteger0 tptp.xc)) (tptp.aInteger0 (tptp.smndt0 tptp.xc)) (not (or (not (tptp.aInteger0 tptp.xc)) (tptp.aInteger0 (tptp.smndt0 tptp.xc))))) :rule reordering :premises (t67))
% 0.40/0.71 (step t69 (cl (=> (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (tptp.aInteger0 (tptp.smndt0 W0)))) (or (not (tptp.aInteger0 tptp.xc)) (tptp.aInteger0 (tptp.smndt0 tptp.xc)))) (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (tptp.aInteger0 (tptp.smndt0 W0))))) :rule implies_neg1)
% 0.40/0.71 (anchor :step t70)
% 0.40/0.71 (assume t70.a0 (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (tptp.aInteger0 (tptp.smndt0 W0)))))
% 0.40/0.71 (step t70.t1 (cl (or (not (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (tptp.aInteger0 (tptp.smndt0 W0))))) (or (not (tptp.aInteger0 tptp.xc)) (tptp.aInteger0 (tptp.smndt0 tptp.xc))))) :rule forall_inst :args ((:= W0 tptp.xc)))
% 0.40/0.71 (step t70.t2 (cl (not (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (tptp.aInteger0 (tptp.smndt0 W0))))) (or (not (tptp.aInteger0 tptp.xc)) (tptp.aInteger0 (tptp.smndt0 tptp.xc)))) :rule or :premises (t70.t1))
% 0.40/0.71 (step t70.t3 (cl (or (not (tptp.aInteger0 tptp.xc)) (tptp.aInteger0 (tptp.smndt0 tptp.xc)))) :rule resolution :premises (t70.t2 t70.a0))
% 0.40/0.71 (step t70 (cl (not (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (tptp.aInteger0 (tptp.smndt0 W0))))) (or (not (tptp.aInteger0 tptp.xc)) (tptp.aInteger0 (tptp.smndt0 tptp.xc)))) :rule subproof :discharge (t70.a0))
% 0.40/0.71 (step t71 (cl (=> (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (tptp.aInteger0 (tptp.smndt0 W0)))) (or (not (tptp.aInteger0 tptp.xc)) (tptp.aInteger0 (tptp.smndt0 tptp.xc)))) (or (not (tptp.aInteger0 tptp.xc)) (tptp.aInteger0 (tptp.smndt0 tptp.xc)))) :rule resolution :premises (t69 t70))
% 0.40/0.71 (step t72 (cl (=> (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (tptp.aInteger0 (tptp.smndt0 W0)))) (or (not (tptp.aInteger0 tptp.xc)) (tptp.aInteger0 (tptp.smndt0 tptp.xc)))) (not (or (not (tptp.aInteger0 tptp.xc)) (tptp.aInteger0 (tptp.smndt0 tptp.xc))))) :rule implies_neg2)
% 0.40/0.71 (step t73 (cl (=> (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (tptp.aInteger0 (tptp.smndt0 W0)))) (or (not (tptp.aInteger0 tptp.xc)) (tptp.aInteger0 (tptp.smndt0 tptp.xc)))) (=> (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (tptp.aInteger0 (tptp.smndt0 W0)))) (or (not (tptp.aInteger0 tptp.xc)) (tptp.aInteger0 (tptp.smndt0 tptp.xc))))) :rule resolution :premises (t71 t72))
% 0.40/0.71 (step t74 (cl (=> (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (tptp.aInteger0 (tptp.smndt0 W0)))) (or (not (tptp.aInteger0 tptp.xc)) (tptp.aInteger0 (tptp.smndt0 tptp.xc))))) :rule contraction :premises (t73))
% 0.40/0.71 (step t75 (cl (not (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (tptp.aInteger0 (tptp.smndt0 W0))))) (or (not (tptp.aInteger0 tptp.xc)) (tptp.aInteger0 (tptp.smndt0 tptp.xc)))) :rule implies :premises (t74))
% 0.40/0.71 (step t76 (cl (not (= (forall ((W0 $$unsorted)) (=> (tptp.aInteger0 W0) (tptp.aInteger0 (tptp.smndt0 W0)))) (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (tptp.aInteger0 (tptp.smndt0 W0)))))) (not (forall ((W0 $$unsorted)) (=> (tptp.aInteger0 W0) (tptp.aInteger0 (tptp.smndt0 W0))))) (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (tptp.aInteger0 (tptp.smndt0 W0))))) :rule equiv_pos2)
% 0.40/0.71 (step t77 (cl (= (forall ((W0 $$unsorted)) (=> (tptp.aInteger0 W0) (tptp.aInteger0 (tptp.smndt0 W0)))) (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (tptp.aInteger0 (tptp.smndt0 W0)))))) :rule all_simplify)
% 0.40/0.71 (step t78 (cl (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (tptp.aInteger0 (tptp.smndt0 W0))))) :rule resolution :premises (t76 t77 a3))
% 0.40/0.71 (step t79 (cl (or (not (tptp.aInteger0 tptp.xc)) (tptp.aInteger0 (tptp.smndt0 tptp.xc)))) :rule resolution :premises (t75 t78))
% 0.40/0.71 (step t80 (cl (tptp.aInteger0 (tptp.smndt0 tptp.xc))) :rule resolution :premises (t68 t22 t79))
% 0.40/0.71 (step t81 (cl (=> (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (tptp.aInteger0 (tptp.sdtpldt0 W0 W1)))) (or (not (tptp.aInteger0 tptp.xb)) (not (tptp.aInteger0 (tptp.smndt0 tptp.xc))) (tptp.aInteger0 (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (tptp.aInteger0 (tptp.sdtpldt0 W0 W1))))) :rule implies_neg1)
% 0.40/0.71 (anchor :step t82)
% 0.40/0.71 (assume t82.a0 (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (tptp.aInteger0 (tptp.sdtpldt0 W0 W1)))))
% 0.40/0.71 (step t82.t1 (cl (or (not (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (tptp.aInteger0 (tptp.sdtpldt0 W0 W1))))) (or (not (tptp.aInteger0 tptp.xb)) (not (tptp.aInteger0 (tptp.smndt0 tptp.xc))) (tptp.aInteger0 (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))))) :rule forall_inst :args ((:= W0 tptp.xb) (:= W1 (tptp.smndt0 tptp.xc))))
% 0.40/0.71 (step t82.t2 (cl (not (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (tptp.aInteger0 (tptp.sdtpldt0 W0 W1))))) (or (not (tptp.aInteger0 tptp.xb)) (not (tptp.aInteger0 (tptp.smndt0 tptp.xc))) (tptp.aInteger0 (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))))) :rule or :premises (t82.t1))
% 0.40/0.71 (step t82.t3 (cl (or (not (tptp.aInteger0 tptp.xb)) (not (tptp.aInteger0 (tptp.smndt0 tptp.xc))) (tptp.aInteger0 (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))))) :rule resolution :premises (t82.t2 t82.a0))
% 0.40/0.71 (step t82 (cl (not (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (tptp.aInteger0 (tptp.sdtpldt0 W0 W1))))) (or (not (tptp.aInteger0 tptp.xb)) (not (tptp.aInteger0 (tptp.smndt0 tptp.xc))) (tptp.aInteger0 (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))))) :rule subproof :discharge (t82.a0))
% 0.40/0.71 (step t83 (cl (=> (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (tptp.aInteger0 (tptp.sdtpldt0 W0 W1)))) (or (not (tptp.aInteger0 tptp.xb)) (not (tptp.aInteger0 (tptp.smndt0 tptp.xc))) (tptp.aInteger0 (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))))) (or (not (tptp.aInteger0 tptp.xb)) (not (tptp.aInteger0 (tptp.smndt0 tptp.xc))) (tptp.aInteger0 (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))))) :rule resolution :premises (t81 t82))
% 0.40/0.71 (step t84 (cl (=> (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (tptp.aInteger0 (tptp.sdtpldt0 W0 W1)))) (or (not (tptp.aInteger0 tptp.xb)) (not (tptp.aInteger0 (tptp.smndt0 tptp.xc))) (tptp.aInteger0 (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))))) (not (or (not (tptp.aInteger0 tptp.xb)) (not (tptp.aInteger0 (tptp.smndt0 tptp.xc))) (tptp.aInteger0 (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))))) :rule implies_neg2)
% 0.40/0.71 (step t85 (cl (=> (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (tptp.aInteger0 (tptp.sdtpldt0 W0 W1)))) (or (not (tptp.aInteger0 tptp.xb)) (not (tptp.aInteger0 (tptp.smndt0 tptp.xc))) (tptp.aInteger0 (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))))) (=> (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (tptp.aInteger0 (tptp.sdtpldt0 W0 W1)))) (or (not (tptp.aInteger0 tptp.xb)) (not (tptp.aInteger0 (tptp.smndt0 tptp.xc))) (tptp.aInteger0 (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))))) :rule resolution :premises (t83 t84))
% 0.40/0.71 (step t86 (cl (=> (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (tptp.aInteger0 (tptp.sdtpldt0 W0 W1)))) (or (not (tptp.aInteger0 tptp.xb)) (not (tptp.aInteger0 (tptp.smndt0 tptp.xc))) (tptp.aInteger0 (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))))) :rule contraction :premises (t85))
% 0.40/0.71 (step t87 (cl (not (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (tptp.aInteger0 (tptp.sdtpldt0 W0 W1))))) (or (not (tptp.aInteger0 tptp.xb)) (not (tptp.aInteger0 (tptp.smndt0 tptp.xc))) (tptp.aInteger0 (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))))) :rule implies :premises (t86))
% 0.40/0.71 (step t88 (cl (not (= (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aInteger0 W0) (tptp.aInteger0 W1)) (tptp.aInteger0 (tptp.sdtpldt0 W0 W1)))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (tptp.aInteger0 (tptp.sdtpldt0 W0 W1)))))) (not (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aInteger0 W0) (tptp.aInteger0 W1)) (tptp.aInteger0 (tptp.sdtpldt0 W0 W1))))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (tptp.aInteger0 (tptp.sdtpldt0 W0 W1))))) :rule equiv_pos2)
% 0.40/0.71 (step t89 (cl (= (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aInteger0 W0) (tptp.aInteger0 W1)) (tptp.aInteger0 (tptp.sdtpldt0 W0 W1)))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (tptp.aInteger0 (tptp.sdtpldt0 W0 W1)))))) :rule all_simplify)
% 0.40/0.71 (step t90 (cl (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (tptp.aInteger0 (tptp.sdtpldt0 W0 W1))))) :rule resolution :premises (t88 t89 a4))
% 0.40/0.71 (step t91 (cl (or (not (tptp.aInteger0 tptp.xb)) (not (tptp.aInteger0 (tptp.smndt0 tptp.xc))) (tptp.aInteger0 (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))))) :rule resolution :premises (t87 t90))
% 0.40/0.71 (step t92 (cl (tptp.aInteger0 (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))) :rule resolution :premises (t66 t20 t80 t91))
% 0.40/0.71 (step t93 (cl (=> (forall ((W0 $$unsorted) (BOUND_VARIABLE_991 $$unsorted)) (or (not (tptp.aInteger0 W0)) (= (tptp.aDivisorOf0 BOUND_VARIABLE_991 W0) (and (tptp.aInteger0 BOUND_VARIABLE_991) (not (= tptp.sz00 BOUND_VARIABLE_991)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= W0 (tptp.sdtasdt0 BOUND_VARIABLE_991 W2)))))))))) (or (not (tptp.aInteger0 (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))) (= (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))) (and (tptp.aInteger0 tptp.xq) (not (= tptp.sz00 tptp.xq)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)) (tptp.sdtasdt0 tptp.xq W2)))))))))) (forall ((W0 $$unsorted) (BOUND_VARIABLE_991 $$unsorted)) (or (not (tptp.aInteger0 W0)) (= (tptp.aDivisorOf0 BOUND_VARIABLE_991 W0) (and (tptp.aInteger0 BOUND_VARIABLE_991) (not (= tptp.sz00 BOUND_VARIABLE_991)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= W0 (tptp.sdtasdt0 BOUND_VARIABLE_991 W2))))))))))) :rule implies_neg1)
% 0.40/0.71 (anchor :step t94)
% 0.40/0.71 (assume t94.a0 (forall ((W0 $$unsorted) (BOUND_VARIABLE_991 $$unsorted)) (or (not (tptp.aInteger0 W0)) (= (tptp.aDivisorOf0 BOUND_VARIABLE_991 W0) (and (tptp.aInteger0 BOUND_VARIABLE_991) (not (= tptp.sz00 BOUND_VARIABLE_991)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= W0 (tptp.sdtasdt0 BOUND_VARIABLE_991 W2)))))))))))
% 0.40/0.71 (step t94.t1 (cl (or (not (forall ((W0 $$unsorted) (BOUND_VARIABLE_991 $$unsorted)) (or (not (tptp.aInteger0 W0)) (= (tptp.aDivisorOf0 BOUND_VARIABLE_991 W0) (and (tptp.aInteger0 BOUND_VARIABLE_991) (not (= tptp.sz00 BOUND_VARIABLE_991)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= W0 (tptp.sdtasdt0 BOUND_VARIABLE_991 W2))))))))))) (or (not (tptp.aInteger0 (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))) (= (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))) (and (tptp.aInteger0 tptp.xq) (not (= tptp.sz00 tptp.xq)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)) (tptp.sdtasdt0 tptp.xq W2))))))))))) :rule forall_inst :args ((:= W0 (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))) (:= BOUND_VARIABLE_991 tptp.xq)))
% 0.40/0.71 (step t94.t2 (cl (not (forall ((W0 $$unsorted) (BOUND_VARIABLE_991 $$unsorted)) (or (not (tptp.aInteger0 W0)) (= (tptp.aDivisorOf0 BOUND_VARIABLE_991 W0) (and (tptp.aInteger0 BOUND_VARIABLE_991) (not (= tptp.sz00 BOUND_VARIABLE_991)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= W0 (tptp.sdtasdt0 BOUND_VARIABLE_991 W2))))))))))) (or (not (tptp.aInteger0 (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))) (= (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))) (and (tptp.aInteger0 tptp.xq) (not (= tptp.sz00 tptp.xq)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)) (tptp.sdtasdt0 tptp.xq W2)))))))))) :rule or :premises (t94.t1))
% 0.40/0.71 (step t94.t3 (cl (or (not (tptp.aInteger0 (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))) (= (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))) (and (tptp.aInteger0 tptp.xq) (not (= tptp.sz00 tptp.xq)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)) (tptp.sdtasdt0 tptp.xq W2)))))))))) :rule resolution :premises (t94.t2 t94.a0))
% 0.40/0.71 (step t94 (cl (not (forall ((W0 $$unsorted) (BOUND_VARIABLE_991 $$unsorted)) (or (not (tptp.aInteger0 W0)) (= (tptp.aDivisorOf0 BOUND_VARIABLE_991 W0) (and (tptp.aInteger0 BOUND_VARIABLE_991) (not (= tptp.sz00 BOUND_VARIABLE_991)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= W0 (tptp.sdtasdt0 BOUND_VARIABLE_991 W2))))))))))) (or (not (tptp.aInteger0 (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))) (= (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))) (and (tptp.aInteger0 tptp.xq) (not (= tptp.sz00 tptp.xq)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)) (tptp.sdtasdt0 tptp.xq W2)))))))))) :rule subproof :discharge (t94.a0))
% 0.40/0.71 (step t95 (cl (=> (forall ((W0 $$unsorted) (BOUND_VARIABLE_991 $$unsorted)) (or (not (tptp.aInteger0 W0)) (= (tptp.aDivisorOf0 BOUND_VARIABLE_991 W0) (and (tptp.aInteger0 BOUND_VARIABLE_991) (not (= tptp.sz00 BOUND_VARIABLE_991)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= W0 (tptp.sdtasdt0 BOUND_VARIABLE_991 W2)))))))))) (or (not (tptp.aInteger0 (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))) (= (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))) (and (tptp.aInteger0 tptp.xq) (not (= tptp.sz00 tptp.xq)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)) (tptp.sdtasdt0 tptp.xq W2)))))))))) (or (not (tptp.aInteger0 (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))) (= (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))) (and (tptp.aInteger0 tptp.xq) (not (= tptp.sz00 tptp.xq)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)) (tptp.sdtasdt0 tptp.xq W2)))))))))) :rule resolution :premises (t93 t94))
% 0.40/0.71 (step t96 (cl (=> (forall ((W0 $$unsorted) (BOUND_VARIABLE_991 $$unsorted)) (or (not (tptp.aInteger0 W0)) (= (tptp.aDivisorOf0 BOUND_VARIABLE_991 W0) (and (tptp.aInteger0 BOUND_VARIABLE_991) (not (= tptp.sz00 BOUND_VARIABLE_991)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= W0 (tptp.sdtasdt0 BOUND_VARIABLE_991 W2)))))))))) (or (not (tptp.aInteger0 (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))) (= (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))) (and (tptp.aInteger0 tptp.xq) (not (= tptp.sz00 tptp.xq)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)) (tptp.sdtasdt0 tptp.xq W2)))))))))) (not (or (not (tptp.aInteger0 (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))) (= (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))) (and (tptp.aInteger0 tptp.xq) (not (= tptp.sz00 tptp.xq)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)) (tptp.sdtasdt0 tptp.xq W2))))))))))) :rule implies_neg2)
% 0.40/0.71 (step t97 (cl (=> (forall ((W0 $$unsorted) (BOUND_VARIABLE_991 $$unsorted)) (or (not (tptp.aInteger0 W0)) (= (tptp.aDivisorOf0 BOUND_VARIABLE_991 W0) (and (tptp.aInteger0 BOUND_VARIABLE_991) (not (= tptp.sz00 BOUND_VARIABLE_991)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= W0 (tptp.sdtasdt0 BOUND_VARIABLE_991 W2)))))))))) (or (not (tptp.aInteger0 (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))) (= (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))) (and (tptp.aInteger0 tptp.xq) (not (= tptp.sz00 tptp.xq)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)) (tptp.sdtasdt0 tptp.xq W2)))))))))) (=> (forall ((W0 $$unsorted) (BOUND_VARIABLE_991 $$unsorted)) (or (not (tptp.aInteger0 W0)) (= (tptp.aDivisorOf0 BOUND_VARIABLE_991 W0) (and (tptp.aInteger0 BOUND_VARIABLE_991) (not (= tptp.sz00 BOUND_VARIABLE_991)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= W0 (tptp.sdtasdt0 BOUND_VARIABLE_991 W2)))))))))) (or (not (tptp.aInteger0 (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))) (= (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))) (and (tptp.aInteger0 tptp.xq) (not (= tptp.sz00 tptp.xq)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)) (tptp.sdtasdt0 tptp.xq W2))))))))))) :rule resolution :premises (t95 t96))
% 0.40/0.71 (step t98 (cl (=> (forall ((W0 $$unsorted) (BOUND_VARIABLE_991 $$unsorted)) (or (not (tptp.aInteger0 W0)) (= (tptp.aDivisorOf0 BOUND_VARIABLE_991 W0) (and (tptp.aInteger0 BOUND_VARIABLE_991) (not (= tptp.sz00 BOUND_VARIABLE_991)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= W0 (tptp.sdtasdt0 BOUND_VARIABLE_991 W2)))))))))) (or (not (tptp.aInteger0 (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))) (= (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))) (and (tptp.aInteger0 tptp.xq) (not (= tptp.sz00 tptp.xq)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)) (tptp.sdtasdt0 tptp.xq W2))))))))))) :rule contraction :premises (t97))
% 0.40/0.71 (step t99 (cl (not (forall ((W0 $$unsorted) (BOUND_VARIABLE_991 $$unsorted)) (or (not (tptp.aInteger0 W0)) (= (tptp.aDivisorOf0 BOUND_VARIABLE_991 W0) (and (tptp.aInteger0 BOUND_VARIABLE_991) (not (= tptp.sz00 BOUND_VARIABLE_991)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= W0 (tptp.sdtasdt0 BOUND_VARIABLE_991 W2))))))))))) (or (not (tptp.aInteger0 (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))) (= (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))) (and (tptp.aInteger0 tptp.xq) (not (= tptp.sz00 tptp.xq)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)) (tptp.sdtasdt0 tptp.xq W2)))))))))) :rule implies :premises (t98))
% 0.40/0.71 (step t100 (cl (not (= (forall ((W0 $$unsorted)) (=> (tptp.aInteger0 W0) (forall ((W1 $$unsorted)) (= (tptp.aDivisorOf0 W1 W0) (and (tptp.aInteger0 W1) (not (= W1 tptp.sz00)) (exists ((W2 $$unsorted)) (and (tptp.aInteger0 W2) (= (tptp.sdtasdt0 W1 W2) W0)))))))) (forall ((W0 $$unsorted) (BOUND_VARIABLE_991 $$unsorted)) (or (not (tptp.aInteger0 W0)) (= (tptp.aDivisorOf0 BOUND_VARIABLE_991 W0) (and (tptp.aInteger0 BOUND_VARIABLE_991) (not (= tptp.sz00 BOUND_VARIABLE_991)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= W0 (tptp.sdtasdt0 BOUND_VARIABLE_991 W2)))))))))))) (not (forall ((W0 $$unsorted)) (=> (tptp.aInteger0 W0) (forall ((W1 $$unsorted)) (= (tptp.aDivisorOf0 W1 W0) (and (tptp.aInteger0 W1) (not (= W1 tptp.sz00)) (exists ((W2 $$unsorted)) (and (tptp.aInteger0 W2) (= (tptp.sdtasdt0 W1 W2) W0))))))))) (forall ((W0 $$unsorted) (BOUND_VARIABLE_991 $$unsorted)) (or (not (tptp.aInteger0 W0)) (= (tptp.aDivisorOf0 BOUND_VARIABLE_991 W0) (and (tptp.aInteger0 BOUND_VARIABLE_991) (not (= tptp.sz00 BOUND_VARIABLE_991)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= W0 (tptp.sdtasdt0 BOUND_VARIABLE_991 W2))))))))))) :rule equiv_pos2)
% 0.40/0.71 (anchor :step t101 :args ((W0 $$unsorted) (:= W0 W0)))
% 0.40/0.71 (step t101.t1 (cl (= W0 W0)) :rule refl)
% 0.40/0.71 (step t101.t2 (cl (= (tptp.aInteger0 W0) (tptp.aInteger0 W0))) :rule refl)
% 0.40/0.71 (anchor :step t101.t3 :args ((W1 $$unsorted) (:= W1 W1)))
% 0.40/0.71 (step t101.t3.t1 (cl (= W1 W1)) :rule refl)
% 0.40/0.71 (step t101.t3.t2 (cl (= (tptp.aDivisorOf0 W1 W0) (tptp.aDivisorOf0 W1 W0))) :rule refl)
% 0.40/0.71 (step t101.t3.t3 (cl (= (tptp.aInteger0 W1) (tptp.aInteger0 W1))) :rule refl)
% 0.40/0.71 (step t101.t3.t4 (cl (= (= W1 tptp.sz00) (= tptp.sz00 W1))) :rule all_simplify)
% 0.40/0.71 (step t101.t3.t5 (cl (= (not (= W1 tptp.sz00)) (not (= tptp.sz00 W1)))) :rule cong :premises (t101.t3.t4))
% 0.40/0.71 (anchor :step t101.t3.t6 :args ((W2 $$unsorted) (:= W2 W2)))
% 0.40/0.71 (step t101.t3.t6.t1 (cl (= W2 W2)) :rule refl)
% 0.40/0.71 (step t101.t3.t6.t2 (cl (= (tptp.aInteger0 W2) (tptp.aInteger0 W2))) :rule refl)
% 0.40/0.71 (step t101.t3.t6.t3 (cl (= (= (tptp.sdtasdt0 W1 W2) W0) (= W0 (tptp.sdtasdt0 W1 W2)))) :rule all_simplify)
% 0.40/0.71 (step t101.t3.t6.t4 (cl (= (and (tptp.aInteger0 W2) (= (tptp.sdtasdt0 W1 W2) W0)) (and (tptp.aInteger0 W2) (= W0 (tptp.sdtasdt0 W1 W2))))) :rule cong :premises (t101.t3.t6.t2 t101.t3.t6.t3))
% 0.40/0.71 (step t101.t3.t6 (cl (= (exists ((W2 $$unsorted)) (and (tptp.aInteger0 W2) (= (tptp.sdtasdt0 W1 W2) W0))) (exists ((W2 $$unsorted)) (and (tptp.aInteger0 W2) (= W0 (tptp.sdtasdt0 W1 W2)))))) :rule bind)
% 0.40/0.71 (step t101.t3.t7 (cl (= (exists ((W2 $$unsorted)) (and (tptp.aInteger0 W2) (= W0 (tptp.sdtasdt0 W1 W2)))) (not (forall ((W2 $$unsorted)) (not (and (tptp.aInteger0 W2) (= W0 (tptp.sdtasdt0 W1 W2)))))))) :rule all_simplify)
% 0.40/0.71 (step t101.t3.t8 (cl (= (forall ((W2 $$unsorted)) (not (and (tptp.aInteger0 W2) (= W0 (tptp.sdtasdt0 W1 W2))))) (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= W0 (tptp.sdtasdt0 W1 W2))))))) :rule all_simplify)
% 0.40/0.71 (step t101.t3.t9 (cl (= (not (forall ((W2 $$unsorted)) (not (and (tptp.aInteger0 W2) (= W0 (tptp.sdtasdt0 W1 W2)))))) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= W0 (tptp.sdtasdt0 W1 W2)))))))) :rule cong :premises (t101.t3.t8))
% 0.40/0.71 (step t101.t3.t10 (cl (= (exists ((W2 $$unsorted)) (and (tptp.aInteger0 W2) (= W0 (tptp.sdtasdt0 W1 W2)))) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= W0 (tptp.sdtasdt0 W1 W2)))))))) :rule trans :premises (t101.t3.t7 t101.t3.t9))
% 0.40/0.71 (step t101.t3.t11 (cl (= (exists ((W2 $$unsorted)) (and (tptp.aInteger0 W2) (= (tptp.sdtasdt0 W1 W2) W0))) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= W0 (tptp.sdtasdt0 W1 W2)))))))) :rule trans :premises (t101.t3.t6 t101.t3.t10))
% 0.40/0.71 (step t101.t3.t12 (cl (= (and (tptp.aInteger0 W1) (not (= W1 tptp.sz00)) (exists ((W2 $$unsorted)) (and (tptp.aInteger0 W2) (= (tptp.sdtasdt0 W1 W2) W0)))) (and (tptp.aInteger0 W1) (not (= tptp.sz00 W1)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= W0 (tptp.sdtasdt0 W1 W2))))))))) :rule cong :premises (t101.t3.t3 t101.t3.t5 t101.t3.t11))
% 0.40/0.71 (step t101.t3.t13 (cl (= (= (tptp.aDivisorOf0 W1 W0) (and (tptp.aInteger0 W1) (not (= W1 tptp.sz00)) (exists ((W2 $$unsorted)) (and (tptp.aInteger0 W2) (= (tptp.sdtasdt0 W1 W2) W0))))) (= (tptp.aDivisorOf0 W1 W0) (and (tptp.aInteger0 W1) (not (= tptp.sz00 W1)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= W0 (tptp.sdtasdt0 W1 W2)))))))))) :rule cong :premises (t101.t3.t2 t101.t3.t12))
% 0.40/0.71 (step t101.t3 (cl (= (forall ((W1 $$unsorted)) (= (tptp.aDivisorOf0 W1 W0) (and (tptp.aInteger0 W1) (not (= W1 tptp.sz00)) (exists ((W2 $$unsorted)) (and (tptp.aInteger0 W2) (= (tptp.sdtasdt0 W1 W2) W0)))))) (forall ((W1 $$unsorted)) (= (tptp.aDivisorOf0 W1 W0) (and (tptp.aInteger0 W1) (not (= tptp.sz00 W1)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= W0 (tptp.sdtasdt0 W1 W2))))))))))) :rule bind)
% 0.40/0.71 (step t101.t4 (cl (= (=> (tptp.aInteger0 W0) (forall ((W1 $$unsorted)) (= (tptp.aDivisorOf0 W1 W0) (and (tptp.aInteger0 W1) (not (= W1 tptp.sz00)) (exists ((W2 $$unsorted)) (and (tptp.aInteger0 W2) (= (tptp.sdtasdt0 W1 W2) W0))))))) (=> (tptp.aInteger0 W0) (forall ((W1 $$unsorted)) (= (tptp.aDivisorOf0 W1 W0) (and (tptp.aInteger0 W1) (not (= tptp.sz00 W1)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= W0 (tptp.sdtasdt0 W1 W2)))))))))))) :rule cong :premises (t101.t2 t101.t3))
% 0.40/0.71 (step t101 (cl (= (forall ((W0 $$unsorted)) (=> (tptp.aInteger0 W0) (forall ((W1 $$unsorted)) (= (tptp.aDivisorOf0 W1 W0) (and (tptp.aInteger0 W1) (not (= W1 tptp.sz00)) (exists ((W2 $$unsorted)) (and (tptp.aInteger0 W2) (= (tptp.sdtasdt0 W1 W2) W0)))))))) (forall ((W0 $$unsorted)) (=> (tptp.aInteger0 W0) (forall ((W1 $$unsorted)) (= (tptp.aDivisorOf0 W1 W0) (and (tptp.aInteger0 W1) (not (= tptp.sz00 W1)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= W0 (tptp.sdtasdt0 W1 W2))))))))))))) :rule bind)
% 0.40/0.71 (step t102 (cl (= (forall ((W0 $$unsorted)) (=> (tptp.aInteger0 W0) (forall ((W1 $$unsorted)) (= (tptp.aDivisorOf0 W1 W0) (and (tptp.aInteger0 W1) (not (= tptp.sz00 W1)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= W0 (tptp.sdtasdt0 W1 W2))))))))))) (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (forall ((W1 $$unsorted)) (= (tptp.aDivisorOf0 W1 W0) (and (tptp.aInteger0 W1) (not (= tptp.sz00 W1)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= W0 (tptp.sdtasdt0 W1 W2))))))))))))) :rule all_simplify)
% 0.40/0.71 (step t103 (cl (= (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (forall ((W1 $$unsorted)) (= (tptp.aDivisorOf0 W1 W0) (and (tptp.aInteger0 W1) (not (= tptp.sz00 W1)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= W0 (tptp.sdtasdt0 W1 W2))))))))))) (forall ((W0 $$unsorted) (BOUND_VARIABLE_991 $$unsorted)) (or (not (tptp.aInteger0 W0)) (= (tptp.aDivisorOf0 BOUND_VARIABLE_991 W0) (and (tptp.aInteger0 BOUND_VARIABLE_991) (not (= tptp.sz00 BOUND_VARIABLE_991)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= W0 (tptp.sdtasdt0 BOUND_VARIABLE_991 W2)))))))))))) :rule all_simplify)
% 0.40/0.71 (step t104 (cl (= (forall ((W0 $$unsorted)) (=> (tptp.aInteger0 W0) (forall ((W1 $$unsorted)) (= (tptp.aDivisorOf0 W1 W0) (and (tptp.aInteger0 W1) (not (= tptp.sz00 W1)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= W0 (tptp.sdtasdt0 W1 W2))))))))))) (forall ((W0 $$unsorted) (BOUND_VARIABLE_991 $$unsorted)) (or (not (tptp.aInteger0 W0)) (= (tptp.aDivisorOf0 BOUND_VARIABLE_991 W0) (and (tptp.aInteger0 BOUND_VARIABLE_991) (not (= tptp.sz00 BOUND_VARIABLE_991)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= W0 (tptp.sdtasdt0 BOUND_VARIABLE_991 W2)))))))))))) :rule trans :premises (t102 t103))
% 0.40/0.71 (step t105 (cl (= (forall ((W0 $$unsorted)) (=> (tptp.aInteger0 W0) (forall ((W1 $$unsorted)) (= (tptp.aDivisorOf0 W1 W0) (and (tptp.aInteger0 W1) (not (= W1 tptp.sz00)) (exists ((W2 $$unsorted)) (and (tptp.aInteger0 W2) (= (tptp.sdtasdt0 W1 W2) W0)))))))) (forall ((W0 $$unsorted) (BOUND_VARIABLE_991 $$unsorted)) (or (not (tptp.aInteger0 W0)) (= (tptp.aDivisorOf0 BOUND_VARIABLE_991 W0) (and (tptp.aInteger0 BOUND_VARIABLE_991) (not (= tptp.sz00 BOUND_VARIABLE_991)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= W0 (tptp.sdtasdt0 BOUND_VARIABLE_991 W2)))))))))))) :rule trans :premises (t101 t104))
% 0.40/0.71 (step t106 (cl (forall ((W0 $$unsorted) (BOUND_VARIABLE_991 $$unsorted)) (or (not (tptp.aInteger0 W0)) (= (tptp.aDivisorOf0 BOUND_VARIABLE_991 W0) (and (tptp.aInteger0 BOUND_VARIABLE_991) (not (= tptp.sz00 BOUND_VARIABLE_991)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= W0 (tptp.sdtasdt0 BOUND_VARIABLE_991 W2))))))))))) :rule resolution :premises (t100 t105 a17))
% 0.40/0.71 (step t107 (cl (or (not (tptp.aInteger0 (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)))) (= (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))) (and (tptp.aInteger0 tptp.xq) (not (= tptp.sz00 tptp.xq)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc)) (tptp.sdtasdt0 tptp.xq W2)))))))))) :rule resolution :premises (t99 t106))
% 0.40/0.71 (step t108 (cl) :rule resolution :premises (t2 t64 t92 t107))
% 0.40/0.71
% 0.40/0.71 % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.K503LsWleh/cvc5---1.0.5_20282.smt2
% 0.40/0.71 % cvc5---1.0.5 exiting
% 0.40/0.72 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------