%------------------------------------------------------------------------------
% File     : cvc5---1.0.5
% Problem  : NUM434+1 : TPTP v8.2.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : do_cvc5 %s %d

% Computer : n026.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:25 EDT 2024

% Result   : Theorem 0.47s 0.64s
% Output   : Proof 0.47s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.13  % Problem    : NUM434+1 : TPTP v8.2.0. Released v4.0.0.
% 0.10/0.14  % Command    : do_cvc5 %s %d
% 0.14/0.35  % Computer : n026.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Tue May 28 01:20:39 EDT 2024
% 0.14/0.36  % CPUTime    : 
% 0.22/0.51  %----Proving TF0_NAR, FOF, or CNF
% 0.47/0.64  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.47/0.64  % SZS status Theorem for /export/starexec/sandbox/tmp/tmp.D06J24rJzH/cvc5---1.0.5_22987.smt2
% 0.47/0.64  % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.D06J24rJzH/cvc5---1.0.5_22987.smt2
% 0.47/0.64  (assume a0 (forall ((W0 $$unsorted)) (=> (tptp.aInteger0 W0) true)))
% 0.47/0.64  (assume a1 (tptp.aInteger0 tptp.sz00))
% 0.47/0.64  (assume a2 (tptp.aInteger0 tptp.sz10))
% 0.47/0.64  (assume a3 (forall ((W0 $$unsorted)) (=> (tptp.aInteger0 W0) (tptp.aInteger0 (tptp.smndt0 W0)))))
% 0.47/0.64  (assume a4 (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aInteger0 W0) (tptp.aInteger0 W1)) (tptp.aInteger0 (tptp.sdtpldt0 W0 W1)))))
% 0.47/0.64  (assume a5 (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aInteger0 W0) (tptp.aInteger0 W1)) (tptp.aInteger0 (tptp.sdtasdt0 W0 W1)))))
% 0.47/0.64  (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.47/0.64  (assume a7 (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aInteger0 W0) (tptp.aInteger0 W1)) (= (tptp.sdtpldt0 W0 W1) (tptp.sdtpldt0 W1 W0)))))
% 0.47/0.64  (assume a8 (forall ((W0 $$unsorted)) (=> (tptp.aInteger0 W0) (and (= (tptp.sdtpldt0 W0 tptp.sz00) W0) (= W0 (tptp.sdtpldt0 tptp.sz00 W0))))))
% 0.47/0.64  (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.47/0.64  (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.47/0.64  (assume a11 (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aInteger0 W0) (tptp.aInteger0 W1)) (= (tptp.sdtasdt0 W0 W1) (tptp.sdtasdt0 W1 W0)))))
% 0.47/0.64  (assume a12 (forall ((W0 $$unsorted)) (=> (tptp.aInteger0 W0) (and (= (tptp.sdtasdt0 W0 tptp.sz10) W0) (= W0 (tptp.sdtasdt0 tptp.sz10 W0))))))
% 0.47/0.64  (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.47/0.64  (assume a14 (forall ((W0 $$unsorted)) (=> (tptp.aInteger0 W0) (and (= (tptp.sdtasdt0 W0 tptp.sz00) tptp.sz00) (= tptp.sz00 (tptp.sdtasdt0 tptp.sz00 W0))))))
% 0.47/0.64  (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.47/0.64  (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.47/0.64  (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.47/0.64  (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.47/0.64  (assume a19 (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aInteger0 W0) (tptp.aInteger0 W1) (not (= W1 tptp.sz00))) (tptp.sdteqdtlpzmzozddtrp0 W0 W0 W1))))
% 0.47/0.64  (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.47/0.64  (assume a21 (forall ((W0 $$unsorted) (W1 $$unsorted) (W2 $$unsorted) (W3 $$unsorted)) (=> (and (tptp.aInteger0 W0) (tptp.aInteger0 W1) (tptp.aInteger0 W2) (not (= W2 tptp.sz00)) (tptp.aInteger0 W3)) (=> (and (tptp.sdteqdtlpzmzozddtrp0 W0 W1 W2) (tptp.sdteqdtlpzmzozddtrp0 W1 W3 W2)) (tptp.sdteqdtlpzmzozddtrp0 W0 W3 W2)))))
% 0.47/0.64  (assume a22 (and (tptp.aInteger0 tptp.xa) (tptp.aInteger0 tptp.xb) (tptp.aInteger0 tptp.xp) (not (= tptp.xp tptp.sz00)) (tptp.aInteger0 tptp.xq) (not (= tptp.xq tptp.sz00))))
% 0.47/0.64  (assume a23 (tptp.sdteqdtlpzmzozddtrp0 tptp.xa tptp.xb (tptp.sdtasdt0 tptp.xp tptp.xq)))
% 0.47/0.64  (assume a24 (not (exists ((W0 $$unsorted)) (and (tptp.aInteger0 W0) (= (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))))))
% 0.47/0.64  (assume a25 true)
% 0.47/0.64  (step t1 (cl (not (or (not (tptp.aInteger0 (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))) (= (tptp.aDivisorOf0 (tptp.sdtasdt0 tptp.xp tptp.xq) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))) (and (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq)) (not (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq))) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2)))))))))) (not (tptp.aInteger0 (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))) (= (tptp.aDivisorOf0 (tptp.sdtasdt0 tptp.xp tptp.xq) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))) (and (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq)) (not (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq))) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2))))))))) :rule or_pos)
% 0.47/0.64  (step t2 (cl (not (tptp.aInteger0 (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))) (= (tptp.aDivisorOf0 (tptp.sdtasdt0 tptp.xp tptp.xq) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))) (and (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq)) (not (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq))) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2)))))))) (not (or (not (tptp.aInteger0 (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))) (= (tptp.aDivisorOf0 (tptp.sdtasdt0 tptp.xp tptp.xq) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))) (and (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq)) (not (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq))) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2))))))))))) :rule reordering :premises (t1))
% 0.47/0.64  (step t3 (cl (not (= (tptp.aDivisorOf0 (tptp.sdtasdt0 tptp.xp tptp.xq) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))) (and (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq)) (not (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq))) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2))))))))) (not (tptp.aDivisorOf0 (tptp.sdtasdt0 tptp.xp tptp.xq) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))) (and (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq)) (not (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq))) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2)))))))) :rule equiv_pos2)
% 0.47/0.64  (step t4 (cl (not (tptp.aDivisorOf0 (tptp.sdtasdt0 tptp.xp tptp.xq) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))) (and (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq)) (not (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq))) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2))))))) (not (= (tptp.aDivisorOf0 (tptp.sdtasdt0 tptp.xp tptp.xq) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))) (and (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq)) (not (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq))) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2)))))))))) :rule reordering :premises (t3))
% 0.47/0.64  (step t5 (cl (not (= (tptp.sdteqdtlpzmzozddtrp0 tptp.xa tptp.xb (tptp.sdtasdt0 tptp.xp tptp.xq)) (tptp.aDivisorOf0 (tptp.sdtasdt0 tptp.xp tptp.xq) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))))) (not (tptp.sdteqdtlpzmzozddtrp0 tptp.xa tptp.xb (tptp.sdtasdt0 tptp.xp tptp.xq))) (tptp.aDivisorOf0 (tptp.sdtasdt0 tptp.xp tptp.xq) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))) :rule equiv_pos2)
% 0.47/0.64  (step t6 (cl (not (tptp.sdteqdtlpzmzozddtrp0 tptp.xa tptp.xb (tptp.sdtasdt0 tptp.xp tptp.xq))) (tptp.aDivisorOf0 (tptp.sdtasdt0 tptp.xp tptp.xq) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))) (not (= (tptp.sdteqdtlpzmzozddtrp0 tptp.xa tptp.xb (tptp.sdtasdt0 tptp.xp tptp.xq)) (tptp.aDivisorOf0 (tptp.sdtasdt0 tptp.xp tptp.xq) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))))) :rule reordering :premises (t5))
% 0.47/0.64  (step t7 (cl (not (or (not (tptp.aInteger0 tptp.xa)) (not (tptp.aInteger0 tptp.xb)) (not (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq))) (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq)) (= (tptp.sdteqdtlpzmzozddtrp0 tptp.xa tptp.xb (tptp.sdtasdt0 tptp.xp tptp.xq)) (tptp.aDivisorOf0 (tptp.sdtasdt0 tptp.xp tptp.xq) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))))) (not (tptp.aInteger0 tptp.xa)) (not (tptp.aInteger0 tptp.xb)) (not (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq))) (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq)) (= (tptp.sdteqdtlpzmzozddtrp0 tptp.xa tptp.xb (tptp.sdtasdt0 tptp.xp tptp.xq)) (tptp.aDivisorOf0 (tptp.sdtasdt0 tptp.xp tptp.xq) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))))) :rule or_pos)
% 0.47/0.64  (step t8 (cl (not (tptp.aInteger0 tptp.xa)) (not (tptp.aInteger0 tptp.xb)) (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq)) (not (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq))) (= (tptp.sdteqdtlpzmzozddtrp0 tptp.xa tptp.xb (tptp.sdtasdt0 tptp.xp tptp.xq)) (tptp.aDivisorOf0 (tptp.sdtasdt0 tptp.xp tptp.xq) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))) (not (or (not (tptp.aInteger0 tptp.xa)) (not (tptp.aInteger0 tptp.xb)) (not (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq))) (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq)) (= (tptp.sdteqdtlpzmzozddtrp0 tptp.xa tptp.xb (tptp.sdtasdt0 tptp.xp tptp.xq)) (tptp.aDivisorOf0 (tptp.sdtasdt0 tptp.xp tptp.xq) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))))))) :rule reordering :premises (t7))
% 0.47/0.64  (step t9 (cl (not (= (and (tptp.aInteger0 tptp.xa) (tptp.aInteger0 tptp.xb) (tptp.aInteger0 tptp.xp) (not (= tptp.xp tptp.sz00)) (tptp.aInteger0 tptp.xq) (not (= tptp.xq tptp.sz00))) (and (tptp.aInteger0 tptp.xa) (tptp.aInteger0 tptp.xb) (tptp.aInteger0 tptp.xp) (not (= tptp.sz00 tptp.xp)) (tptp.aInteger0 tptp.xq) (not (= tptp.sz00 tptp.xq))))) (not (and (tptp.aInteger0 tptp.xa) (tptp.aInteger0 tptp.xb) (tptp.aInteger0 tptp.xp) (not (= tptp.xp tptp.sz00)) (tptp.aInteger0 tptp.xq) (not (= tptp.xq tptp.sz00)))) (and (tptp.aInteger0 tptp.xa) (tptp.aInteger0 tptp.xb) (tptp.aInteger0 tptp.xp) (not (= tptp.sz00 tptp.xp)) (tptp.aInteger0 tptp.xq) (not (= tptp.sz00 tptp.xq)))) :rule equiv_pos2)
% 0.47/0.64  (step t10 (cl (= (tptp.aInteger0 tptp.xa) (tptp.aInteger0 tptp.xa))) :rule refl)
% 0.47/0.64  (step t11 (cl (= (tptp.aInteger0 tptp.xb) (tptp.aInteger0 tptp.xb))) :rule refl)
% 0.47/0.64  (step t12 (cl (= (tptp.aInteger0 tptp.xp) (tptp.aInteger0 tptp.xp))) :rule refl)
% 0.47/0.64  (step t13 (cl (= (= tptp.xp tptp.sz00) (= tptp.sz00 tptp.xp))) :rule all_simplify)
% 0.47/0.64  (step t14 (cl (= (not (= tptp.xp tptp.sz00)) (not (= tptp.sz00 tptp.xp)))) :rule cong :premises (t13))
% 0.47/0.64  (step t15 (cl (= (tptp.aInteger0 tptp.xq) (tptp.aInteger0 tptp.xq))) :rule refl)
% 0.47/0.64  (step t16 (cl (= (= tptp.xq tptp.sz00) (= tptp.sz00 tptp.xq))) :rule all_simplify)
% 0.47/0.64  (step t17 (cl (= (not (= tptp.xq tptp.sz00)) (not (= tptp.sz00 tptp.xq)))) :rule cong :premises (t16))
% 0.47/0.64  (step t18 (cl (= (and (tptp.aInteger0 tptp.xa) (tptp.aInteger0 tptp.xb) (tptp.aInteger0 tptp.xp) (not (= tptp.xp tptp.sz00)) (tptp.aInteger0 tptp.xq) (not (= tptp.xq tptp.sz00))) (and (tptp.aInteger0 tptp.xa) (tptp.aInteger0 tptp.xb) (tptp.aInteger0 tptp.xp) (not (= tptp.sz00 tptp.xp)) (tptp.aInteger0 tptp.xq) (not (= tptp.sz00 tptp.xq))))) :rule cong :premises (t10 t11 t12 t14 t15 t17))
% 0.47/0.64  (step t19 (cl (and (tptp.aInteger0 tptp.xa) (tptp.aInteger0 tptp.xb) (tptp.aInteger0 tptp.xp) (not (= tptp.sz00 tptp.xp)) (tptp.aInteger0 tptp.xq) (not (= tptp.sz00 tptp.xq)))) :rule resolution :premises (t9 t18 a22))
% 0.47/0.64  (step t20 (cl (tptp.aInteger0 tptp.xa)) :rule and :premises (t19))
% 0.47/0.64  (step t21 (cl (tptp.aInteger0 tptp.xb)) :rule and :premises (t19))
% 0.47/0.64  (step t22 (cl (not (or (not (tptp.aInteger0 tptp.xp)) (not (tptp.aInteger0 tptp.xq)) (not (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq))) (= tptp.sz00 tptp.xp) (= tptp.sz00 tptp.xq))) (not (tptp.aInteger0 tptp.xp)) (not (tptp.aInteger0 tptp.xq)) (not (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq))) (= tptp.sz00 tptp.xp) (= tptp.sz00 tptp.xq)) :rule or_pos)
% 0.47/0.64  (step t23 (cl (= tptp.sz00 tptp.xp) (= tptp.sz00 tptp.xq) (not (tptp.aInteger0 tptp.xp)) (not (tptp.aInteger0 tptp.xq)) (not (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq))) (not (or (not (tptp.aInteger0 tptp.xp)) (not (tptp.aInteger0 tptp.xq)) (not (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq))) (= tptp.sz00 tptp.xp) (= tptp.sz00 tptp.xq)))) :rule reordering :premises (t22))
% 0.47/0.64  (step t24 (cl (not (= tptp.sz00 tptp.xp))) :rule and :premises (t19))
% 0.47/0.64  (step t25 (cl (not (= tptp.sz00 tptp.xq))) :rule and :premises (t19))
% 0.47/0.64  (step t26 (cl (tptp.aInteger0 tptp.xp)) :rule and :premises (t19))
% 0.47/0.64  (step t27 (cl (tptp.aInteger0 tptp.xq)) :rule and :premises (t19))
% 0.47/0.64  (step t28 (cl (=> (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (not (= tptp.sz00 (tptp.sdtasdt0 W0 W1))) (= tptp.sz00 W0) (= tptp.sz00 W1))) (or (not (tptp.aInteger0 tptp.xp)) (not (tptp.aInteger0 tptp.xq)) (not (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq))) (= tptp.sz00 tptp.xp) (= tptp.sz00 tptp.xq))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (not (= tptp.sz00 (tptp.sdtasdt0 W0 W1))) (= tptp.sz00 W0) (= tptp.sz00 W1)))) :rule implies_neg1)
% 0.47/0.64  (anchor :step t29)
% 0.47/0.64  (assume t29.a0 (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (not (= tptp.sz00 (tptp.sdtasdt0 W0 W1))) (= tptp.sz00 W0) (= tptp.sz00 W1))))
% 0.47/0.64  (step t29.t1 (cl (or (not (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (not (= tptp.sz00 (tptp.sdtasdt0 W0 W1))) (= tptp.sz00 W0) (= tptp.sz00 W1)))) (or (not (tptp.aInteger0 tptp.xp)) (not (tptp.aInteger0 tptp.xq)) (not (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq))) (= tptp.sz00 tptp.xp) (= tptp.sz00 tptp.xq)))) :rule forall_inst :args ((:= W0 tptp.xp) (:= W1 tptp.xq)))
% 0.47/0.64  (step t29.t2 (cl (not (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (not (= tptp.sz00 (tptp.sdtasdt0 W0 W1))) (= tptp.sz00 W0) (= tptp.sz00 W1)))) (or (not (tptp.aInteger0 tptp.xp)) (not (tptp.aInteger0 tptp.xq)) (not (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq))) (= tptp.sz00 tptp.xp) (= tptp.sz00 tptp.xq))) :rule or :premises (t29.t1))
% 0.47/0.64  (step t29.t3 (cl (or (not (tptp.aInteger0 tptp.xp)) (not (tptp.aInteger0 tptp.xq)) (not (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq))) (= tptp.sz00 tptp.xp) (= tptp.sz00 tptp.xq))) :rule resolution :premises (t29.t2 t29.a0))
% 0.47/0.64  (step t29 (cl (not (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (not (= tptp.sz00 (tptp.sdtasdt0 W0 W1))) (= tptp.sz00 W0) (= tptp.sz00 W1)))) (or (not (tptp.aInteger0 tptp.xp)) (not (tptp.aInteger0 tptp.xq)) (not (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq))) (= tptp.sz00 tptp.xp) (= tptp.sz00 tptp.xq))) :rule subproof :discharge (t29.a0))
% 0.47/0.64  (step t30 (cl (=> (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (not (= tptp.sz00 (tptp.sdtasdt0 W0 W1))) (= tptp.sz00 W0) (= tptp.sz00 W1))) (or (not (tptp.aInteger0 tptp.xp)) (not (tptp.aInteger0 tptp.xq)) (not (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq))) (= tptp.sz00 tptp.xp) (= tptp.sz00 tptp.xq))) (or (not (tptp.aInteger0 tptp.xp)) (not (tptp.aInteger0 tptp.xq)) (not (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq))) (= tptp.sz00 tptp.xp) (= tptp.sz00 tptp.xq))) :rule resolution :premises (t28 t29))
% 0.47/0.64  (step t31 (cl (=> (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (not (= tptp.sz00 (tptp.sdtasdt0 W0 W1))) (= tptp.sz00 W0) (= tptp.sz00 W1))) (or (not (tptp.aInteger0 tptp.xp)) (not (tptp.aInteger0 tptp.xq)) (not (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq))) (= tptp.sz00 tptp.xp) (= tptp.sz00 tptp.xq))) (not (or (not (tptp.aInteger0 tptp.xp)) (not (tptp.aInteger0 tptp.xq)) (not (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq))) (= tptp.sz00 tptp.xp) (= tptp.sz00 tptp.xq)))) :rule implies_neg2)
% 0.47/0.64  (step t32 (cl (=> (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (not (= tptp.sz00 (tptp.sdtasdt0 W0 W1))) (= tptp.sz00 W0) (= tptp.sz00 W1))) (or (not (tptp.aInteger0 tptp.xp)) (not (tptp.aInteger0 tptp.xq)) (not (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq))) (= tptp.sz00 tptp.xp) (= tptp.sz00 tptp.xq))) (=> (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (not (= tptp.sz00 (tptp.sdtasdt0 W0 W1))) (= tptp.sz00 W0) (= tptp.sz00 W1))) (or (not (tptp.aInteger0 tptp.xp)) (not (tptp.aInteger0 tptp.xq)) (not (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq))) (= tptp.sz00 tptp.xp) (= tptp.sz00 tptp.xq)))) :rule resolution :premises (t30 t31))
% 0.47/0.64  (step t33 (cl (=> (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (not (= tptp.sz00 (tptp.sdtasdt0 W0 W1))) (= tptp.sz00 W0) (= tptp.sz00 W1))) (or (not (tptp.aInteger0 tptp.xp)) (not (tptp.aInteger0 tptp.xq)) (not (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq))) (= tptp.sz00 tptp.xp) (= tptp.sz00 tptp.xq)))) :rule contraction :premises (t32))
% 0.47/0.64  (step t34 (cl (not (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (not (= tptp.sz00 (tptp.sdtasdt0 W0 W1))) (= tptp.sz00 W0) (= tptp.sz00 W1)))) (or (not (tptp.aInteger0 tptp.xp)) (not (tptp.aInteger0 tptp.xq)) (not (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq))) (= tptp.sz00 tptp.xp) (= tptp.sz00 tptp.xq))) :rule implies :premises (t33))
% 0.47/0.64  (step t35 (cl (not (= (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))))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (not (= tptp.sz00 (tptp.sdtasdt0 W0 W1))) (= tptp.sz00 W0) (= tptp.sz00 W1))))) (not (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)))))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (not (= tptp.sz00 (tptp.sdtasdt0 W0 W1))) (= tptp.sz00 W0) (= tptp.sz00 W1)))) :rule equiv_pos2)
% 0.47/0.64  (anchor :step t36 :args ((W0 $$unsorted) (:= W0 W0) (W1 $$unsorted) (:= W1 W1)))
% 0.47/0.64  (step t36.t1 (cl (= W0 W0)) :rule refl)
% 0.47/0.64  (step t36.t2 (cl (= W1 W1)) :rule refl)
% 0.47/0.64  (step t36.t3 (cl (= (and (tptp.aInteger0 W0) (tptp.aInteger0 W1)) (and (tptp.aInteger0 W0) (tptp.aInteger0 W1)))) :rule refl)
% 0.47/0.64  (step t36.t4 (cl (= (= (tptp.sdtasdt0 W0 W1) tptp.sz00) (= tptp.sz00 (tptp.sdtasdt0 W0 W1)))) :rule all_simplify)
% 0.47/0.64  (step t36.t5 (cl (= (= W0 tptp.sz00) (= tptp.sz00 W0))) :rule all_simplify)
% 0.47/0.64  (step t36.t6 (cl (= (= W1 tptp.sz00) (= tptp.sz00 W1))) :rule all_simplify)
% 0.47/0.64  (step t36.t7 (cl (= (or (= W0 tptp.sz00) (= W1 tptp.sz00)) (or (= tptp.sz00 W0) (= tptp.sz00 W1)))) :rule cong :premises (t36.t5 t36.t6))
% 0.47/0.64  (step t36.t8 (cl (= (=> (= (tptp.sdtasdt0 W0 W1) tptp.sz00) (or (= W0 tptp.sz00) (= W1 tptp.sz00))) (=> (= tptp.sz00 (tptp.sdtasdt0 W0 W1)) (or (= tptp.sz00 W0) (= tptp.sz00 W1))))) :rule cong :premises (t36.t4 t36.t7))
% 0.47/0.64  (step t36.t9 (cl (= (=> (and (tptp.aInteger0 W0) (tptp.aInteger0 W1)) (=> (= (tptp.sdtasdt0 W0 W1) tptp.sz00) (or (= W0 tptp.sz00) (= W1 tptp.sz00)))) (=> (and (tptp.aInteger0 W0) (tptp.aInteger0 W1)) (=> (= tptp.sz00 (tptp.sdtasdt0 W0 W1)) (or (= tptp.sz00 W0) (= tptp.sz00 W1)))))) :rule cong :premises (t36.t3 t36.t8))
% 0.47/0.64  (step t36 (cl (= (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))))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aInteger0 W0) (tptp.aInteger0 W1)) (=> (= tptp.sz00 (tptp.sdtasdt0 W0 W1)) (or (= tptp.sz00 W0) (= tptp.sz00 W1))))))) :rule bind)
% 0.47/0.64  (step t37 (cl (= (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aInteger0 W0) (tptp.aInteger0 W1)) (=> (= tptp.sz00 (tptp.sdtasdt0 W0 W1)) (or (= tptp.sz00 W0) (= tptp.sz00 W1))))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (not (= tptp.sz00 (tptp.sdtasdt0 W0 W1))) (= tptp.sz00 W0) (= tptp.sz00 W1))))) :rule all_simplify)
% 0.47/0.64  (step t38 (cl (= (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))))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (not (= tptp.sz00 (tptp.sdtasdt0 W0 W1))) (= tptp.sz00 W0) (= tptp.sz00 W1))))) :rule trans :premises (t36 t37))
% 0.47/0.64  (step t39 (cl (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (not (= tptp.sz00 (tptp.sdtasdt0 W0 W1))) (= tptp.sz00 W0) (= tptp.sz00 W1)))) :rule resolution :premises (t35 t38 a16))
% 0.47/0.64  (step t40 (cl (or (not (tptp.aInteger0 tptp.xp)) (not (tptp.aInteger0 tptp.xq)) (not (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq))) (= tptp.sz00 tptp.xp) (= tptp.sz00 tptp.xq))) :rule resolution :premises (t34 t39))
% 0.47/0.64  (step t41 (cl (not (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq)))) :rule resolution :premises (t23 t24 t25 t26 t27 t40))
% 0.47/0.64  (step t42 (cl (not (or (not (tptp.aInteger0 tptp.xp)) (not (tptp.aInteger0 tptp.xq)) (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq)))) (not (tptp.aInteger0 tptp.xp)) (not (tptp.aInteger0 tptp.xq)) (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq))) :rule or_pos)
% 0.47/0.64  (step t43 (cl (not (tptp.aInteger0 tptp.xp)) (not (tptp.aInteger0 tptp.xq)) (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq)) (not (or (not (tptp.aInteger0 tptp.xp)) (not (tptp.aInteger0 tptp.xq)) (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq))))) :rule reordering :premises (t42))
% 0.47/0.64  (step t44 (cl (=> (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (tptp.aInteger0 (tptp.sdtasdt0 W0 W1)))) (or (not (tptp.aInteger0 tptp.xp)) (not (tptp.aInteger0 tptp.xq)) (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq)))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (tptp.aInteger0 (tptp.sdtasdt0 W0 W1))))) :rule implies_neg1)
% 0.47/0.64  (anchor :step t45)
% 0.47/0.64  (assume t45.a0 (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (tptp.aInteger0 (tptp.sdtasdt0 W0 W1)))))
% 0.47/0.64  (step t45.t1 (cl (or (not (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (tptp.aInteger0 (tptp.sdtasdt0 W0 W1))))) (or (not (tptp.aInteger0 tptp.xp)) (not (tptp.aInteger0 tptp.xq)) (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq))))) :rule forall_inst :args ((:= W0 tptp.xp) (:= W1 tptp.xq)))
% 0.47/0.64  (step t45.t2 (cl (not (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (tptp.aInteger0 (tptp.sdtasdt0 W0 W1))))) (or (not (tptp.aInteger0 tptp.xp)) (not (tptp.aInteger0 tptp.xq)) (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq)))) :rule or :premises (t45.t1))
% 0.47/0.64  (step t45.t3 (cl (or (not (tptp.aInteger0 tptp.xp)) (not (tptp.aInteger0 tptp.xq)) (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq)))) :rule resolution :premises (t45.t2 t45.a0))
% 0.47/0.64  (step t45 (cl (not (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (tptp.aInteger0 (tptp.sdtasdt0 W0 W1))))) (or (not (tptp.aInteger0 tptp.xp)) (not (tptp.aInteger0 tptp.xq)) (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq)))) :rule subproof :discharge (t45.a0))
% 0.47/0.64  (step t46 (cl (=> (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (tptp.aInteger0 (tptp.sdtasdt0 W0 W1)))) (or (not (tptp.aInteger0 tptp.xp)) (not (tptp.aInteger0 tptp.xq)) (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq)))) (or (not (tptp.aInteger0 tptp.xp)) (not (tptp.aInteger0 tptp.xq)) (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq)))) :rule resolution :premises (t44 t45))
% 0.47/0.64  (step t47 (cl (=> (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (tptp.aInteger0 (tptp.sdtasdt0 W0 W1)))) (or (not (tptp.aInteger0 tptp.xp)) (not (tptp.aInteger0 tptp.xq)) (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq)))) (not (or (not (tptp.aInteger0 tptp.xp)) (not (tptp.aInteger0 tptp.xq)) (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq))))) :rule implies_neg2)
% 0.47/0.64  (step t48 (cl (=> (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (tptp.aInteger0 (tptp.sdtasdt0 W0 W1)))) (or (not (tptp.aInteger0 tptp.xp)) (not (tptp.aInteger0 tptp.xq)) (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq)))) (=> (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (tptp.aInteger0 (tptp.sdtasdt0 W0 W1)))) (or (not (tptp.aInteger0 tptp.xp)) (not (tptp.aInteger0 tptp.xq)) (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq))))) :rule resolution :premises (t46 t47))
% 0.47/0.64  (step t49 (cl (=> (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (tptp.aInteger0 (tptp.sdtasdt0 W0 W1)))) (or (not (tptp.aInteger0 tptp.xp)) (not (tptp.aInteger0 tptp.xq)) (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq))))) :rule contraction :premises (t48))
% 0.47/0.64  (step t50 (cl (not (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (tptp.aInteger0 (tptp.sdtasdt0 W0 W1))))) (or (not (tptp.aInteger0 tptp.xp)) (not (tptp.aInteger0 tptp.xq)) (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq)))) :rule implies :premises (t49))
% 0.47/0.64  (step t51 (cl (not (= (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aInteger0 W0) (tptp.aInteger0 W1)) (tptp.aInteger0 (tptp.sdtasdt0 W0 W1)))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (tptp.aInteger0 (tptp.sdtasdt0 W0 W1)))))) (not (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aInteger0 W0) (tptp.aInteger0 W1)) (tptp.aInteger0 (tptp.sdtasdt0 W0 W1))))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (tptp.aInteger0 (tptp.sdtasdt0 W0 W1))))) :rule equiv_pos2)
% 0.47/0.64  (step t52 (cl (= (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aInteger0 W0) (tptp.aInteger0 W1)) (tptp.aInteger0 (tptp.sdtasdt0 W0 W1)))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (tptp.aInteger0 (tptp.sdtasdt0 W0 W1)))))) :rule all_simplify)
% 0.47/0.64  (step t53 (cl (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (tptp.aInteger0 (tptp.sdtasdt0 W0 W1))))) :rule resolution :premises (t51 t52 a5))
% 0.47/0.64  (step t54 (cl (or (not (tptp.aInteger0 tptp.xp)) (not (tptp.aInteger0 tptp.xq)) (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq)))) :rule resolution :premises (t50 t53))
% 0.47/0.64  (step t55 (cl (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq))) :rule resolution :premises (t43 t26 t27 t54))
% 0.47/0.64  (step t56 (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.xa)) (not (tptp.aInteger0 tptp.xb)) (not (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq))) (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq)) (= (tptp.sdteqdtlpzmzozddtrp0 tptp.xa tptp.xb (tptp.sdtasdt0 tptp.xp tptp.xq)) (tptp.aDivisorOf0 (tptp.sdtasdt0 tptp.xp tptp.xq) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))))) (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.47/0.64  (anchor :step t57)
% 0.47/0.64  (assume t57.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.47/0.64  (step t57.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.xa)) (not (tptp.aInteger0 tptp.xb)) (not (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq))) (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq)) (= (tptp.sdteqdtlpzmzozddtrp0 tptp.xa tptp.xb (tptp.sdtasdt0 tptp.xp tptp.xq)) (tptp.aDivisorOf0 (tptp.sdtasdt0 tptp.xp tptp.xq) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))))))) :rule forall_inst :args ((:= W0 tptp.xa) (:= W1 tptp.xb) (:= W2 (tptp.sdtasdt0 tptp.xp tptp.xq))))
% 0.47/0.64  (step t57.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.xa)) (not (tptp.aInteger0 tptp.xb)) (not (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq))) (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq)) (= (tptp.sdteqdtlpzmzozddtrp0 tptp.xa tptp.xb (tptp.sdtasdt0 tptp.xp tptp.xq)) (tptp.aDivisorOf0 (tptp.sdtasdt0 tptp.xp tptp.xq) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))))) :rule or :premises (t57.t1))
% 0.47/0.64  (step t57.t3 (cl (or (not (tptp.aInteger0 tptp.xa)) (not (tptp.aInteger0 tptp.xb)) (not (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq))) (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq)) (= (tptp.sdteqdtlpzmzozddtrp0 tptp.xa tptp.xb (tptp.sdtasdt0 tptp.xp tptp.xq)) (tptp.aDivisorOf0 (tptp.sdtasdt0 tptp.xp tptp.xq) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))))) :rule resolution :premises (t57.t2 t57.a0))
% 0.47/0.64  (step t57 (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.xa)) (not (tptp.aInteger0 tptp.xb)) (not (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq))) (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq)) (= (tptp.sdteqdtlpzmzozddtrp0 tptp.xa tptp.xb (tptp.sdtasdt0 tptp.xp tptp.xq)) (tptp.aDivisorOf0 (tptp.sdtasdt0 tptp.xp tptp.xq) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))))) :rule subproof :discharge (t57.a0))
% 0.47/0.64  (step t58 (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.xa)) (not (tptp.aInteger0 tptp.xb)) (not (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq))) (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq)) (= (tptp.sdteqdtlpzmzozddtrp0 tptp.xa tptp.xb (tptp.sdtasdt0 tptp.xp tptp.xq)) (tptp.aDivisorOf0 (tptp.sdtasdt0 tptp.xp tptp.xq) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))))) (or (not (tptp.aInteger0 tptp.xa)) (not (tptp.aInteger0 tptp.xb)) (not (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq))) (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq)) (= (tptp.sdteqdtlpzmzozddtrp0 tptp.xa tptp.xb (tptp.sdtasdt0 tptp.xp tptp.xq)) (tptp.aDivisorOf0 (tptp.sdtasdt0 tptp.xp tptp.xq) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))))) :rule resolution :premises (t56 t57))
% 0.47/0.64  (step t59 (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.xa)) (not (tptp.aInteger0 tptp.xb)) (not (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq))) (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq)) (= (tptp.sdteqdtlpzmzozddtrp0 tptp.xa tptp.xb (tptp.sdtasdt0 tptp.xp tptp.xq)) (tptp.aDivisorOf0 (tptp.sdtasdt0 tptp.xp tptp.xq) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))))) (not (or (not (tptp.aInteger0 tptp.xa)) (not (tptp.aInteger0 tptp.xb)) (not (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq))) (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq)) (= (tptp.sdteqdtlpzmzozddtrp0 tptp.xa tptp.xb (tptp.sdtasdt0 tptp.xp tptp.xq)) (tptp.aDivisorOf0 (tptp.sdtasdt0 tptp.xp tptp.xq) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))))))) :rule implies_neg2)
% 0.47/0.64  (step t60 (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.xa)) (not (tptp.aInteger0 tptp.xb)) (not (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq))) (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq)) (= (tptp.sdteqdtlpzmzozddtrp0 tptp.xa tptp.xb (tptp.sdtasdt0 tptp.xp tptp.xq)) (tptp.aDivisorOf0 (tptp.sdtasdt0 tptp.xp tptp.xq) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))))) (=> (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.xa)) (not (tptp.aInteger0 tptp.xb)) (not (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq))) (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq)) (= (tptp.sdteqdtlpzmzozddtrp0 tptp.xa tptp.xb (tptp.sdtasdt0 tptp.xp tptp.xq)) (tptp.aDivisorOf0 (tptp.sdtasdt0 tptp.xp tptp.xq) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))))))) :rule resolution :premises (t58 t59))
% 0.47/0.64  (step t61 (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.xa)) (not (tptp.aInteger0 tptp.xb)) (not (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq))) (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq)) (= (tptp.sdteqdtlpzmzozddtrp0 tptp.xa tptp.xb (tptp.sdtasdt0 tptp.xp tptp.xq)) (tptp.aDivisorOf0 (tptp.sdtasdt0 tptp.xp tptp.xq) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))))))) :rule contraction :premises (t60))
% 0.47/0.64  (step t62 (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.xa)) (not (tptp.aInteger0 tptp.xb)) (not (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq))) (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq)) (= (tptp.sdteqdtlpzmzozddtrp0 tptp.xa tptp.xb (tptp.sdtasdt0 tptp.xp tptp.xq)) (tptp.aDivisorOf0 (tptp.sdtasdt0 tptp.xp tptp.xq) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))))) :rule implies :premises (t61))
% 0.47/0.64  (step t63 (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.47/0.64  (anchor :step t64 :args ((W0 $$unsorted) (:= W0 W0) (W1 $$unsorted) (:= W1 W1) (W2 $$unsorted) (:= W2 W2)))
% 0.47/0.64  (step t64.t1 (cl (= W0 W0)) :rule refl)
% 0.47/0.64  (step t64.t2 (cl (= W1 W1)) :rule refl)
% 0.47/0.64  (step t64.t3 (cl (= W2 W2)) :rule refl)
% 0.47/0.64  (step t64.t4 (cl (= (tptp.aInteger0 W0) (tptp.aInteger0 W0))) :rule refl)
% 0.47/0.64  (step t64.t5 (cl (= (tptp.aInteger0 W1) (tptp.aInteger0 W1))) :rule refl)
% 0.47/0.64  (step t64.t6 (cl (= (tptp.aInteger0 W2) (tptp.aInteger0 W2))) :rule refl)
% 0.47/0.64  (step t64.t7 (cl (= (= W2 tptp.sz00) (= tptp.sz00 W2))) :rule all_simplify)
% 0.47/0.64  (step t64.t8 (cl (= (not (= W2 tptp.sz00)) (not (= tptp.sz00 W2)))) :rule cong :premises (t64.t7))
% 0.47/0.64  (step t64.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 (t64.t4 t64.t5 t64.t6 t64.t8))
% 0.47/0.64  (step t64.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.47/0.64  (step t64.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 (t64.t9 t64.t10))
% 0.47/0.64  (step t64 (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.47/0.64  (step t65 (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.47/0.64  (step t66 (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 (t64 t65))
% 0.47/0.64  (step t67 (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 (t63 t66 a18))
% 0.47/0.64  (step t68 (cl (or (not (tptp.aInteger0 tptp.xa)) (not (tptp.aInteger0 tptp.xb)) (not (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq))) (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq)) (= (tptp.sdteqdtlpzmzozddtrp0 tptp.xa tptp.xb (tptp.sdtasdt0 tptp.xp tptp.xq)) (tptp.aDivisorOf0 (tptp.sdtasdt0 tptp.xp tptp.xq) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))))) :rule resolution :premises (t62 t67))
% 0.47/0.64  (step t69 (cl (= (tptp.sdteqdtlpzmzozddtrp0 tptp.xa tptp.xb (tptp.sdtasdt0 tptp.xp tptp.xq)) (tptp.aDivisorOf0 (tptp.sdtasdt0 tptp.xp tptp.xq) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))))) :rule resolution :premises (t8 t20 t21 t41 t55 t68))
% 0.47/0.64  (step t70 (cl (tptp.aDivisorOf0 (tptp.sdtasdt0 tptp.xp tptp.xq) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))) :rule resolution :premises (t6 a23 t69))
% 0.47/0.64  (step t71 (cl (not (and (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq)) (not (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq))) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2)))))))) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2))))))) :rule and_pos)
% 0.47/0.64  (step t72 (cl (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2)))))) (not (and (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq)) (not (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq))) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2))))))))) :rule reordering :premises (t71))
% 0.47/0.64  (step t73 (cl (= (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))))) (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))))))) :rule hole :args ((forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))))) (= W0 W2)))
% 0.47/0.64  (step t74 (cl (= (= (= (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))))) (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2)))))) true) (= (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))))) (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2)))))))) :rule equiv_simplify)
% 0.47/0.64  (step t75 (cl (not (= (= (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))))) (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2)))))) true)) (= (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))))) (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2))))))) :rule equiv1 :premises (t74))
% 0.47/0.64  (step t76 (cl (= (= (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))))) (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2)))))) (= (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2))))) (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))))))))) :rule all_simplify)
% 0.47/0.64  (step t77 (cl (= (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2))))) (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2))))))) :rule refl)
% 0.47/0.64  (anchor :step t78 :args ((W2 $$unsorted) (:= W2 W2)))
% 0.47/0.64  (step t78.t1 (cl (= W2 W2)) :rule refl)
% 0.47/0.64  (step t78.t2 (cl (= (not (tptp.aInteger0 W2)) (not (tptp.aInteger0 W2)))) :rule refl)
% 0.47/0.64  (step t78.t3 (cl (= (= (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))) (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2)))) :rule all_simplify)
% 0.47/0.64  (step t78.t4 (cl (= (not (= (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2))))) :rule cong :premises (t78.t3))
% 0.47/0.64  (step t78.t5 (cl (= (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))))) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2)))))) :rule cong :premises (t78.t2 t78.t4))
% 0.47/0.64  (step t78 (cl (= (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))))) (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2))))))) :rule bind)
% 0.47/0.64  (step t79 (cl (= (= (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2))))) (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))))))) (= (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2))))) (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2)))))))) :rule cong :premises (t77 t78))
% 0.47/0.64  (step t80 (cl (= (= (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2))))) (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2)))))) true)) :rule all_simplify)
% 0.47/0.64  (step t81 (cl (= (= (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2))))) (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))))))) true)) :rule trans :premises (t79 t80))
% 0.47/0.64  (step t82 (cl (= (= (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))))) (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2)))))) true)) :rule trans :premises (t76 t81))
% 0.47/0.64  (step t83 (cl (= (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))))) (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2))))))) :rule resolution :premises (t75 t82))
% 0.47/0.64  (step t84 (cl (= (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))))) (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2))))))) :rule trans :premises (t73 t83))
% 0.47/0.64  (step t85 (cl (not (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))))))) (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2)))))) :rule equiv1 :premises (t84))
% 0.47/0.64  (step t86 (cl (not (= (not (exists ((W0 $$unsorted)) (and (tptp.aInteger0 W0) (= (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))))) (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))))))) (not (not (exists ((W0 $$unsorted)) (and (tptp.aInteger0 W0) (= (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))))))) (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))))))) :rule equiv_pos2)
% 0.47/0.64  (step t87 (cl (= (exists ((W0 $$unsorted)) (and (tptp.aInteger0 W0) (= (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))))) (not (forall ((W0 $$unsorted)) (not (and (tptp.aInteger0 W0) (= (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))))))))) :rule all_simplify)
% 0.47/0.64  (step t88 (cl (= (forall ((W0 $$unsorted)) (not (and (tptp.aInteger0 W0) (= (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))))) (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))))))) :rule all_simplify)
% 0.47/0.64  (step t89 (cl (= (not (forall ((W0 $$unsorted)) (not (and (tptp.aInteger0 W0) (= (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))))))) (not (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))))))))) :rule cong :premises (t88))
% 0.47/0.64  (step t90 (cl (= (exists ((W0 $$unsorted)) (and (tptp.aInteger0 W0) (= (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))))) (not (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))))))))) :rule trans :premises (t87 t89))
% 0.47/0.64  (step t91 (cl (= (not (exists ((W0 $$unsorted)) (and (tptp.aInteger0 W0) (= (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))))) (not (not (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))))))))) :rule cong :premises (t90))
% 0.47/0.64  (step t92 (cl (= (not (not (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))))))) (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))))))) :rule all_simplify)
% 0.47/0.64  (step t93 (cl (= (not (exists ((W0 $$unsorted)) (and (tptp.aInteger0 W0) (= (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))))) (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))))))) :rule trans :premises (t91 t92))
% 0.47/0.64  (step t94 (cl (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))))))) :rule resolution :premises (t86 t93 a24))
% 0.47/0.64  (step t95 (cl (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2)))))) :rule resolution :premises (t85 t94))
% 0.47/0.64  (step t96 (cl (not (and (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq)) (not (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq))) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2))))))))) :rule resolution :premises (t72 t95))
% 0.47/0.64  (step t97 (cl (not (= (tptp.aDivisorOf0 (tptp.sdtasdt0 tptp.xp tptp.xq) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))) (and (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq)) (not (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq))) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2)))))))))) :rule resolution :premises (t4 t70 t96))
% 0.47/0.64  (step t98 (cl (not (or (not (tptp.aInteger0 tptp.xa)) (not (tptp.aInteger0 (tptp.smndt0 tptp.xb))) (tptp.aInteger0 (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))))) (not (tptp.aInteger0 tptp.xa)) (not (tptp.aInteger0 (tptp.smndt0 tptp.xb))) (tptp.aInteger0 (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))) :rule or_pos)
% 0.47/0.64  (step t99 (cl (not (tptp.aInteger0 tptp.xa)) (not (tptp.aInteger0 (tptp.smndt0 tptp.xb))) (tptp.aInteger0 (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))) (not (or (not (tptp.aInteger0 tptp.xa)) (not (tptp.aInteger0 (tptp.smndt0 tptp.xb))) (tptp.aInteger0 (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))))) :rule reordering :premises (t98))
% 0.47/0.64  (step t100 (cl (not (or (not (tptp.aInteger0 tptp.xb)) (tptp.aInteger0 (tptp.smndt0 tptp.xb)))) (not (tptp.aInteger0 tptp.xb)) (tptp.aInteger0 (tptp.smndt0 tptp.xb))) :rule or_pos)
% 0.47/0.64  (step t101 (cl (not (tptp.aInteger0 tptp.xb)) (tptp.aInteger0 (tptp.smndt0 tptp.xb)) (not (or (not (tptp.aInteger0 tptp.xb)) (tptp.aInteger0 (tptp.smndt0 tptp.xb))))) :rule reordering :premises (t100))
% 0.47/0.64  (step t102 (cl (=> (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (tptp.aInteger0 (tptp.smndt0 W0)))) (or (not (tptp.aInteger0 tptp.xb)) (tptp.aInteger0 (tptp.smndt0 tptp.xb)))) (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (tptp.aInteger0 (tptp.smndt0 W0))))) :rule implies_neg1)
% 0.47/0.64  (anchor :step t103)
% 0.47/0.64  (assume t103.a0 (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (tptp.aInteger0 (tptp.smndt0 W0)))))
% 0.47/0.64  (step t103.t1 (cl (or (not (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (tptp.aInteger0 (tptp.smndt0 W0))))) (or (not (tptp.aInteger0 tptp.xb)) (tptp.aInteger0 (tptp.smndt0 tptp.xb))))) :rule forall_inst :args ((:= W0 tptp.xb)))
% 0.47/0.64  (step t103.t2 (cl (not (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (tptp.aInteger0 (tptp.smndt0 W0))))) (or (not (tptp.aInteger0 tptp.xb)) (tptp.aInteger0 (tptp.smndt0 tptp.xb)))) :rule or :premises (t103.t1))
% 0.47/0.64  (step t103.t3 (cl (or (not (tptp.aInteger0 tptp.xb)) (tptp.aInteger0 (tptp.smndt0 tptp.xb)))) :rule resolution :premises (t103.t2 t103.a0))
% 0.47/0.64  (step t103 (cl (not (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (tptp.aInteger0 (tptp.smndt0 W0))))) (or (not (tptp.aInteger0 tptp.xb)) (tptp.aInteger0 (tptp.smndt0 tptp.xb)))) :rule subproof :discharge (t103.a0))
% 0.47/0.64  (step t104 (cl (=> (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (tptp.aInteger0 (tptp.smndt0 W0)))) (or (not (tptp.aInteger0 tptp.xb)) (tptp.aInteger0 (tptp.smndt0 tptp.xb)))) (or (not (tptp.aInteger0 tptp.xb)) (tptp.aInteger0 (tptp.smndt0 tptp.xb)))) :rule resolution :premises (t102 t103))
% 0.47/0.64  (step t105 (cl (=> (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (tptp.aInteger0 (tptp.smndt0 W0)))) (or (not (tptp.aInteger0 tptp.xb)) (tptp.aInteger0 (tptp.smndt0 tptp.xb)))) (not (or (not (tptp.aInteger0 tptp.xb)) (tptp.aInteger0 (tptp.smndt0 tptp.xb))))) :rule implies_neg2)
% 0.47/0.64  (step t106 (cl (=> (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (tptp.aInteger0 (tptp.smndt0 W0)))) (or (not (tptp.aInteger0 tptp.xb)) (tptp.aInteger0 (tptp.smndt0 tptp.xb)))) (=> (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (tptp.aInteger0 (tptp.smndt0 W0)))) (or (not (tptp.aInteger0 tptp.xb)) (tptp.aInteger0 (tptp.smndt0 tptp.xb))))) :rule resolution :premises (t104 t105))
% 0.47/0.64  (step t107 (cl (=> (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (tptp.aInteger0 (tptp.smndt0 W0)))) (or (not (tptp.aInteger0 tptp.xb)) (tptp.aInteger0 (tptp.smndt0 tptp.xb))))) :rule contraction :premises (t106))
% 0.47/0.64  (step t108 (cl (not (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (tptp.aInteger0 (tptp.smndt0 W0))))) (or (not (tptp.aInteger0 tptp.xb)) (tptp.aInteger0 (tptp.smndt0 tptp.xb)))) :rule implies :premises (t107))
% 0.47/0.64  (step t109 (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.47/0.64  (step t110 (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.47/0.64  (step t111 (cl (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (tptp.aInteger0 (tptp.smndt0 W0))))) :rule resolution :premises (t109 t110 a3))
% 0.47/0.64  (step t112 (cl (or (not (tptp.aInteger0 tptp.xb)) (tptp.aInteger0 (tptp.smndt0 tptp.xb)))) :rule resolution :premises (t108 t111))
% 0.47/0.64  (step t113 (cl (tptp.aInteger0 (tptp.smndt0 tptp.xb))) :rule resolution :premises (t101 t21 t112))
% 0.47/0.64  (step t114 (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.xa)) (not (tptp.aInteger0 (tptp.smndt0 tptp.xb))) (tptp.aInteger0 (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))))) (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (tptp.aInteger0 (tptp.sdtpldt0 W0 W1))))) :rule implies_neg1)
% 0.47/0.64  (anchor :step t115)
% 0.47/0.64  (assume t115.a0 (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (tptp.aInteger0 (tptp.sdtpldt0 W0 W1)))))
% 0.47/0.64  (step t115.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.xa)) (not (tptp.aInteger0 (tptp.smndt0 tptp.xb))) (tptp.aInteger0 (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))))) :rule forall_inst :args ((:= W0 tptp.xa) (:= W1 (tptp.smndt0 tptp.xb))))
% 0.47/0.64  (step t115.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.xa)) (not (tptp.aInteger0 (tptp.smndt0 tptp.xb))) (tptp.aInteger0 (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))))) :rule or :premises (t115.t1))
% 0.47/0.64  (step t115.t3 (cl (or (not (tptp.aInteger0 tptp.xa)) (not (tptp.aInteger0 (tptp.smndt0 tptp.xb))) (tptp.aInteger0 (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))))) :rule resolution :premises (t115.t2 t115.a0))
% 0.47/0.64  (step t115 (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.xa)) (not (tptp.aInteger0 (tptp.smndt0 tptp.xb))) (tptp.aInteger0 (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))))) :rule subproof :discharge (t115.a0))
% 0.47/0.64  (step t116 (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.xa)) (not (tptp.aInteger0 (tptp.smndt0 tptp.xb))) (tptp.aInteger0 (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))))) (or (not (tptp.aInteger0 tptp.xa)) (not (tptp.aInteger0 (tptp.smndt0 tptp.xb))) (tptp.aInteger0 (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))))) :rule resolution :premises (t114 t115))
% 0.47/0.64  (step t117 (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.xa)) (not (tptp.aInteger0 (tptp.smndt0 tptp.xb))) (tptp.aInteger0 (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))))) (not (or (not (tptp.aInteger0 tptp.xa)) (not (tptp.aInteger0 (tptp.smndt0 tptp.xb))) (tptp.aInteger0 (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))))) :rule implies_neg2)
% 0.47/0.64  (step t118 (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.xa)) (not (tptp.aInteger0 (tptp.smndt0 tptp.xb))) (tptp.aInteger0 (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))))) (=> (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.xa)) (not (tptp.aInteger0 (tptp.smndt0 tptp.xb))) (tptp.aInteger0 (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))))) :rule resolution :premises (t116 t117))
% 0.47/0.64  (step t119 (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.xa)) (not (tptp.aInteger0 (tptp.smndt0 tptp.xb))) (tptp.aInteger0 (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))))) :rule contraction :premises (t118))
% 0.47/0.64  (step t120 (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.xa)) (not (tptp.aInteger0 (tptp.smndt0 tptp.xb))) (tptp.aInteger0 (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))))) :rule implies :premises (t119))
% 0.47/0.64  (step t121 (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.47/0.64  (step t122 (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.47/0.64  (step t123 (cl (forall ((W0 $$unsorted) (W1 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W1)) (tptp.aInteger0 (tptp.sdtpldt0 W0 W1))))) :rule resolution :premises (t121 t122 a4))
% 0.47/0.64  (step t124 (cl (or (not (tptp.aInteger0 tptp.xa)) (not (tptp.aInteger0 (tptp.smndt0 tptp.xb))) (tptp.aInteger0 (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))))) :rule resolution :premises (t120 t123))
% 0.47/0.64  (step t125 (cl (tptp.aInteger0 (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))) :rule resolution :premises (t99 t20 t113 t124))
% 0.47/0.64  (step t126 (cl (=> (forall ((W0 $$unsorted) (BOUND_VARIABLE_1004 $$unsorted)) (or (not (tptp.aInteger0 W0)) (= (tptp.aDivisorOf0 BOUND_VARIABLE_1004 W0) (and (tptp.aInteger0 BOUND_VARIABLE_1004) (not (= tptp.sz00 BOUND_VARIABLE_1004)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= W0 (tptp.sdtasdt0 BOUND_VARIABLE_1004 W2)))))))))) (or (not (tptp.aInteger0 (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))) (= (tptp.aDivisorOf0 (tptp.sdtasdt0 tptp.xp tptp.xq) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))) (and (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq)) (not (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq))) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2)))))))))) (forall ((W0 $$unsorted) (BOUND_VARIABLE_1004 $$unsorted)) (or (not (tptp.aInteger0 W0)) (= (tptp.aDivisorOf0 BOUND_VARIABLE_1004 W0) (and (tptp.aInteger0 BOUND_VARIABLE_1004) (not (= tptp.sz00 BOUND_VARIABLE_1004)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= W0 (tptp.sdtasdt0 BOUND_VARIABLE_1004 W2))))))))))) :rule implies_neg1)
% 0.47/0.64  (anchor :step t127)
% 0.47/0.64  (assume t127.a0 (forall ((W0 $$unsorted) (BOUND_VARIABLE_1004 $$unsorted)) (or (not (tptp.aInteger0 W0)) (= (tptp.aDivisorOf0 BOUND_VARIABLE_1004 W0) (and (tptp.aInteger0 BOUND_VARIABLE_1004) (not (= tptp.sz00 BOUND_VARIABLE_1004)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= W0 (tptp.sdtasdt0 BOUND_VARIABLE_1004 W2)))))))))))
% 0.47/0.64  (step t127.t1 (cl (or (not (forall ((W0 $$unsorted) (BOUND_VARIABLE_1004 $$unsorted)) (or (not (tptp.aInteger0 W0)) (= (tptp.aDivisorOf0 BOUND_VARIABLE_1004 W0) (and (tptp.aInteger0 BOUND_VARIABLE_1004) (not (= tptp.sz00 BOUND_VARIABLE_1004)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= W0 (tptp.sdtasdt0 BOUND_VARIABLE_1004 W2))))))))))) (or (not (tptp.aInteger0 (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))) (= (tptp.aDivisorOf0 (tptp.sdtasdt0 tptp.xp tptp.xq) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))) (and (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq)) (not (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq))) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2))))))))))) :rule forall_inst :args ((:= W0 (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))) (:= BOUND_VARIABLE_1004 (tptp.sdtasdt0 tptp.xp tptp.xq))))
% 0.47/0.64  (step t127.t2 (cl (not (forall ((W0 $$unsorted) (BOUND_VARIABLE_1004 $$unsorted)) (or (not (tptp.aInteger0 W0)) (= (tptp.aDivisorOf0 BOUND_VARIABLE_1004 W0) (and (tptp.aInteger0 BOUND_VARIABLE_1004) (not (= tptp.sz00 BOUND_VARIABLE_1004)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= W0 (tptp.sdtasdt0 BOUND_VARIABLE_1004 W2))))))))))) (or (not (tptp.aInteger0 (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))) (= (tptp.aDivisorOf0 (tptp.sdtasdt0 tptp.xp tptp.xq) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))) (and (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq)) (not (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq))) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2)))))))))) :rule or :premises (t127.t1))
% 0.47/0.64  (step t127.t3 (cl (or (not (tptp.aInteger0 (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))) (= (tptp.aDivisorOf0 (tptp.sdtasdt0 tptp.xp tptp.xq) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))) (and (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq)) (not (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq))) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2)))))))))) :rule resolution :premises (t127.t2 t127.a0))
% 0.47/0.64  (step t127 (cl (not (forall ((W0 $$unsorted) (BOUND_VARIABLE_1004 $$unsorted)) (or (not (tptp.aInteger0 W0)) (= (tptp.aDivisorOf0 BOUND_VARIABLE_1004 W0) (and (tptp.aInteger0 BOUND_VARIABLE_1004) (not (= tptp.sz00 BOUND_VARIABLE_1004)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= W0 (tptp.sdtasdt0 BOUND_VARIABLE_1004 W2))))))))))) (or (not (tptp.aInteger0 (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))) (= (tptp.aDivisorOf0 (tptp.sdtasdt0 tptp.xp tptp.xq) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))) (and (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq)) (not (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq))) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2)))))))))) :rule subproof :discharge (t127.a0))
% 0.47/0.64  (step t128 (cl (=> (forall ((W0 $$unsorted) (BOUND_VARIABLE_1004 $$unsorted)) (or (not (tptp.aInteger0 W0)) (= (tptp.aDivisorOf0 BOUND_VARIABLE_1004 W0) (and (tptp.aInteger0 BOUND_VARIABLE_1004) (not (= tptp.sz00 BOUND_VARIABLE_1004)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= W0 (tptp.sdtasdt0 BOUND_VARIABLE_1004 W2)))))))))) (or (not (tptp.aInteger0 (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))) (= (tptp.aDivisorOf0 (tptp.sdtasdt0 tptp.xp tptp.xq) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))) (and (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq)) (not (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq))) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2)))))))))) (or (not (tptp.aInteger0 (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))) (= (tptp.aDivisorOf0 (tptp.sdtasdt0 tptp.xp tptp.xq) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))) (and (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq)) (not (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq))) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2)))))))))) :rule resolution :premises (t126 t127))
% 0.47/0.64  (step t129 (cl (=> (forall ((W0 $$unsorted) (BOUND_VARIABLE_1004 $$unsorted)) (or (not (tptp.aInteger0 W0)) (= (tptp.aDivisorOf0 BOUND_VARIABLE_1004 W0) (and (tptp.aInteger0 BOUND_VARIABLE_1004) (not (= tptp.sz00 BOUND_VARIABLE_1004)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= W0 (tptp.sdtasdt0 BOUND_VARIABLE_1004 W2)))))))))) (or (not (tptp.aInteger0 (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))) (= (tptp.aDivisorOf0 (tptp.sdtasdt0 tptp.xp tptp.xq) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))) (and (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq)) (not (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq))) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2)))))))))) (not (or (not (tptp.aInteger0 (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))) (= (tptp.aDivisorOf0 (tptp.sdtasdt0 tptp.xp tptp.xq) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))) (and (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq)) (not (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq))) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2))))))))))) :rule implies_neg2)
% 0.47/0.64  (step t130 (cl (=> (forall ((W0 $$unsorted) (BOUND_VARIABLE_1004 $$unsorted)) (or (not (tptp.aInteger0 W0)) (= (tptp.aDivisorOf0 BOUND_VARIABLE_1004 W0) (and (tptp.aInteger0 BOUND_VARIABLE_1004) (not (= tptp.sz00 BOUND_VARIABLE_1004)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= W0 (tptp.sdtasdt0 BOUND_VARIABLE_1004 W2)))))))))) (or (not (tptp.aInteger0 (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))) (= (tptp.aDivisorOf0 (tptp.sdtasdt0 tptp.xp tptp.xq) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))) (and (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq)) (not (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq))) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2)))))))))) (=> (forall ((W0 $$unsorted) (BOUND_VARIABLE_1004 $$unsorted)) (or (not (tptp.aInteger0 W0)) (= (tptp.aDivisorOf0 BOUND_VARIABLE_1004 W0) (and (tptp.aInteger0 BOUND_VARIABLE_1004) (not (= tptp.sz00 BOUND_VARIABLE_1004)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= W0 (tptp.sdtasdt0 BOUND_VARIABLE_1004 W2)))))))))) (or (not (tptp.aInteger0 (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))) (= (tptp.aDivisorOf0 (tptp.sdtasdt0 tptp.xp tptp.xq) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))) (and (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq)) (not (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq))) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2))))))))))) :rule resolution :premises (t128 t129))
% 0.47/0.64  (step t131 (cl (=> (forall ((W0 $$unsorted) (BOUND_VARIABLE_1004 $$unsorted)) (or (not (tptp.aInteger0 W0)) (= (tptp.aDivisorOf0 BOUND_VARIABLE_1004 W0) (and (tptp.aInteger0 BOUND_VARIABLE_1004) (not (= tptp.sz00 BOUND_VARIABLE_1004)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= W0 (tptp.sdtasdt0 BOUND_VARIABLE_1004 W2)))))))))) (or (not (tptp.aInteger0 (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))) (= (tptp.aDivisorOf0 (tptp.sdtasdt0 tptp.xp tptp.xq) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))) (and (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq)) (not (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq))) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2))))))))))) :rule contraction :premises (t130))
% 0.47/0.64  (step t132 (cl (not (forall ((W0 $$unsorted) (BOUND_VARIABLE_1004 $$unsorted)) (or (not (tptp.aInteger0 W0)) (= (tptp.aDivisorOf0 BOUND_VARIABLE_1004 W0) (and (tptp.aInteger0 BOUND_VARIABLE_1004) (not (= tptp.sz00 BOUND_VARIABLE_1004)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= W0 (tptp.sdtasdt0 BOUND_VARIABLE_1004 W2))))))))))) (or (not (tptp.aInteger0 (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))) (= (tptp.aDivisorOf0 (tptp.sdtasdt0 tptp.xp tptp.xq) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))) (and (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq)) (not (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq))) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2)))))))))) :rule implies :premises (t131))
% 0.47/0.64  (step t133 (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_1004 $$unsorted)) (or (not (tptp.aInteger0 W0)) (= (tptp.aDivisorOf0 BOUND_VARIABLE_1004 W0) (and (tptp.aInteger0 BOUND_VARIABLE_1004) (not (= tptp.sz00 BOUND_VARIABLE_1004)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= W0 (tptp.sdtasdt0 BOUND_VARIABLE_1004 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_1004 $$unsorted)) (or (not (tptp.aInteger0 W0)) (= (tptp.aDivisorOf0 BOUND_VARIABLE_1004 W0) (and (tptp.aInteger0 BOUND_VARIABLE_1004) (not (= tptp.sz00 BOUND_VARIABLE_1004)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= W0 (tptp.sdtasdt0 BOUND_VARIABLE_1004 W2))))))))))) :rule equiv_pos2)
% 0.47/0.64  (anchor :step t134 :args ((W0 $$unsorted) (:= W0 W0)))
% 0.47/0.64  (step t134.t1 (cl (= W0 W0)) :rule refl)
% 0.47/0.64  (step t134.t2 (cl (= (tptp.aInteger0 W0) (tptp.aInteger0 W0))) :rule refl)
% 0.47/0.64  (anchor :step t134.t3 :args ((W1 $$unsorted) (:= W1 W1)))
% 0.47/0.64  (step t134.t3.t1 (cl (= W1 W1)) :rule refl)
% 0.47/0.64  (step t134.t3.t2 (cl (= (tptp.aDivisorOf0 W1 W0) (tptp.aDivisorOf0 W1 W0))) :rule refl)
% 0.47/0.64  (step t134.t3.t3 (cl (= (tptp.aInteger0 W1) (tptp.aInteger0 W1))) :rule refl)
% 0.47/0.64  (step t134.t3.t4 (cl (= (= W1 tptp.sz00) (= tptp.sz00 W1))) :rule all_simplify)
% 0.47/0.64  (step t134.t3.t5 (cl (= (not (= W1 tptp.sz00)) (not (= tptp.sz00 W1)))) :rule cong :premises (t134.t3.t4))
% 0.47/0.64  (anchor :step t134.t3.t6 :args ((W2 $$unsorted) (:= W2 W2)))
% 0.47/0.64  (step t134.t3.t6.t1 (cl (= W2 W2)) :rule refl)
% 0.47/0.64  (step t134.t3.t6.t2 (cl (= (tptp.aInteger0 W2) (tptp.aInteger0 W2))) :rule refl)
% 0.47/0.64  (step t134.t3.t6.t3 (cl (= (= (tptp.sdtasdt0 W1 W2) W0) (= W0 (tptp.sdtasdt0 W1 W2)))) :rule all_simplify)
% 0.47/0.64  (step t134.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 (t134.t3.t6.t2 t134.t3.t6.t3))
% 0.47/0.64  (step t134.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.47/0.64  (step t134.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.47/0.64  (step t134.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.47/0.64  (step t134.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 (t134.t3.t8))
% 0.47/0.64  (step t134.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 (t134.t3.t7 t134.t3.t9))
% 0.47/0.64  (step t134.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 (t134.t3.t6 t134.t3.t10))
% 0.47/0.64  (step t134.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 (t134.t3.t3 t134.t3.t5 t134.t3.t11))
% 0.47/0.64  (step t134.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 (t134.t3.t2 t134.t3.t12))
% 0.47/0.64  (step t134.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.47/0.64  (step t134.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 (t134.t2 t134.t3))
% 0.47/0.64  (step t134 (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.47/0.64  (step t135 (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.47/0.65  (step t136 (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_1004 $$unsorted)) (or (not (tptp.aInteger0 W0)) (= (tptp.aDivisorOf0 BOUND_VARIABLE_1004 W0) (and (tptp.aInteger0 BOUND_VARIABLE_1004) (not (= tptp.sz00 BOUND_VARIABLE_1004)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= W0 (tptp.sdtasdt0 BOUND_VARIABLE_1004 W2)))))))))))) :rule all_simplify)
% 0.47/0.65  (step t137 (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_1004 $$unsorted)) (or (not (tptp.aInteger0 W0)) (= (tptp.aDivisorOf0 BOUND_VARIABLE_1004 W0) (and (tptp.aInteger0 BOUND_VARIABLE_1004) (not (= tptp.sz00 BOUND_VARIABLE_1004)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= W0 (tptp.sdtasdt0 BOUND_VARIABLE_1004 W2)))))))))))) :rule trans :premises (t135 t136))
% 0.47/0.65  (step t138 (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_1004 $$unsorted)) (or (not (tptp.aInteger0 W0)) (= (tptp.aDivisorOf0 BOUND_VARIABLE_1004 W0) (and (tptp.aInteger0 BOUND_VARIABLE_1004) (not (= tptp.sz00 BOUND_VARIABLE_1004)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= W0 (tptp.sdtasdt0 BOUND_VARIABLE_1004 W2)))))))))))) :rule trans :premises (t134 t137))
% 0.47/0.65  (step t139 (cl (forall ((W0 $$unsorted) (BOUND_VARIABLE_1004 $$unsorted)) (or (not (tptp.aInteger0 W0)) (= (tptp.aDivisorOf0 BOUND_VARIABLE_1004 W0) (and (tptp.aInteger0 BOUND_VARIABLE_1004) (not (= tptp.sz00 BOUND_VARIABLE_1004)) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= W0 (tptp.sdtasdt0 BOUND_VARIABLE_1004 W2))))))))))) :rule resolution :premises (t133 t138 a17))
% 0.47/0.65  (step t140 (cl (or (not (tptp.aInteger0 (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))) (= (tptp.aDivisorOf0 (tptp.sdtasdt0 tptp.xp tptp.xq) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))) (and (tptp.aInteger0 (tptp.sdtasdt0 tptp.xp tptp.xq)) (not (= tptp.sz00 (tptp.sdtasdt0 tptp.xp tptp.xq))) (not (forall ((W2 $$unsorted)) (or (not (tptp.aInteger0 W2)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 (tptp.sdtasdt0 tptp.xp tptp.xq) W2)))))))))) :rule resolution :premises (t132 t139))
% 0.47/0.65  (step t141 (cl) :rule resolution :premises (t2 t97 t125 t140))
% 0.47/0.65  
% 0.47/0.65  % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.D06J24rJzH/cvc5---1.0.5_22987.smt2
% 0.47/0.65  % cvc5---1.0.5 exiting
% 0.47/0.65  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------