TSTP Solution File: SEU697^2 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SEU697^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n018.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:54: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.04/0.13 % Problem : SEU697^2 : TPTP v8.2.0. Released v3.7.0.
% 0.04/0.14 % Command : do_cvc5 %s %d
% 0.14/0.35 % Computer : n018.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 : Mon May 27 11:35: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/sandbox2/tmp/tmp.jpWtF2q4J3/cvc5---1.0.5_1564.smt2
% 0.20/0.52 % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.jpWtF2q4J3/cvc5---1.0.5_1564.smt2
% 0.20/0.52 (assume a0 (= tptp.lam (lambda ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= (@ Xf Xx) Xy))))))
% 0.20/0.52 (assume a1 (not (forall ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (=> (forall ((Xx $$unsorted)) (=> (@ (@ tptp.in Xx) A) (@ (@ tptp.in (@ Xf Xx)) B))) (= (@ (@ (@ tptp.lam A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))) (@ (@ (@ tptp.lam A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))))))))
% 0.20/0.52 (assume a2 true)
% 0.20/0.52 (step t1 (cl (not (= (not (forall ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (or (not (forall ((Xx $$unsorted)) (or (not (@ (@ tptp.in Xx) A)) (@ (@ tptp.in (@ Xf Xx)) B)))) (= (@ (@ (@ tptp.lam A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))) (@ (@ (@ tptp.lam A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))))))) false)) (not (not (forall ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (or (not (forall ((Xx $$unsorted)) (or (not (@ (@ tptp.in Xx) A)) (@ (@ tptp.in (@ Xf Xx)) B)))) (= (@ (@ (@ tptp.lam A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))) (@ (@ (@ tptp.lam A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx)))))))) false) :rule equiv_pos2)
% 0.20/0.52 (anchor :step t2 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B) (Xf (-> $$unsorted $$unsorted)) (:= Xf Xf)))
% 0.20/0.52 (step t2.t1 (cl (= A A)) :rule refl)
% 0.20/0.52 (step t2.t2 (cl (= B B)) :rule refl)
% 0.20/0.52 (step t2.t3 (cl (= Xf Xf)) :rule refl)
% 0.20/0.52 (step t2.t4 (cl (= (not (forall ((Xx $$unsorted)) (or (not (@ (@ tptp.in Xx) A)) (@ (@ tptp.in (@ Xf Xx)) B)))) (not (forall ((Xx $$unsorted)) (or (not (@ (@ tptp.in Xx) A)) (@ (@ tptp.in (@ Xf Xx)) B)))))) :rule refl)
% 0.20/0.52 (step t2.t5 (cl (not (= (= tptp.lam (lambda ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= (@ Xf Xx) Xy))))) (= tptp.lam (lambda ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx)))))))) (not (= tptp.lam (lambda ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= (@ Xf Xx) Xy)))))) (= tptp.lam (lambda ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx))))))) :rule equiv_pos2)
% 0.20/0.52 (step t2.t6 (cl (= tptp.lam tptp.lam)) :rule refl)
% 0.20/0.52 (anchor :step t2.t7 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B) (Xf (-> $$unsorted $$unsorted)) (:= Xf Xf)))
% 0.20/0.52 (step t2.t7.t1 (cl (= A A)) :rule refl)
% 0.20/0.52 (step t2.t7.t2 (cl (= B B)) :rule refl)
% 0.20/0.52 (step t2.t7.t3 (cl (= Xf Xf)) :rule refl)
% 0.20/0.52 (step t2.t7.t4 (cl (= (@ (@ tptp.dpsetconstr A) B) (@ (@ tptp.dpsetconstr A) B))) :rule refl)
% 0.20/0.52 (anchor :step t2.t7.t5 :args ((Xx $$unsorted) (:= Xx Xx) (Xy $$unsorted) (:= Xy Xy)))
% 0.20/0.52 (step t2.t7.t5.t1 (cl (= Xx Xx)) :rule refl)
% 0.20/0.52 (step t2.t7.t5.t2 (cl (= Xy Xy)) :rule refl)
% 0.20/0.52 (step t2.t7.t5.t3 (cl (= (= (@ Xf Xx) Xy) (= Xy (@ Xf Xx)))) :rule all_simplify)
% 0.20/0.52 (step t2.t7.t5 (cl (= (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= (@ Xf Xx) Xy)) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx))))) :rule bind)
% 0.20/0.52 (step t2.t7.t6 (cl (= (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= (@ Xf Xx) Xy))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx)))))) :rule cong :premises (t2.t7.t4 t2.t7.t5))
% 0.20/0.52 (step t2.t7 (cl (= (lambda ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= (@ Xf Xx) Xy)))) (lambda ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx))))))) :rule bind)
% 0.20/0.52 (step t2.t8 (cl (= (= tptp.lam (lambda ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= (@ Xf Xx) Xy))))) (= tptp.lam (lambda ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx)))))))) :rule cong :premises (t2.t6 t2.t7))
% 0.20/0.52 (step t2.t9 (cl (= tptp.lam (lambda ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx))))))) :rule resolution :premises (t2.t5 t2.t8 a0))
% 0.20/0.52 (step t2.t10 (cl (= A A)) :rule refl)
% 0.20/0.52 (step t2.t11 (cl (= (@ tptp.lam A) (@ (lambda ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx))))) A))) :rule cong :premises (t2.t9 t2.t10))
% 0.20/0.52 (step t2.t12 (cl (= B B)) :rule refl)
% 0.20/0.52 (step t2.t13 (cl (= (@ (@ tptp.lam A) B) (@ (@ (lambda ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx))))) A) B))) :rule cong :premises (t2.t11 t2.t12))
% 0.20/0.52 (step t2.t14 (cl (= (lambda ((Xx $$unsorted)) (@ Xf Xx)) (lambda ((Xx $$unsorted)) (@ Xf Xx)))) :rule refl)
% 0.20/0.52 (step t2.t15 (cl (= (@ (@ (@ tptp.lam A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))) (@ (@ (@ (lambda ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx))))) A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))))) :rule cong :premises (t2.t13 t2.t14))
% 0.20/0.52 (step t2.t16 (cl (= (lambda ((Xx $$unsorted)) (@ Xf Xx)) (lambda ((Xx $$unsorted)) (@ Xf Xx)))) :rule refl)
% 0.20/0.52 (step t2.t17 (cl (= (@ (@ (@ tptp.lam A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))) (@ (@ (@ (lambda ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx))))) A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))))) :rule cong :premises (t2.t13 t2.t16))
% 0.20/0.52 (step t2.t18 (cl (= (= (@ (@ (@ tptp.lam A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))) (@ (@ (@ tptp.lam A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx)))) (= (@ (@ (@ (lambda ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx))))) A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))) (@ (@ (@ (lambda ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx))))) A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx)))))) :rule cong :premises (t2.t15 t2.t17))
% 0.20/0.52 (step t2.t19 (cl (= (or (not (forall ((Xx $$unsorted)) (or (not (@ (@ tptp.in Xx) A)) (@ (@ tptp.in (@ Xf Xx)) B)))) (= (@ (@ (@ tptp.lam A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))) (@ (@ (@ tptp.lam A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))))) (or (not (forall ((Xx $$unsorted)) (or (not (@ (@ tptp.in Xx) A)) (@ (@ tptp.in (@ Xf Xx)) B)))) (= (@ (@ (@ (lambda ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx))))) A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))) (@ (@ (@ (lambda ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx))))) A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))))))) :rule cong :premises (t2.t4 t2.t18))
% 0.20/0.52 (step t2 (cl (= (forall ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (or (not (forall ((Xx $$unsorted)) (or (not (@ (@ tptp.in Xx) A)) (@ (@ tptp.in (@ Xf Xx)) B)))) (= (@ (@ (@ tptp.lam A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))) (@ (@ (@ tptp.lam A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx)))))) (forall ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (or (not (forall ((Xx $$unsorted)) (or (not (@ (@ tptp.in Xx) A)) (@ (@ tptp.in (@ Xf Xx)) B)))) (= (@ (@ (@ (lambda ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx))))) A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))) (@ (@ (@ (lambda ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx))))) A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx)))))))) :rule bind)
% 0.20/0.52 (step t3 (cl (= (not (forall ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (or (not (forall ((Xx $$unsorted)) (or (not (@ (@ tptp.in Xx) A)) (@ (@ tptp.in (@ Xf Xx)) B)))) (= (@ (@ (@ tptp.lam A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))) (@ (@ (@ tptp.lam A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))))))) (not (forall ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (or (not (forall ((Xx $$unsorted)) (or (not (@ (@ tptp.in Xx) A)) (@ (@ tptp.in (@ Xf Xx)) B)))) (= (@ (@ (@ (lambda ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx))))) A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))) (@ (@ (@ (lambda ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx))))) A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))))))))) :rule cong :premises (t2))
% 0.20/0.52 (anchor :step t4 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B) (Xf (-> $$unsorted $$unsorted)) (:= Xf Xf)))
% 0.20/0.52 (step t4.t1 (cl (= A A)) :rule refl)
% 0.20/0.52 (step t4.t2 (cl (= B B)) :rule refl)
% 0.20/0.52 (step t4.t3 (cl (= Xf Xf)) :rule refl)
% 0.20/0.52 (step t4.t4 (cl (= (not (forall ((Xx $$unsorted)) (or (not (@ (@ tptp.in Xx) A)) (@ (@ tptp.in (@ Xf Xx)) B)))) (not (forall ((Xx $$unsorted)) (or (not (@ (@ tptp.in Xx) A)) (@ (@ tptp.in (@ Xf Xx)) B)))))) :rule refl)
% 0.20/0.52 (step t4.t5 (cl (= (@ (lambda ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx))))) A) (lambda ((B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx))))))) :rule all_simplify)
% 0.20/0.52 (step t4.t6 (cl (= B B)) :rule refl)
% 0.20/0.52 (step t4.t7 (cl (= (@ (@ (lambda ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx))))) A) B) (@ (lambda ((B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx))))) B))) :rule cong :premises (t4.t5 t4.t6))
% 0.20/0.52 (step t4.t8 (cl (= (@ (lambda ((B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx))))) B) (lambda ((Xf (-> $$unsorted $$unsorted))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx))))))) :rule all_simplify)
% 0.20/0.52 (step t4.t9 (cl (= (@ (@ (lambda ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx))))) A) B) (lambda ((Xf (-> $$unsorted $$unsorted))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx))))))) :rule trans :premises (t4.t7 t4.t8))
% 0.20/0.52 (step t4.t10 (cl (= (lambda ((Xx $$unsorted)) (@ Xf Xx)) (lambda ((Xx $$unsorted)) (@ Xf Xx)))) :rule refl)
% 0.20/0.52 (step t4.t11 (cl (= (@ (@ (@ (lambda ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx))))) A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))) (@ (lambda ((Xf (-> $$unsorted $$unsorted))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx))))) (lambda ((Xx $$unsorted)) (@ Xf Xx))))) :rule cong :premises (t4.t9 t4.t10))
% 0.20/0.52 (step t4.t12 (cl (= (@ (lambda ((Xf (-> $$unsorted $$unsorted))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx))))) (lambda ((Xx $$unsorted)) (@ Xf Xx))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ (lambda ((Xx $$unsorted)) (@ Xf Xx)) Xx)))))) :rule all_simplify)
% 0.20/0.52 (step t4.t13 (cl (= (@ (@ tptp.dpsetconstr A) B) (@ (@ tptp.dpsetconstr A) B))) :rule refl)
% 0.20/0.52 (anchor :step t4.t14 :args ((Xx $$unsorted) (:= Xx Xx) (Xy $$unsorted) (:= Xy Xy)))
% 0.20/0.52 (step t4.t14.t1 (cl (= Xx Xx)) :rule refl)
% 0.20/0.52 (step t4.t14.t2 (cl (= Xy Xy)) :rule refl)
% 0.20/0.52 (step t4.t14.t3 (cl (= Xy Xy)) :rule refl)
% 0.20/0.52 (step t4.t14.t4 (cl (= (@ (lambda ((Xx $$unsorted)) (@ Xf Xx)) Xx) (@ Xf Xx))) :rule all_simplify)
% 0.20/0.52 (step t4.t14.t5 (cl (= (= Xy (@ (lambda ((Xx $$unsorted)) (@ Xf Xx)) Xx)) (= Xy (@ Xf Xx)))) :rule cong :premises (t4.t14.t3 t4.t14.t4))
% 0.20/0.52 (step t4.t14 (cl (= (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ (lambda ((Xx $$unsorted)) (@ Xf Xx)) Xx))) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx))))) :rule bind)
% 0.20/0.52 (step t4.t15 (cl (= (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ (lambda ((Xx $$unsorted)) (@ Xf Xx)) Xx)))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx)))))) :rule cong :premises (t4.t13 t4.t14))
% 0.20/0.52 (step t4.t16 (cl (= (@ (lambda ((Xf (-> $$unsorted $$unsorted))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx))))) (lambda ((Xx $$unsorted)) (@ Xf Xx))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx)))))) :rule trans :premises (t4.t12 t4.t15))
% 0.20/0.52 (step t4.t17 (cl (= (@ (@ (@ (lambda ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx))))) A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx)))))) :rule trans :premises (t4.t11 t4.t16))
% 0.20/0.52 (step t4.t18 (cl (= (lambda ((Xx $$unsorted)) (@ Xf Xx)) (lambda ((Xx $$unsorted)) (@ Xf Xx)))) :rule refl)
% 0.20/0.52 (step t4.t19 (cl (= (@ (@ (@ (lambda ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx))))) A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))) (@ (lambda ((Xf (-> $$unsorted $$unsorted))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx))))) (lambda ((Xx $$unsorted)) (@ Xf Xx))))) :rule cong :premises (t4.t9 t4.t18))
% 0.20/0.52 (step t4.t20 (cl (= (@ (lambda ((Xf (-> $$unsorted $$unsorted))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx))))) (lambda ((Xx $$unsorted)) (@ Xf Xx))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ (lambda ((Xx $$unsorted)) (@ Xf Xx)) Xx)))))) :rule all_simplify)
% 0.20/0.52 (anchor :step t4.t21 :args ((Xx $$unsorted) (:= Xx Xx) (Xy $$unsorted) (:= Xy Xy)))
% 0.20/0.52 (step t4.t21.t1 (cl (= Xx Xx)) :rule refl)
% 0.20/0.52 (step t4.t21.t2 (cl (= Xy Xy)) :rule refl)
% 0.20/0.52 (step t4.t21.t3 (cl (= Xy Xy)) :rule refl)
% 0.20/0.52 (step t4.t21.t4 (cl (= (@ (lambda ((Xx $$unsorted)) (@ Xf Xx)) Xx) (@ Xf Xx))) :rule all_simplify)
% 0.20/0.52 (step t4.t21.t5 (cl (= (= Xy (@ (lambda ((Xx $$unsorted)) (@ Xf Xx)) Xx)) (= Xy (@ Xf Xx)))) :rule cong :premises (t4.t21.t3 t4.t21.t4))
% 0.20/0.52 (step t4.t21 (cl (= (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ (lambda ((Xx $$unsorted)) (@ Xf Xx)) Xx))) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx))))) :rule bind)
% 0.20/0.52 (step t4.t22 (cl (= (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ (lambda ((Xx $$unsorted)) (@ Xf Xx)) Xx)))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx)))))) :rule cong :premises (t4.t13 t4.t21))
% 0.20/0.52 (step t4.t23 (cl (= (@ (lambda ((Xf (-> $$unsorted $$unsorted))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx))))) (lambda ((Xx $$unsorted)) (@ Xf Xx))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx)))))) :rule trans :premises (t4.t20 t4.t22))
% 0.20/0.52 (step t4.t24 (cl (= (@ (@ (@ (lambda ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx))))) A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx)))))) :rule trans :premises (t4.t19 t4.t23))
% 0.20/0.52 (step t4.t25 (cl (= (= (@ (@ (@ (lambda ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx))))) A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))) (@ (@ (@ (lambda ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx))))) A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx)))) (= (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx)))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx))))))) :rule cong :premises (t4.t17 t4.t24))
% 0.20/0.52 (step t4.t26 (cl (= (= (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx)))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx))))) true)) :rule all_simplify)
% 0.20/0.52 (step t4.t27 (cl (= (= (@ (@ (@ (lambda ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx))))) A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))) (@ (@ (@ (lambda ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx))))) A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx)))) true)) :rule trans :premises (t4.t25 t4.t26))
% 0.20/0.52 (step t4.t28 (cl (= (or (not (forall ((Xx $$unsorted)) (or (not (@ (@ tptp.in Xx) A)) (@ (@ tptp.in (@ Xf Xx)) B)))) (= (@ (@ (@ (lambda ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx))))) A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))) (@ (@ (@ (lambda ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx))))) A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))))) (or (not (forall ((Xx $$unsorted)) (or (not (@ (@ tptp.in Xx) A)) (@ (@ tptp.in (@ Xf Xx)) B)))) true))) :rule cong :premises (t4.t4 t4.t27))
% 0.20/0.52 (step t4.t29 (cl (= (or (not (forall ((Xx $$unsorted)) (or (not (@ (@ tptp.in Xx) A)) (@ (@ tptp.in (@ Xf Xx)) B)))) true) true)) :rule all_simplify)
% 0.20/0.52 (step t4.t30 (cl (= (or (not (forall ((Xx $$unsorted)) (or (not (@ (@ tptp.in Xx) A)) (@ (@ tptp.in (@ Xf Xx)) B)))) (= (@ (@ (@ (lambda ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx))))) A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))) (@ (@ (@ (lambda ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx))))) A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))))) true)) :rule trans :premises (t4.t28 t4.t29))
% 0.20/0.52 (step t4 (cl (= (forall ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (or (not (forall ((Xx $$unsorted)) (or (not (@ (@ tptp.in Xx) A)) (@ (@ tptp.in (@ Xf Xx)) B)))) (= (@ (@ (@ (lambda ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx))))) A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))) (@ (@ (@ (lambda ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx))))) A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx)))))) (forall ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) true))) :rule bind)
% 0.20/0.52 (step t5 (cl (= (forall ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) true) true)) :rule all_simplify)
% 0.20/0.52 (step t6 (cl (= (forall ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (or (not (forall ((Xx $$unsorted)) (or (not (@ (@ tptp.in Xx) A)) (@ (@ tptp.in (@ Xf Xx)) B)))) (= (@ (@ (@ (lambda ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx))))) A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))) (@ (@ (@ (lambda ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx))))) A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx)))))) true)) :rule trans :premises (t4 t5))
% 0.20/0.52 (step t7 (cl (= (not (forall ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (or (not (forall ((Xx $$unsorted)) (or (not (@ (@ tptp.in Xx) A)) (@ (@ tptp.in (@ Xf Xx)) B)))) (= (@ (@ (@ (lambda ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx))))) A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))) (@ (@ (@ (lambda ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx))))) A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))))))) (not true))) :rule cong :premises (t6))
% 0.20/0.52 (step t8 (cl (= (not true) false)) :rule all_simplify)
% 0.20/0.52 (step t9 (cl (= (not (forall ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (or (not (forall ((Xx $$unsorted)) (or (not (@ (@ tptp.in Xx) A)) (@ (@ tptp.in (@ Xf Xx)) B)))) (= (@ (@ (@ (lambda ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx))))) A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))) (@ (@ (@ (lambda ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (@ (@ (@ tptp.dpsetconstr A) B) (lambda ((Xx $$unsorted) (Xy $$unsorted)) (= Xy (@ Xf Xx))))) A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))))))) false)) :rule trans :premises (t7 t8))
% 0.20/0.52 (step t10 (cl (= (not (forall ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (or (not (forall ((Xx $$unsorted)) (or (not (@ (@ tptp.in Xx) A)) (@ (@ tptp.in (@ Xf Xx)) B)))) (= (@ (@ (@ tptp.lam A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))) (@ (@ (@ tptp.lam A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))))))) false)) :rule trans :premises (t3 t9))
% 0.20/0.52 (step t11 (cl (not (= (not (forall ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (=> (forall ((Xx $$unsorted)) (=> (@ (@ tptp.in Xx) A) (@ (@ tptp.in (@ Xf Xx)) B))) (= (@ (@ (@ tptp.lam A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))) (@ (@ (@ tptp.lam A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))))))) (not (forall ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (or (not (forall ((Xx $$unsorted)) (or (not (@ (@ tptp.in Xx) A)) (@ (@ tptp.in (@ Xf Xx)) B)))) (= (@ (@ (@ tptp.lam A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))) (@ (@ (@ tptp.lam A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))))))))) (not (not (forall ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (=> (forall ((Xx $$unsorted)) (=> (@ (@ tptp.in Xx) A) (@ (@ tptp.in (@ Xf Xx)) B))) (= (@ (@ (@ tptp.lam A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))) (@ (@ (@ tptp.lam A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx)))))))) (not (forall ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (or (not (forall ((Xx $$unsorted)) (or (not (@ (@ tptp.in Xx) A)) (@ (@ tptp.in (@ Xf Xx)) B)))) (= (@ (@ (@ tptp.lam A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))) (@ (@ (@ tptp.lam A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx)))))))) :rule equiv_pos2)
% 0.20/0.52 (anchor :step t12 :args ((A $$unsorted) (:= A A) (B $$unsorted) (:= B B) (Xf (-> $$unsorted $$unsorted)) (:= Xf Xf)))
% 0.20/0.52 (step t12.t1 (cl (= A A)) :rule refl)
% 0.20/0.52 (step t12.t2 (cl (= B B)) :rule refl)
% 0.20/0.52 (step t12.t3 (cl (= Xf Xf)) :rule refl)
% 0.20/0.52 (step t12.t4 (cl (= (forall ((Xx $$unsorted)) (=> (@ (@ tptp.in Xx) A) (@ (@ tptp.in (@ Xf Xx)) B))) (forall ((Xx $$unsorted)) (or (not (@ (@ tptp.in Xx) A)) (@ (@ tptp.in (@ Xf Xx)) B))))) :rule all_simplify)
% 0.20/0.52 (step t12.t5 (cl (= (= (@ (@ (@ tptp.lam A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))) (@ (@ (@ tptp.lam A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx)))) (= (@ (@ (@ tptp.lam A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))) (@ (@ (@ tptp.lam A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx)))))) :rule refl)
% 0.20/0.52 (step t12.t6 (cl (= (=> (forall ((Xx $$unsorted)) (=> (@ (@ tptp.in Xx) A) (@ (@ tptp.in (@ Xf Xx)) B))) (= (@ (@ (@ tptp.lam A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))) (@ (@ (@ tptp.lam A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))))) (=> (forall ((Xx $$unsorted)) (or (not (@ (@ tptp.in Xx) A)) (@ (@ tptp.in (@ Xf Xx)) B))) (= (@ (@ (@ tptp.lam A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))) (@ (@ (@ tptp.lam A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))))))) :rule cong :premises (t12.t4 t12.t5))
% 0.20/0.52 (step t12 (cl (= (forall ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (=> (forall ((Xx $$unsorted)) (=> (@ (@ tptp.in Xx) A) (@ (@ tptp.in (@ Xf Xx)) B))) (= (@ (@ (@ tptp.lam A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))) (@ (@ (@ tptp.lam A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx)))))) (forall ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (=> (forall ((Xx $$unsorted)) (or (not (@ (@ tptp.in Xx) A)) (@ (@ tptp.in (@ Xf Xx)) B))) (= (@ (@ (@ tptp.lam A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))) (@ (@ (@ tptp.lam A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx)))))))) :rule bind)
% 0.20/0.52 (step t13 (cl (= (forall ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (=> (forall ((Xx $$unsorted)) (or (not (@ (@ tptp.in Xx) A)) (@ (@ tptp.in (@ Xf Xx)) B))) (= (@ (@ (@ tptp.lam A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))) (@ (@ (@ tptp.lam A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx)))))) (forall ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (or (not (forall ((Xx $$unsorted)) (or (not (@ (@ tptp.in Xx) A)) (@ (@ tptp.in (@ Xf Xx)) B)))) (= (@ (@ (@ tptp.lam A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))) (@ (@ (@ tptp.lam A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx)))))))) :rule all_simplify)
% 0.20/0.52 (step t14 (cl (= (forall ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (=> (forall ((Xx $$unsorted)) (=> (@ (@ tptp.in Xx) A) (@ (@ tptp.in (@ Xf Xx)) B))) (= (@ (@ (@ tptp.lam A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))) (@ (@ (@ tptp.lam A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx)))))) (forall ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (or (not (forall ((Xx $$unsorted)) (or (not (@ (@ tptp.in Xx) A)) (@ (@ tptp.in (@ Xf Xx)) B)))) (= (@ (@ (@ tptp.lam A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))) (@ (@ (@ tptp.lam A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx)))))))) :rule trans :premises (t12 t13))
% 0.20/0.52 (step t15 (cl (= (not (forall ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (=> (forall ((Xx $$unsorted)) (=> (@ (@ tptp.in Xx) A) (@ (@ tptp.in (@ Xf Xx)) B))) (= (@ (@ (@ tptp.lam A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))) (@ (@ (@ tptp.lam A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))))))) (not (forall ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (or (not (forall ((Xx $$unsorted)) (or (not (@ (@ tptp.in Xx) A)) (@ (@ tptp.in (@ Xf Xx)) B)))) (= (@ (@ (@ tptp.lam A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))) (@ (@ (@ tptp.lam A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))))))))) :rule cong :premises (t14))
% 0.20/0.52 (step t16 (cl (not (forall ((A $$unsorted) (B $$unsorted) (Xf (-> $$unsorted $$unsorted))) (or (not (forall ((Xx $$unsorted)) (or (not (@ (@ tptp.in Xx) A)) (@ (@ tptp.in (@ Xf Xx)) B)))) (= (@ (@ (@ tptp.lam A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx))) (@ (@ (@ tptp.lam A) B) (lambda ((Xx $$unsorted)) (@ Xf Xx)))))))) :rule resolution :premises (t11 t15 a1))
% 0.20/0.52 (step t17 (cl false) :rule resolution :premises (t1 t10 t16))
% 0.20/0.52 (step t18 (cl (not false)) :rule false)
% 0.20/0.52 (step t19 (cl) :rule resolution :premises (t17 t18))
% 0.20/0.52
% 0.20/0.52 % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.jpWtF2q4J3/cvc5---1.0.5_1564.smt2
% 0.20/0.52 % cvc5---1.0.5 exiting
% 0.20/0.52 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------