TSTP Solution File: SYO379^5 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SYO379^5 : TPTP v8.2.0. Bugfixed v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n032.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.15s 0.42s
% Output : Proof 0.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SYO379^5 : TPTP v8.2.0. Bugfixed v5.2.0.
% 0.10/0.11 % Command : do_cvc5 %s %d
% 0.10/0.30 % Computer : n032.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Tue May 28 08:12:09 EDT 2024
% 0.10/0.30 % CPUTime :
% 0.15/0.41 %----Proving TH0
% 0.15/0.42 --- Run --ho-elim --full-saturate-quant at 10...
% 0.15/0.42 % SZS status Theorem for /export/starexec/sandbox/tmp/tmp.Nn3Egt14FL/cvc5---1.0.5_13688.smt2
% 0.15/0.42 % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.Nn3Egt14FL/cvc5---1.0.5_13688.smt2
% 0.15/0.42 (assume a0 (= tptp.cQDP0 (lambda ((Xz $$unsorted)) (= Xz tptp.c))))
% 0.15/0.42 (assume a1 (= tptp.cQDP1 (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz tptp.cQDP0) (exists ((Xt $$unsorted)) (@ Xz Xt))))))
% 0.15/0.42 (assume a2 (not (exists ((Xs (-> $$unsorted Bool))) (@ tptp.cQDP1 Xs))))
% 0.15/0.42 (assume a3 true)
% 0.15/0.42 (step t1 (cl (not (= (forall ((Xs (-> $$unsorted Bool))) (not (@ tptp.cQDP1 Xs))) false)) (not (forall ((Xs (-> $$unsorted Bool))) (not (@ tptp.cQDP1 Xs)))) false) :rule equiv_pos2)
% 0.15/0.42 (anchor :step t2 :args ((Xs (-> $$unsorted Bool)) (:= Xs Xs)))
% 0.15/0.42 (step t2.t1 (cl (= Xs Xs)) :rule refl)
% 0.15/0.42 (step t2.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.15/0.42 (step t2.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.15/0.42 (step t2.t4 (cl (= tptp.cQDP1 tptp.cQDP1)) :rule refl)
% 0.15/0.42 (anchor :step t2.t5 :args ((Xz (-> $$unsorted Bool)) (:= Xz Xz)))
% 0.15/0.42 (step t2.t5.t1 (cl (= Xz Xz)) :rule refl)
% 0.15/0.42 (step t2.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.15/0.42 (step t2.t5.t3 (cl (= tptp.cQDP0 tptp.cQDP0)) :rule refl)
% 0.15/0.42 (anchor :step t2.t5.t4 :args ((Xz $$unsorted) (:= Xz Xz)))
% 0.15/0.42 (step t2.t5.t4.t1 (cl (= Xz Xz)) :rule refl)
% 0.15/0.42 (step t2.t5.t4.t2 (cl (= (= Xz tptp.c) (= tptp.c Xz))) :rule all_simplify)
% 0.15/0.42 (step t2.t5.t4 (cl (= (lambda ((Xz $$unsorted)) (= Xz tptp.c)) (lambda ((Xz $$unsorted)) (= tptp.c Xz)))) :rule bind)
% 0.15/0.42 (step t2.t5.t5 (cl (= (= tptp.cQDP0 (lambda ((Xz $$unsorted)) (= Xz tptp.c))) (= tptp.cQDP0 (lambda ((Xz $$unsorted)) (= tptp.c Xz))))) :rule cong :premises (t2.t5.t3 t2.t5.t4))
% 0.15/0.42 (step t2.t5.t6 (cl (= tptp.cQDP0 (lambda ((Xz $$unsorted)) (= tptp.c Xz)))) :rule resolution :premises (t2.t5.t2 t2.t5.t5 a0))
% 0.15/0.42 (step t2.t5.t7 (cl (= Xz Xz)) :rule refl)
% 0.15/0.42 (step t2.t5.t8 (cl (= (= tptp.cQDP0 Xz) (= (lambda ((Xz $$unsorted)) (= tptp.c Xz)) Xz))) :rule cong :premises (t2.t5.t6 t2.t5.t7))
% 0.15/0.42 (step t2.t5.t9 (cl (= (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))) :rule refl)
% 0.15/0.42 (step t2.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.t8 t2.t5.t9))
% 0.15/0.42 (step t2.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.15/0.42 (step t2.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.t4 t2.t5))
% 0.15/0.42 (step t2.t7 (cl (= tptp.cQDP1 tptp.cQDP1)) :rule refl)
% 0.15/0.42 (anchor :step t2.t8 :args ((Xz (-> $$unsorted Bool)) (:= Xz Xz)))
% 0.15/0.42 (step t2.t8.t1 (cl (= Xz Xz)) :rule refl)
% 0.15/0.42 (step t2.t8.t2 (cl (= (= (lambda ((Xz $$unsorted)) (= tptp.c Xz)) Xz) (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))))) :rule all_simplify)
% 0.15/0.42 (step t2.t8.t3 (cl (= (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))) :rule refl)
% 0.15/0.42 (step t2.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.t8.t2 t2.t8.t3))
% 0.15/0.42 (step t2.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.15/0.42 (step t2.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.t7 t2.t8))
% 0.15/0.42 (step t2.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.t6 t2.t9))
% 0.15/0.42 (step t2.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.15/0.42 (anchor :step t2.t12 :args ((Xz (-> $$unsorted Bool)) (:= Xz Xz)))
% 0.15/0.42 (step t2.t12.t1 (cl (= Xz Xz)) :rule refl)
% 0.15/0.42 (step t2.t12.t2 (cl (= (= Xz tptp.cQDP0) (= tptp.cQDP0 Xz))) :rule all_simplify)
% 0.15/0.42 (step t2.t12.t3 (cl (= (exists ((Xt $$unsorted)) (@ Xz Xt)) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))) :rule all_simplify)
% 0.15/0.42 (step t2.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.t12.t2 t2.t12.t3))
% 0.15/0.42 (step t2.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.15/0.42 (step t2.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.t7 t2.t12))
% 0.15/0.42 (step t2.t14 (cl (= tptp.cQDP1 (lambda ((Xz (-> $$unsorted Bool))) (and (= tptp.cQDP0 Xz) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))))) :rule resolution :premises (t2.t11 t2.t13 a1))
% 0.15/0.42 (step t2.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.t3 t2.t10 t2.t14))
% 0.15/0.42 (step t2.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.15/0.42 (step t2.t17 (cl (= tptp.cQDP0 tptp.cQDP0)) :rule refl)
% 0.15/0.42 (anchor :step t2.t18 :args ((Xz $$unsorted) (:= Xz Xz)))
% 0.15/0.42 (step t2.t18.t1 (cl (= Xz Xz)) :rule refl)
% 0.15/0.42 (step t2.t18.t2 (cl (= (= Xz tptp.c) (= tptp.c Xz))) :rule all_simplify)
% 0.15/0.42 (step t2.t18 (cl (= (lambda ((Xz $$unsorted)) (= Xz tptp.c)) (lambda ((Xz $$unsorted)) (= tptp.c Xz)))) :rule bind)
% 0.15/0.42 (step t2.t19 (cl (= (= tptp.cQDP0 (lambda ((Xz $$unsorted)) (= Xz tptp.c))) (= tptp.cQDP0 (lambda ((Xz $$unsorted)) (= tptp.c Xz))))) :rule cong :premises (t2.t17 t2.t18))
% 0.15/0.42 (step t2.t20 (cl (= tptp.cQDP0 (lambda ((Xz $$unsorted)) (= tptp.c Xz)))) :rule resolution :premises (t2.t16 t2.t19 a0))
% 0.15/0.42 (step t2.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.t2 t2.t15 t2.t20))
% 0.15/0.42 (step t2.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.t21))
% 0.15/0.42 (step t2.t23 (cl (= Xs Xs)) :rule refl)
% 0.15/0.42 (step t2.t24 (cl (= (@ tptp.cQDP1 Xs) (@ (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))) Xs))) :rule cong :premises (t2.t22 t2.t23))
% 0.15/0.42 (step t2.t25 (cl (= (not (@ tptp.cQDP1 Xs)) (not (@ (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))) Xs)))) :rule cong :premises (t2.t24))
% 0.15/0.42 (step t2 (cl (= (forall ((Xs (-> $$unsorted Bool))) (not (@ tptp.cQDP1 Xs))) (forall ((Xs (-> $$unsorted Bool))) (not (@ (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))) Xs))))) :rule bind)
% 0.15/0.42 (anchor :step t3 :args ((Xs (-> $$unsorted Bool)) (:= Xs Xs)))
% 0.15/0.42 (step t3.t1 (cl (= Xs Xs)) :rule refl)
% 0.15/0.42 (step t3.t2 (cl (= (@ (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))) Xs) (and (= Xs (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xs Xt))))))) :rule all_simplify)
% 0.15/0.42 (step t3.t3 (cl (= (not (@ (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))) Xs)) (not (and (= Xs (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xs Xt)))))))) :rule cong :premises (t3.t2))
% 0.15/0.42 (step t3 (cl (= (forall ((Xs (-> $$unsorted Bool))) (not (@ (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))) Xs))) (forall ((Xs (-> $$unsorted Bool))) (not (and (= Xs (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xs Xt))))))))) :rule bind)
% 0.15/0.42 (step t4 (cl (= (forall ((Xs (-> $$unsorted Bool))) (not (and (= Xs (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xs Xt))))))) (forall ((Xs (-> $$unsorted Bool))) (or (not (= Xs (lambda ((Xz $$unsorted)) (= tptp.c Xz)))) (forall ((Xt $$unsorted)) (not (@ Xs Xt))))))) :rule all_simplify)
% 0.15/0.42 (step t5 (cl (= (forall ((Xs (-> $$unsorted Bool))) (or (not (= Xs (lambda ((Xz $$unsorted)) (= tptp.c Xz)))) (forall ((Xt $$unsorted)) (not (@ Xs Xt))))) (forall ((Xs (-> $$unsorted Bool)) (BOUND_VARIABLE_638 $$unsorted)) (or (not (= Xs (lambda ((Xz $$unsorted)) (= tptp.c Xz)))) (not (@ Xs BOUND_VARIABLE_638)))))) :rule all_simplify)
% 0.15/0.42 (step t6 (cl (= (forall ((Xs (-> $$unsorted Bool)) (BOUND_VARIABLE_638 $$unsorted)) (or (not (= Xs (lambda ((Xz $$unsorted)) (= tptp.c Xz)))) (not (@ Xs BOUND_VARIABLE_638)))) (forall ((BOUND_VARIABLE_638 $$unsorted)) (or (not (= (lambda ((Xz $$unsorted)) (= tptp.c Xz)) (lambda ((Xz $$unsorted)) (= tptp.c Xz)))) (not (@ (lambda ((Xz $$unsorted)) (= tptp.c Xz)) BOUND_VARIABLE_638)))))) :rule all_simplify)
% 0.15/0.42 (anchor :step t7 :args ((BOUND_VARIABLE_638 $$unsorted) (:= BOUND_VARIABLE_638 BOUND_VARIABLE_638)))
% 0.15/0.42 (step t7.t1 (cl (= BOUND_VARIABLE_638 BOUND_VARIABLE_638)) :rule refl)
% 0.15/0.42 (step t7.t2 (cl (= (= (lambda ((Xz $$unsorted)) (= tptp.c Xz)) (lambda ((Xz $$unsorted)) (= tptp.c Xz))) true)) :rule all_simplify)
% 0.15/0.42 (step t7.t3 (cl (= (not (= (lambda ((Xz $$unsorted)) (= tptp.c Xz)) (lambda ((Xz $$unsorted)) (= tptp.c Xz)))) (not true))) :rule cong :premises (t7.t2))
% 0.15/0.42 (step t7.t4 (cl (= (not true) false)) :rule all_simplify)
% 0.15/0.42 (step t7.t5 (cl (= (not (= (lambda ((Xz $$unsorted)) (= tptp.c Xz)) (lambda ((Xz $$unsorted)) (= tptp.c Xz)))) false)) :rule trans :premises (t7.t3 t7.t4))
% 0.15/0.42 (step t7.t6 (cl (= (@ (lambda ((Xz $$unsorted)) (= tptp.c Xz)) BOUND_VARIABLE_638) (= tptp.c BOUND_VARIABLE_638))) :rule all_simplify)
% 0.15/0.42 (step t7.t7 (cl (= (not (@ (lambda ((Xz $$unsorted)) (= tptp.c Xz)) BOUND_VARIABLE_638)) (not (= tptp.c BOUND_VARIABLE_638)))) :rule cong :premises (t7.t6))
% 0.15/0.42 (step t7.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_638))) (or false (not (= tptp.c BOUND_VARIABLE_638))))) :rule cong :premises (t7.t5 t7.t7))
% 0.15/0.42 (step t7.t9 (cl (= (or false (not (= tptp.c BOUND_VARIABLE_638))) (not (= tptp.c BOUND_VARIABLE_638)))) :rule all_simplify)
% 0.15/0.42 (step t7.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_638))) (not (= tptp.c BOUND_VARIABLE_638)))) :rule trans :premises (t7.t8 t7.t9))
% 0.15/0.42 (step t7 (cl (= (forall ((BOUND_VARIABLE_638 $$unsorted)) (or (not (= (lambda ((Xz $$unsorted)) (= tptp.c Xz)) (lambda ((Xz $$unsorted)) (= tptp.c Xz)))) (not (@ (lambda ((Xz $$unsorted)) (= tptp.c Xz)) BOUND_VARIABLE_638)))) (forall ((BOUND_VARIABLE_638 $$unsorted)) (not (= tptp.c BOUND_VARIABLE_638))))) :rule bind)
% 0.15/0.42 (step t8 (cl (= (forall ((BOUND_VARIABLE_638 $$unsorted)) (not (= tptp.c BOUND_VARIABLE_638))) (not (= tptp.c tptp.c)))) :rule all_simplify)
% 0.15/0.42 (step t9 (cl (= (= tptp.c tptp.c) true)) :rule all_simplify)
% 0.15/0.42 (step t10 (cl (= (not (= tptp.c tptp.c)) (not true))) :rule cong :premises (t9))
% 0.15/0.42 (step t11 (cl (= (not true) false)) :rule all_simplify)
% 0.15/0.42 (step t12 (cl (= (not (= tptp.c tptp.c)) false)) :rule trans :premises (t10 t11))
% 0.15/0.42 (step t13 (cl (= (forall ((BOUND_VARIABLE_638 $$unsorted)) (not (= tptp.c BOUND_VARIABLE_638))) false)) :rule trans :premises (t8 t12))
% 0.15/0.42 (step t14 (cl (= (forall ((BOUND_VARIABLE_638 $$unsorted)) (or (not (= (lambda ((Xz $$unsorted)) (= tptp.c Xz)) (lambda ((Xz $$unsorted)) (= tptp.c Xz)))) (not (@ (lambda ((Xz $$unsorted)) (= tptp.c Xz)) BOUND_VARIABLE_638)))) false)) :rule trans :premises (t7 t13))
% 0.15/0.42 (step t15 (cl (= (forall ((Xs (-> $$unsorted Bool)) (BOUND_VARIABLE_638 $$unsorted)) (or (not (= Xs (lambda ((Xz $$unsorted)) (= tptp.c Xz)))) (not (@ Xs BOUND_VARIABLE_638)))) false)) :rule trans :premises (t6 t14))
% 0.15/0.42 (step t16 (cl (= (forall ((Xs (-> $$unsorted Bool))) (or (not (= Xs (lambda ((Xz $$unsorted)) (= tptp.c Xz)))) (forall ((Xt $$unsorted)) (not (@ Xs Xt))))) false)) :rule trans :premises (t5 t15))
% 0.15/0.42 (step t17 (cl (= (forall ((Xs (-> $$unsorted Bool))) (not (and (= Xs (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xs Xt))))))) false)) :rule trans :premises (t4 t16))
% 0.15/0.42 (step t18 (cl (= (forall ((Xs (-> $$unsorted Bool))) (not (@ (lambda ((Xz (-> $$unsorted Bool))) (and (= Xz (lambda ((Xz $$unsorted)) (= tptp.c Xz))) (not (forall ((Xt $$unsorted)) (not (@ Xz Xt)))))) Xs))) false)) :rule trans :premises (t3 t17))
% 0.15/0.42 (step t19 (cl (= (forall ((Xs (-> $$unsorted Bool))) (not (@ tptp.cQDP1 Xs))) false)) :rule trans :premises (t2 t18))
% 0.15/0.42 (step t20 (cl (not (= (not (exists ((Xs (-> $$unsorted Bool))) (@ tptp.cQDP1 Xs))) (forall ((Xs (-> $$unsorted Bool))) (not (@ tptp.cQDP1 Xs))))) (not (not (exists ((Xs (-> $$unsorted Bool))) (@ tptp.cQDP1 Xs)))) (forall ((Xs (-> $$unsorted Bool))) (not (@ tptp.cQDP1 Xs)))) :rule equiv_pos2)
% 0.15/0.42 (step t21 (cl (= (exists ((Xs (-> $$unsorted Bool))) (@ tptp.cQDP1 Xs)) (not (forall ((Xs (-> $$unsorted Bool))) (not (@ tptp.cQDP1 Xs)))))) :rule all_simplify)
% 0.15/0.43 (step t22 (cl (= (not (exists ((Xs (-> $$unsorted Bool))) (@ tptp.cQDP1 Xs))) (not (not (forall ((Xs (-> $$unsorted Bool))) (not (@ tptp.cQDP1 Xs))))))) :rule cong :premises (t21))
% 0.15/0.43 (step t23 (cl (= (not (not (forall ((Xs (-> $$unsorted Bool))) (not (@ tptp.cQDP1 Xs))))) (forall ((Xs (-> $$unsorted Bool))) (not (@ tptp.cQDP1 Xs))))) :rule all_simplify)
% 0.15/0.43 (step t24 (cl (= (not (exists ((Xs (-> $$unsorted Bool))) (@ tptp.cQDP1 Xs))) (forall ((Xs (-> $$unsorted Bool))) (not (@ tptp.cQDP1 Xs))))) :rule trans :premises (t22 t23))
% 0.15/0.43 (step t25 (cl (forall ((Xs (-> $$unsorted Bool))) (not (@ tptp.cQDP1 Xs)))) :rule resolution :premises (t20 t24 a2))
% 0.15/0.43 (step t26 (cl false) :rule resolution :premises (t1 t19 t25))
% 0.15/0.43 (step t27 (cl (not false)) :rule false)
% 0.15/0.43 (step t28 (cl) :rule resolution :premises (t26 t27))
% 0.15/0.43
% 0.15/0.43 % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.Nn3Egt14FL/cvc5---1.0.5_13688.smt2
% 0.15/0.43 % cvc5---1.0.5 exiting
% 0.15/0.43 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------