TSTP Solution File: SYO378^5 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SYO378^5 : TPTP v8.2.0. Bugfixed v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n016.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 18:31:42 EDT 2024
% Result : Theorem 0.20s 0.52s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.13 % Problem : SYO378^5 : TPTP v8.2.0. Bugfixed v5.2.0.
% 0.10/0.14 % Command : do_cvc5 %s %d
% 0.14/0.35 % Computer : n016.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 07:37:39 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.49 %----Proving TH0
% 0.20/0.52 --- Run --ho-elim --full-saturate-quant at 10...
% 0.20/0.52 % SZS status Theorem for /export/starexec/sandbox/tmp/tmp.TXoDq3GOxT/cvc5---1.0.5_4079.smt2
% 0.20/0.52 % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.TXoDq3GOxT/cvc5---1.0.5_4079.smt2
% 0.20/0.52 (assume a0 (= tptp.cQDP0 (lambda ((Xz $$unsorted)) (= Xz tptp.c))))
% 0.20/0.52 (assume a1 (= tptp.cQDP1 (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz tptp.cQDP0) (exists ((Xt $$unsorted)) (@ Xz Xt))))))
% 0.20/0.52 (assume a2 (= tptp.cQDP2 (lambda ((Xz (-> (-> $$unsorted Bool) Bool))) (and (= Xz tptp.cQDP1) (exists ((Xt (-> $$unsorted Bool))) (@ Xz Xt))))))
% 0.20/0.52 (assume a3 (not (exists ((Xs (-> (-> $$unsorted Bool) Bool))) (@ tptp.cQDP2 Xs))))
% 0.20/0.52 (assume a4 true)
% 0.20/0.52 (step t1 (cl (not (= (forall ((Xs (-> (-> $$unsorted Bool) Bool))) (not (@ tptp.cQDP2 Xs))) false)) (not (forall ((Xs (-> (-> $$unsorted Bool) Bool))) (not (@ tptp.cQDP2 Xs)))) false) :rule equiv_pos2)
% 0.20/0.52 (anchor :step t2 :args ((Xs (-> (-> $$unsorted Bool) Bool)) (:= Xs Xs)))
% 0.20/0.52 (step t2.t1 (cl (= Xs Xs)) :rule refl)
% 0.20/0.52 (step t2.t2 (cl (and (= tptp.cQDP2 (lambda ((Xz (-> (-> $$unsorted Bool) Bool))) (and (= Xz (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt))))))) (not (forall ((Xt (-> $$unsorted Bool))) (not (@ Xz Xt))))))) (= tptp.cQDP1 (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt))))))) (= tptp.cQDP0 (lambda ((Xz $$unsorted)) (= tptp.c Xz)))) (not (= tptp.cQDP2 (lambda ((Xz (-> (-> $$unsorted Bool) Bool))) (and (= Xz (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt))))))) (not (forall ((Xt (-> $$unsorted Bool))) (not (@ Xz Xt)))))))) (not (= tptp.cQDP1 (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))))) (not (= tptp.cQDP0 (lambda ((Xz $$unsorted)) (= tptp.c Xz))))) :rule and_neg)
% 0.20/0.52 (step t2.t3 (cl (not (= (= tptp.cQDP2 (lambda ((Xz (-> (-> $$unsorted Bool) Bool))) (and (= tptp.cQDP1 Xz) (not (forall ((Xt (-> $$unsorted Bool))) (not (@ Xz Xt))))))) (= tptp.cQDP2 (lambda ((Xz (-> (-> $$unsorted Bool) Bool))) (and (= Xz (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt))))))) (not (forall ((Xt (-> $$unsorted Bool))) (not (@ Xz Xt))))))))) (not (= tptp.cQDP2 (lambda ((Xz (-> (-> $$unsorted Bool) Bool))) (and (= tptp.cQDP1 Xz) (not (forall ((Xt (-> $$unsorted Bool))) (not (@ Xz Xt)))))))) (= tptp.cQDP2 (lambda ((Xz (-> (-> $$unsorted Bool) Bool))) (and (= Xz (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt))))))) (not (forall ((Xt (-> $$unsorted Bool))) (not (@ Xz Xt)))))))) :rule equiv_pos2)
% 0.20/0.52 (step t2.t4 (cl (= tptp.cQDP2 tptp.cQDP2)) :rule refl)
% 0.20/0.52 (anchor :step t2.t5 :args ((Xz (-> (-> $$unsorted Bool) Bool)) (:= Xz Xz)))
% 0.20/0.52 (step t2.t5.t1 (cl (= Xz Xz)) :rule refl)
% 0.20/0.52 (step t2.t5.t2 (cl (and (= tptp.cQDP1 (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt))))))) (= tptp.cQDP0 (lambda ((Xz $$unsorted)) (= tptp.c Xz)))) (not (= tptp.cQDP1 (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))))) (not (= tptp.cQDP0 (lambda ((Xz $$unsorted)) (= tptp.c Xz))))) :rule and_neg)
% 0.20/0.52 (step t2.t5.t3 (cl (not (= (= tptp.cQDP1 (lambda ((Xz (-> $$unsorted Bool))) (and (= tptp.cQDP0 Xz) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt))))))) (= tptp.cQDP1 (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt))))))))) (not (= tptp.cQDP1 (lambda ((Xz (-> $$unsorted Bool))) (and (= tptp.cQDP0 Xz) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))))) (= tptp.cQDP1 (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))))) :rule equiv_pos2)
% 0.20/0.52 (step t2.t5.t4 (cl (= tptp.cQDP1 tptp.cQDP1)) :rule refl)
% 0.20/0.52 (anchor :step t2.t5.t5 :args ((Xz (-> $$unsorted Bool)) (:= Xz Xz)))
% 0.20/0.52 (step t2.t5.t5.t1 (cl (= Xz Xz)) :rule refl)
% 0.20/0.52 (step t2.t5.t5.t2 (cl (not (= (= tptp.cQDP0 (lambda ((Xz $$unsorted)) (= Xz tptp.c))) (= tptp.cQDP0 (lambda ((Xz $$unsorted)) (= tptp.c Xz))))) (not (= tptp.cQDP0 (lambda ((Xz $$unsorted)) (= Xz tptp.c)))) (= tptp.cQDP0 (lambda ((Xz $$unsorted)) (= tptp.c Xz)))) :rule equiv_pos2)
% 0.20/0.52 (step t2.t5.t5.t3 (cl (= tptp.cQDP0 tptp.cQDP0)) :rule refl)
% 0.20/0.52 (anchor :step t2.t5.t5.t4 :args ((Xz $$unsorted) (:= Xz Xz)))
% 0.20/0.52 (step t2.t5.t5.t4.t1 (cl (= Xz Xz)) :rule refl)
% 0.20/0.52 (step t2.t5.t5.t4.t2 (cl (= (= Xz tptp.c) (= tptp.c Xz))) :rule all_simplify)
% 0.20/0.52 (step t2.t5.t5.t4 (cl (= (lambda ((Xz $$unsorted)) (= Xz tptp.c)) (lambda ((Xz $$unsorted)) (= tptp.c Xz)))) :rule bind)
% 0.20/0.52 (step t2.t5.t5.t5 (cl (= (= tptp.cQDP0 (lambda ((Xz $$unsorted)) (= Xz tptp.c))) (= tptp.cQDP0 (lambda ((Xz $$unsorted)) (= tptp.c Xz))))) :rule cong :premises (t2.t5.t5.t3 t2.t5.t5.t4))
% 0.20/0.52 (step t2.t5.t5.t6 (cl (= tptp.cQDP0 (lambda ((Xz $$unsorted)) (= tptp.c Xz)))) :rule resolution :premises (t2.t5.t5.t2 t2.t5.t5.t5 a0))
% 0.20/0.52 (step t2.t5.t5.t7 (cl (= Xz Xz)) :rule refl)
% 0.20/0.52 (step t2.t5.t5.t8 (cl (= (= tptp.cQDP0 Xz) (= (lambda ((Xz $$unsorted)) (= tptp.c Xz)) Xz))) :rule cong :premises (t2.t5.t5.t6 t2.t5.t5.t7))
% 0.20/0.52 (step t2.t5.t5.t9 (cl (= (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))) :rule refl)
% 0.20/0.52 (step t2.t5.t5.t10 (cl (= (and (= tptp.cQDP0 Xz) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt))))) (and (= (lambda ((Xz $$unsorted)) (= tptp.c Xz)) Xz) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt))))))) :rule cong :premises (t2.t5.t5.t8 t2.t5.t5.t9))
% 0.20/0.52 (step t2.t5.t5 (cl (= (lambda ((Xz (-> $$unsorted Bool))) (and (= tptp.cQDP0 Xz) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))) (lambda ((Xz (-> $$unsorted Bool))) (and (= (lambda ((Xz $$unsorted)) (= tptp.c Xz)) Xz) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))))) :rule bind)
% 0.20/0.52 (step t2.t5.t6 (cl (= (= tptp.cQDP1 (lambda ((Xz (-> $$unsorted Bool))) (and (= tptp.cQDP0 Xz) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt))))))) (= tptp.cQDP1 (lambda ((Xz (-> $$unsorted Bool))) (and (= (lambda ((Xz $$unsorted)) (= tptp.c Xz)) Xz) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt))))))))) :rule cong :premises (t2.t5.t4 t2.t5.t5))
% 0.20/0.52 (step t2.t5.t7 (cl (= tptp.cQDP1 tptp.cQDP1)) :rule refl)
% 0.20/0.52 (anchor :step t2.t5.t8 :args ((Xz (-> $$unsorted Bool)) (:= Xz Xz)))
% 0.20/0.52 (step t2.t5.t8.t1 (cl (= Xz Xz)) :rule refl)
% 0.20/0.52 (step t2.t5.t8.t2 (cl (= (= (lambda ((Xz $$unsorted)) (= tptp.c Xz)) Xz) (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))))) :rule all_simplify)
% 0.20/0.52 (step t2.t5.t8.t3 (cl (= (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))) :rule refl)
% 0.20/0.52 (step t2.t5.t8.t4 (cl (= (and (= (lambda ((Xz $$unsorted)) (= tptp.c Xz)) Xz) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt))))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt))))))) :rule cong :premises (t2.t5.t8.t2 t2.t5.t8.t3))
% 0.20/0.52 (step t2.t5.t8 (cl (= (lambda ((Xz (-> $$unsorted Bool))) (and (= (lambda ((Xz $$unsorted)) (= tptp.c Xz)) Xz) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))) (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))))) :rule bind)
% 0.20/0.52 (step t2.t5.t9 (cl (= (= tptp.cQDP1 (lambda ((Xz (-> $$unsorted Bool))) (and (= (lambda ((Xz $$unsorted)) (= tptp.c Xz)) Xz) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt))))))) (= tptp.cQDP1 (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt))))))))) :rule cong :premises (t2.t5.t7 t2.t5.t8))
% 0.20/0.52 (step t2.t5.t10 (cl (= (= tptp.cQDP1 (lambda ((Xz (-> $$unsorted Bool))) (and (= tptp.cQDP0 Xz) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt))))))) (= tptp.cQDP1 (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt))))))))) :rule trans :premises (t2.t5.t6 t2.t5.t9))
% 0.20/0.52 (step t2.t5.t11 (cl (not (= (= tptp.cQDP1 (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz tptp.cQDP0) (exists ((Xt $$unsorted)) (@ Xz Xt))))) (= tptp.cQDP1 (lambda ((Xz (-> $$unsorted Bool))) (and (= tptp.cQDP0 Xz) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt))))))))) (not (= tptp.cQDP1 (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz tptp.cQDP0) (exists ((Xt $$unsorted)) (@ Xz Xt)))))) (= tptp.cQDP1 (lambda ((Xz (-> $$unsorted Bool))) (and (= tptp.cQDP0 Xz) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))))) :rule equiv_pos2)
% 0.20/0.52 (anchor :step t2.t5.t12 :args ((Xz (-> $$unsorted Bool)) (:= Xz Xz)))
% 0.20/0.52 (step t2.t5.t12.t1 (cl (= Xz Xz)) :rule refl)
% 0.20/0.52 (step t2.t5.t12.t2 (cl (= (= Xz tptp.cQDP0) (= tptp.cQDP0 Xz))) :rule all_simplify)
% 0.20/0.52 (step t2.t5.t12.t3 (cl (= (exists ((Xt $$unsorted)) (@ Xz Xt)) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))) :rule all_simplify)
% 0.20/0.52 (step t2.t5.t12.t4 (cl (= (and (= Xz tptp.cQDP0) (exists ((Xt $$unsorted)) (@ Xz Xt))) (and (= tptp.cQDP0 Xz) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt))))))) :rule cong :premises (t2.t5.t12.t2 t2.t5.t12.t3))
% 0.20/0.52 (step t2.t5.t12 (cl (= (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz tptp.cQDP0) (exists ((Xt $$unsorted)) (@ Xz Xt)))) (lambda ((Xz (-> $$unsorted Bool))) (and (= tptp.cQDP0 Xz) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))))) :rule bind)
% 0.20/0.52 (step t2.t5.t13 (cl (= (= tptp.cQDP1 (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz tptp.cQDP0) (exists ((Xt $$unsorted)) (@ Xz Xt))))) (= tptp.cQDP1 (lambda ((Xz (-> $$unsorted Bool))) (and (= tptp.cQDP0 Xz) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt))))))))) :rule cong :premises (t2.t5.t7 t2.t5.t12))
% 0.20/0.52 (step t2.t5.t14 (cl (= tptp.cQDP1 (lambda ((Xz (-> $$unsorted Bool))) (and (= tptp.cQDP0 Xz) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))))) :rule resolution :premises (t2.t5.t11 t2.t5.t13 a1))
% 0.20/0.52 (step t2.t5.t15 (cl (= tptp.cQDP1 (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))))) :rule resolution :premises (t2.t5.t3 t2.t5.t10 t2.t5.t14))
% 0.20/0.52 (step t2.t5.t16 (cl (not (= (= tptp.cQDP0 (lambda ((Xz $$unsorted)) (= Xz tptp.c))) (= tptp.cQDP0 (lambda ((Xz $$unsorted)) (= tptp.c Xz))))) (not (= tptp.cQDP0 (lambda ((Xz $$unsorted)) (= Xz tptp.c)))) (= tptp.cQDP0 (lambda ((Xz $$unsorted)) (= tptp.c Xz)))) :rule equiv_pos2)
% 0.20/0.52 (step t2.t5.t17 (cl (= tptp.cQDP0 tptp.cQDP0)) :rule refl)
% 0.20/0.52 (anchor :step t2.t5.t18 :args ((Xz $$unsorted) (:= Xz Xz)))
% 0.20/0.52 (step t2.t5.t18.t1 (cl (= Xz Xz)) :rule refl)
% 0.20/0.52 (step t2.t5.t18.t2 (cl (= (= Xz tptp.c) (= tptp.c Xz))) :rule all_simplify)
% 0.20/0.52 (step t2.t5.t18 (cl (= (lambda ((Xz $$unsorted)) (= Xz tptp.c)) (lambda ((Xz $$unsorted)) (= tptp.c Xz)))) :rule bind)
% 0.20/0.52 (step t2.t5.t19 (cl (= (= tptp.cQDP0 (lambda ((Xz $$unsorted)) (= Xz tptp.c))) (= tptp.cQDP0 (lambda ((Xz $$unsorted)) (= tptp.c Xz))))) :rule cong :premises (t2.t5.t17 t2.t5.t18))
% 0.20/0.52 (step t2.t5.t20 (cl (= tptp.cQDP0 (lambda ((Xz $$unsorted)) (= tptp.c Xz)))) :rule resolution :premises (t2.t5.t16 t2.t5.t19 a0))
% 0.20/0.52 (step t2.t5.t21 (cl (and (= tptp.cQDP1 (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt))))))) (= tptp.cQDP0 (lambda ((Xz $$unsorted)) (= tptp.c Xz))))) :rule resolution :premises (t2.t5.t2 t2.t5.t15 t2.t5.t20))
% 0.20/0.52 (step t2.t5.t22 (cl (= tptp.cQDP1 (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))))) :rule and :premises (t2.t5.t21))
% 0.20/0.52 (step t2.t5.t23 (cl (= Xz Xz)) :rule refl)
% 0.20/0.52 (step t2.t5.t24 (cl (= (= tptp.cQDP1 Xz) (= (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))) Xz))) :rule cong :premises (t2.t5.t22 t2.t5.t23))
% 0.20/0.52 (step t2.t5.t25 (cl (= (not (forall ((Xt (-> $$unsorted Bool))) (not (@ Xz Xt)))) (not (forall ((Xt (-> $$unsorted Bool))) (not (@ Xz Xt)))))) :rule refl)
% 0.20/0.52 (step t2.t5.t26 (cl (= (and (= tptp.cQDP1 Xz) (not (forall ((Xt (-> $$unsorted Bool))) (not (@ Xz Xt))))) (and (= (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))) Xz) (not (forall ((Xt (-> $$unsorted Bool))) (not (@ Xz Xt))))))) :rule cong :premises (t2.t5.t24 t2.t5.t25))
% 0.20/0.52 (step t2.t5 (cl (= (lambda ((Xz (-> (-> $$unsorted Bool) Bool))) (and (= tptp.cQDP1 Xz) (not (forall ((Xt (-> $$unsorted Bool))) (not (@ Xz Xt)))))) (lambda ((Xz (-> (-> $$unsorted Bool) Bool))) (and (= (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))) Xz) (not (forall ((Xt (-> $$unsorted Bool))) (not (@ Xz Xt)))))))) :rule bind)
% 0.20/0.52 (step t2.t6 (cl (= (= tptp.cQDP2 (lambda ((Xz (-> (-> $$unsorted Bool) Bool))) (and (= tptp.cQDP1 Xz) (not (forall ((Xt (-> $$unsorted Bool))) (not (@ Xz Xt))))))) (= tptp.cQDP2 (lambda ((Xz (-> (-> $$unsorted Bool) Bool))) (and (= (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))) Xz) (not (forall ((Xt (-> $$unsorted Bool))) (not (@ Xz Xt))))))))) :rule cong :premises (t2.t4 t2.t5))
% 0.20/0.52 (step t2.t7 (cl (= tptp.cQDP2 tptp.cQDP2)) :rule refl)
% 0.20/0.52 (anchor :step t2.t8 :args ((Xz (-> (-> $$unsorted Bool) Bool)) (:= Xz Xz)))
% 0.20/0.52 (step t2.t8.t1 (cl (= Xz Xz)) :rule refl)
% 0.20/0.52 (step t2.t8.t2 (cl (= (= (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))) Xz) (= Xz (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt))))))))) :rule all_simplify)
% 0.20/0.52 (step t2.t8.t3 (cl (= (not (forall ((Xt (-> $$unsorted Bool))) (not (@ Xz Xt)))) (not (forall ((Xt (-> $$unsorted Bool))) (not (@ Xz Xt)))))) :rule refl)
% 0.20/0.52 (step t2.t8.t4 (cl (= (and (= (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))) Xz) (not (forall ((Xt (-> $$unsorted Bool))) (not (@ Xz Xt))))) (and (= Xz (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt))))))) (not (forall ((Xt (-> $$unsorted Bool))) (not (@ Xz Xt))))))) :rule cong :premises (t2.t8.t2 t2.t8.t3))
% 0.20/0.52 (step t2.t8 (cl (= (lambda ((Xz (-> (-> $$unsorted Bool) Bool))) (and (= (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))) Xz) (not (forall ((Xt (-> $$unsorted Bool))) (not (@ Xz Xt)))))) (lambda ((Xz (-> (-> $$unsorted Bool) Bool))) (and (= Xz (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt))))))) (not (forall ((Xt (-> $$unsorted Bool))) (not (@ Xz Xt)))))))) :rule bind)
% 0.20/0.52 (step t2.t9 (cl (= (= tptp.cQDP2 (lambda ((Xz (-> (-> $$unsorted Bool) Bool))) (and (= (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))) Xz) (not (forall ((Xt (-> $$unsorted Bool))) (not (@ Xz Xt))))))) (= tptp.cQDP2 (lambda ((Xz (-> (-> $$unsorted Bool) Bool))) (and (= Xz (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt))))))) (not (forall ((Xt (-> $$unsorted Bool))) (not (@ Xz Xt))))))))) :rule cong :premises (t2.t7 t2.t8))
% 0.20/0.52 (step t2.t10 (cl (= (= tptp.cQDP2 (lambda ((Xz (-> (-> $$unsorted Bool) Bool))) (and (= tptp.cQDP1 Xz) (not (forall ((Xt (-> $$unsorted Bool))) (not (@ Xz Xt))))))) (= tptp.cQDP2 (lambda ((Xz (-> (-> $$unsorted Bool) Bool))) (and (= Xz (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt))))))) (not (forall ((Xt (-> $$unsorted Bool))) (not (@ Xz Xt))))))))) :rule trans :premises (t2.t6 t2.t9))
% 0.20/0.52 (step t2.t11 (cl (not (= (= tptp.cQDP2 (lambda ((Xz (-> (-> $$unsorted Bool) Bool))) (and (= Xz tptp.cQDP1) (exists ((Xt (-> $$unsorted Bool))) (@ Xz Xt))))) (= tptp.cQDP2 (lambda ((Xz (-> (-> $$unsorted Bool) Bool))) (and (= tptp.cQDP1 Xz) (not (forall ((Xt (-> $$unsorted Bool))) (not (@ Xz Xt))))))))) (not (= tptp.cQDP2 (lambda ((Xz (-> (-> $$unsorted Bool) Bool))) (and (= Xz tptp.cQDP1) (exists ((Xt (-> $$unsorted Bool))) (@ Xz Xt)))))) (= tptp.cQDP2 (lambda ((Xz (-> (-> $$unsorted Bool) Bool))) (and (= tptp.cQDP1 Xz) (not (forall ((Xt (-> $$unsorted Bool))) (not (@ Xz Xt)))))))) :rule equiv_pos2)
% 0.20/0.52 (anchor :step t2.t12 :args ((Xz (-> (-> $$unsorted Bool) Bool)) (:= Xz Xz)))
% 0.20/0.52 (step t2.t12.t1 (cl (= Xz Xz)) :rule refl)
% 0.20/0.52 (step t2.t12.t2 (cl (= (= Xz tptp.cQDP1) (= tptp.cQDP1 Xz))) :rule all_simplify)
% 0.20/0.52 (step t2.t12.t3 (cl (= (exists ((Xt (-> $$unsorted Bool))) (@ Xz Xt)) (not (forall ((Xt (-> $$unsorted Bool))) (not (@ Xz Xt)))))) :rule all_simplify)
% 0.20/0.52 (step t2.t12.t4 (cl (= (and (= Xz tptp.cQDP1) (exists ((Xt (-> $$unsorted Bool))) (@ Xz Xt))) (and (= tptp.cQDP1 Xz) (not (forall ((Xt (-> $$unsorted Bool))) (not (@ Xz Xt))))))) :rule cong :premises (t2.t12.t2 t2.t12.t3))
% 0.20/0.52 (step t2.t12 (cl (= (lambda ((Xz (-> (-> $$unsorted Bool) Bool))) (and (= Xz tptp.cQDP1) (exists ((Xt (-> $$unsorted Bool))) (@ Xz Xt)))) (lambda ((Xz (-> (-> $$unsorted Bool) Bool))) (and (= tptp.cQDP1 Xz) (not (forall ((Xt (-> $$unsorted Bool))) (not (@ Xz Xt)))))))) :rule bind)
% 0.20/0.52 (step t2.t13 (cl (= (= tptp.cQDP2 (lambda ((Xz (-> (-> $$unsorted Bool) Bool))) (and (= Xz tptp.cQDP1) (exists ((Xt (-> $$unsorted Bool))) (@ Xz Xt))))) (= tptp.cQDP2 (lambda ((Xz (-> (-> $$unsorted Bool) Bool))) (and (= tptp.cQDP1 Xz) (not (forall ((Xt (-> $$unsorted Bool))) (not (@ Xz Xt))))))))) :rule cong :premises (t2.t7 t2.t12))
% 0.20/0.52 (step t2.t14 (cl (= tptp.cQDP2 (lambda ((Xz (-> (-> $$unsorted Bool) Bool))) (and (= tptp.cQDP1 Xz) (not (forall ((Xt (-> $$unsorted Bool))) (not (@ Xz Xt)))))))) :rule resolution :premises (t2.t11 t2.t13 a2))
% 0.20/0.52 (step t2.t15 (cl (= tptp.cQDP2 (lambda ((Xz (-> (-> $$unsorted Bool) Bool))) (and (= Xz (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt))))))) (not (forall ((Xt (-> $$unsorted Bool))) (not (@ Xz Xt)))))))) :rule resolution :premises (t2.t3 t2.t10 t2.t14))
% 0.20/0.52 (step t2.t16 (cl (not (= (= tptp.cQDP1 (lambda ((Xz (-> $$unsorted Bool))) (and (= tptp.cQDP0 Xz) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt))))))) (= tptp.cQDP1 (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt))))))))) (not (= tptp.cQDP1 (lambda ((Xz (-> $$unsorted Bool))) (and (= tptp.cQDP0 Xz) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))))) (= tptp.cQDP1 (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))))) :rule equiv_pos2)
% 0.20/0.52 (step t2.t17 (cl (= tptp.cQDP1 tptp.cQDP1)) :rule refl)
% 0.20/0.52 (anchor :step t2.t18 :args ((Xz (-> $$unsorted Bool)) (:= Xz Xz)))
% 0.20/0.52 (step t2.t18.t1 (cl (= Xz Xz)) :rule refl)
% 0.20/0.52 (step t2.t18.t2 (cl (not (= (= tptp.cQDP0 (lambda ((Xz $$unsorted)) (= Xz tptp.c))) (= tptp.cQDP0 (lambda ((Xz $$unsorted)) (= tptp.c Xz))))) (not (= tptp.cQDP0 (lambda ((Xz $$unsorted)) (= Xz tptp.c)))) (= tptp.cQDP0 (lambda ((Xz $$unsorted)) (= tptp.c Xz)))) :rule equiv_pos2)
% 0.20/0.52 (step t2.t18.t3 (cl (= tptp.cQDP0 tptp.cQDP0)) :rule refl)
% 0.20/0.52 (anchor :step t2.t18.t4 :args ((Xz $$unsorted) (:= Xz Xz)))
% 0.20/0.52 (step t2.t18.t4.t1 (cl (= Xz Xz)) :rule refl)
% 0.20/0.52 (step t2.t18.t4.t2 (cl (= (= Xz tptp.c) (= tptp.c Xz))) :rule all_simplify)
% 0.20/0.52 (step t2.t18.t4 (cl (= (lambda ((Xz $$unsorted)) (= Xz tptp.c)) (lambda ((Xz $$unsorted)) (= tptp.c Xz)))) :rule bind)
% 0.20/0.52 (step t2.t18.t5 (cl (= (= tptp.cQDP0 (lambda ((Xz $$unsorted)) (= Xz tptp.c))) (= tptp.cQDP0 (lambda ((Xz $$unsorted)) (= tptp.c Xz))))) :rule cong :premises (t2.t18.t3 t2.t18.t4))
% 0.20/0.52 (step t2.t18.t6 (cl (= tptp.cQDP0 (lambda ((Xz $$unsorted)) (= tptp.c Xz)))) :rule resolution :premises (t2.t18.t2 t2.t18.t5 a0))
% 0.20/0.52 (step t2.t18.t7 (cl (= Xz Xz)) :rule refl)
% 0.20/0.52 (step t2.t18.t8 (cl (= (= tptp.cQDP0 Xz) (= (lambda ((Xz $$unsorted)) (= tptp.c Xz)) Xz))) :rule cong :premises (t2.t18.t6 t2.t18.t7))
% 0.20/0.52 (step t2.t18.t9 (cl (= (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))) :rule refl)
% 0.20/0.52 (step t2.t18.t10 (cl (= (and (= tptp.cQDP0 Xz) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt))))) (and (= (lambda ((Xz $$unsorted)) (= tptp.c Xz)) Xz) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt))))))) :rule cong :premises (t2.t18.t8 t2.t18.t9))
% 0.20/0.52 (step t2.t18 (cl (= (lambda ((Xz (-> $$unsorted Bool))) (and (= tptp.cQDP0 Xz) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))) (lambda ((Xz (-> $$unsorted Bool))) (and (= (lambda ((Xz $$unsorted)) (= tptp.c Xz)) Xz) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))))) :rule bind)
% 0.20/0.52 (step t2.t19 (cl (= (= tptp.cQDP1 (lambda ((Xz (-> $$unsorted Bool))) (and (= tptp.cQDP0 Xz) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt))))))) (= tptp.cQDP1 (lambda ((Xz (-> $$unsorted Bool))) (and (= (lambda ((Xz $$unsorted)) (= tptp.c Xz)) Xz) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt))))))))) :rule cong :premises (t2.t17 t2.t18))
% 0.20/0.52 (step t2.t20 (cl (= tptp.cQDP1 tptp.cQDP1)) :rule refl)
% 0.20/0.52 (anchor :step t2.t21 :args ((Xz (-> $$unsorted Bool)) (:= Xz Xz)))
% 0.20/0.52 (step t2.t21.t1 (cl (= Xz Xz)) :rule refl)
% 0.20/0.52 (step t2.t21.t2 (cl (= (= (lambda ((Xz $$unsorted)) (= tptp.c Xz)) Xz) (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))))) :rule all_simplify)
% 0.20/0.52 (step t2.t21.t3 (cl (= (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))) :rule refl)
% 0.20/0.52 (step t2.t21.t4 (cl (= (and (= (lambda ((Xz $$unsorted)) (= tptp.c Xz)) Xz) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt))))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt))))))) :rule cong :premises (t2.t21.t2 t2.t21.t3))
% 0.20/0.52 (step t2.t21 (cl (= (lambda ((Xz (-> $$unsorted Bool))) (and (= (lambda ((Xz $$unsorted)) (= tptp.c Xz)) Xz) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))) (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))))) :rule bind)
% 0.20/0.52 (step t2.t22 (cl (= (= tptp.cQDP1 (lambda ((Xz (-> $$unsorted Bool))) (and (= (lambda ((Xz $$unsorted)) (= tptp.c Xz)) Xz) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt))))))) (= tptp.cQDP1 (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt))))))))) :rule cong :premises (t2.t20 t2.t21))
% 0.20/0.52 (step t2.t23 (cl (= (= tptp.cQDP1 (lambda ((Xz (-> $$unsorted Bool))) (and (= tptp.cQDP0 Xz) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt))))))) (= tptp.cQDP1 (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt))))))))) :rule trans :premises (t2.t19 t2.t22))
% 0.20/0.52 (step t2.t24 (cl (not (= (= tptp.cQDP1 (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz tptp.cQDP0) (exists ((Xt $$unsorted)) (@ Xz Xt))))) (= tptp.cQDP1 (lambda ((Xz (-> $$unsorted Bool))) (and (= tptp.cQDP0 Xz) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt))))))))) (not (= tptp.cQDP1 (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz tptp.cQDP0) (exists ((Xt $$unsorted)) (@ Xz Xt)))))) (= tptp.cQDP1 (lambda ((Xz (-> $$unsorted Bool))) (and (= tptp.cQDP0 Xz) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))))) :rule equiv_pos2)
% 0.20/0.52 (anchor :step t2.t25 :args ((Xz (-> $$unsorted Bool)) (:= Xz Xz)))
% 0.20/0.52 (step t2.t25.t1 (cl (= Xz Xz)) :rule refl)
% 0.20/0.52 (step t2.t25.t2 (cl (= (= Xz tptp.cQDP0) (= tptp.cQDP0 Xz))) :rule all_simplify)
% 0.20/0.52 (step t2.t25.t3 (cl (= (exists ((Xt $$unsorted)) (@ Xz Xt)) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))) :rule all_simplify)
% 0.20/0.52 (step t2.t25.t4 (cl (= (and (= Xz tptp.cQDP0) (exists ((Xt $$unsorted)) (@ Xz Xt))) (and (= tptp.cQDP0 Xz) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt))))))) :rule cong :premises (t2.t25.t2 t2.t25.t3))
% 0.20/0.52 (step t2.t25 (cl (= (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz tptp.cQDP0) (exists ((Xt $$unsorted)) (@ Xz Xt)))) (lambda ((Xz (-> $$unsorted Bool))) (and (= tptp.cQDP0 Xz) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))))) :rule bind)
% 0.20/0.52 (step t2.t26 (cl (= (= tptp.cQDP1 (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz tptp.cQDP0) (exists ((Xt $$unsorted)) (@ Xz Xt))))) (= tptp.cQDP1 (lambda ((Xz (-> $$unsorted Bool))) (and (= tptp.cQDP0 Xz) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt))))))))) :rule cong :premises (t2.t20 t2.t25))
% 0.20/0.52 (step t2.t27 (cl (= tptp.cQDP1 (lambda ((Xz (-> $$unsorted Bool))) (and (= tptp.cQDP0 Xz) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))))) :rule resolution :premises (t2.t24 t2.t26 a1))
% 0.20/0.52 (step t2.t28 (cl (= tptp.cQDP1 (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))))) :rule resolution :premises (t2.t16 t2.t23 t2.t27))
% 0.20/0.52 (step t2.t29 (cl (not (= (= tptp.cQDP0 (lambda ((Xz $$unsorted)) (= Xz tptp.c))) (= tptp.cQDP0 (lambda ((Xz $$unsorted)) (= tptp.c Xz))))) (not (= tptp.cQDP0 (lambda ((Xz $$unsorted)) (= Xz tptp.c)))) (= tptp.cQDP0 (lambda ((Xz $$unsorted)) (= tptp.c Xz)))) :rule equiv_pos2)
% 0.20/0.52 (step t2.t30 (cl (= tptp.cQDP0 tptp.cQDP0)) :rule refl)
% 0.20/0.52 (anchor :step t2.t31 :args ((Xz $$unsorted) (:= Xz Xz)))
% 0.20/0.52 (step t2.t31.t1 (cl (= Xz Xz)) :rule refl)
% 0.20/0.52 (step t2.t31.t2 (cl (= (= Xz tptp.c) (= tptp.c Xz))) :rule all_simplify)
% 0.20/0.52 (step t2.t31 (cl (= (lambda ((Xz $$unsorted)) (= Xz tptp.c)) (lambda ((Xz $$unsorted)) (= tptp.c Xz)))) :rule bind)
% 0.20/0.52 (step t2.t32 (cl (= (= tptp.cQDP0 (lambda ((Xz $$unsorted)) (= Xz tptp.c))) (= tptp.cQDP0 (lambda ((Xz $$unsorted)) (= tptp.c Xz))))) :rule cong :premises (t2.t30 t2.t31))
% 0.20/0.52 (step t2.t33 (cl (= tptp.cQDP0 (lambda ((Xz $$unsorted)) (= tptp.c Xz)))) :rule resolution :premises (t2.t29 t2.t32 a0))
% 0.20/0.52 (step t2.t34 (cl (and (= tptp.cQDP2 (lambda ((Xz (-> (-> $$unsorted Bool) Bool))) (and (= Xz (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt))))))) (not (forall ((Xt (-> $$unsorted Bool))) (not (@ Xz Xt))))))) (= tptp.cQDP1 (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt))))))) (= tptp.cQDP0 (lambda ((Xz $$unsorted)) (= tptp.c Xz))))) :rule resolution :premises (t2.t2 t2.t15 t2.t28 t2.t33))
% 0.20/0.52 (step t2.t35 (cl (= tptp.cQDP2 (lambda ((Xz (-> (-> $$unsorted Bool) Bool))) (and (= Xz (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt))))))) (not (forall ((Xt (-> $$unsorted Bool))) (not (@ Xz Xt)))))))) :rule and :premises (t2.t34))
% 0.20/0.52 (step t2.t36 (cl (= Xs Xs)) :rule refl)
% 0.20/0.52 (step t2.t37 (cl (= (@ tptp.cQDP2 Xs) (@ (lambda ((Xz (-> (-> $$unsorted Bool) Bool))) (and (= Xz (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt))))))) (not (forall ((Xt (-> $$unsorted Bool))) (not (@ Xz Xt)))))) Xs))) :rule cong :premises (t2.t35 t2.t36))
% 0.20/0.52 (step t2.t38 (cl (= (not (@ tptp.cQDP2 Xs)) (not (@ (lambda ((Xz (-> (-> $$unsorted Bool) Bool))) (and (= Xz (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt))))))) (not (forall ((Xt (-> $$unsorted Bool))) (not (@ Xz Xt)))))) Xs)))) :rule cong :premises (t2.t37))
% 0.20/0.52 (step t2 (cl (= (forall ((Xs (-> (-> $$unsorted Bool) Bool))) (not (@ tptp.cQDP2 Xs))) (forall ((Xs (-> (-> $$unsorted Bool) Bool))) (not (@ (lambda ((Xz (-> (-> $$unsorted Bool) Bool))) (and (= Xz (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt))))))) (not (forall ((Xt (-> $$unsorted Bool))) (not (@ Xz Xt)))))) Xs))))) :rule bind)
% 0.20/0.52 (anchor :step t3 :args ((Xs (-> (-> $$unsorted Bool) Bool)) (:= Xs Xs)))
% 0.20/0.52 (step t3.t1 (cl (= Xs Xs)) :rule refl)
% 0.20/0.52 (step t3.t2 (cl (= (@ (lambda ((Xz (-> (-> $$unsorted Bool) Bool))) (and (= Xz (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt))))))) (not (forall ((Xt (-> $$unsorted Bool))) (not (@ Xz Xt)))))) Xs) (and (= Xs (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt))))))) (not (forall ((Xt (-> $$unsorted Bool))) (not (@ Xs Xt))))))) :rule all_simplify)
% 0.20/0.52 (step t3.t3 (cl (= (not (@ (lambda ((Xz (-> (-> $$unsorted Bool) Bool))) (and (= Xz (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt))))))) (not (forall ((Xt (-> $$unsorted Bool))) (not (@ Xz Xt)))))) Xs)) (not (and (= Xs (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt))))))) (not (forall ((Xt (-> $$unsorted Bool))) (not (@ Xs Xt)))))))) :rule cong :premises (t3.t2))
% 0.20/0.52 (step t3 (cl (= (forall ((Xs (-> (-> $$unsorted Bool) Bool))) (not (@ (lambda ((Xz (-> (-> $$unsorted Bool) Bool))) (and (= Xz (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt))))))) (not (forall ((Xt (-> $$unsorted Bool))) (not (@ Xz Xt)))))) Xs))) (forall ((Xs (-> (-> $$unsorted Bool) Bool))) (not (and (= Xs (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt))))))) (not (forall ((Xt (-> $$unsorted Bool))) (not (@ Xs Xt))))))))) :rule bind)
% 0.20/0.52 (step t4 (cl (= (forall ((Xs (-> (-> $$unsorted Bool) Bool))) (not (and (= Xs (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt))))))) (not (forall ((Xt (-> $$unsorted Bool))) (not (@ Xs Xt))))))) (forall ((Xs (-> (-> $$unsorted Bool) Bool))) (or (not (= Xs (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))))) (forall ((Xt (-> $$unsorted Bool))) (not (@ Xs Xt))))))) :rule all_simplify)
% 0.20/0.52 (step t5 (cl (= (forall ((Xs (-> (-> $$unsorted Bool) Bool))) (or (not (= Xs (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))))) (forall ((Xt (-> $$unsorted Bool))) (not (@ Xs Xt))))) (forall ((Xs (-> (-> $$unsorted Bool) Bool)) (BOUND_VARIABLE_667 (-> $$unsorted Bool))) (or (not (= Xs (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))))) (not (@ Xs BOUND_VARIABLE_667)))))) :rule all_simplify)
% 0.20/0.52 (step t6 (cl (= (forall ((Xs (-> (-> $$unsorted Bool) Bool)) (BOUND_VARIABLE_667 (-> $$unsorted Bool))) (or (not (= Xs (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))))) (not (@ Xs BOUND_VARIABLE_667)))) (forall ((BOUND_VARIABLE_667 (-> $$unsorted Bool))) (or (not (= (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))) (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))))) (not (@ (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))) BOUND_VARIABLE_667)))))) :rule all_simplify)
% 0.20/0.52 (anchor :step t7 :args ((BOUND_VARIABLE_667 (-> $$unsorted Bool)) (:= BOUND_VARIABLE_667 BOUND_VARIABLE_667)))
% 0.20/0.52 (step t7.t1 (cl (= BOUND_VARIABLE_667 BOUND_VARIABLE_667)) :rule refl)
% 0.20/0.52 (step t7.t2 (cl (= (= (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))) (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt))))))) true)) :rule all_simplify)
% 0.20/0.52 (step t7.t3 (cl (= (not (= (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))) (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))))) (not true))) :rule cong :premises (t7.t2))
% 0.20/0.52 (step t7.t4 (cl (= (not true) false)) :rule all_simplify)
% 0.20/0.52 (step t7.t5 (cl (= (not (= (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))) (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))))) false)) :rule trans :premises (t7.t3 t7.t4))
% 0.20/0.52 (step t7.t6 (cl (= (@ (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))) BOUND_VARIABLE_667) (and (= BOUND_VARIABLE_667 (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ BOUND_VARIABLE_667 Xt))))))) :rule all_simplify)
% 0.20/0.52 (step t7.t7 (cl (= (= BOUND_VARIABLE_667 (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (= (lambda ((Xz $$unsorted)) (= tptp.c Xz)) BOUND_VARIABLE_667))) :rule all_simplify)
% 0.20/0.52 (step t7.t8 (cl (= (not (forall ((Xt $$unsorted)) (not (@ BOUND_VARIABLE_667 Xt)))) (not (forall ((Xt $$unsorted)) (not (@ BOUND_VARIABLE_667 Xt)))))) :rule refl)
% 0.20/0.52 (step t7.t9 (cl (= (and (= BOUND_VARIABLE_667 (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ BOUND_VARIABLE_667 Xt))))) (and (= (lambda ((Xz $$unsorted)) (= tptp.c Xz)) BOUND_VARIABLE_667) (not (forall ((Xt $$unsorted)) (not (@ BOUND_VARIABLE_667 Xt))))))) :rule cong :premises (t7.t7 t7.t8))
% 0.20/0.52 (step t7.t10 (cl (= (@ (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))) BOUND_VARIABLE_667) (and (= (lambda ((Xz $$unsorted)) (= tptp.c Xz)) BOUND_VARIABLE_667) (not (forall ((Xt $$unsorted)) (not (@ BOUND_VARIABLE_667 Xt))))))) :rule trans :premises (t7.t6 t7.t9))
% 0.20/0.52 (step t7.t11 (cl (= (not (@ (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))) BOUND_VARIABLE_667)) (not (and (= (lambda ((Xz $$unsorted)) (= tptp.c Xz)) BOUND_VARIABLE_667) (not (forall ((Xt $$unsorted)) (not (@ BOUND_VARIABLE_667 Xt)))))))) :rule cong :premises (t7.t10))
% 0.20/0.52 (step t7.t12 (cl (= (or (not (= (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))) (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))))) (not (@ (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))) BOUND_VARIABLE_667))) (or false (not (and (= (lambda ((Xz $$unsorted)) (= tptp.c Xz)) BOUND_VARIABLE_667) (not (forall ((Xt $$unsorted)) (not (@ BOUND_VARIABLE_667 Xt))))))))) :rule cong :premises (t7.t5 t7.t11))
% 0.20/0.52 (step t7.t13 (cl (= (or false (not (and (= (lambda ((Xz $$unsorted)) (= tptp.c Xz)) BOUND_VARIABLE_667) (not (forall ((Xt $$unsorted)) (not (@ BOUND_VARIABLE_667 Xt))))))) (not (and (= (lambda ((Xz $$unsorted)) (= tptp.c Xz)) BOUND_VARIABLE_667) (not (forall ((Xt $$unsorted)) (not (@ BOUND_VARIABLE_667 Xt)))))))) :rule all_simplify)
% 0.20/0.52 (step t7.t14 (cl (= (or (not (= (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))) (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))))) (not (@ (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))) BOUND_VARIABLE_667))) (not (and (= (lambda ((Xz $$unsorted)) (= tptp.c Xz)) BOUND_VARIABLE_667) (not (forall ((Xt $$unsorted)) (not (@ BOUND_VARIABLE_667 Xt)))))))) :rule trans :premises (t7.t12 t7.t13))
% 0.20/0.52 (step t7 (cl (= (forall ((BOUND_VARIABLE_667 (-> $$unsorted Bool))) (or (not (= (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))) (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))))) (not (@ (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))) BOUND_VARIABLE_667)))) (forall ((BOUND_VARIABLE_667 (-> $$unsorted Bool))) (not (and (= (lambda ((Xz $$unsorted)) (= tptp.c Xz)) BOUND_VARIABLE_667) (not (forall ((Xt $$unsorted)) (not (@ BOUND_VARIABLE_667 Xt))))))))) :rule bind)
% 0.20/0.52 (step t8 (cl (= (forall ((BOUND_VARIABLE_667 (-> $$unsorted Bool))) (not (and (= (lambda ((Xz $$unsorted)) (= tptp.c Xz)) BOUND_VARIABLE_667) (not (forall ((Xt $$unsorted)) (not (@ BOUND_VARIABLE_667 Xt))))))) (forall ((BOUND_VARIABLE_667 (-> $$unsorted Bool))) (or (not (= (lambda ((Xz $$unsorted)) (= tptp.c Xz)) BOUND_VARIABLE_667)) (forall ((Xt $$unsorted)) (not (@ BOUND_VARIABLE_667 Xt))))))) :rule all_simplify)
% 0.20/0.52 (step t9 (cl (= (forall ((BOUND_VARIABLE_667 (-> $$unsorted Bool))) (or (not (= (lambda ((Xz $$unsorted)) (= tptp.c Xz)) BOUND_VARIABLE_667)) (forall ((Xt $$unsorted)) (not (@ BOUND_VARIABLE_667 Xt))))) (forall ((BOUND_VARIABLE_667 (-> $$unsorted Bool)) (BOUND_VARIABLE_695 $$unsorted)) (or (not (= (lambda ((Xz $$unsorted)) (= tptp.c Xz)) BOUND_VARIABLE_667)) (not (@ BOUND_VARIABLE_667 BOUND_VARIABLE_695)))))) :rule all_simplify)
% 0.20/0.52 (step t10 (cl (= (forall ((BOUND_VARIABLE_667 (-> $$unsorted Bool)) (BOUND_VARIABLE_695 $$unsorted)) (or (not (= (lambda ((Xz $$unsorted)) (= tptp.c Xz)) BOUND_VARIABLE_667)) (not (@ BOUND_VARIABLE_667 BOUND_VARIABLE_695)))) (forall ((BOUND_VARIABLE_695 $$unsorted)) (or (not (= (lambda ((Xz $$unsorted)) (= tptp.c Xz)) (lambda ((Xz $$unsorted)) (= tptp.c Xz)))) (not (@ (lambda ((Xz $$unsorted)) (= tptp.c Xz)) BOUND_VARIABLE_695)))))) :rule all_simplify)
% 0.20/0.52 (anchor :step t11 :args ((BOUND_VARIABLE_695 $$unsorted) (:= BOUND_VARIABLE_695 BOUND_VARIABLE_695)))
% 0.20/0.52 (step t11.t1 (cl (= BOUND_VARIABLE_695 BOUND_VARIABLE_695)) :rule refl)
% 0.20/0.52 (step t11.t2 (cl (= (= (lambda ((Xz $$unsorted)) (= tptp.c Xz)) (lambda ((Xz $$unsorted)) (= tptp.c Xz))) true)) :rule all_simplify)
% 0.20/0.52 (step t11.t3 (cl (= (not (= (lambda ((Xz $$unsorted)) (= tptp.c Xz)) (lambda ((Xz $$unsorted)) (= tptp.c Xz)))) (not true))) :rule cong :premises (t11.t2))
% 0.20/0.52 (step t11.t4 (cl (= (not true) false)) :rule all_simplify)
% 0.20/0.52 (step t11.t5 (cl (= (not (= (lambda ((Xz $$unsorted)) (= tptp.c Xz)) (lambda ((Xz $$unsorted)) (= tptp.c Xz)))) false)) :rule trans :premises (t11.t3 t11.t4))
% 0.20/0.52 (step t11.t6 (cl (= (@ (lambda ((Xz $$unsorted)) (= tptp.c Xz)) BOUND_VARIABLE_695) (= tptp.c BOUND_VARIABLE_695))) :rule all_simplify)
% 0.20/0.52 (step t11.t7 (cl (= (not (@ (lambda ((Xz $$unsorted)) (= tptp.c Xz)) BOUND_VARIABLE_695)) (not (= tptp.c BOUND_VARIABLE_695)))) :rule cong :premises (t11.t6))
% 0.20/0.52 (step t11.t8 (cl (= (or (not (= (lambda ((Xz $$unsorted)) (= tptp.c Xz)) (lambda ((Xz $$unsorted)) (= tptp.c Xz)))) (not (@ (lambda ((Xz $$unsorted)) (= tptp.c Xz)) BOUND_VARIABLE_695))) (or false (not (= tptp.c BOUND_VARIABLE_695))))) :rule cong :premises (t11.t5 t11.t7))
% 0.20/0.52 (step t11.t9 (cl (= (or false (not (= tptp.c BOUND_VARIABLE_695))) (not (= tptp.c BOUND_VARIABLE_695)))) :rule all_simplify)
% 0.20/0.52 (step t11.t10 (cl (= (or (not (= (lambda ((Xz $$unsorted)) (= tptp.c Xz)) (lambda ((Xz $$unsorted)) (= tptp.c Xz)))) (not (@ (lambda ((Xz $$unsorted)) (= tptp.c Xz)) BOUND_VARIABLE_695))) (not (= tptp.c BOUND_VARIABLE_695)))) :rule trans :premises (t11.t8 t11.t9))
% 0.20/0.52 (step t11 (cl (= (forall ((BOUND_VARIABLE_695 $$unsorted)) (or (not (= (lambda ((Xz $$unsorted)) (= tptp.c Xz)) (lambda ((Xz $$unsorted)) (= tptp.c Xz)))) (not (@ (lambda ((Xz $$unsorted)) (= tptp.c Xz)) BOUND_VARIABLE_695)))) (forall ((BOUND_VARIABLE_695 $$unsorted)) (not (= tptp.c BOUND_VARIABLE_695))))) :rule bind)
% 0.20/0.52 (step t12 (cl (= (forall ((BOUND_VARIABLE_695 $$unsorted)) (not (= tptp.c BOUND_VARIABLE_695))) (not (= tptp.c tptp.c)))) :rule all_simplify)
% 0.20/0.52 (step t13 (cl (= (= tptp.c tptp.c) true)) :rule all_simplify)
% 0.20/0.52 (step t14 (cl (= (not (= tptp.c tptp.c)) (not true))) :rule cong :premises (t13))
% 0.20/0.52 (step t15 (cl (= (not true) false)) :rule all_simplify)
% 0.20/0.52 (step t16 (cl (= (not (= tptp.c tptp.c)) false)) :rule trans :premises (t14 t15))
% 0.20/0.52 (step t17 (cl (= (forall ((BOUND_VARIABLE_695 $$unsorted)) (not (= tptp.c BOUND_VARIABLE_695))) false)) :rule trans :premises (t12 t16))
% 0.20/0.52 (step t18 (cl (= (forall ((BOUND_VARIABLE_695 $$unsorted)) (or (not (= (lambda ((Xz $$unsorted)) (= tptp.c Xz)) (lambda ((Xz $$unsorted)) (= tptp.c Xz)))) (not (@ (lambda ((Xz $$unsorted)) (= tptp.c Xz)) BOUND_VARIABLE_695)))) false)) :rule trans :premises (t11 t17))
% 0.20/0.52 (step t19 (cl (= (forall ((BOUND_VARIABLE_667 (-> $$unsorted Bool)) (BOUND_VARIABLE_695 $$unsorted)) (or (not (= (lambda ((Xz $$unsorted)) (= tptp.c Xz)) BOUND_VARIABLE_667)) (not (@ BOUND_VARIABLE_667 BOUND_VARIABLE_695)))) false)) :rule trans :premises (t10 t18))
% 0.20/0.52 (step t20 (cl (= (forall ((BOUND_VARIABLE_667 (-> $$unsorted Bool))) (or (not (= (lambda ((Xz $$unsorted)) (= tptp.c Xz)) BOUND_VARIABLE_667)) (forall ((Xt $$unsorted)) (not (@ BOUND_VARIABLE_667 Xt))))) false)) :rule trans :premises (t9 t19))
% 0.20/0.52 (step t21 (cl (= (forall ((BOUND_VARIABLE_667 (-> $$unsorted Bool))) (not (and (= (lambda ((Xz $$unsorted)) (= tptp.c Xz)) BOUND_VARIABLE_667) (not (forall ((Xt $$unsorted)) (not (@ BOUND_VARIABLE_667 Xt))))))) false)) :rule trans :premises (t8 t20))
% 0.20/0.52 (step t22 (cl (= (forall ((BOUND_VARIABLE_667 (-> $$unsorted Bool))) (or (not (= (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))) (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))))) (not (@ (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))) BOUND_VARIABLE_667)))) false)) :rule trans :premises (t7 t21))
% 0.20/0.52 (step t23 (cl (= (forall ((Xs (-> (-> $$unsorted Bool) Bool)) (BOUND_VARIABLE_667 (-> $$unsorted Bool))) (or (not (= Xs (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))))) (not (@ Xs BOUND_VARIABLE_667)))) false)) :rule trans :premises (t6 t22))
% 0.20/0.52 (step t24 (cl (= (forall ((Xs (-> (-> $$unsorted Bool) Bool))) (or (not (= Xs (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))))) (forall ((Xt (-> $$unsorted Bool))) (not (@ Xs Xt))))) false)) :rule trans :premises (t5 t23))
% 0.20/0.52 (step t25 (cl (= (forall ((Xs (-> (-> $$unsorted Bool) Bool))) (not (and (= Xs (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt))))))) (not (forall ((Xt (-> $$unsorted Bool))) (not (@ Xs Xt))))))) false)) :rule trans :premises (t4 t24))
% 0.20/0.52 (step t26 (cl (= (forall ((Xs (-> (-> $$unsorted Bool) Bool))) (not (@ (lambda ((Xz (-> (-> $$unsorted Bool) Bool))) (and (= Xz (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt))))))) (not (forall ((Xt (-> $$unsorted Bool))) (not (@ Xz Xt)))))) Xs))) false)) :rule trans :premises (t3 t25))
% 0.20/0.52 (step t27 (cl (= (forall ((Xs (-> (-> $$unsorted Bool) Bool))) (not (@ tptp.cQDP2 Xs))) false)) :rule trans :premises (t2 t26))
% 0.20/0.52 (step t28 (cl (not (= (not (exists ((Xs (-> (-> $$unsorted Bool) Bool))) (@ tptp.cQDP2 Xs))) (forall ((Xs (-> (-> $$unsorted Bool) Bool))) (not (@ tptp.cQDP2 Xs))))) (not (not (exists ((Xs (-> (-> $$unsorted Bool) Bool))) (@ tptp.cQDP2 Xs)))) (forall ((Xs (-> (-> $$unsorted Bool) Bool))) (not (@ tptp.cQDP2 Xs)))) :rule equiv_pos2)
% 0.20/0.52 (step t29 (cl (= (exists ((Xs (-> (-> $$unsorted Bool) Bool))) (@ tptp.cQDP2 Xs)) (not (forall ((Xs (-> (-> $$unsorted Bool) Bool))) (not (@ tptp.cQDP2 Xs)))))) :rule all_simplify)
% 0.20/0.52 (step t30 (cl (= (not (exists ((Xs (-> (-> $$unsorted Bool) Bool))) (@ tptp.cQDP2 Xs))) (not (not (forall ((Xs (-> (-> $$unsorted Bool) Bool))) (not (@ tptp.cQDP2 Xs))))))) :rule cong :premises (t29))
% 0.20/0.52 (step t31 (cl (= (not (not (forall ((Xs (-> (-> $$unsorted Bool) Bool))) (not (@ tptp.cQDP2 Xs))))) (forall ((Xs (-> (-> $$unsorted Bool) Bool))) (not (@ tptp.cQDP2 Xs))))) :rule all_simplify)
% 0.20/0.53 (step t32 (cl (= (not (exists ((Xs (-> (-> $$unsorted Bool) Bool))) (@ tptp.cQDP2 Xs))) (forall ((Xs (-> (-> $$unsorted Bool) Bool))) (not (@ tptp.cQDP2 Xs))))) :rule trans :premises (t30 t31))
% 0.20/0.53 (step t33 (cl (forall ((Xs (-> (-> $$unsorted Bool) Bool))) (not (@ tptp.cQDP2 Xs)))) :rule resolution :premises (t28 t32 a3))
% 0.20/0.53 (step t34 (cl false) :rule resolution :premises (t1 t27 t33))
% 0.20/0.53 (step t35 (cl (not false)) :rule false)
% 0.20/0.53 (step t36 (cl) :rule resolution :premises (t34 t35))
% 0.20/0.53
% 0.20/0.53 % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.TXoDq3GOxT/cvc5---1.0.5_4079.smt2
% 0.20/0.53 % cvc5---1.0.5 exiting
% 0.20/0.53 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------