TSTP Solution File: NUM429+3 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : NUM429+3 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n012.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.21s 0.56s
% Output : Proof 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : NUM429+3 : TPTP v8.2.0. Released v4.0.0.
% 0.12/0.14 % Command : do_cvc5 %s %d
% 0.14/0.36 % Computer : n012.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon May 27 23:33:24 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.21/0.53 %----Proving TF0_NAR, FOF, or CNF
% 0.21/0.56 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.21/0.56 % SZS status Theorem for /export/starexec/sandbox/tmp/tmp.Xw74XrRcOc/cvc5---1.0.5_26472.smt2
% 0.21/0.56 % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.Xw74XrRcOc/cvc5---1.0.5_26472.smt2
% 0.21/0.56 (assume a0 (forall ((W0 $$unsorted)) (=> (tptp.aInteger0 W0) true)))
% 0.21/0.56 (assume a1 (tptp.aInteger0 tptp.sz00))
% 0.21/0.56 (assume a2 (tptp.aInteger0 tptp.sz10))
% 0.21/0.56 (assume a3 (forall ((W0 $$unsorted)) (=> (tptp.aInteger0 W0) (tptp.aInteger0 (tptp.smndt0 W0)))))
% 0.21/0.56 (assume a4 (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aInteger0 W0) (tptp.aInteger0 W1)) (tptp.aInteger0 (tptp.sdtpldt0 W0 W1)))))
% 0.21/0.56 (assume a5 (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aInteger0 W0) (tptp.aInteger0 W1)) (tptp.aInteger0 (tptp.sdtasdt0 W0 W1)))))
% 0.21/0.56 (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.21/0.56 (assume a7 (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aInteger0 W0) (tptp.aInteger0 W1)) (= (tptp.sdtpldt0 W0 W1) (tptp.sdtpldt0 W1 W0)))))
% 0.21/0.56 (assume a8 (forall ((W0 $$unsorted)) (=> (tptp.aInteger0 W0) (and (= (tptp.sdtpldt0 W0 tptp.sz00) W0) (= W0 (tptp.sdtpldt0 tptp.sz00 W0))))))
% 0.21/0.56 (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.21/0.56 (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.21/0.56 (assume a11 (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aInteger0 W0) (tptp.aInteger0 W1)) (= (tptp.sdtasdt0 W0 W1) (tptp.sdtasdt0 W1 W0)))))
% 0.21/0.56 (assume a12 (forall ((W0 $$unsorted)) (=> (tptp.aInteger0 W0) (and (= (tptp.sdtasdt0 W0 tptp.sz10) W0) (= W0 (tptp.sdtasdt0 tptp.sz10 W0))))))
% 0.21/0.56 (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.21/0.56 (assume a14 (forall ((W0 $$unsorted)) (=> (tptp.aInteger0 W0) (and (= (tptp.sdtasdt0 W0 tptp.sz00) tptp.sz00) (= tptp.sz00 (tptp.sdtasdt0 tptp.sz00 W0))))))
% 0.21/0.56 (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.21/0.56 (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.21/0.56 (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.21/0.56 (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.21/0.56 (assume a19 (forall ((W0 $$unsorted) (W1 $$unsorted)) (=> (and (tptp.aInteger0 W0) (tptp.aInteger0 W1) (not (= W1 tptp.sz00))) (tptp.sdteqdtlpzmzozddtrp0 W0 W0 W1))))
% 0.21/0.56 (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.21/0.56 (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.21/0.56 (assume a22 (and (exists ((W0 $$unsorted)) (and (tptp.aInteger0 W0) (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))))) (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))) (tptp.sdteqdtlpzmzozddtrp0 tptp.xa tptp.xb tptp.xq) (exists ((W0 $$unsorted)) (and (tptp.aInteger0 W0) (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))))) (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))) (tptp.sdteqdtlpzmzozddtrp0 tptp.xb tptp.xc tptp.xq)))
% 0.21/0.56 (assume a23 (not (exists ((W0 $$unsorted)) (and (tptp.aInteger0 W0) (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))))))
% 0.21/0.56 (assume a24 true)
% 0.21/0.56 (step t1 (cl (not (= (not (exists ((W0 $$unsorted)) (and (tptp.aInteger0 W0) (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))))) (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 tptp.xq W0))))))) (not (not (exists ((W0 $$unsorted)) (and (tptp.aInteger0 W0) (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))))))) (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 tptp.xq W0)))))) :rule equiv_pos2)
% 0.21/0.56 (anchor :step t2 :args ((W0 $$unsorted) (:= W0 W0)))
% 0.21/0.56 (step t2.t1 (cl (= W0 W0)) :rule refl)
% 0.21/0.56 (step t2.t2 (cl (= (tptp.aInteger0 W0) (tptp.aInteger0 W0))) :rule refl)
% 0.21/0.56 (step t2.t3 (cl (= (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))) (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 tptp.xq W0)))) :rule all_simplify)
% 0.21/0.56 (step t2.t4 (cl (= (and (tptp.aInteger0 W0) (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))) (and (tptp.aInteger0 W0) (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 tptp.xq W0))))) :rule cong :premises (t2.t2 t2.t3))
% 0.21/0.56 (step t2 (cl (= (exists ((W0 $$unsorted)) (and (tptp.aInteger0 W0) (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))))) (exists ((W0 $$unsorted)) (and (tptp.aInteger0 W0) (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 tptp.xq W0)))))) :rule bind)
% 0.21/0.56 (step t3 (cl (= (exists ((W0 $$unsorted)) (and (tptp.aInteger0 W0) (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 tptp.xq W0)))) (not (forall ((W0 $$unsorted)) (not (and (tptp.aInteger0 W0) (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 tptp.xq W0)))))))) :rule all_simplify)
% 0.21/0.56 (step t4 (cl (= (forall ((W0 $$unsorted)) (not (and (tptp.aInteger0 W0) (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 tptp.xq W0))))) (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 tptp.xq W0))))))) :rule all_simplify)
% 0.21/0.56 (step t5 (cl (= (not (forall ((W0 $$unsorted)) (not (and (tptp.aInteger0 W0) (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 tptp.xq W0)))))) (not (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 tptp.xq W0)))))))) :rule cong :premises (t4))
% 0.21/0.56 (step t6 (cl (= (exists ((W0 $$unsorted)) (and (tptp.aInteger0 W0) (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 tptp.xq W0)))) (not (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 tptp.xq W0)))))))) :rule trans :premises (t3 t5))
% 0.21/0.56 (step t7 (cl (= (exists ((W0 $$unsorted)) (and (tptp.aInteger0 W0) (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))))) (not (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 tptp.xq W0)))))))) :rule trans :premises (t2 t6))
% 0.21/0.56 (step t8 (cl (= (not (exists ((W0 $$unsorted)) (and (tptp.aInteger0 W0) (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))))) (not (not (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 tptp.xq W0))))))))) :rule cong :premises (t7))
% 0.21/0.56 (step t9 (cl (= (not (not (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 tptp.xq W0))))))) (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 tptp.xq W0))))))) :rule all_simplify)
% 0.21/0.56 (step t10 (cl (= (not (exists ((W0 $$unsorted)) (and (tptp.aInteger0 W0) (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))))) (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 tptp.xq W0))))))) :rule trans :premises (t8 t9))
% 0.21/0.56 (step t11 (cl (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 tptp.xq W0)))))) :rule resolution :premises (t1 t10 a23))
% 0.21/0.56 (step t12 (cl (= (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))))) (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))))))) :rule hole :args ((forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))))) (= W0 W0)))
% 0.21/0.56 (step t13 (cl (= (= (= (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))))) (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 tptp.xq W0)))))) true) (= (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))))) (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 tptp.xq W0)))))))) :rule equiv_simplify)
% 0.21/0.56 (step t14 (cl (not (= (= (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))))) (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 tptp.xq W0)))))) true)) (= (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))))) (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 tptp.xq W0))))))) :rule equiv1 :premises (t13))
% 0.21/0.56 (step t15 (cl (= (= (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))))) (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 tptp.xq W0)))))) (= (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 tptp.xq W0))))) (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))))))))) :rule all_simplify)
% 0.21/0.56 (step t16 (cl (= (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 tptp.xq W0))))) (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 tptp.xq W0))))))) :rule refl)
% 0.21/0.56 (anchor :step t17 :args ((W0 $$unsorted) (:= W0 W0)))
% 0.21/0.56 (step t17.t1 (cl (= W0 W0)) :rule refl)
% 0.21/0.56 (step t17.t2 (cl (= (not (tptp.aInteger0 W0)) (not (tptp.aInteger0 W0)))) :rule refl)
% 0.21/0.56 (step t17.t3 (cl (= (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))) (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 tptp.xq W0)))) :rule all_simplify)
% 0.21/0.56 (step t17.t4 (cl (= (not (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 tptp.xq W0))))) :rule cong :premises (t17.t3))
% 0.21/0.56 (step t17.t5 (cl (= (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))))) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 tptp.xq W0)))))) :rule cong :premises (t17.t2 t17.t4))
% 0.21/0.56 (step t17 (cl (= (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))))) (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 tptp.xq W0))))))) :rule bind)
% 0.21/0.56 (step t18 (cl (= (= (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 tptp.xq W0))))) (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))))))) (= (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 tptp.xq W0))))) (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 tptp.xq W0)))))))) :rule cong :premises (t16 t17))
% 0.21/0.56 (step t19 (cl (= (= (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 tptp.xq W0))))) (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 tptp.xq W0)))))) true)) :rule all_simplify)
% 0.21/0.56 (step t20 (cl (= (= (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 tptp.xq W0))))) (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))))))) true)) :rule trans :premises (t18 t19))
% 0.21/0.56 (step t21 (cl (= (= (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))))) (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 tptp.xq W0)))))) true)) :rule trans :premises (t15 t20))
% 0.21/0.56 (step t22 (cl (= (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))))) (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 tptp.xq W0))))))) :rule resolution :premises (t14 t21))
% 0.21/0.56 (step t23 (cl (= (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))))) (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 tptp.xq W0))))))) :rule trans :premises (t12 t22))
% 0.21/0.56 (step t24 (cl (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))))) (not (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 tptp.xq W0))))))) :rule equiv2 :premises (t23))
% 0.21/0.56 (step t25 (cl (not (= (and (exists ((W0 $$unsorted)) (and (tptp.aInteger0 W0) (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))))) (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))) (tptp.sdteqdtlpzmzozddtrp0 tptp.xa tptp.xb tptp.xq) (exists ((W0 $$unsorted)) (and (tptp.aInteger0 W0) (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))))) (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))) (tptp.sdteqdtlpzmzozddtrp0 tptp.xb tptp.xc tptp.xq)) (and (not (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))))))) (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))) (tptp.sdteqdtlpzmzozddtrp0 tptp.xa tptp.xb tptp.xq) (not (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))))))) (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))) (tptp.sdteqdtlpzmzozddtrp0 tptp.xb tptp.xc tptp.xq)))) (not (and (exists ((W0 $$unsorted)) (and (tptp.aInteger0 W0) (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))))) (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))) (tptp.sdteqdtlpzmzozddtrp0 tptp.xa tptp.xb tptp.xq) (exists ((W0 $$unsorted)) (and (tptp.aInteger0 W0) (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))))) (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))) (tptp.sdteqdtlpzmzozddtrp0 tptp.xb tptp.xc tptp.xq))) (and (not (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))))))) (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))) (tptp.sdteqdtlpzmzozddtrp0 tptp.xa tptp.xb tptp.xq) (not (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))))))) (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))) (tptp.sdteqdtlpzmzozddtrp0 tptp.xb tptp.xc tptp.xq))) :rule equiv_pos2)
% 0.21/0.56 (step t26 (cl (= (exists ((W0 $$unsorted)) (and (tptp.aInteger0 W0) (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))))) (not (forall ((W0 $$unsorted)) (not (and (tptp.aInteger0 W0) (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))))))))) :rule all_simplify)
% 0.21/0.56 (step t27 (cl (= (forall ((W0 $$unsorted)) (not (and (tptp.aInteger0 W0) (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))))) (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))))))) :rule all_simplify)
% 0.21/0.56 (step t28 (cl (= (not (forall ((W0 $$unsorted)) (not (and (tptp.aInteger0 W0) (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))))))) (not (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))))))))) :rule cong :premises (t27))
% 0.21/0.56 (step t29 (cl (= (exists ((W0 $$unsorted)) (and (tptp.aInteger0 W0) (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))))) (not (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))))))))) :rule trans :premises (t26 t28))
% 0.21/0.56 (step t30 (cl (= (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))) (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))))) :rule refl)
% 0.21/0.56 (step t31 (cl (= (tptp.sdteqdtlpzmzozddtrp0 tptp.xa tptp.xb tptp.xq) (tptp.sdteqdtlpzmzozddtrp0 tptp.xa tptp.xb tptp.xq))) :rule refl)
% 0.21/0.56 (step t32 (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.21/0.56 (step t33 (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.21/0.56 (step t34 (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 (t33))
% 0.21/0.56 (step t35 (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 (t32 t34))
% 0.21/0.57 (step t36 (cl (= (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))) (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))))) :rule refl)
% 0.21/0.57 (step t37 (cl (= (tptp.sdteqdtlpzmzozddtrp0 tptp.xb tptp.xc tptp.xq) (tptp.sdteqdtlpzmzozddtrp0 tptp.xb tptp.xc tptp.xq))) :rule refl)
% 0.21/0.57 (step t38 (cl (= (and (exists ((W0 $$unsorted)) (and (tptp.aInteger0 W0) (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))))) (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))) (tptp.sdteqdtlpzmzozddtrp0 tptp.xa tptp.xb tptp.xq) (exists ((W0 $$unsorted)) (and (tptp.aInteger0 W0) (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))))) (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))) (tptp.sdteqdtlpzmzozddtrp0 tptp.xb tptp.xc tptp.xq)) (and (not (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))))))) (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))) (tptp.sdteqdtlpzmzozddtrp0 tptp.xa tptp.xb tptp.xq) (not (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))))))) (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))) (tptp.sdteqdtlpzmzozddtrp0 tptp.xb tptp.xc tptp.xq)))) :rule cong :premises (t29 t30 t31 t35 t36 t37))
% 0.21/0.57 (step t39 (cl (and (not (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))))))) (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb))) (tptp.sdteqdtlpzmzozddtrp0 tptp.xa tptp.xb tptp.xq) (not (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))))))) (tptp.aDivisorOf0 tptp.xq (tptp.sdtpldt0 tptp.xb (tptp.smndt0 tptp.xc))) (tptp.sdteqdtlpzmzozddtrp0 tptp.xb tptp.xc tptp.xq))) :rule resolution :premises (t25 t38 a22))
% 0.21/0.57 (step t40 (cl (not (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtasdt0 tptp.xq W0) (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)))))))) :rule and :premises (t39))
% 0.21/0.57 (step t41 (cl (not (forall ((W0 $$unsorted)) (or (not (tptp.aInteger0 W0)) (not (= (tptp.sdtpldt0 tptp.xa (tptp.smndt0 tptp.xb)) (tptp.sdtasdt0 tptp.xq W0))))))) :rule resolution :premises (t24 t40))
% 0.21/0.57 (step t42 (cl) :rule resolution :premises (t11 t41))
% 0.21/0.57
% 0.21/0.57 % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.Xw74XrRcOc/cvc5---1.0.5_26472.smt2
% 0.21/0.57 % cvc5---1.0.5 exiting
% 0.21/0.57 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------