TSTP Solution File: PUZ107^5 by cvc5---1.0.5

%------------------------------------------------------------------------------
% File     : cvc5---1.0.5
% Problem  : PUZ107^5 : TPTP v8.2.0. Bugfixed v6.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : do_cvc5 %s %d

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

% Result   : Theorem 0.22s 0.60s
% Output   : Proof 0.22s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14  % Problem    : PUZ107^5 : TPTP v8.2.0. Bugfixed v6.2.0.
% 0.07/0.15  % Command    : do_cvc5 %s %d
% 0.15/0.36  % Computer : n019.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 300
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Sat May 25 19:58:54 EDT 2024
% 0.15/0.37  % CPUTime    : 
% 0.22/0.54  %----Proving TH0
% 0.22/0.60  --- Run --ho-elim --full-saturate-quant at 10...
% 0.22/0.60  % SZS status Theorem for /export/starexec/sandbox/tmp/tmp.8hUflAYcHJ/cvc5---1.0.5_12126.smt2
% 0.22/0.60  % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.8hUflAYcHJ/cvc5---1.0.5_12126.smt2
% 0.22/0.60  (assume a0 (= tptp.cCKB_INJ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (=> (and (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv) (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2)))))))
% 0.22/0.60  (assume a1 (= tptp.cCKB_XPL (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (=> (@ (@ Xk Xx) Xy) (exists ((Xu $$unsorted) (Xv $$unsorted)) (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xu Xm) (= Xv Xn)))))))))))
% 0.22/0.60  (assume a2 (= tptp.cCKB_INF (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (exists ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ tptp.cCKB_INJ Xh) (@ (@ (@ (@ tptp.cCKB_XPL Xh) Xk) Xm) Xn))))))
% 0.22/0.60  (assume a3 (= tptp.cCKB_FIN (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (@ tptp.cCKB_INF Xk)))))
% 0.22/0.60  (assume a4 (not (@ tptp.cCKB_FIN (lambda ((Xu $$unsorted) (Xv $$unsorted)) (and (= Xu tptp.c1) (= Xv tptp.c1))))))
% 0.22/0.60  (assume a5 true)
% 0.22/0.60  (step t1 (cl (not (= (not (@ tptp.cCKB_FIN (lambda ((Xu $$unsorted) (Xv $$unsorted)) (and (= tptp.c1 Xu) (= tptp.c1 Xv))))) false)) (not (not (@ tptp.cCKB_FIN (lambda ((Xu $$unsorted) (Xv $$unsorted)) (and (= tptp.c1 Xu) (= tptp.c1 Xv)))))) false) :rule equiv_pos2)
% 0.22/0.60  (step t2 (cl (and (= tptp.cCKB_FIN (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ Xk Xm) Xn)) (not (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn)))))))))))) (= tptp.cCKB_INF (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ Xk Xm) Xn)) (not (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn))))))))))))) (= tptp.cCKB_XPL (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv)))))))))) (= tptp.cCKB_INJ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))))) (not (= tptp.cCKB_FIN (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ Xk Xm) Xn)) (not (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn))))))))))))) (not (= tptp.cCKB_INF (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ Xk Xm) Xn)) (not (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn)))))))))))))) (not (= tptp.cCKB_XPL (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))))) (not (= tptp.cCKB_INJ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2)))))))) :rule and_neg)
% 0.22/0.60  (step t3 (cl (not (= (= tptp.cCKB_FIN (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (@ tptp.cCKB_INF Xk)))) (= tptp.cCKB_FIN (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ Xk Xm) Xn)) (not (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn)))))))))))))) (not (= tptp.cCKB_FIN (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (@ tptp.cCKB_INF Xk))))) (= tptp.cCKB_FIN (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ Xk Xm) Xn)) (not (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn))))))))))))) :rule equiv_pos2)
% 0.22/0.60  (step t4 (cl (= tptp.cCKB_FIN tptp.cCKB_FIN)) :rule refl)
% 0.22/0.60  (anchor :step t5 :args ((Xk (-> $$unsorted $$unsorted Bool)) (:= Xk Xk)))
% 0.22/0.60  (step t5.t1 (cl (= Xk Xk)) :rule refl)
% 0.22/0.60  (step t5.t2 (cl (and (= tptp.cCKB_INF (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ Xk Xm) Xn)) (not (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn))))))))))))) (= tptp.cCKB_XPL (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv)))))))))) (= tptp.cCKB_INJ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))))) (not (= tptp.cCKB_INF (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ Xk Xm) Xn)) (not (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn)))))))))))))) (not (= tptp.cCKB_XPL (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))))) (not (= tptp.cCKB_INJ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2)))))))) :rule and_neg)
% 0.22/0.60  (step t5.t3 (cl (not (= (= tptp.cCKB_INF (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (@ tptp.cCKB_INJ Xh)) (not (@ (@ (@ (@ tptp.cCKB_XPL Xh) Xk) Xm) Xn))))))) (= tptp.cCKB_INF (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ Xk Xm) Xn)) (not (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn))))))))))))))) (not (= tptp.cCKB_INF (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (@ tptp.cCKB_INJ Xh)) (not (@ (@ (@ (@ tptp.cCKB_XPL Xh) Xk) Xm) Xn)))))))) (= tptp.cCKB_INF (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ Xk Xm) Xn)) (not (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn)))))))))))))) :rule equiv_pos2)
% 0.22/0.60  (step t5.t4 (cl (= tptp.cCKB_INF tptp.cCKB_INF)) :rule refl)
% 0.22/0.60  (anchor :step t5.t5 :args ((Xk (-> $$unsorted $$unsorted Bool)) (:= Xk Xk)))
% 0.22/0.60  (step t5.t5.t1 (cl (= Xk Xk)) :rule refl)
% 0.22/0.60  (anchor :step t5.t5.t2 :args ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (:= Xh Xh) (Xm $$unsorted) (:= Xm Xm) (Xn $$unsorted) (:= Xn Xn)))
% 0.22/0.60  (step t5.t5.t2.t1 (cl (= Xh Xh)) :rule refl)
% 0.22/0.60  (step t5.t5.t2.t2 (cl (= Xm Xm)) :rule refl)
% 0.22/0.60  (step t5.t5.t2.t3 (cl (= Xn Xn)) :rule refl)
% 0.22/0.60  (step t5.t5.t2.t4 (cl (and (= tptp.cCKB_XPL (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv)))))))))) (= tptp.cCKB_INJ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))))) (not (= tptp.cCKB_XPL (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))))) (not (= tptp.cCKB_INJ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2)))))))) :rule and_neg)
% 0.22/0.60  (step t5.t5.t2.t5 (cl (not (= (= tptp.cCKB_XPL (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (=> (@ (@ Xk Xx) Xy) (exists ((Xu $$unsorted) (Xv $$unsorted)) (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xu Xm) (= Xv Xn)))))))))) (= tptp.cCKB_XPL (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv)))))))))))) (not (= tptp.cCKB_XPL (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (=> (@ (@ Xk Xx) Xy) (exists ((Xu $$unsorted) (Xv $$unsorted)) (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xu Xm) (= Xv Xn))))))))))) (= tptp.cCKB_XPL (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))))) :rule equiv_pos2)
% 0.22/0.60  (step t5.t5.t2.t6 (cl (= tptp.cCKB_XPL tptp.cCKB_XPL)) :rule refl)
% 0.22/0.60  (anchor :step t5.t5.t2.t7 :args ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (:= Xh Xh) (Xk (-> $$unsorted $$unsorted Bool)) (:= Xk Xk) (Xm $$unsorted) (:= Xm Xm) (Xn $$unsorted) (:= Xn Xn)))
% 0.22/0.60  (step t5.t5.t2.t7.t1 (cl (= Xh Xh)) :rule refl)
% 0.22/0.60  (step t5.t5.t2.t7.t2 (cl (= Xk Xk)) :rule refl)
% 0.22/0.60  (step t5.t5.t2.t7.t3 (cl (= Xm Xm)) :rule refl)
% 0.22/0.60  (step t5.t5.t2.t7.t4 (cl (= Xn Xn)) :rule refl)
% 0.22/0.60  (step t5.t5.t2.t7.t5 (cl (= (@ (@ Xk Xm) Xn) (@ (@ Xk Xm) Xn))) :rule refl)
% 0.22/0.60  (anchor :step t5.t5.t2.t7.t6 :args ((Xx $$unsorted) (:= Xx Xx) (Xy $$unsorted) (:= Xy Xy)))
% 0.22/0.60  (step t5.t5.t2.t7.t6.t1 (cl (= Xx Xx)) :rule refl)
% 0.22/0.60  (step t5.t5.t2.t7.t6.t2 (cl (= Xy Xy)) :rule refl)
% 0.22/0.60  (step t5.t5.t2.t7.t6.t3 (cl (= (@ (@ Xk Xx) Xy) (@ (@ Xk Xx) Xy))) :rule refl)
% 0.22/0.60  (anchor :step t5.t5.t2.t7.t6.t4 :args ((Xu $$unsorted) (:= Xu Xu) (Xv $$unsorted) (:= Xv Xv)))
% 0.22/0.60  (step t5.t5.t2.t7.t6.t4.t1 (cl (= Xu Xu)) :rule refl)
% 0.22/0.60  (step t5.t5.t2.t7.t6.t4.t2 (cl (= Xv Xv)) :rule refl)
% 0.22/0.60  (step t5.t5.t2.t7.t6.t4.t3 (cl (= (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv))) :rule refl)
% 0.22/0.60  (step t5.t5.t2.t7.t6.t4.t4 (cl (= (@ (@ Xk Xu) Xv) (@ (@ Xk Xu) Xv))) :rule refl)
% 0.22/0.60  (step t5.t5.t2.t7.t6.t4.t5 (cl (= (= Xu Xm) (= Xm Xu))) :rule all_simplify)
% 0.22/0.60  (step t5.t5.t2.t7.t6.t4.t6 (cl (= (= Xv Xn) (= Xn Xv))) :rule all_simplify)
% 0.22/0.60  (step t5.t5.t2.t7.t6.t4.t7 (cl (= (and (= Xu Xm) (= Xv Xn)) (and (= Xm Xu) (= Xn Xv)))) :rule cong :premises (t5.t5.t2.t7.t6.t4.t5 t5.t5.t2.t7.t6.t4.t6))
% 0.22/0.60  (step t5.t5.t2.t7.t6.t4.t8 (cl (= (not (and (= Xu Xm) (= Xv Xn))) (not (and (= Xm Xu) (= Xn Xv))))) :rule cong :premises (t5.t5.t2.t7.t6.t4.t7))
% 0.22/0.60  (step t5.t5.t2.t7.t6.t4.t9 (cl (= (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xu Xm) (= Xv Xn)))) (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xm Xu) (= Xn Xv)))))) :rule cong :premises (t5.t5.t2.t7.t6.t4.t3 t5.t5.t2.t7.t6.t4.t4 t5.t5.t2.t7.t6.t4.t8))
% 0.22/0.60  (step t5.t5.t2.t7.t6.t4 (cl (= (exists ((Xu $$unsorted) (Xv $$unsorted)) (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xu Xm) (= Xv Xn))))) (exists ((Xu $$unsorted) (Xv $$unsorted)) (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xm Xu) (= Xn Xv))))))) :rule bind)
% 0.22/0.60  (step t5.t5.t2.t7.t6.t5 (cl (= (exists ((Xu $$unsorted) (Xv $$unsorted)) (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xm Xu) (= Xn Xv))))) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (not (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xm Xu) (= Xn Xv))))))))) :rule all_simplify)
% 0.22/0.60  (step t5.t5.t2.t7.t6.t6 (cl (= (forall ((Xu $$unsorted) (Xv $$unsorted)) (not (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xm Xu) (= Xn Xv)))))) (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv)))))) :rule all_simplify)
% 0.22/0.60  (step t5.t5.t2.t7.t6.t7 (cl (= (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (not (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xm Xu) (= Xn Xv))))))) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))) :rule cong :premises (t5.t5.t2.t7.t6.t6))
% 0.22/0.60  (step t5.t5.t2.t7.t6.t8 (cl (= (exists ((Xu $$unsorted) (Xv $$unsorted)) (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xm Xu) (= Xn Xv))))) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))) :rule trans :premises (t5.t5.t2.t7.t6.t5 t5.t5.t2.t7.t6.t7))
% 0.22/0.60  (step t5.t5.t2.t7.t6.t9 (cl (= (exists ((Xu $$unsorted) (Xv $$unsorted)) (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xu Xm) (= Xv Xn))))) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))) :rule trans :premises (t5.t5.t2.t7.t6.t4 t5.t5.t2.t7.t6.t8))
% 0.22/0.60  (step t5.t5.t2.t7.t6.t10 (cl (= (=> (@ (@ Xk Xx) Xy) (exists ((Xu $$unsorted) (Xv $$unsorted)) (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xu Xm) (= Xv Xn)))))) (=> (@ (@ Xk Xx) Xy) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv)))))))) :rule cong :premises (t5.t5.t2.t7.t6.t3 t5.t5.t2.t7.t6.t9))
% 0.22/0.60  (step t5.t5.t2.t7.t6 (cl (= (forall ((Xx $$unsorted) (Xy $$unsorted)) (=> (@ (@ Xk Xx) Xy) (exists ((Xu $$unsorted) (Xv $$unsorted)) (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xu Xm) (= Xv Xn))))))) (forall ((Xx $$unsorted) (Xy $$unsorted)) (=> (@ (@ Xk Xx) Xy) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) :rule bind)
% 0.22/0.60  (step t5.t5.t2.t7.t7 (cl (= (forall ((Xx $$unsorted) (Xy $$unsorted)) (=> (@ (@ Xk Xx) Xy) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) :rule all_simplify)
% 0.22/0.60  (step t5.t5.t2.t7.t8 (cl (= (forall ((Xx $$unsorted) (Xy $$unsorted)) (=> (@ (@ Xk Xx) Xy) (exists ((Xu $$unsorted) (Xv $$unsorted)) (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xu Xm) (= Xv Xn))))))) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) :rule trans :premises (t5.t5.t2.t7.t6 t5.t5.t2.t7.t7))
% 0.22/0.60  (step t5.t5.t2.t7.t9 (cl (= (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (=> (@ (@ Xk Xx) Xy) (exists ((Xu $$unsorted) (Xv $$unsorted)) (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xu Xm) (= Xv Xn)))))))) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv)))))))))) :rule cong :premises (t5.t5.t2.t7.t5 t5.t5.t2.t7.t8))
% 0.22/0.60  (step t5.t5.t2.t7 (cl (= (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (=> (@ (@ Xk Xx) Xy) (exists ((Xu $$unsorted) (Xv $$unsorted)) (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xu Xm) (= Xv Xn))))))))) (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))))) :rule bind)
% 0.22/0.60  (step t5.t5.t2.t8 (cl (= (= tptp.cCKB_XPL (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (=> (@ (@ Xk Xx) Xy) (exists ((Xu $$unsorted) (Xv $$unsorted)) (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xu Xm) (= Xv Xn)))))))))) (= tptp.cCKB_XPL (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv)))))))))))) :rule cong :premises (t5.t5.t2.t6 t5.t5.t2.t7))
% 0.22/0.60  (step t5.t5.t2.t9 (cl (= tptp.cCKB_XPL (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))))) :rule resolution :premises (t5.t5.t2.t5 t5.t5.t2.t8 a1))
% 0.22/0.60  (step t5.t5.t2.t10 (cl (not (= (= tptp.cCKB_INJ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (=> (and (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv) (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2)))))) (= tptp.cCKB_INJ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2)))))))) (not (= tptp.cCKB_INJ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (=> (and (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv) (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))))) (= tptp.cCKB_INJ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))))) :rule equiv_pos2)
% 0.22/0.60  (step t5.t5.t2.t11 (cl (= tptp.cCKB_INJ tptp.cCKB_INJ)) :rule refl)
% 0.22/0.60  (anchor :step t5.t5.t2.t12 :args ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (:= Xh Xh)))
% 0.22/0.60  (step t5.t5.t2.t12.t1 (cl (= Xh Xh)) :rule refl)
% 0.22/0.60  (step t5.t5.t2.t12.t2 (cl (= (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (=> (and (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv) (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2)))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2)))))) :rule all_simplify)
% 0.22/0.60  (step t5.t5.t2.t12 (cl (= (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (=> (and (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv) (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))))) :rule bind)
% 0.22/0.60  (step t5.t5.t2.t13 (cl (= (= tptp.cCKB_INJ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (=> (and (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv) (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2)))))) (= tptp.cCKB_INJ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2)))))))) :rule cong :premises (t5.t5.t2.t11 t5.t5.t2.t12))
% 0.22/0.60  (step t5.t5.t2.t14 (cl (= tptp.cCKB_INJ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))))) :rule resolution :premises (t5.t5.t2.t10 t5.t5.t2.t13 a0))
% 0.22/0.60  (step t5.t5.t2.t15 (cl (and (= tptp.cCKB_XPL (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv)))))))))) (= tptp.cCKB_INJ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2)))))))) :rule resolution :premises (t5.t5.t2.t4 t5.t5.t2.t9 t5.t5.t2.t14))
% 0.22/0.60  (step t5.t5.t2.t16 (cl (= tptp.cCKB_INJ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))))) :rule and :premises (t5.t5.t2.t15))
% 0.22/0.60  (step t5.t5.t2.t17 (cl (= Xh Xh)) :rule refl)
% 0.22/0.60  (step t5.t5.t2.t18 (cl (= (@ tptp.cCKB_INJ Xh) (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) Xh))) :rule cong :premises (t5.t5.t2.t16 t5.t5.t2.t17))
% 0.22/0.60  (step t5.t5.t2.t19 (cl (= (not (@ tptp.cCKB_INJ Xh)) (not (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) Xh)))) :rule cong :premises (t5.t5.t2.t18))
% 0.22/0.60  (step t5.t5.t2.t20 (cl (= tptp.cCKB_XPL (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))))) :rule and :premises (t5.t5.t2.t15))
% 0.22/0.60  (step t5.t5.t2.t21 (cl (= (@ tptp.cCKB_XPL Xh) (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) Xh))) :rule cong :premises (t5.t5.t2.t20 t5.t5.t2.t17))
% 0.22/0.60  (step t5.t5.t2.t22 (cl (= Xk Xk)) :rule refl)
% 0.22/0.60  (step t5.t5.t2.t23 (cl (= (@ (@ tptp.cCKB_XPL Xh) Xk) (@ (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) Xh) Xk))) :rule cong :premises (t5.t5.t2.t21 t5.t5.t2.t22))
% 0.22/0.60  (step t5.t5.t2.t24 (cl (= Xm Xm)) :rule refl)
% 0.22/0.60  (step t5.t5.t2.t25 (cl (= (@ (@ (@ tptp.cCKB_XPL Xh) Xk) Xm) (@ (@ (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) Xh) Xk) Xm))) :rule cong :premises (t5.t5.t2.t23 t5.t5.t2.t24))
% 0.22/0.60  (step t5.t5.t2.t26 (cl (= Xn Xn)) :rule refl)
% 0.22/0.60  (step t5.t5.t2.t27 (cl (= (@ (@ (@ (@ tptp.cCKB_XPL Xh) Xk) Xm) Xn) (@ (@ (@ (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) Xh) Xk) Xm) Xn))) :rule cong :premises (t5.t5.t2.t25 t5.t5.t2.t26))
% 0.22/0.60  (step t5.t5.t2.t28 (cl (= (not (@ (@ (@ (@ tptp.cCKB_XPL Xh) Xk) Xm) Xn)) (not (@ (@ (@ (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) Xh) Xk) Xm) Xn)))) :rule cong :premises (t5.t5.t2.t27))
% 0.22/0.60  (step t5.t5.t2.t29 (cl (= (or (not (@ tptp.cCKB_INJ Xh)) (not (@ (@ (@ (@ tptp.cCKB_XPL Xh) Xk) Xm) Xn))) (or (not (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) Xh)) (not (@ (@ (@ (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) Xh) Xk) Xm) Xn))))) :rule cong :premises (t5.t5.t2.t19 t5.t5.t2.t28))
% 0.22/0.60  (step t5.t5.t2 (cl (= (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (@ tptp.cCKB_INJ Xh)) (not (@ (@ (@ (@ tptp.cCKB_XPL Xh) Xk) Xm) Xn)))) (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) Xh)) (not (@ (@ (@ (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) Xh) Xk) Xm) Xn)))))) :rule bind)
% 0.22/0.60  (step t5.t5.t3 (cl (= (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (@ tptp.cCKB_INJ Xh)) (not (@ (@ (@ (@ tptp.cCKB_XPL Xh) Xk) Xm) Xn))))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) Xh)) (not (@ (@ (@ (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) Xh) Xk) Xm) Xn))))))) :rule cong :premises (t5.t5.t2))
% 0.22/0.60  (step t5.t5 (cl (= (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (@ tptp.cCKB_INJ Xh)) (not (@ (@ (@ (@ tptp.cCKB_XPL Xh) Xk) Xm) Xn)))))) (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) Xh)) (not (@ (@ (@ (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) Xh) Xk) Xm) Xn)))))))) :rule bind)
% 0.22/0.60  (step t5.t6 (cl (= (= tptp.cCKB_INF (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (@ tptp.cCKB_INJ Xh)) (not (@ (@ (@ (@ tptp.cCKB_XPL Xh) Xk) Xm) Xn))))))) (= tptp.cCKB_INF (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) Xh)) (not (@ (@ (@ (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) Xh) Xk) Xm) Xn))))))))) :rule cong :premises (t5.t4 t5.t5))
% 0.22/0.60  (step t5.t7 (cl (= tptp.cCKB_INF tptp.cCKB_INF)) :rule refl)
% 0.22/0.60  (anchor :step t5.t8 :args ((Xk (-> $$unsorted $$unsorted Bool)) (:= Xk Xk)))
% 0.22/0.60  (step t5.t8.t1 (cl (= Xk Xk)) :rule refl)
% 0.22/0.60  (anchor :step t5.t8.t2 :args ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (:= Xh Xh) (Xm $$unsorted) (:= Xm Xm) (Xn $$unsorted) (:= Xn Xn)))
% 0.22/0.60  (step t5.t8.t2.t1 (cl (= Xh Xh)) :rule refl)
% 0.22/0.60  (step t5.t8.t2.t2 (cl (= Xm Xm)) :rule refl)
% 0.22/0.60  (step t5.t8.t2.t3 (cl (= Xn Xn)) :rule refl)
% 0.22/0.60  (step t5.t8.t2.t4 (cl (= (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) Xh) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2)))))) :rule all_simplify)
% 0.22/0.60  (step t5.t8.t2.t5 (cl (= (not (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) Xh)) (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))))) :rule cong :premises (t5.t8.t2.t4))
% 0.22/0.60  (step t5.t8.t2.t6 (cl (= (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) Xh) (lambda ((Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))))) :rule all_simplify)
% 0.22/0.60  (step t5.t8.t2.t7 (cl (= Xk Xk)) :rule refl)
% 0.22/0.60  (step t5.t8.t2.t8 (cl (= (@ (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) Xh) Xk) (@ (lambda ((Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) Xk))) :rule cong :premises (t5.t8.t2.t6 t5.t8.t2.t7))
% 0.22/0.60  (step t5.t8.t2.t9 (cl (= (@ (lambda ((Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) Xk) (lambda ((Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))))) :rule all_simplify)
% 0.22/0.60  (step t5.t8.t2.t10 (cl (= (@ (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) Xh) Xk) (lambda ((Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))))) :rule trans :premises (t5.t8.t2.t8 t5.t8.t2.t9))
% 0.22/0.60  (step t5.t8.t2.t11 (cl (= Xm Xm)) :rule refl)
% 0.22/0.60  (step t5.t8.t2.t12 (cl (= (@ (@ (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) Xh) Xk) Xm) (@ (lambda ((Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) Xm))) :rule cong :premises (t5.t8.t2.t10 t5.t8.t2.t11))
% 0.22/0.60  (step t5.t8.t2.t13 (cl (= (@ (lambda ((Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) Xm) (lambda ((Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))))) :rule all_simplify)
% 0.22/0.60  (anchor :step t5.t8.t2.t14 :args ((Xn $$unsorted) (:= Xn Xn)))
% 0.22/0.60  (step t5.t8.t2.t14.t1 (cl (= Xn Xn)) :rule refl)
% 0.22/0.60  (step t5.t8.t2.t14.t2 (cl (= (@ (@ Xk Xm) Xn) (@ (@ Xk Xm) Xn))) :rule refl)
% 0.22/0.60  (anchor :step t5.t8.t2.t14.t3 :args ((Xx $$unsorted) (:= Xx Xx) (Xy $$unsorted) (:= Xy Xy)))
% 0.22/0.60  (step t5.t8.t2.t14.t3.t1 (cl (= Xx Xx)) :rule refl)
% 0.22/0.60  (step t5.t8.t2.t14.t3.t2 (cl (= Xy Xy)) :rule refl)
% 0.22/0.60  (step t5.t8.t2.t14.t3.t3 (cl (= (not (@ (@ Xk Xx) Xy)) (not (@ (@ Xk Xx) Xy)))) :rule refl)
% 0.22/0.60  (anchor :step t5.t8.t2.t14.t3.t4 :args ((Xu $$unsorted) (:= Xu Xu) (Xv $$unsorted) (:= Xv Xv)))
% 0.22/0.60  (step t5.t8.t2.t14.t3.t4.t1 (cl (= Xu Xu)) :rule refl)
% 0.22/0.60  (step t5.t8.t2.t14.t3.t4.t2 (cl (= Xv Xv)) :rule refl)
% 0.22/0.60  (step t5.t8.t2.t14.t3.t4.t3 (cl (= (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)))) :rule refl)
% 0.22/0.60  (step t5.t8.t2.t14.t3.t4.t4 (cl (= (not (@ (@ Xk Xu) Xv)) (not (@ (@ Xk Xu) Xv)))) :rule refl)
% 0.22/0.60  (step t5.t8.t2.t14.t3.t4.t5 (cl (= (= Xm Xu) (= Xu Xm))) :rule all_simplify)
% 0.22/0.60  (step t5.t8.t2.t14.t3.t4.t6 (cl (= (= Xn Xv) (= Xn Xv))) :rule refl)
% 0.22/0.60  (step t5.t8.t2.t14.t3.t4.t7 (cl (= (and (= Xm Xu) (= Xn Xv)) (and (= Xu Xm) (= Xn Xv)))) :rule cong :premises (t5.t8.t2.t14.t3.t4.t5 t5.t8.t2.t14.t3.t4.t6))
% 0.22/0.60  (step t5.t8.t2.t14.t3.t4.t8 (cl (= (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xn Xv))))) :rule cong :premises (t5.t8.t2.t14.t3.t4.t3 t5.t8.t2.t14.t3.t4.t4 t5.t8.t2.t14.t3.t4.t7))
% 0.22/0.60  (step t5.t8.t2.t14.t3.t4 (cl (= (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv)))) (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xn Xv)))))) :rule bind)
% 0.22/0.60  (step t5.t8.t2.t14.t3.t5 (cl (= (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xn Xv))))))) :rule cong :premises (t5.t8.t2.t14.t3.t4))
% 0.22/0.60  (step t5.t8.t2.t14.t3.t6 (cl (= (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv)))))) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xn Xv)))))))) :rule cong :premises (t5.t8.t2.t14.t3.t3 t5.t8.t2.t14.t3.t5))
% 0.22/0.60  (step t5.t8.t2.t14.t3 (cl (= (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xn Xv))))))))) :rule bind)
% 0.22/0.60  (step t5.t8.t2.t14.t4 (cl (= (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv)))))))) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xn Xv)))))))))) :rule cong :premises (t5.t8.t2.t14.t2 t5.t8.t2.t14.t3))
% 0.22/0.60  (step t5.t8.t2.t14 (cl (= (lambda ((Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) (lambda ((Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xn Xv))))))))))) :rule bind)
% 0.22/0.60  (step t5.t8.t2.t15 (cl (= (@ (lambda ((Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) Xm) (lambda ((Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xn Xv))))))))))) :rule trans :premises (t5.t8.t2.t13 t5.t8.t2.t14))
% 0.22/0.60  (step t5.t8.t2.t16 (cl (= (@ (@ (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) Xh) Xk) Xm) (lambda ((Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xn Xv))))))))))) :rule trans :premises (t5.t8.t2.t12 t5.t8.t2.t15))
% 0.22/0.60  (step t5.t8.t2.t17 (cl (= Xn Xn)) :rule refl)
% 0.22/0.60  (step t5.t8.t2.t18 (cl (= (@ (@ (@ (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) Xh) Xk) Xm) Xn) (@ (lambda ((Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xn Xv))))))))) Xn))) :rule cong :premises (t5.t8.t2.t16 t5.t8.t2.t17))
% 0.22/0.60  (step t5.t8.t2.t19 (cl (= (@ (lambda ((Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xn Xv))))))))) Xn) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xn Xv)))))))))) :rule all_simplify)
% 0.22/0.60  (step t5.t8.t2.t20 (cl (= (@ (@ Xk Xm) Xn) (@ (@ Xk Xm) Xn))) :rule refl)
% 0.22/0.60  (anchor :step t5.t8.t2.t21 :args ((Xx $$unsorted) (:= Xx Xx) (Xy $$unsorted) (:= Xy Xy)))
% 0.22/0.60  (step t5.t8.t2.t21.t1 (cl (= Xx Xx)) :rule refl)
% 0.22/0.60  (step t5.t8.t2.t21.t2 (cl (= Xy Xy)) :rule refl)
% 0.22/0.60  (step t5.t8.t2.t21.t3 (cl (= (not (@ (@ Xk Xx) Xy)) (not (@ (@ Xk Xx) Xy)))) :rule refl)
% 0.22/0.60  (anchor :step t5.t8.t2.t21.t4 :args ((Xu $$unsorted) (:= Xu Xu) (Xv $$unsorted) (:= Xv Xv)))
% 0.22/0.60  (step t5.t8.t2.t21.t4.t1 (cl (= Xu Xu)) :rule refl)
% 0.22/0.60  (step t5.t8.t2.t21.t4.t2 (cl (= Xv Xv)) :rule refl)
% 0.22/0.60  (step t5.t8.t2.t21.t4.t3 (cl (= (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)))) :rule refl)
% 0.22/0.60  (step t5.t8.t2.t21.t4.t4 (cl (= (not (@ (@ Xk Xu) Xv)) (not (@ (@ Xk Xu) Xv)))) :rule refl)
% 0.22/0.60  (step t5.t8.t2.t21.t4.t5 (cl (= (= Xu Xm) (= Xu Xm))) :rule refl)
% 0.22/0.60  (step t5.t8.t2.t21.t4.t6 (cl (= (= Xn Xv) (= Xv Xn))) :rule all_simplify)
% 0.22/0.60  (step t5.t8.t2.t21.t4.t7 (cl (= (and (= Xu Xm) (= Xn Xv)) (and (= Xu Xm) (= Xv Xn)))) :rule cong :premises (t5.t8.t2.t21.t4.t5 t5.t8.t2.t21.t4.t6))
% 0.22/0.60  (step t5.t8.t2.t21.t4.t8 (cl (= (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xn Xv))) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn))))) :rule cong :premises (t5.t8.t2.t21.t4.t3 t5.t8.t2.t21.t4.t4 t5.t8.t2.t21.t4.t7))
% 0.22/0.60  (step t5.t8.t2.t21.t4 (cl (= (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xn Xv)))) (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn)))))) :rule bind)
% 0.22/0.60  (step t5.t8.t2.t21.t5 (cl (= (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xn Xv))))) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn))))))) :rule cong :premises (t5.t8.t2.t21.t4))
% 0.22/0.60  (step t5.t8.t2.t21.t6 (cl (= (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xn Xv)))))) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn)))))))) :rule cong :premises (t5.t8.t2.t21.t3 t5.t8.t2.t21.t5))
% 0.22/0.60  (step t5.t8.t2.t21 (cl (= (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xn Xv))))))) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn))))))))) :rule bind)
% 0.22/0.60  (step t5.t8.t2.t22 (cl (= (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xn Xv)))))))) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn)))))))))) :rule cong :premises (t5.t8.t2.t20 t5.t8.t2.t21))
% 0.22/0.60  (step t5.t8.t2.t23 (cl (= (@ (lambda ((Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xn Xv))))))))) Xn) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn)))))))))) :rule trans :premises (t5.t8.t2.t19 t5.t8.t2.t22))
% 0.22/0.60  (step t5.t8.t2.t24 (cl (= (@ (@ (@ (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) Xh) Xk) Xm) Xn) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn)))))))))) :rule trans :premises (t5.t8.t2.t18 t5.t8.t2.t23))
% 0.22/0.60  (step t5.t8.t2.t25 (cl (= (not (@ (@ (@ (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) Xh) Xk) Xm) Xn)) (not (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn))))))))))) :rule cong :premises (t5.t8.t2.t24))
% 0.22/0.60  (step t5.t8.t2.t26 (cl (= (or (not (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) Xh)) (not (@ (@ (@ (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) Xh) Xk) Xm) Xn))) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn)))))))))))) :rule cong :premises (t5.t8.t2.t5 t5.t8.t2.t25))
% 0.22/0.60  (step t5.t8.t2 (cl (= (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) Xh)) (not (@ (@ (@ (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) Xh) Xk) Xm) Xn)))) (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn))))))))))))) :rule bind)
% 0.22/0.60  (step t5.t8.t3 (cl (= (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn))))))))))) (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ Xk Xm) Xn)) (not (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn)))))))))))) :rule all_simplify)
% 0.22/0.60  (step t5.t8.t4 (cl (= (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) Xh)) (not (@ (@ (@ (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) Xh) Xk) Xm) Xn)))) (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ Xk Xm) Xn)) (not (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn)))))))))))) :rule trans :premises (t5.t8.t2 t5.t8.t3))
% 0.22/0.60  (step t5.t8.t5 (cl (= (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) Xh)) (not (@ (@ (@ (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) Xh) Xk) Xm) Xn))))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ Xk Xm) Xn)) (not (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn))))))))))))) :rule cong :premises (t5.t8.t4))
% 0.22/0.60  (step t5.t8 (cl (= (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) Xh)) (not (@ (@ (@ (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) Xh) Xk) Xm) Xn)))))) (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ Xk Xm) Xn)) (not (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn)))))))))))))) :rule bind)
% 0.22/0.60  (step t5.t9 (cl (= (= tptp.cCKB_INF (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) Xh)) (not (@ (@ (@ (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) Xh) Xk) Xm) Xn))))))) (= tptp.cCKB_INF (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ Xk Xm) Xn)) (not (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn))))))))))))))) :rule cong :premises (t5.t7 t5.t8))
% 0.22/0.60  (step t5.t10 (cl (= (= tptp.cCKB_INF (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (@ tptp.cCKB_INJ Xh)) (not (@ (@ (@ (@ tptp.cCKB_XPL Xh) Xk) Xm) Xn))))))) (= tptp.cCKB_INF (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ Xk Xm) Xn)) (not (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn))))))))))))))) :rule trans :premises (t5.t6 t5.t9))
% 0.22/0.60  (step t5.t11 (cl (not (= (= tptp.cCKB_INF (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (exists ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ tptp.cCKB_INJ Xh) (@ (@ (@ (@ tptp.cCKB_XPL Xh) Xk) Xm) Xn))))) (= tptp.cCKB_INF (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (@ tptp.cCKB_INJ Xh)) (not (@ (@ (@ (@ tptp.cCKB_XPL Xh) Xk) Xm) Xn))))))))) (not (= tptp.cCKB_INF (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (exists ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ tptp.cCKB_INJ Xh) (@ (@ (@ (@ tptp.cCKB_XPL Xh) Xk) Xm) Xn)))))) (= tptp.cCKB_INF (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (@ tptp.cCKB_INJ Xh)) (not (@ (@ (@ (@ tptp.cCKB_XPL Xh) Xk) Xm) Xn)))))))) :rule equiv_pos2)
% 0.22/0.60  (anchor :step t5.t12 :args ((Xk (-> $$unsorted $$unsorted Bool)) (:= Xk Xk)))
% 0.22/0.60  (step t5.t12.t1 (cl (= Xk Xk)) :rule refl)
% 0.22/0.60  (step t5.t12.t2 (cl (= (exists ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ tptp.cCKB_INJ Xh) (@ (@ (@ (@ tptp.cCKB_XPL Xh) Xk) Xm) Xn))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (not (and (@ tptp.cCKB_INJ Xh) (@ (@ (@ (@ tptp.cCKB_XPL Xh) Xk) Xm) Xn))))))) :rule all_simplify)
% 0.22/0.60  (step t5.t12.t3 (cl (= (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (not (and (@ tptp.cCKB_INJ Xh) (@ (@ (@ (@ tptp.cCKB_XPL Xh) Xk) Xm) Xn)))) (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (@ tptp.cCKB_INJ Xh)) (not (@ (@ (@ (@ tptp.cCKB_XPL Xh) Xk) Xm) Xn)))))) :rule all_simplify)
% 0.22/0.60  (step t5.t12.t4 (cl (= (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (not (and (@ tptp.cCKB_INJ Xh) (@ (@ (@ (@ tptp.cCKB_XPL Xh) Xk) Xm) Xn))))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (@ tptp.cCKB_INJ Xh)) (not (@ (@ (@ (@ tptp.cCKB_XPL Xh) Xk) Xm) Xn))))))) :rule cong :premises (t5.t12.t3))
% 0.22/0.60  (step t5.t12.t5 (cl (= (exists ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ tptp.cCKB_INJ Xh) (@ (@ (@ (@ tptp.cCKB_XPL Xh) Xk) Xm) Xn))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (@ tptp.cCKB_INJ Xh)) (not (@ (@ (@ (@ tptp.cCKB_XPL Xh) Xk) Xm) Xn))))))) :rule trans :premises (t5.t12.t2 t5.t12.t4))
% 0.22/0.60  (step t5.t12 (cl (= (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (exists ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ tptp.cCKB_INJ Xh) (@ (@ (@ (@ tptp.cCKB_XPL Xh) Xk) Xm) Xn)))) (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (@ tptp.cCKB_INJ Xh)) (not (@ (@ (@ (@ tptp.cCKB_XPL Xh) Xk) Xm) Xn)))))))) :rule bind)
% 0.22/0.60  (step t5.t13 (cl (= (= tptp.cCKB_INF (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (exists ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ tptp.cCKB_INJ Xh) (@ (@ (@ (@ tptp.cCKB_XPL Xh) Xk) Xm) Xn))))) (= tptp.cCKB_INF (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (@ tptp.cCKB_INJ Xh)) (not (@ (@ (@ (@ tptp.cCKB_XPL Xh) Xk) Xm) Xn))))))))) :rule cong :premises (t5.t7 t5.t12))
% 0.22/0.60  (step t5.t14 (cl (= tptp.cCKB_INF (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (@ tptp.cCKB_INJ Xh)) (not (@ (@ (@ (@ tptp.cCKB_XPL Xh) Xk) Xm) Xn)))))))) :rule resolution :premises (t5.t11 t5.t13 a2))
% 0.22/0.60  (step t5.t15 (cl (= tptp.cCKB_INF (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ Xk Xm) Xn)) (not (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn)))))))))))))) :rule resolution :premises (t5.t3 t5.t10 t5.t14))
% 0.22/0.60  (step t5.t16 (cl (not (= (= tptp.cCKB_XPL (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (=> (@ (@ Xk Xx) Xy) (exists ((Xu $$unsorted) (Xv $$unsorted)) (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xu Xm) (= Xv Xn)))))))))) (= tptp.cCKB_XPL (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv)))))))))))) (not (= tptp.cCKB_XPL (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (=> (@ (@ Xk Xx) Xy) (exists ((Xu $$unsorted) (Xv $$unsorted)) (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xu Xm) (= Xv Xn))))))))))) (= tptp.cCKB_XPL (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))))) :rule equiv_pos2)
% 0.22/0.60  (step t5.t17 (cl (= tptp.cCKB_XPL tptp.cCKB_XPL)) :rule refl)
% 0.22/0.60  (anchor :step t5.t18 :args ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (:= Xh Xh) (Xk (-> $$unsorted $$unsorted Bool)) (:= Xk Xk) (Xm $$unsorted) (:= Xm Xm) (Xn $$unsorted) (:= Xn Xn)))
% 0.22/0.60  (step t5.t18.t1 (cl (= Xh Xh)) :rule refl)
% 0.22/0.60  (step t5.t18.t2 (cl (= Xk Xk)) :rule refl)
% 0.22/0.60  (step t5.t18.t3 (cl (= Xm Xm)) :rule refl)
% 0.22/0.60  (step t5.t18.t4 (cl (= Xn Xn)) :rule refl)
% 0.22/0.60  (step t5.t18.t5 (cl (= (@ (@ Xk Xm) Xn) (@ (@ Xk Xm) Xn))) :rule refl)
% 0.22/0.60  (anchor :step t5.t18.t6 :args ((Xx $$unsorted) (:= Xx Xx) (Xy $$unsorted) (:= Xy Xy)))
% 0.22/0.60  (step t5.t18.t6.t1 (cl (= Xx Xx)) :rule refl)
% 0.22/0.60  (step t5.t18.t6.t2 (cl (= Xy Xy)) :rule refl)
% 0.22/0.60  (step t5.t18.t6.t3 (cl (= (@ (@ Xk Xx) Xy) (@ (@ Xk Xx) Xy))) :rule refl)
% 0.22/0.60  (anchor :step t5.t18.t6.t4 :args ((Xu $$unsorted) (:= Xu Xu) (Xv $$unsorted) (:= Xv Xv)))
% 0.22/0.60  (step t5.t18.t6.t4.t1 (cl (= Xu Xu)) :rule refl)
% 0.22/0.60  (step t5.t18.t6.t4.t2 (cl (= Xv Xv)) :rule refl)
% 0.22/0.60  (step t5.t18.t6.t4.t3 (cl (= (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv))) :rule refl)
% 0.22/0.60  (step t5.t18.t6.t4.t4 (cl (= (@ (@ Xk Xu) Xv) (@ (@ Xk Xu) Xv))) :rule refl)
% 0.22/0.60  (step t5.t18.t6.t4.t5 (cl (= (= Xu Xm) (= Xm Xu))) :rule all_simplify)
% 0.22/0.60  (step t5.t18.t6.t4.t6 (cl (= (= Xv Xn) (= Xn Xv))) :rule all_simplify)
% 0.22/0.60  (step t5.t18.t6.t4.t7 (cl (= (and (= Xu Xm) (= Xv Xn)) (and (= Xm Xu) (= Xn Xv)))) :rule cong :premises (t5.t18.t6.t4.t5 t5.t18.t6.t4.t6))
% 0.22/0.60  (step t5.t18.t6.t4.t8 (cl (= (not (and (= Xu Xm) (= Xv Xn))) (not (and (= Xm Xu) (= Xn Xv))))) :rule cong :premises (t5.t18.t6.t4.t7))
% 0.22/0.60  (step t5.t18.t6.t4.t9 (cl (= (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xu Xm) (= Xv Xn)))) (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xm Xu) (= Xn Xv)))))) :rule cong :premises (t5.t18.t6.t4.t3 t5.t18.t6.t4.t4 t5.t18.t6.t4.t8))
% 0.22/0.60  (step t5.t18.t6.t4 (cl (= (exists ((Xu $$unsorted) (Xv $$unsorted)) (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xu Xm) (= Xv Xn))))) (exists ((Xu $$unsorted) (Xv $$unsorted)) (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xm Xu) (= Xn Xv))))))) :rule bind)
% 0.22/0.60  (step t5.t18.t6.t5 (cl (= (exists ((Xu $$unsorted) (Xv $$unsorted)) (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xm Xu) (= Xn Xv))))) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (not (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xm Xu) (= Xn Xv))))))))) :rule all_simplify)
% 0.22/0.60  (step t5.t18.t6.t6 (cl (= (forall ((Xu $$unsorted) (Xv $$unsorted)) (not (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xm Xu) (= Xn Xv)))))) (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv)))))) :rule all_simplify)
% 0.22/0.60  (step t5.t18.t6.t7 (cl (= (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (not (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xm Xu) (= Xn Xv))))))) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))) :rule cong :premises (t5.t18.t6.t6))
% 0.22/0.60  (step t5.t18.t6.t8 (cl (= (exists ((Xu $$unsorted) (Xv $$unsorted)) (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xm Xu) (= Xn Xv))))) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))) :rule trans :premises (t5.t18.t6.t5 t5.t18.t6.t7))
% 0.22/0.60  (step t5.t18.t6.t9 (cl (= (exists ((Xu $$unsorted) (Xv $$unsorted)) (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xu Xm) (= Xv Xn))))) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))) :rule trans :premises (t5.t18.t6.t4 t5.t18.t6.t8))
% 0.22/0.60  (step t5.t18.t6.t10 (cl (= (=> (@ (@ Xk Xx) Xy) (exists ((Xu $$unsorted) (Xv $$unsorted)) (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xu Xm) (= Xv Xn)))))) (=> (@ (@ Xk Xx) Xy) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv)))))))) :rule cong :premises (t5.t18.t6.t3 t5.t18.t6.t9))
% 0.22/0.60  (step t5.t18.t6 (cl (= (forall ((Xx $$unsorted) (Xy $$unsorted)) (=> (@ (@ Xk Xx) Xy) (exists ((Xu $$unsorted) (Xv $$unsorted)) (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xu Xm) (= Xv Xn))))))) (forall ((Xx $$unsorted) (Xy $$unsorted)) (=> (@ (@ Xk Xx) Xy) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) :rule bind)
% 0.22/0.60  (step t5.t18.t7 (cl (= (forall ((Xx $$unsorted) (Xy $$unsorted)) (=> (@ (@ Xk Xx) Xy) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) :rule all_simplify)
% 0.22/0.60  (step t5.t18.t8 (cl (= (forall ((Xx $$unsorted) (Xy $$unsorted)) (=> (@ (@ Xk Xx) Xy) (exists ((Xu $$unsorted) (Xv $$unsorted)) (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xu Xm) (= Xv Xn))))))) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) :rule trans :premises (t5.t18.t6 t5.t18.t7))
% 0.22/0.60  (step t5.t18.t9 (cl (= (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (=> (@ (@ Xk Xx) Xy) (exists ((Xu $$unsorted) (Xv $$unsorted)) (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xu Xm) (= Xv Xn)))))))) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv)))))))))) :rule cong :premises (t5.t18.t5 t5.t18.t8))
% 0.22/0.60  (step t5.t18 (cl (= (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (=> (@ (@ Xk Xx) Xy) (exists ((Xu $$unsorted) (Xv $$unsorted)) (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xu Xm) (= Xv Xn))))))))) (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))))) :rule bind)
% 0.22/0.60  (step t5.t19 (cl (= (= tptp.cCKB_XPL (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (=> (@ (@ Xk Xx) Xy) (exists ((Xu $$unsorted) (Xv $$unsorted)) (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xu Xm) (= Xv Xn)))))))))) (= tptp.cCKB_XPL (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv)))))))))))) :rule cong :premises (t5.t17 t5.t18))
% 0.22/0.60  (step t5.t20 (cl (= tptp.cCKB_XPL (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))))) :rule resolution :premises (t5.t16 t5.t19 a1))
% 0.22/0.60  (step t5.t21 (cl (not (= (= tptp.cCKB_INJ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (=> (and (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv) (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2)))))) (= tptp.cCKB_INJ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2)))))))) (not (= tptp.cCKB_INJ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (=> (and (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv) (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))))) (= tptp.cCKB_INJ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))))) :rule equiv_pos2)
% 0.22/0.60  (step t5.t22 (cl (= tptp.cCKB_INJ tptp.cCKB_INJ)) :rule refl)
% 0.22/0.60  (anchor :step t5.t23 :args ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (:= Xh Xh)))
% 0.22/0.60  (step t5.t23.t1 (cl (= Xh Xh)) :rule refl)
% 0.22/0.60  (step t5.t23.t2 (cl (= (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (=> (and (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv) (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2)))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2)))))) :rule all_simplify)
% 0.22/0.60  (step t5.t23 (cl (= (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (=> (and (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv) (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))))) :rule bind)
% 0.22/0.60  (step t5.t24 (cl (= (= tptp.cCKB_INJ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (=> (and (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv) (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2)))))) (= tptp.cCKB_INJ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2)))))))) :rule cong :premises (t5.t22 t5.t23))
% 0.22/0.60  (step t5.t25 (cl (= tptp.cCKB_INJ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))))) :rule resolution :premises (t5.t21 t5.t24 a0))
% 0.22/0.60  (step t5.t26 (cl (and (= tptp.cCKB_INF (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ Xk Xm) Xn)) (not (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn))))))))))))) (= tptp.cCKB_XPL (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv)))))))))) (= tptp.cCKB_INJ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2)))))))) :rule resolution :premises (t5.t2 t5.t15 t5.t20 t5.t25))
% 0.22/0.60  (step t5.t27 (cl (= tptp.cCKB_INF (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ Xk Xm) Xn)) (not (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn)))))))))))))) :rule and :premises (t5.t26))
% 0.22/0.60  (step t5.t28 (cl (= Xk Xk)) :rule refl)
% 0.22/0.60  (step t5.t29 (cl (= (@ tptp.cCKB_INF Xk) (@ (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ Xk Xm) Xn)) (not (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn)))))))))))) Xk))) :rule cong :premises (t5.t27 t5.t28))
% 0.22/0.60  (step t5.t30 (cl (= (not (@ tptp.cCKB_INF Xk)) (not (@ (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ Xk Xm) Xn)) (not (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn)))))))))))) Xk)))) :rule cong :premises (t5.t29))
% 0.22/0.60  (step t5 (cl (= (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (@ tptp.cCKB_INF Xk))) (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (@ (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ Xk Xm) Xn)) (not (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn)))))))))))) Xk))))) :rule bind)
% 0.22/0.60  (step t6 (cl (= (= tptp.cCKB_FIN (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (@ tptp.cCKB_INF Xk)))) (= tptp.cCKB_FIN (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (@ (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ Xk Xm) Xn)) (not (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn)))))))))))) Xk)))))) :rule cong :premises (t4 t5))
% 0.22/0.60  (step t7 (cl (= tptp.cCKB_FIN tptp.cCKB_FIN)) :rule refl)
% 0.22/0.60  (anchor :step t8 :args ((Xk (-> $$unsorted $$unsorted Bool)) (:= Xk Xk)))
% 0.22/0.60  (step t8.t1 (cl (= Xk Xk)) :rule refl)
% 0.22/0.60  (step t8.t2 (cl (= (@ (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ Xk Xm) Xn)) (not (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn)))))))))))) Xk) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ Xk Xm) Xn)) (not (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn))))))))))))) :rule all_simplify)
% 0.22/0.60  (step t8.t3 (cl (= (not (@ (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ Xk Xm) Xn)) (not (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn)))))))))))) Xk)) (not (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ Xk Xm) Xn)) (not (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn)))))))))))))) :rule cong :premises (t8.t2))
% 0.22/0.60  (step t8.t4 (cl (= (not (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ Xk Xm) Xn)) (not (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn)))))))))))) (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ Xk Xm) Xn)) (not (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn)))))))))))) :rule all_simplify)
% 0.22/0.60  (step t8.t5 (cl (= (not (@ (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ Xk Xm) Xn)) (not (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn)))))))))))) Xk)) (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ Xk Xm) Xn)) (not (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn)))))))))))) :rule trans :premises (t8.t3 t8.t4))
% 0.22/0.60  (step t8 (cl (= (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (@ (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ Xk Xm) Xn)) (not (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn)))))))))))) Xk))) (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ Xk Xm) Xn)) (not (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn))))))))))))) :rule bind)
% 0.22/0.60  (step t9 (cl (= (= tptp.cCKB_FIN (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (@ (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ Xk Xm) Xn)) (not (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn)))))))))))) Xk)))) (= tptp.cCKB_FIN (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ Xk Xm) Xn)) (not (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn)))))))))))))) :rule cong :premises (t7 t8))
% 0.22/0.60  (step t10 (cl (= (= tptp.cCKB_FIN (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (@ tptp.cCKB_INF Xk)))) (= tptp.cCKB_FIN (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ Xk Xm) Xn)) (not (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn)))))))))))))) :rule trans :premises (t6 t9))
% 0.22/0.60  (step t11 (cl (= tptp.cCKB_FIN (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ Xk Xm) Xn)) (not (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn))))))))))))) :rule resolution :premises (t3 t10 a3))
% 0.22/0.60  (step t12 (cl (not (= (= tptp.cCKB_INF (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (@ tptp.cCKB_INJ Xh)) (not (@ (@ (@ (@ tptp.cCKB_XPL Xh) Xk) Xm) Xn))))))) (= tptp.cCKB_INF (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ Xk Xm) Xn)) (not (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn))))))))))))))) (not (= tptp.cCKB_INF (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (@ tptp.cCKB_INJ Xh)) (not (@ (@ (@ (@ tptp.cCKB_XPL Xh) Xk) Xm) Xn)))))))) (= tptp.cCKB_INF (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ Xk Xm) Xn)) (not (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn)))))))))))))) :rule equiv_pos2)
% 0.22/0.60  (step t13 (cl (= tptp.cCKB_INF tptp.cCKB_INF)) :rule refl)
% 0.22/0.60  (anchor :step t14 :args ((Xk (-> $$unsorted $$unsorted Bool)) (:= Xk Xk)))
% 0.22/0.60  (step t14.t1 (cl (= Xk Xk)) :rule refl)
% 0.22/0.60  (anchor :step t14.t2 :args ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (:= Xh Xh) (Xm $$unsorted) (:= Xm Xm) (Xn $$unsorted) (:= Xn Xn)))
% 0.22/0.60  (step t14.t2.t1 (cl (= Xh Xh)) :rule refl)
% 0.22/0.60  (step t14.t2.t2 (cl (= Xm Xm)) :rule refl)
% 0.22/0.60  (step t14.t2.t3 (cl (= Xn Xn)) :rule refl)
% 0.22/0.60  (step t14.t2.t4 (cl (and (= tptp.cCKB_XPL (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv)))))))))) (= tptp.cCKB_INJ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))))) (not (= tptp.cCKB_XPL (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))))) (not (= tptp.cCKB_INJ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2)))))))) :rule and_neg)
% 0.22/0.60  (step t14.t2.t5 (cl (not (= (= tptp.cCKB_XPL (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (=> (@ (@ Xk Xx) Xy) (exists ((Xu $$unsorted) (Xv $$unsorted)) (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xu Xm) (= Xv Xn)))))))))) (= tptp.cCKB_XPL (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv)))))))))))) (not (= tptp.cCKB_XPL (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (=> (@ (@ Xk Xx) Xy) (exists ((Xu $$unsorted) (Xv $$unsorted)) (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xu Xm) (= Xv Xn))))))))))) (= tptp.cCKB_XPL (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))))) :rule equiv_pos2)
% 0.22/0.60  (step t14.t2.t6 (cl (= tptp.cCKB_XPL tptp.cCKB_XPL)) :rule refl)
% 0.22/0.60  (anchor :step t14.t2.t7 :args ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (:= Xh Xh) (Xk (-> $$unsorted $$unsorted Bool)) (:= Xk Xk) (Xm $$unsorted) (:= Xm Xm) (Xn $$unsorted) (:= Xn Xn)))
% 0.22/0.60  (step t14.t2.t7.t1 (cl (= Xh Xh)) :rule refl)
% 0.22/0.60  (step t14.t2.t7.t2 (cl (= Xk Xk)) :rule refl)
% 0.22/0.60  (step t14.t2.t7.t3 (cl (= Xm Xm)) :rule refl)
% 0.22/0.60  (step t14.t2.t7.t4 (cl (= Xn Xn)) :rule refl)
% 0.22/0.60  (step t14.t2.t7.t5 (cl (= (@ (@ Xk Xm) Xn) (@ (@ Xk Xm) Xn))) :rule refl)
% 0.22/0.60  (anchor :step t14.t2.t7.t6 :args ((Xx $$unsorted) (:= Xx Xx) (Xy $$unsorted) (:= Xy Xy)))
% 0.22/0.60  (step t14.t2.t7.t6.t1 (cl (= Xx Xx)) :rule refl)
% 0.22/0.60  (step t14.t2.t7.t6.t2 (cl (= Xy Xy)) :rule refl)
% 0.22/0.60  (step t14.t2.t7.t6.t3 (cl (= (@ (@ Xk Xx) Xy) (@ (@ Xk Xx) Xy))) :rule refl)
% 0.22/0.60  (anchor :step t14.t2.t7.t6.t4 :args ((Xu $$unsorted) (:= Xu Xu) (Xv $$unsorted) (:= Xv Xv)))
% 0.22/0.60  (step t14.t2.t7.t6.t4.t1 (cl (= Xu Xu)) :rule refl)
% 0.22/0.60  (step t14.t2.t7.t6.t4.t2 (cl (= Xv Xv)) :rule refl)
% 0.22/0.60  (step t14.t2.t7.t6.t4.t3 (cl (= (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv))) :rule refl)
% 0.22/0.60  (step t14.t2.t7.t6.t4.t4 (cl (= (@ (@ Xk Xu) Xv) (@ (@ Xk Xu) Xv))) :rule refl)
% 0.22/0.60  (step t14.t2.t7.t6.t4.t5 (cl (= (= Xu Xm) (= Xm Xu))) :rule all_simplify)
% 0.22/0.60  (step t14.t2.t7.t6.t4.t6 (cl (= (= Xv Xn) (= Xn Xv))) :rule all_simplify)
% 0.22/0.60  (step t14.t2.t7.t6.t4.t7 (cl (= (and (= Xu Xm) (= Xv Xn)) (and (= Xm Xu) (= Xn Xv)))) :rule cong :premises (t14.t2.t7.t6.t4.t5 t14.t2.t7.t6.t4.t6))
% 0.22/0.60  (step t14.t2.t7.t6.t4.t8 (cl (= (not (and (= Xu Xm) (= Xv Xn))) (not (and (= Xm Xu) (= Xn Xv))))) :rule cong :premises (t14.t2.t7.t6.t4.t7))
% 0.22/0.60  (step t14.t2.t7.t6.t4.t9 (cl (= (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xu Xm) (= Xv Xn)))) (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xm Xu) (= Xn Xv)))))) :rule cong :premises (t14.t2.t7.t6.t4.t3 t14.t2.t7.t6.t4.t4 t14.t2.t7.t6.t4.t8))
% 0.22/0.60  (step t14.t2.t7.t6.t4 (cl (= (exists ((Xu $$unsorted) (Xv $$unsorted)) (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xu Xm) (= Xv Xn))))) (exists ((Xu $$unsorted) (Xv $$unsorted)) (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xm Xu) (= Xn Xv))))))) :rule bind)
% 0.22/0.60  (step t14.t2.t7.t6.t5 (cl (= (exists ((Xu $$unsorted) (Xv $$unsorted)) (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xm Xu) (= Xn Xv))))) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (not (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xm Xu) (= Xn Xv))))))))) :rule all_simplify)
% 0.22/0.60  (step t14.t2.t7.t6.t6 (cl (= (forall ((Xu $$unsorted) (Xv $$unsorted)) (not (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xm Xu) (= Xn Xv)))))) (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv)))))) :rule all_simplify)
% 0.22/0.60  (step t14.t2.t7.t6.t7 (cl (= (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (not (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xm Xu) (= Xn Xv))))))) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))) :rule cong :premises (t14.t2.t7.t6.t6))
% 0.22/0.60  (step t14.t2.t7.t6.t8 (cl (= (exists ((Xu $$unsorted) (Xv $$unsorted)) (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xm Xu) (= Xn Xv))))) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))) :rule trans :premises (t14.t2.t7.t6.t5 t14.t2.t7.t6.t7))
% 0.22/0.60  (step t14.t2.t7.t6.t9 (cl (= (exists ((Xu $$unsorted) (Xv $$unsorted)) (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xu Xm) (= Xv Xn))))) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))) :rule trans :premises (t14.t2.t7.t6.t4 t14.t2.t7.t6.t8))
% 0.22/0.60  (step t14.t2.t7.t6.t10 (cl (= (=> (@ (@ Xk Xx) Xy) (exists ((Xu $$unsorted) (Xv $$unsorted)) (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xu Xm) (= Xv Xn)))))) (=> (@ (@ Xk Xx) Xy) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv)))))))) :rule cong :premises (t14.t2.t7.t6.t3 t14.t2.t7.t6.t9))
% 0.22/0.60  (step t14.t2.t7.t6 (cl (= (forall ((Xx $$unsorted) (Xy $$unsorted)) (=> (@ (@ Xk Xx) Xy) (exists ((Xu $$unsorted) (Xv $$unsorted)) (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xu Xm) (= Xv Xn))))))) (forall ((Xx $$unsorted) (Xy $$unsorted)) (=> (@ (@ Xk Xx) Xy) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) :rule bind)
% 0.22/0.60  (step t14.t2.t7.t7 (cl (= (forall ((Xx $$unsorted) (Xy $$unsorted)) (=> (@ (@ Xk Xx) Xy) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) :rule all_simplify)
% 0.22/0.60  (step t14.t2.t7.t8 (cl (= (forall ((Xx $$unsorted) (Xy $$unsorted)) (=> (@ (@ Xk Xx) Xy) (exists ((Xu $$unsorted) (Xv $$unsorted)) (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xu Xm) (= Xv Xn))))))) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) :rule trans :premises (t14.t2.t7.t6 t14.t2.t7.t7))
% 0.22/0.60  (step t14.t2.t7.t9 (cl (= (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (=> (@ (@ Xk Xx) Xy) (exists ((Xu $$unsorted) (Xv $$unsorted)) (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xu Xm) (= Xv Xn)))))))) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv)))))))))) :rule cong :premises (t14.t2.t7.t5 t14.t2.t7.t8))
% 0.22/0.60  (step t14.t2.t7 (cl (= (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (=> (@ (@ Xk Xx) Xy) (exists ((Xu $$unsorted) (Xv $$unsorted)) (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xu Xm) (= Xv Xn))))))))) (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))))) :rule bind)
% 0.22/0.60  (step t14.t2.t8 (cl (= (= tptp.cCKB_XPL (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (=> (@ (@ Xk Xx) Xy) (exists ((Xu $$unsorted) (Xv $$unsorted)) (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xu Xm) (= Xv Xn)))))))))) (= tptp.cCKB_XPL (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv)))))))))))) :rule cong :premises (t14.t2.t6 t14.t2.t7))
% 0.22/0.60  (step t14.t2.t9 (cl (= tptp.cCKB_XPL (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))))) :rule resolution :premises (t14.t2.t5 t14.t2.t8 a1))
% 0.22/0.60  (step t14.t2.t10 (cl (not (= (= tptp.cCKB_INJ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (=> (and (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv) (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2)))))) (= tptp.cCKB_INJ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2)))))))) (not (= tptp.cCKB_INJ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (=> (and (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv) (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))))) (= tptp.cCKB_INJ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))))) :rule equiv_pos2)
% 0.22/0.60  (step t14.t2.t11 (cl (= tptp.cCKB_INJ tptp.cCKB_INJ)) :rule refl)
% 0.22/0.60  (anchor :step t14.t2.t12 :args ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (:= Xh Xh)))
% 0.22/0.60  (step t14.t2.t12.t1 (cl (= Xh Xh)) :rule refl)
% 0.22/0.60  (step t14.t2.t12.t2 (cl (= (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (=> (and (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv) (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2)))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2)))))) :rule all_simplify)
% 0.22/0.60  (step t14.t2.t12 (cl (= (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (=> (and (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv) (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))))) :rule bind)
% 0.22/0.60  (step t14.t2.t13 (cl (= (= tptp.cCKB_INJ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (=> (and (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv) (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2)))))) (= tptp.cCKB_INJ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2)))))))) :rule cong :premises (t14.t2.t11 t14.t2.t12))
% 0.22/0.60  (step t14.t2.t14 (cl (= tptp.cCKB_INJ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))))) :rule resolution :premises (t14.t2.t10 t14.t2.t13 a0))
% 0.22/0.60  (step t14.t2.t15 (cl (and (= tptp.cCKB_XPL (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv)))))))))) (= tptp.cCKB_INJ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2)))))))) :rule resolution :premises (t14.t2.t4 t14.t2.t9 t14.t2.t14))
% 0.22/0.60  (step t14.t2.t16 (cl (= tptp.cCKB_INJ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))))) :rule and :premises (t14.t2.t15))
% 0.22/0.60  (step t14.t2.t17 (cl (= Xh Xh)) :rule refl)
% 0.22/0.60  (step t14.t2.t18 (cl (= (@ tptp.cCKB_INJ Xh) (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) Xh))) :rule cong :premises (t14.t2.t16 t14.t2.t17))
% 0.22/0.60  (step t14.t2.t19 (cl (= (not (@ tptp.cCKB_INJ Xh)) (not (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) Xh)))) :rule cong :premises (t14.t2.t18))
% 0.22/0.60  (step t14.t2.t20 (cl (= tptp.cCKB_XPL (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))))) :rule and :premises (t14.t2.t15))
% 0.22/0.60  (step t14.t2.t21 (cl (= (@ tptp.cCKB_XPL Xh) (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) Xh))) :rule cong :premises (t14.t2.t20 t14.t2.t17))
% 0.22/0.60  (step t14.t2.t22 (cl (= Xk Xk)) :rule refl)
% 0.22/0.60  (step t14.t2.t23 (cl (= (@ (@ tptp.cCKB_XPL Xh) Xk) (@ (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) Xh) Xk))) :rule cong :premises (t14.t2.t21 t14.t2.t22))
% 0.22/0.60  (step t14.t2.t24 (cl (= Xm Xm)) :rule refl)
% 0.22/0.60  (step t14.t2.t25 (cl (= (@ (@ (@ tptp.cCKB_XPL Xh) Xk) Xm) (@ (@ (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) Xh) Xk) Xm))) :rule cong :premises (t14.t2.t23 t14.t2.t24))
% 0.22/0.60  (step t14.t2.t26 (cl (= Xn Xn)) :rule refl)
% 0.22/0.60  (step t14.t2.t27 (cl (= (@ (@ (@ (@ tptp.cCKB_XPL Xh) Xk) Xm) Xn) (@ (@ (@ (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) Xh) Xk) Xm) Xn))) :rule cong :premises (t14.t2.t25 t14.t2.t26))
% 0.22/0.60  (step t14.t2.t28 (cl (= (not (@ (@ (@ (@ tptp.cCKB_XPL Xh) Xk) Xm) Xn)) (not (@ (@ (@ (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) Xh) Xk) Xm) Xn)))) :rule cong :premises (t14.t2.t27))
% 0.22/0.60  (step t14.t2.t29 (cl (= (or (not (@ tptp.cCKB_INJ Xh)) (not (@ (@ (@ (@ tptp.cCKB_XPL Xh) Xk) Xm) Xn))) (or (not (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) Xh)) (not (@ (@ (@ (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) Xh) Xk) Xm) Xn))))) :rule cong :premises (t14.t2.t19 t14.t2.t28))
% 0.22/0.60  (step t14.t2 (cl (= (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (@ tptp.cCKB_INJ Xh)) (not (@ (@ (@ (@ tptp.cCKB_XPL Xh) Xk) Xm) Xn)))) (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) Xh)) (not (@ (@ (@ (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) Xh) Xk) Xm) Xn)))))) :rule bind)
% 0.22/0.60  (step t14.t3 (cl (= (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (@ tptp.cCKB_INJ Xh)) (not (@ (@ (@ (@ tptp.cCKB_XPL Xh) Xk) Xm) Xn))))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) Xh)) (not (@ (@ (@ (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) Xh) Xk) Xm) Xn))))))) :rule cong :premises (t14.t2))
% 0.22/0.60  (step t14 (cl (= (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (@ tptp.cCKB_INJ Xh)) (not (@ (@ (@ (@ tptp.cCKB_XPL Xh) Xk) Xm) Xn)))))) (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) Xh)) (not (@ (@ (@ (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) Xh) Xk) Xm) Xn)))))))) :rule bind)
% 0.22/0.60  (step t15 (cl (= (= tptp.cCKB_INF (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (@ tptp.cCKB_INJ Xh)) (not (@ (@ (@ (@ tptp.cCKB_XPL Xh) Xk) Xm) Xn))))))) (= tptp.cCKB_INF (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) Xh)) (not (@ (@ (@ (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) Xh) Xk) Xm) Xn))))))))) :rule cong :premises (t13 t14))
% 0.22/0.60  (step t16 (cl (= tptp.cCKB_INF tptp.cCKB_INF)) :rule refl)
% 0.22/0.60  (anchor :step t17 :args ((Xk (-> $$unsorted $$unsorted Bool)) (:= Xk Xk)))
% 0.22/0.60  (step t17.t1 (cl (= Xk Xk)) :rule refl)
% 0.22/0.60  (anchor :step t17.t2 :args ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (:= Xh Xh) (Xm $$unsorted) (:= Xm Xm) (Xn $$unsorted) (:= Xn Xn)))
% 0.22/0.60  (step t17.t2.t1 (cl (= Xh Xh)) :rule refl)
% 0.22/0.60  (step t17.t2.t2 (cl (= Xm Xm)) :rule refl)
% 0.22/0.60  (step t17.t2.t3 (cl (= Xn Xn)) :rule refl)
% 0.22/0.60  (step t17.t2.t4 (cl (= (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) Xh) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2)))))) :rule all_simplify)
% 0.22/0.60  (step t17.t2.t5 (cl (= (not (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) Xh)) (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))))) :rule cong :premises (t17.t2.t4))
% 0.22/0.60  (step t17.t2.t6 (cl (= (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) Xh) (lambda ((Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))))) :rule all_simplify)
% 0.22/0.60  (step t17.t2.t7 (cl (= Xk Xk)) :rule refl)
% 0.22/0.60  (step t17.t2.t8 (cl (= (@ (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) Xh) Xk) (@ (lambda ((Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) Xk))) :rule cong :premises (t17.t2.t6 t17.t2.t7))
% 0.22/0.60  (step t17.t2.t9 (cl (= (@ (lambda ((Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) Xk) (lambda ((Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))))) :rule all_simplify)
% 0.22/0.60  (step t17.t2.t10 (cl (= (@ (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) Xh) Xk) (lambda ((Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))))) :rule trans :premises (t17.t2.t8 t17.t2.t9))
% 0.22/0.60  (step t17.t2.t11 (cl (= Xm Xm)) :rule refl)
% 0.22/0.60  (step t17.t2.t12 (cl (= (@ (@ (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) Xh) Xk) Xm) (@ (lambda ((Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) Xm))) :rule cong :premises (t17.t2.t10 t17.t2.t11))
% 0.22/0.60  (step t17.t2.t13 (cl (= (@ (lambda ((Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) Xm) (lambda ((Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))))) :rule all_simplify)
% 0.22/0.60  (anchor :step t17.t2.t14 :args ((Xn $$unsorted) (:= Xn Xn)))
% 0.22/0.60  (step t17.t2.t14.t1 (cl (= Xn Xn)) :rule refl)
% 0.22/0.60  (step t17.t2.t14.t2 (cl (= (@ (@ Xk Xm) Xn) (@ (@ Xk Xm) Xn))) :rule refl)
% 0.22/0.60  (anchor :step t17.t2.t14.t3 :args ((Xx $$unsorted) (:= Xx Xx) (Xy $$unsorted) (:= Xy Xy)))
% 0.22/0.60  (step t17.t2.t14.t3.t1 (cl (= Xx Xx)) :rule refl)
% 0.22/0.60  (step t17.t2.t14.t3.t2 (cl (= Xy Xy)) :rule refl)
% 0.22/0.60  (step t17.t2.t14.t3.t3 (cl (= (not (@ (@ Xk Xx) Xy)) (not (@ (@ Xk Xx) Xy)))) :rule refl)
% 0.22/0.60  (anchor :step t17.t2.t14.t3.t4 :args ((Xu $$unsorted) (:= Xu Xu) (Xv $$unsorted) (:= Xv Xv)))
% 0.22/0.60  (step t17.t2.t14.t3.t4.t1 (cl (= Xu Xu)) :rule refl)
% 0.22/0.60  (step t17.t2.t14.t3.t4.t2 (cl (= Xv Xv)) :rule refl)
% 0.22/0.60  (step t17.t2.t14.t3.t4.t3 (cl (= (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)))) :rule refl)
% 0.22/0.60  (step t17.t2.t14.t3.t4.t4 (cl (= (not (@ (@ Xk Xu) Xv)) (not (@ (@ Xk Xu) Xv)))) :rule refl)
% 0.22/0.60  (step t17.t2.t14.t3.t4.t5 (cl (= (= Xm Xu) (= Xu Xm))) :rule all_simplify)
% 0.22/0.60  (step t17.t2.t14.t3.t4.t6 (cl (= (= Xn Xv) (= Xn Xv))) :rule refl)
% 0.22/0.60  (step t17.t2.t14.t3.t4.t7 (cl (= (and (= Xm Xu) (= Xn Xv)) (and (= Xu Xm) (= Xn Xv)))) :rule cong :premises (t17.t2.t14.t3.t4.t5 t17.t2.t14.t3.t4.t6))
% 0.22/0.60  (step t17.t2.t14.t3.t4.t8 (cl (= (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xn Xv))))) :rule cong :premises (t17.t2.t14.t3.t4.t3 t17.t2.t14.t3.t4.t4 t17.t2.t14.t3.t4.t7))
% 0.22/0.60  (step t17.t2.t14.t3.t4 (cl (= (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv)))) (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xn Xv)))))) :rule bind)
% 0.22/0.60  (step t17.t2.t14.t3.t5 (cl (= (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xn Xv))))))) :rule cong :premises (t17.t2.t14.t3.t4))
% 0.22/0.60  (step t17.t2.t14.t3.t6 (cl (= (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv)))))) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xn Xv)))))))) :rule cong :premises (t17.t2.t14.t3.t3 t17.t2.t14.t3.t5))
% 0.22/0.60  (step t17.t2.t14.t3 (cl (= (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xn Xv))))))))) :rule bind)
% 0.22/0.60  (step t17.t2.t14.t4 (cl (= (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv)))))))) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xn Xv)))))))))) :rule cong :premises (t17.t2.t14.t2 t17.t2.t14.t3))
% 0.22/0.60  (step t17.t2.t14 (cl (= (lambda ((Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) (lambda ((Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xn Xv))))))))))) :rule bind)
% 0.22/0.60  (step t17.t2.t15 (cl (= (@ (lambda ((Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) Xm) (lambda ((Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xn Xv))))))))))) :rule trans :premises (t17.t2.t13 t17.t2.t14))
% 0.22/0.60  (step t17.t2.t16 (cl (= (@ (@ (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) Xh) Xk) Xm) (lambda ((Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xn Xv))))))))))) :rule trans :premises (t17.t2.t12 t17.t2.t15))
% 0.22/0.60  (step t17.t2.t17 (cl (= Xn Xn)) :rule refl)
% 0.22/0.60  (step t17.t2.t18 (cl (= (@ (@ (@ (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) Xh) Xk) Xm) Xn) (@ (lambda ((Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xn Xv))))))))) Xn))) :rule cong :premises (t17.t2.t16 t17.t2.t17))
% 0.22/0.60  (step t17.t2.t19 (cl (= (@ (lambda ((Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xn Xv))))))))) Xn) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xn Xv)))))))))) :rule all_simplify)
% 0.22/0.60  (step t17.t2.t20 (cl (= (@ (@ Xk Xm) Xn) (@ (@ Xk Xm) Xn))) :rule refl)
% 0.22/0.60  (anchor :step t17.t2.t21 :args ((Xx $$unsorted) (:= Xx Xx) (Xy $$unsorted) (:= Xy Xy)))
% 0.22/0.60  (step t17.t2.t21.t1 (cl (= Xx Xx)) :rule refl)
% 0.22/0.60  (step t17.t2.t21.t2 (cl (= Xy Xy)) :rule refl)
% 0.22/0.60  (step t17.t2.t21.t3 (cl (= (not (@ (@ Xk Xx) Xy)) (not (@ (@ Xk Xx) Xy)))) :rule refl)
% 0.22/0.60  (anchor :step t17.t2.t21.t4 :args ((Xu $$unsorted) (:= Xu Xu) (Xv $$unsorted) (:= Xv Xv)))
% 0.22/0.60  (step t17.t2.t21.t4.t1 (cl (= Xu Xu)) :rule refl)
% 0.22/0.60  (step t17.t2.t21.t4.t2 (cl (= Xv Xv)) :rule refl)
% 0.22/0.60  (step t17.t2.t21.t4.t3 (cl (= (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)))) :rule refl)
% 0.22/0.60  (step t17.t2.t21.t4.t4 (cl (= (not (@ (@ Xk Xu) Xv)) (not (@ (@ Xk Xu) Xv)))) :rule refl)
% 0.22/0.60  (step t17.t2.t21.t4.t5 (cl (= (= Xu Xm) (= Xu Xm))) :rule refl)
% 0.22/0.60  (step t17.t2.t21.t4.t6 (cl (= (= Xn Xv) (= Xv Xn))) :rule all_simplify)
% 0.22/0.60  (step t17.t2.t21.t4.t7 (cl (= (and (= Xu Xm) (= Xn Xv)) (and (= Xu Xm) (= Xv Xn)))) :rule cong :premises (t17.t2.t21.t4.t5 t17.t2.t21.t4.t6))
% 0.22/0.60  (step t17.t2.t21.t4.t8 (cl (= (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xn Xv))) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn))))) :rule cong :premises (t17.t2.t21.t4.t3 t17.t2.t21.t4.t4 t17.t2.t21.t4.t7))
% 0.22/0.60  (step t17.t2.t21.t4 (cl (= (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xn Xv)))) (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn)))))) :rule bind)
% 0.22/0.60  (step t17.t2.t21.t5 (cl (= (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xn Xv))))) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn))))))) :rule cong :premises (t17.t2.t21.t4))
% 0.22/0.60  (step t17.t2.t21.t6 (cl (= (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xn Xv)))))) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn)))))))) :rule cong :premises (t17.t2.t21.t3 t17.t2.t21.t5))
% 0.22/0.60  (step t17.t2.t21 (cl (= (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xn Xv))))))) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn))))))))) :rule bind)
% 0.22/0.60  (step t17.t2.t22 (cl (= (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xn Xv)))))))) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn)))))))))) :rule cong :premises (t17.t2.t20 t17.t2.t21))
% 0.22/0.60  (step t17.t2.t23 (cl (= (@ (lambda ((Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xn Xv))))))))) Xn) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn)))))))))) :rule trans :premises (t17.t2.t19 t17.t2.t22))
% 0.22/0.60  (step t17.t2.t24 (cl (= (@ (@ (@ (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) Xh) Xk) Xm) Xn) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn)))))))))) :rule trans :premises (t17.t2.t18 t17.t2.t23))
% 0.22/0.60  (step t17.t2.t25 (cl (= (not (@ (@ (@ (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) Xh) Xk) Xm) Xn)) (not (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn))))))))))) :rule cong :premises (t17.t2.t24))
% 0.22/0.60  (step t17.t2.t26 (cl (= (or (not (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) Xh)) (not (@ (@ (@ (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) Xh) Xk) Xm) Xn))) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn)))))))))))) :rule cong :premises (t17.t2.t5 t17.t2.t25))
% 0.22/0.60  (step t17.t2 (cl (= (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) Xh)) (not (@ (@ (@ (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) Xh) Xk) Xm) Xn)))) (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn))))))))))))) :rule bind)
% 0.22/0.60  (step t17.t3 (cl (= (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn))))))))))) (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ Xk Xm) Xn)) (not (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn)))))))))))) :rule all_simplify)
% 0.22/0.60  (step t17.t4 (cl (= (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) Xh)) (not (@ (@ (@ (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) Xh) Xk) Xm) Xn)))) (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ Xk Xm) Xn)) (not (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn)))))))))))) :rule trans :premises (t17.t2 t17.t3))
% 0.22/0.60  (step t17.t5 (cl (= (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) Xh)) (not (@ (@ (@ (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) Xh) Xk) Xm) Xn))))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ Xk Xm) Xn)) (not (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn))))))))))))) :rule cong :premises (t17.t4))
% 0.22/0.60  (step t17 (cl (= (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) Xh)) (not (@ (@ (@ (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) Xh) Xk) Xm) Xn)))))) (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ Xk Xm) Xn)) (not (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn)))))))))))))) :rule bind)
% 0.22/0.60  (step t18 (cl (= (= tptp.cCKB_INF (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) Xh)) (not (@ (@ (@ (@ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) Xh) Xk) Xm) Xn))))))) (= tptp.cCKB_INF (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ Xk Xm) Xn)) (not (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn))))))))))))))) :rule cong :premises (t16 t17))
% 0.22/0.60  (step t19 (cl (= (= tptp.cCKB_INF (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (@ tptp.cCKB_INJ Xh)) (not (@ (@ (@ (@ tptp.cCKB_XPL Xh) Xk) Xm) Xn))))))) (= tptp.cCKB_INF (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ Xk Xm) Xn)) (not (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn))))))))))))))) :rule trans :premises (t15 t18))
% 0.22/0.60  (step t20 (cl (not (= (= tptp.cCKB_INF (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (exists ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ tptp.cCKB_INJ Xh) (@ (@ (@ (@ tptp.cCKB_XPL Xh) Xk) Xm) Xn))))) (= tptp.cCKB_INF (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (@ tptp.cCKB_INJ Xh)) (not (@ (@ (@ (@ tptp.cCKB_XPL Xh) Xk) Xm) Xn))))))))) (not (= tptp.cCKB_INF (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (exists ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ tptp.cCKB_INJ Xh) (@ (@ (@ (@ tptp.cCKB_XPL Xh) Xk) Xm) Xn)))))) (= tptp.cCKB_INF (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (@ tptp.cCKB_INJ Xh)) (not (@ (@ (@ (@ tptp.cCKB_XPL Xh) Xk) Xm) Xn)))))))) :rule equiv_pos2)
% 0.22/0.60  (anchor :step t21 :args ((Xk (-> $$unsorted $$unsorted Bool)) (:= Xk Xk)))
% 0.22/0.60  (step t21.t1 (cl (= Xk Xk)) :rule refl)
% 0.22/0.60  (step t21.t2 (cl (= (exists ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ tptp.cCKB_INJ Xh) (@ (@ (@ (@ tptp.cCKB_XPL Xh) Xk) Xm) Xn))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (not (and (@ tptp.cCKB_INJ Xh) (@ (@ (@ (@ tptp.cCKB_XPL Xh) Xk) Xm) Xn))))))) :rule all_simplify)
% 0.22/0.60  (step t21.t3 (cl (= (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (not (and (@ tptp.cCKB_INJ Xh) (@ (@ (@ (@ tptp.cCKB_XPL Xh) Xk) Xm) Xn)))) (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (@ tptp.cCKB_INJ Xh)) (not (@ (@ (@ (@ tptp.cCKB_XPL Xh) Xk) Xm) Xn)))))) :rule all_simplify)
% 0.22/0.60  (step t21.t4 (cl (= (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (not (and (@ tptp.cCKB_INJ Xh) (@ (@ (@ (@ tptp.cCKB_XPL Xh) Xk) Xm) Xn))))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (@ tptp.cCKB_INJ Xh)) (not (@ (@ (@ (@ tptp.cCKB_XPL Xh) Xk) Xm) Xn))))))) :rule cong :premises (t21.t3))
% 0.22/0.60  (step t21.t5 (cl (= (exists ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ tptp.cCKB_INJ Xh) (@ (@ (@ (@ tptp.cCKB_XPL Xh) Xk) Xm) Xn))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (@ tptp.cCKB_INJ Xh)) (not (@ (@ (@ (@ tptp.cCKB_XPL Xh) Xk) Xm) Xn))))))) :rule trans :premises (t21.t2 t21.t4))
% 0.22/0.60  (step t21 (cl (= (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (exists ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ tptp.cCKB_INJ Xh) (@ (@ (@ (@ tptp.cCKB_XPL Xh) Xk) Xm) Xn)))) (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (@ tptp.cCKB_INJ Xh)) (not (@ (@ (@ (@ tptp.cCKB_XPL Xh) Xk) Xm) Xn)))))))) :rule bind)
% 0.22/0.60  (step t22 (cl (= (= tptp.cCKB_INF (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (exists ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ tptp.cCKB_INJ Xh) (@ (@ (@ (@ tptp.cCKB_XPL Xh) Xk) Xm) Xn))))) (= tptp.cCKB_INF (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (@ tptp.cCKB_INJ Xh)) (not (@ (@ (@ (@ tptp.cCKB_XPL Xh) Xk) Xm) Xn))))))))) :rule cong :premises (t16 t21))
% 0.22/0.60  (step t23 (cl (= tptp.cCKB_INF (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (@ tptp.cCKB_INJ Xh)) (not (@ (@ (@ (@ tptp.cCKB_XPL Xh) Xk) Xm) Xn)))))))) :rule resolution :premises (t20 t22 a2))
% 0.22/0.60  (step t24 (cl (= tptp.cCKB_INF (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ Xk Xm) Xn)) (not (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn)))))))))))))) :rule resolution :premises (t12 t19 t23))
% 0.22/0.60  (step t25 (cl (not (= (= tptp.cCKB_XPL (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (=> (@ (@ Xk Xx) Xy) (exists ((Xu $$unsorted) (Xv $$unsorted)) (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xu Xm) (= Xv Xn)))))))))) (= tptp.cCKB_XPL (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv)))))))))))) (not (= tptp.cCKB_XPL (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (=> (@ (@ Xk Xx) Xy) (exists ((Xu $$unsorted) (Xv $$unsorted)) (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xu Xm) (= Xv Xn))))))))))) (= tptp.cCKB_XPL (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))))) :rule equiv_pos2)
% 0.22/0.60  (step t26 (cl (= tptp.cCKB_XPL tptp.cCKB_XPL)) :rule refl)
% 0.22/0.60  (anchor :step t27 :args ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (:= Xh Xh) (Xk (-> $$unsorted $$unsorted Bool)) (:= Xk Xk) (Xm $$unsorted) (:= Xm Xm) (Xn $$unsorted) (:= Xn Xn)))
% 0.22/0.60  (step t27.t1 (cl (= Xh Xh)) :rule refl)
% 0.22/0.60  (step t27.t2 (cl (= Xk Xk)) :rule refl)
% 0.22/0.60  (step t27.t3 (cl (= Xm Xm)) :rule refl)
% 0.22/0.60  (step t27.t4 (cl (= Xn Xn)) :rule refl)
% 0.22/0.60  (step t27.t5 (cl (= (@ (@ Xk Xm) Xn) (@ (@ Xk Xm) Xn))) :rule refl)
% 0.22/0.60  (anchor :step t27.t6 :args ((Xx $$unsorted) (:= Xx Xx) (Xy $$unsorted) (:= Xy Xy)))
% 0.22/0.60  (step t27.t6.t1 (cl (= Xx Xx)) :rule refl)
% 0.22/0.60  (step t27.t6.t2 (cl (= Xy Xy)) :rule refl)
% 0.22/0.60  (step t27.t6.t3 (cl (= (@ (@ Xk Xx) Xy) (@ (@ Xk Xx) Xy))) :rule refl)
% 0.22/0.60  (anchor :step t27.t6.t4 :args ((Xu $$unsorted) (:= Xu Xu) (Xv $$unsorted) (:= Xv Xv)))
% 0.22/0.60  (step t27.t6.t4.t1 (cl (= Xu Xu)) :rule refl)
% 0.22/0.60  (step t27.t6.t4.t2 (cl (= Xv Xv)) :rule refl)
% 0.22/0.60  (step t27.t6.t4.t3 (cl (= (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv))) :rule refl)
% 0.22/0.60  (step t27.t6.t4.t4 (cl (= (@ (@ Xk Xu) Xv) (@ (@ Xk Xu) Xv))) :rule refl)
% 0.22/0.60  (step t27.t6.t4.t5 (cl (= (= Xu Xm) (= Xm Xu))) :rule all_simplify)
% 0.22/0.60  (step t27.t6.t4.t6 (cl (= (= Xv Xn) (= Xn Xv))) :rule all_simplify)
% 0.22/0.60  (step t27.t6.t4.t7 (cl (= (and (= Xu Xm) (= Xv Xn)) (and (= Xm Xu) (= Xn Xv)))) :rule cong :premises (t27.t6.t4.t5 t27.t6.t4.t6))
% 0.22/0.60  (step t27.t6.t4.t8 (cl (= (not (and (= Xu Xm) (= Xv Xn))) (not (and (= Xm Xu) (= Xn Xv))))) :rule cong :premises (t27.t6.t4.t7))
% 0.22/0.60  (step t27.t6.t4.t9 (cl (= (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xu Xm) (= Xv Xn)))) (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xm Xu) (= Xn Xv)))))) :rule cong :premises (t27.t6.t4.t3 t27.t6.t4.t4 t27.t6.t4.t8))
% 0.22/0.60  (step t27.t6.t4 (cl (= (exists ((Xu $$unsorted) (Xv $$unsorted)) (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xu Xm) (= Xv Xn))))) (exists ((Xu $$unsorted) (Xv $$unsorted)) (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xm Xu) (= Xn Xv))))))) :rule bind)
% 0.22/0.60  (step t27.t6.t5 (cl (= (exists ((Xu $$unsorted) (Xv $$unsorted)) (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xm Xu) (= Xn Xv))))) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (not (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xm Xu) (= Xn Xv))))))))) :rule all_simplify)
% 0.22/0.60  (step t27.t6.t6 (cl (= (forall ((Xu $$unsorted) (Xv $$unsorted)) (not (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xm Xu) (= Xn Xv)))))) (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv)))))) :rule all_simplify)
% 0.22/0.60  (step t27.t6.t7 (cl (= (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (not (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xm Xu) (= Xn Xv))))))) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))) :rule cong :premises (t27.t6.t6))
% 0.22/0.60  (step t27.t6.t8 (cl (= (exists ((Xu $$unsorted) (Xv $$unsorted)) (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xm Xu) (= Xn Xv))))) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))) :rule trans :premises (t27.t6.t5 t27.t6.t7))
% 0.22/0.60  (step t27.t6.t9 (cl (= (exists ((Xu $$unsorted) (Xv $$unsorted)) (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xu Xm) (= Xv Xn))))) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))) :rule trans :premises (t27.t6.t4 t27.t6.t8))
% 0.22/0.60  (step t27.t6.t10 (cl (= (=> (@ (@ Xk Xx) Xy) (exists ((Xu $$unsorted) (Xv $$unsorted)) (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xu Xm) (= Xv Xn)))))) (=> (@ (@ Xk Xx) Xy) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv)))))))) :rule cong :premises (t27.t6.t3 t27.t6.t9))
% 0.22/0.60  (step t27.t6 (cl (= (forall ((Xx $$unsorted) (Xy $$unsorted)) (=> (@ (@ Xk Xx) Xy) (exists ((Xu $$unsorted) (Xv $$unsorted)) (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xu Xm) (= Xv Xn))))))) (forall ((Xx $$unsorted) (Xy $$unsorted)) (=> (@ (@ Xk Xx) Xy) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) :rule bind)
% 0.22/0.60  (step t27.t7 (cl (= (forall ((Xx $$unsorted) (Xy $$unsorted)) (=> (@ (@ Xk Xx) Xy) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) :rule all_simplify)
% 0.22/0.60  (step t27.t8 (cl (= (forall ((Xx $$unsorted) (Xy $$unsorted)) (=> (@ (@ Xk Xx) Xy) (exists ((Xu $$unsorted) (Xv $$unsorted)) (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xu Xm) (= Xv Xn))))))) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))) :rule trans :premises (t27.t6 t27.t7))
% 0.22/0.60  (step t27.t9 (cl (= (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (=> (@ (@ Xk Xx) Xy) (exists ((Xu $$unsorted) (Xv $$unsorted)) (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xu Xm) (= Xv Xn)))))))) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv)))))))))) :rule cong :premises (t27.t5 t27.t8))
% 0.22/0.60  (step t27 (cl (= (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (=> (@ (@ Xk Xx) Xy) (exists ((Xu $$unsorted) (Xv $$unsorted)) (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xu Xm) (= Xv Xn))))))))) (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))))) :rule bind)
% 0.22/0.60  (step t28 (cl (= (= tptp.cCKB_XPL (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (=> (@ (@ Xk Xx) Xy) (exists ((Xu $$unsorted) (Xv $$unsorted)) (and (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv) (@ (@ Xk Xu) Xv) (not (and (= Xu Xm) (= Xv Xn)))))))))) (= tptp.cCKB_XPL (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv)))))))))))) :rule cong :premises (t26 t27))
% 0.22/0.60  (step t29 (cl (= tptp.cCKB_XPL (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv))))))))))) :rule resolution :premises (t25 t28 a1))
% 0.22/0.60  (step t30 (cl (not (= (= tptp.cCKB_INJ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (=> (and (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv) (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2)))))) (= tptp.cCKB_INJ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2)))))))) (not (= tptp.cCKB_INJ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (=> (and (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv) (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))))) (= tptp.cCKB_INJ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))))) :rule equiv_pos2)
% 0.22/0.60  (step t31 (cl (= tptp.cCKB_INJ tptp.cCKB_INJ)) :rule refl)
% 0.22/0.60  (anchor :step t32 :args ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (:= Xh Xh)))
% 0.22/0.60  (step t32.t1 (cl (= Xh Xh)) :rule refl)
% 0.22/0.60  (step t32.t2 (cl (= (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (=> (and (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv) (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2)))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2)))))) :rule all_simplify)
% 0.22/0.60  (step t32 (cl (= (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (=> (and (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv) (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))))) :rule bind)
% 0.22/0.60  (step t33 (cl (= (= tptp.cCKB_INJ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (=> (and (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv) (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2)))))) (= tptp.cCKB_INJ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2)))))))) :rule cong :premises (t31 t32))
% 0.22/0.60  (step t34 (cl (= tptp.cCKB_INJ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))))) :rule resolution :premises (t30 t33 a0))
% 0.22/0.60  (step t35 (cl (and (= tptp.cCKB_FIN (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ Xk Xm) Xn)) (not (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn)))))))))))) (= tptp.cCKB_INF (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (not (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ Xk Xm) Xn)) (not (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn))))))))))))) (= tptp.cCKB_XPL (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xk (-> $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (and (@ (@ Xk Xm) Xn) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xm Xu) (= Xn Xv)))))))))) (= tptp.cCKB_INJ (lambda ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2)))))))) :rule resolution :premises (t2 t11 t24 t29 t34))
% 0.22/0.60  (step t36 (cl (= tptp.cCKB_FIN (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ Xk Xm) Xn)) (not (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn))))))))))))) :rule and :premises (t35))
% 0.22/0.60  (step t37 (cl (= (lambda ((Xu $$unsorted) (Xv $$unsorted)) (and (= tptp.c1 Xu) (= tptp.c1 Xv))) (lambda ((Xu $$unsorted) (Xv $$unsorted)) (and (= tptp.c1 Xu) (= tptp.c1 Xv))))) :rule refl)
% 0.22/0.60  (step t38 (cl (= (@ tptp.cCKB_FIN (lambda ((Xu $$unsorted) (Xv $$unsorted)) (and (= tptp.c1 Xu) (= tptp.c1 Xv)))) (@ (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ Xk Xm) Xn)) (not (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn))))))))))) (lambda ((Xu $$unsorted) (Xv $$unsorted)) (and (= tptp.c1 Xu) (= tptp.c1 Xv)))))) :rule cong :premises (t36 t37))
% 0.22/0.60  (step t39 (cl (= (not (@ tptp.cCKB_FIN (lambda ((Xu $$unsorted) (Xv $$unsorted)) (and (= tptp.c1 Xu) (= tptp.c1 Xv))))) (not (@ (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ Xk Xm) Xn)) (not (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn))))))))))) (lambda ((Xu $$unsorted) (Xv $$unsorted)) (and (= tptp.c1 Xu) (= tptp.c1 Xv))))))) :rule cong :premises (t38))
% 0.22/0.60  (step t40 (cl (= (@ (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ Xk Xm) Xn)) (not (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn))))))))))) (lambda ((Xu $$unsorted) (Xv $$unsorted)) (and (= tptp.c1 Xu) (= tptp.c1 Xv)))) (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ (lambda ((Xu $$unsorted) (Xv $$unsorted)) (and (= tptp.c1 Xu) (= tptp.c1 Xv))) Xm) Xn)) (not (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ (lambda ((Xu $$unsorted) (Xv $$unsorted)) (and (= tptp.c1 Xu) (= tptp.c1 Xv))) Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ (lambda ((Xu $$unsorted) (Xv $$unsorted)) (and (= tptp.c1 Xu) (= tptp.c1 Xv))) Xu) Xv)) (and (= Xu Xm) (= Xv Xn)))))))))))) :rule all_simplify)
% 0.22/0.60  (anchor :step t41 :args ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (:= Xh Xh) (Xm $$unsorted) (:= Xm Xm) (Xn $$unsorted) (:= Xn Xn)))
% 0.22/0.60  (step t41.t1 (cl (= Xh Xh)) :rule refl)
% 0.22/0.60  (step t41.t2 (cl (= Xm Xm)) :rule refl)
% 0.22/0.60  (step t41.t3 (cl (= Xn Xn)) :rule refl)
% 0.22/0.60  (step t41.t4 (cl (= (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))))) :rule refl)
% 0.22/0.60  (step t41.t5 (cl (= (@ (lambda ((Xu $$unsorted) (Xv $$unsorted)) (and (= tptp.c1 Xu) (= tptp.c1 Xv))) Xm) (lambda ((Xv $$unsorted)) (and (= tptp.c1 Xm) (= tptp.c1 Xv))))) :rule all_simplify)
% 0.22/0.60  (step t41.t6 (cl (= Xn Xn)) :rule refl)
% 0.22/0.60  (step t41.t7 (cl (= (@ (@ (lambda ((Xu $$unsorted) (Xv $$unsorted)) (and (= tptp.c1 Xu) (= tptp.c1 Xv))) Xm) Xn) (@ (lambda ((Xv $$unsorted)) (and (= tptp.c1 Xm) (= tptp.c1 Xv))) Xn))) :rule cong :premises (t41.t5 t41.t6))
% 0.22/0.60  (step t41.t8 (cl (= (@ (lambda ((Xv $$unsorted)) (and (= tptp.c1 Xm) (= tptp.c1 Xv))) Xn) (and (= tptp.c1 Xm) (= tptp.c1 Xn)))) :rule all_simplify)
% 0.22/0.60  (step t41.t9 (cl (= (@ (@ (lambda ((Xu $$unsorted) (Xv $$unsorted)) (and (= tptp.c1 Xu) (= tptp.c1 Xv))) Xm) Xn) (and (= tptp.c1 Xm) (= tptp.c1 Xn)))) :rule trans :premises (t41.t7 t41.t8))
% 0.22/0.60  (step t41.t10 (cl (= (not (@ (@ (lambda ((Xu $$unsorted) (Xv $$unsorted)) (and (= tptp.c1 Xu) (= tptp.c1 Xv))) Xm) Xn)) (not (and (= tptp.c1 Xm) (= tptp.c1 Xn))))) :rule cong :premises (t41.t9))
% 0.22/0.60  (anchor :step t41.t11 :args ((Xx $$unsorted) (:= Xx Xx) (Xy $$unsorted) (:= Xy Xy)))
% 0.22/0.60  (step t41.t11.t1 (cl (= Xx Xx)) :rule refl)
% 0.22/0.60  (step t41.t11.t2 (cl (= Xy Xy)) :rule refl)
% 0.22/0.60  (step t41.t11.t3 (cl (= (@ (lambda ((Xu $$unsorted) (Xv $$unsorted)) (and (= tptp.c1 Xu) (= tptp.c1 Xv))) Xx) (lambda ((Xv $$unsorted)) (and (= tptp.c1 Xx) (= tptp.c1 Xv))))) :rule all_simplify)
% 0.22/0.60  (step t41.t11.t4 (cl (= Xy Xy)) :rule refl)
% 0.22/0.60  (step t41.t11.t5 (cl (= (@ (@ (lambda ((Xu $$unsorted) (Xv $$unsorted)) (and (= tptp.c1 Xu) (= tptp.c1 Xv))) Xx) Xy) (@ (lambda ((Xv $$unsorted)) (and (= tptp.c1 Xx) (= tptp.c1 Xv))) Xy))) :rule cong :premises (t41.t11.t3 t41.t11.t4))
% 0.22/0.60  (step t41.t11.t6 (cl (= (@ (lambda ((Xv $$unsorted)) (and (= tptp.c1 Xx) (= tptp.c1 Xv))) Xy) (and (= tptp.c1 Xx) (= tptp.c1 Xy)))) :rule all_simplify)
% 0.22/0.60  (step t41.t11.t7 (cl (= (@ (@ (lambda ((Xu $$unsorted) (Xv $$unsorted)) (and (= tptp.c1 Xu) (= tptp.c1 Xv))) Xx) Xy) (and (= tptp.c1 Xx) (= tptp.c1 Xy)))) :rule trans :premises (t41.t11.t5 t41.t11.t6))
% 0.22/0.60  (step t41.t11.t8 (cl (= (not (@ (@ (lambda ((Xu $$unsorted) (Xv $$unsorted)) (and (= tptp.c1 Xu) (= tptp.c1 Xv))) Xx) Xy)) (not (and (= tptp.c1 Xx) (= tptp.c1 Xy))))) :rule cong :premises (t41.t11.t7))
% 0.22/0.60  (anchor :step t41.t11.t9 :args ((Xu $$unsorted) (:= Xu Xu) (Xv $$unsorted) (:= Xv Xv)))
% 0.22/0.60  (step t41.t11.t9.t1 (cl (= Xu Xu)) :rule refl)
% 0.22/0.60  (step t41.t11.t9.t2 (cl (= Xv Xv)) :rule refl)
% 0.22/0.60  (step t41.t11.t9.t3 (cl (= (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)))) :rule refl)
% 0.22/0.60  (step t41.t11.t9.t4 (cl (= (@ (lambda ((Xu $$unsorted) (Xv $$unsorted)) (and (= tptp.c1 Xu) (= tptp.c1 Xv))) Xu) (lambda ((Xv $$unsorted)) (and (= tptp.c1 Xu) (= tptp.c1 Xv))))) :rule all_simplify)
% 0.22/0.60  (step t41.t11.t9.t5 (cl (= Xv Xv)) :rule refl)
% 0.22/0.60  (step t41.t11.t9.t6 (cl (= (@ (@ (lambda ((Xu $$unsorted) (Xv $$unsorted)) (and (= tptp.c1 Xu) (= tptp.c1 Xv))) Xu) Xv) (@ (lambda ((Xv $$unsorted)) (and (= tptp.c1 Xu) (= tptp.c1 Xv))) Xv))) :rule cong :premises (t41.t11.t9.t4 t41.t11.t9.t5))
% 0.22/0.60  (step t41.t11.t9.t7 (cl (= (@ (lambda ((Xv $$unsorted)) (and (= tptp.c1 Xu) (= tptp.c1 Xv))) Xv) (and (= tptp.c1 Xu) (= tptp.c1 Xv)))) :rule all_simplify)
% 0.22/0.60  (step t41.t11.t9.t8 (cl (= (@ (@ (lambda ((Xu $$unsorted) (Xv $$unsorted)) (and (= tptp.c1 Xu) (= tptp.c1 Xv))) Xu) Xv) (and (= tptp.c1 Xu) (= tptp.c1 Xv)))) :rule trans :premises (t41.t11.t9.t6 t41.t11.t9.t7))
% 0.22/0.60  (step t41.t11.t9.t9 (cl (= (not (@ (@ (lambda ((Xu $$unsorted) (Xv $$unsorted)) (and (= tptp.c1 Xu) (= tptp.c1 Xv))) Xu) Xv)) (not (and (= tptp.c1 Xu) (= tptp.c1 Xv))))) :rule cong :premises (t41.t11.t9.t8))
% 0.22/0.60  (step t41.t11.t9.t10 (cl (= (and (= Xu Xm) (= Xv Xn)) (and (= Xu Xm) (= Xv Xn)))) :rule refl)
% 0.22/0.60  (step t41.t11.t9.t11 (cl (= (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ (lambda ((Xu $$unsorted) (Xv $$unsorted)) (and (= tptp.c1 Xu) (= tptp.c1 Xv))) Xu) Xv)) (and (= Xu Xm) (= Xv Xn))) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (and (= tptp.c1 Xu) (= tptp.c1 Xv))) (and (= Xu Xm) (= Xv Xn))))) :rule cong :premises (t41.t11.t9.t3 t41.t11.t9.t9 t41.t11.t9.t10))
% 0.22/0.60  (step t41.t11.t9 (cl (= (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ (lambda ((Xu $$unsorted) (Xv $$unsorted)) (and (= tptp.c1 Xu) (= tptp.c1 Xv))) Xu) Xv)) (and (= Xu Xm) (= Xv Xn)))) (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (and (= tptp.c1 Xu) (= tptp.c1 Xv))) (and (= Xu Xm) (= Xv Xn)))))) :rule bind)
% 0.22/0.60  (step t41.t11.t10 (cl (= (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (and (= tptp.c1 Xu) (= tptp.c1 Xv))) (and (= Xu Xm) (= Xv Xn)))) (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (= tptp.c1 Xu)) (not (= tptp.c1 Xv)) (and (= Xu Xm) (= Xv Xn)))))) :rule all_simplify)
% 0.22/0.60  (step t41.t11.t11 (cl (= (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (= tptp.c1 Xu)) (not (= tptp.c1 Xv)) (and (= Xu Xm) (= Xv Xn)))) (or (not (@ (@ (@ (@ Xh Xx) Xy) tptp.c1) tptp.c1)) (not (= tptp.c1 tptp.c1)) (not (= tptp.c1 tptp.c1)) (and (= tptp.c1 Xm) (= tptp.c1 Xn))))) :rule all_simplify)
% 0.22/0.60  (step t41.t11.t12 (cl (= (not (@ (@ (@ (@ Xh Xx) Xy) tptp.c1) tptp.c1)) (not (@ (@ (@ (@ Xh Xx) Xy) tptp.c1) tptp.c1)))) :rule refl)
% 0.22/0.60  (step t41.t11.t13 (cl (= (= tptp.c1 tptp.c1) true)) :rule all_simplify)
% 0.22/0.60  (step t41.t11.t14 (cl (= (not (= tptp.c1 tptp.c1)) (not true))) :rule cong :premises (t41.t11.t13))
% 0.22/0.60  (step t41.t11.t15 (cl (= (not true) false)) :rule all_simplify)
% 0.22/0.60  (step t41.t11.t16 (cl (= (not (= tptp.c1 tptp.c1)) false)) :rule trans :premises (t41.t11.t14 t41.t11.t15))
% 0.22/0.60  (step t41.t11.t17 (cl (= (and (= tptp.c1 Xm) (= tptp.c1 Xn)) (and (= tptp.c1 Xm) (= tptp.c1 Xn)))) :rule refl)
% 0.22/0.60  (step t41.t11.t18 (cl (= (or (not (@ (@ (@ (@ Xh Xx) Xy) tptp.c1) tptp.c1)) (not (= tptp.c1 tptp.c1)) (not (= tptp.c1 tptp.c1)) (and (= tptp.c1 Xm) (= tptp.c1 Xn))) (or (not (@ (@ (@ (@ Xh Xx) Xy) tptp.c1) tptp.c1)) false false (and (= tptp.c1 Xm) (= tptp.c1 Xn))))) :rule cong :premises (t41.t11.t12 t41.t11.t16 t41.t11.t16 t41.t11.t17))
% 0.22/0.60  (step t41.t11.t19 (cl (= (or (not (@ (@ (@ (@ Xh Xx) Xy) tptp.c1) tptp.c1)) false false (and (= tptp.c1 Xm) (= tptp.c1 Xn))) (or (not (@ (@ (@ (@ Xh Xx) Xy) tptp.c1) tptp.c1)) (and (= tptp.c1 Xm) (= tptp.c1 Xn))))) :rule all_simplify)
% 0.22/0.60  (step t41.t11.t20 (cl (= (or (not (@ (@ (@ (@ Xh Xx) Xy) tptp.c1) tptp.c1)) (not (= tptp.c1 tptp.c1)) (not (= tptp.c1 tptp.c1)) (and (= tptp.c1 Xm) (= tptp.c1 Xn))) (or (not (@ (@ (@ (@ Xh Xx) Xy) tptp.c1) tptp.c1)) (and (= tptp.c1 Xm) (= tptp.c1 Xn))))) :rule trans :premises (t41.t11.t18 t41.t11.t19))
% 0.22/0.60  (step t41.t11.t21 (cl (= (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (= tptp.c1 Xu)) (not (= tptp.c1 Xv)) (and (= Xu Xm) (= Xv Xn)))) (or (not (@ (@ (@ (@ Xh Xx) Xy) tptp.c1) tptp.c1)) (and (= tptp.c1 Xm) (= tptp.c1 Xn))))) :rule trans :premises (t41.t11.t11 t41.t11.t20))
% 0.22/0.60  (step t41.t11.t22 (cl (= (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (and (= tptp.c1 Xu) (= tptp.c1 Xv))) (and (= Xu Xm) (= Xv Xn)))) (or (not (@ (@ (@ (@ Xh Xx) Xy) tptp.c1) tptp.c1)) (and (= tptp.c1 Xm) (= tptp.c1 Xn))))) :rule trans :premises (t41.t11.t10 t41.t11.t21))
% 0.22/0.60  (step t41.t11.t23 (cl (= (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ (lambda ((Xu $$unsorted) (Xv $$unsorted)) (and (= tptp.c1 Xu) (= tptp.c1 Xv))) Xu) Xv)) (and (= Xu Xm) (= Xv Xn)))) (or (not (@ (@ (@ (@ Xh Xx) Xy) tptp.c1) tptp.c1)) (and (= tptp.c1 Xm) (= tptp.c1 Xn))))) :rule trans :premises (t41.t11.t9 t41.t11.t22))
% 0.22/0.60  (step t41.t11.t24 (cl (= (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ (lambda ((Xu $$unsorted) (Xv $$unsorted)) (and (= tptp.c1 Xu) (= tptp.c1 Xv))) Xu) Xv)) (and (= Xu Xm) (= Xv Xn))))) (not (or (not (@ (@ (@ (@ Xh Xx) Xy) tptp.c1) tptp.c1)) (and (= tptp.c1 Xm) (= tptp.c1 Xn)))))) :rule cong :premises (t41.t11.t23))
% 0.22/0.60  (step t41.t11.t25 (cl (= (or (not (@ (@ (lambda ((Xu $$unsorted) (Xv $$unsorted)) (and (= tptp.c1 Xu) (= tptp.c1 Xv))) Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ (lambda ((Xu $$unsorted) (Xv $$unsorted)) (and (= tptp.c1 Xu) (= tptp.c1 Xv))) Xu) Xv)) (and (= Xu Xm) (= Xv Xn)))))) (or (not (and (= tptp.c1 Xx) (= tptp.c1 Xy))) (not (or (not (@ (@ (@ (@ Xh Xx) Xy) tptp.c1) tptp.c1)) (and (= tptp.c1 Xm) (= tptp.c1 Xn))))))) :rule cong :premises (t41.t11.t8 t41.t11.t24))
% 0.22/0.60  (step t41.t11 (cl (= (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ (lambda ((Xu $$unsorted) (Xv $$unsorted)) (and (= tptp.c1 Xu) (= tptp.c1 Xv))) Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ (lambda ((Xu $$unsorted) (Xv $$unsorted)) (and (= tptp.c1 Xu) (= tptp.c1 Xv))) Xu) Xv)) (and (= Xu Xm) (= Xv Xn))))))) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (and (= tptp.c1 Xx) (= tptp.c1 Xy))) (not (or (not (@ (@ (@ (@ Xh Xx) Xy) tptp.c1) tptp.c1)) (and (= tptp.c1 Xm) (= tptp.c1 Xn)))))))) :rule bind)
% 0.22/0.60  (step t41.t12 (cl (= (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (and (= tptp.c1 Xx) (= tptp.c1 Xy))) (not (or (not (@ (@ (@ (@ Xh Xx) Xy) tptp.c1) tptp.c1)) (and (= tptp.c1 Xm) (= tptp.c1 Xn)))))) (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (= tptp.c1 Xx)) (not (= tptp.c1 Xy)) (and (@ (@ (@ (@ Xh Xx) Xy) tptp.c1) tptp.c1) (or (not (= tptp.c1 Xm)) (not (= tptp.c1 Xn)))))))) :rule all_simplify)
% 0.22/0.60  (step t41.t13 (cl (= (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (= tptp.c1 Xx)) (not (= tptp.c1 Xy)) (and (@ (@ (@ (@ Xh Xx) Xy) tptp.c1) tptp.c1) (or (not (= tptp.c1 Xm)) (not (= tptp.c1 Xn)))))) (or (not (= tptp.c1 tptp.c1)) (not (= tptp.c1 tptp.c1)) (and (@ (@ (@ (@ Xh tptp.c1) tptp.c1) tptp.c1) tptp.c1) (or (not (= tptp.c1 Xm)) (not (= tptp.c1 Xn))))))) :rule all_simplify)
% 0.22/0.60  (step t41.t14 (cl (= (= tptp.c1 tptp.c1) true)) :rule all_simplify)
% 0.22/0.60  (step t41.t15 (cl (= (not (= tptp.c1 tptp.c1)) (not true))) :rule cong :premises (t41.t14))
% 0.22/0.60  (step t41.t16 (cl (= (not true) false)) :rule all_simplify)
% 0.22/0.60  (step t41.t17 (cl (= (not (= tptp.c1 tptp.c1)) false)) :rule trans :premises (t41.t15 t41.t16))
% 0.22/0.60  (step t41.t18 (cl (= (and (@ (@ (@ (@ Xh tptp.c1) tptp.c1) tptp.c1) tptp.c1) (or (not (= tptp.c1 Xm)) (not (= tptp.c1 Xn)))) (and (@ (@ (@ (@ Xh tptp.c1) tptp.c1) tptp.c1) tptp.c1) (or (not (= tptp.c1 Xm)) (not (= tptp.c1 Xn)))))) :rule refl)
% 0.22/0.60  (step t41.t19 (cl (= (or (not (= tptp.c1 tptp.c1)) (not (= tptp.c1 tptp.c1)) (and (@ (@ (@ (@ Xh tptp.c1) tptp.c1) tptp.c1) tptp.c1) (or (not (= tptp.c1 Xm)) (not (= tptp.c1 Xn))))) (or false false (and (@ (@ (@ (@ Xh tptp.c1) tptp.c1) tptp.c1) tptp.c1) (or (not (= tptp.c1 Xm)) (not (= tptp.c1 Xn))))))) :rule cong :premises (t41.t17 t41.t17 t41.t18))
% 0.22/0.60  (step t41.t20 (cl (= (or false false (and (@ (@ (@ (@ Xh tptp.c1) tptp.c1) tptp.c1) tptp.c1) (or (not (= tptp.c1 Xm)) (not (= tptp.c1 Xn))))) (and (@ (@ (@ (@ Xh tptp.c1) tptp.c1) tptp.c1) tptp.c1) (or (not (= tptp.c1 Xm)) (not (= tptp.c1 Xn)))))) :rule all_simplify)
% 0.22/0.60  (step t41.t21 (cl (= (or (not (= tptp.c1 tptp.c1)) (not (= tptp.c1 tptp.c1)) (and (@ (@ (@ (@ Xh tptp.c1) tptp.c1) tptp.c1) tptp.c1) (or (not (= tptp.c1 Xm)) (not (= tptp.c1 Xn))))) (and (@ (@ (@ (@ Xh tptp.c1) tptp.c1) tptp.c1) tptp.c1) (or (not (= tptp.c1 Xm)) (not (= tptp.c1 Xn)))))) :rule trans :premises (t41.t19 t41.t20))
% 0.22/0.60  (step t41.t22 (cl (= (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (= tptp.c1 Xx)) (not (= tptp.c1 Xy)) (and (@ (@ (@ (@ Xh Xx) Xy) tptp.c1) tptp.c1) (or (not (= tptp.c1 Xm)) (not (= tptp.c1 Xn)))))) (and (@ (@ (@ (@ Xh tptp.c1) tptp.c1) tptp.c1) tptp.c1) (or (not (= tptp.c1 Xm)) (not (= tptp.c1 Xn)))))) :rule trans :premises (t41.t13 t41.t21))
% 0.22/0.60  (step t41.t23 (cl (= (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (and (= tptp.c1 Xx) (= tptp.c1 Xy))) (not (or (not (@ (@ (@ (@ Xh Xx) Xy) tptp.c1) tptp.c1)) (and (= tptp.c1 Xm) (= tptp.c1 Xn)))))) (and (@ (@ (@ (@ Xh tptp.c1) tptp.c1) tptp.c1) tptp.c1) (or (not (= tptp.c1 Xm)) (not (= tptp.c1 Xn)))))) :rule trans :premises (t41.t12 t41.t22))
% 0.22/0.60  (step t41.t24 (cl (= (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ (lambda ((Xu $$unsorted) (Xv $$unsorted)) (and (= tptp.c1 Xu) (= tptp.c1 Xv))) Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ (lambda ((Xu $$unsorted) (Xv $$unsorted)) (and (= tptp.c1 Xu) (= tptp.c1 Xv))) Xu) Xv)) (and (= Xu Xm) (= Xv Xn))))))) (and (@ (@ (@ (@ Xh tptp.c1) tptp.c1) tptp.c1) tptp.c1) (or (not (= tptp.c1 Xm)) (not (= tptp.c1 Xn)))))) :rule trans :premises (t41.t11 t41.t23))
% 0.22/0.60  (step t41.t25 (cl (= (not (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ (lambda ((Xu $$unsorted) (Xv $$unsorted)) (and (= tptp.c1 Xu) (= tptp.c1 Xv))) Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ (lambda ((Xu $$unsorted) (Xv $$unsorted)) (and (= tptp.c1 Xu) (= tptp.c1 Xv))) Xu) Xv)) (and (= Xu Xm) (= Xv Xn)))))))) (not (and (@ (@ (@ (@ Xh tptp.c1) tptp.c1) tptp.c1) tptp.c1) (or (not (= tptp.c1 Xm)) (not (= tptp.c1 Xn))))))) :rule cong :premises (t41.t24))
% 0.22/0.60  (step t41.t26 (cl (= (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ (lambda ((Xu $$unsorted) (Xv $$unsorted)) (and (= tptp.c1 Xu) (= tptp.c1 Xv))) Xm) Xn)) (not (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ (lambda ((Xu $$unsorted) (Xv $$unsorted)) (and (= tptp.c1 Xu) (= tptp.c1 Xv))) Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ (lambda ((Xu $$unsorted) (Xv $$unsorted)) (and (= tptp.c1 Xu) (= tptp.c1 Xv))) Xu) Xv)) (and (= Xu Xm) (= Xv Xn))))))))) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (and (= tptp.c1 Xm) (= tptp.c1 Xn))) (not (and (@ (@ (@ (@ Xh tptp.c1) tptp.c1) tptp.c1) tptp.c1) (or (not (= tptp.c1 Xm)) (not (= tptp.c1 Xn)))))))) :rule cong :premises (t41.t4 t41.t10 t41.t25))
% 0.22/0.60  (step t41 (cl (= (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ (lambda ((Xu $$unsorted) (Xv $$unsorted)) (and (= tptp.c1 Xu) (= tptp.c1 Xv))) Xm) Xn)) (not (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ (lambda ((Xu $$unsorted) (Xv $$unsorted)) (and (= tptp.c1 Xu) (= tptp.c1 Xv))) Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ (lambda ((Xu $$unsorted) (Xv $$unsorted)) (and (= tptp.c1 Xu) (= tptp.c1 Xv))) Xu) Xv)) (and (= Xu Xm) (= Xv Xn)))))))))) (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (and (= tptp.c1 Xm) (= tptp.c1 Xn))) (not (and (@ (@ (@ (@ Xh tptp.c1) tptp.c1) tptp.c1) tptp.c1) (or (not (= tptp.c1 Xm)) (not (= tptp.c1 Xn))))))))) :rule bind)
% 0.22/0.60  (step t42 (cl (= (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (and (= tptp.c1 Xm) (= tptp.c1 Xn))) (not (and (@ (@ (@ (@ Xh tptp.c1) tptp.c1) tptp.c1) tptp.c1) (or (not (= tptp.c1 Xm)) (not (= tptp.c1 Xn))))))) (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (= tptp.c1 Xm)) (not (= tptp.c1 Xn)) (not (@ (@ (@ (@ Xh tptp.c1) tptp.c1) tptp.c1) tptp.c1)) (and (= tptp.c1 Xm) (= tptp.c1 Xn)))))) :rule all_simplify)
% 0.22/0.60  (step t43 (cl (= (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (= tptp.c1 Xm)) (not (= tptp.c1 Xn)) (not (@ (@ (@ (@ Xh tptp.c1) tptp.c1) tptp.c1) tptp.c1)) (and (= tptp.c1 Xm) (= tptp.c1 Xn)))) (or (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ (@ (@ Xh tptp.c1) tptp.c1) tptp.c1) tptp.c1)))) (forall ((Xm $$unsorted) (Xn $$unsorted)) (or (not (= tptp.c1 Xm)) (not (= tptp.c1 Xn)) (and (= tptp.c1 Xm) (= tptp.c1 Xn))))))) :rule all_simplify)
% 0.22/0.60  (step t44 (cl (= (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ (@ (@ Xh tptp.c1) tptp.c1) tptp.c1) tptp.c1)))) (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ (@ (@ Xh tptp.c1) tptp.c1) tptp.c1) tptp.c1)))))) :rule refl)
% 0.22/0.60  (step t45 (cl (= (forall ((Xm $$unsorted) (Xn $$unsorted)) (or (not (= tptp.c1 Xm)) (not (= tptp.c1 Xn)) (and (= tptp.c1 Xm) (= tptp.c1 Xn)))) (or (not (= tptp.c1 tptp.c1)) (not (= tptp.c1 tptp.c1)) (and (= tptp.c1 tptp.c1) (= tptp.c1 tptp.c1))))) :rule all_simplify)
% 0.22/0.60  (step t46 (cl (= (= tptp.c1 tptp.c1) true)) :rule all_simplify)
% 0.22/0.60  (step t47 (cl (= (not (= tptp.c1 tptp.c1)) (not true))) :rule cong :premises (t46))
% 0.22/0.60  (step t48 (cl (= (not true) false)) :rule all_simplify)
% 0.22/0.60  (step t49 (cl (= (not (= tptp.c1 tptp.c1)) false)) :rule trans :premises (t47 t48))
% 0.22/0.60  (step t50 (cl (= (and (= tptp.c1 tptp.c1) (= tptp.c1 tptp.c1)) (= tptp.c1 tptp.c1))) :rule all_simplify)
% 0.22/0.60  (step t51 (cl (= (and (= tptp.c1 tptp.c1) (= tptp.c1 tptp.c1)) true)) :rule trans :premises (t50 t46))
% 0.22/0.60  (step t52 (cl (= (or (not (= tptp.c1 tptp.c1)) (not (= tptp.c1 tptp.c1)) (and (= tptp.c1 tptp.c1) (= tptp.c1 tptp.c1))) (or false false true))) :rule cong :premises (t49 t49 t51))
% 0.22/0.60  (step t53 (cl (= (or false false true) true)) :rule all_simplify)
% 0.22/0.60  (step t54 (cl (= (or (not (= tptp.c1 tptp.c1)) (not (= tptp.c1 tptp.c1)) (and (= tptp.c1 tptp.c1) (= tptp.c1 tptp.c1))) true)) :rule trans :premises (t52 t53))
% 0.22/0.60  (step t55 (cl (= (forall ((Xm $$unsorted) (Xn $$unsorted)) (or (not (= tptp.c1 Xm)) (not (= tptp.c1 Xn)) (and (= tptp.c1 Xm) (= tptp.c1 Xn)))) true)) :rule trans :premises (t45 t54))
% 0.22/0.60  (step t56 (cl (= (or (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ (@ (@ Xh tptp.c1) tptp.c1) tptp.c1) tptp.c1)))) (forall ((Xm $$unsorted) (Xn $$unsorted)) (or (not (= tptp.c1 Xm)) (not (= tptp.c1 Xn)) (and (= tptp.c1 Xm) (= tptp.c1 Xn))))) (or (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ (@ (@ Xh tptp.c1) tptp.c1) tptp.c1) tptp.c1)))) true))) :rule cong :premises (t44 t55))
% 0.22/0.60  (step t57 (cl (= (or (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ (@ (@ Xh tptp.c1) tptp.c1) tptp.c1) tptp.c1)))) true) true)) :rule all_simplify)
% 0.22/0.60  (step t58 (cl (= (or (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool))) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ (@ (@ Xh tptp.c1) tptp.c1) tptp.c1) tptp.c1)))) (forall ((Xm $$unsorted) (Xn $$unsorted)) (or (not (= tptp.c1 Xm)) (not (= tptp.c1 Xn)) (and (= tptp.c1 Xm) (= tptp.c1 Xn))))) true)) :rule trans :premises (t56 t57))
% 0.22/0.60  (step t59 (cl (= (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (= tptp.c1 Xm)) (not (= tptp.c1 Xn)) (not (@ (@ (@ (@ Xh tptp.c1) tptp.c1) tptp.c1) tptp.c1)) (and (= tptp.c1 Xm) (= tptp.c1 Xn)))) true)) :rule trans :premises (t43 t58))
% 0.22/0.60  (step t60 (cl (= (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (and (= tptp.c1 Xm) (= tptp.c1 Xn))) (not (and (@ (@ (@ (@ Xh tptp.c1) tptp.c1) tptp.c1) tptp.c1) (or (not (= tptp.c1 Xm)) (not (= tptp.c1 Xn))))))) true)) :rule trans :premises (t42 t59))
% 0.22/0.60  (step t61 (cl (= (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ (lambda ((Xu $$unsorted) (Xv $$unsorted)) (and (= tptp.c1 Xu) (= tptp.c1 Xv))) Xm) Xn)) (not (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ (lambda ((Xu $$unsorted) (Xv $$unsorted)) (and (= tptp.c1 Xu) (= tptp.c1 Xv))) Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ (lambda ((Xu $$unsorted) (Xv $$unsorted)) (and (= tptp.c1 Xu) (= tptp.c1 Xv))) Xu) Xv)) (and (= Xu Xm) (= Xv Xn)))))))))) true)) :rule trans :premises (t41 t60))
% 0.22/0.60  (step t62 (cl (= (@ (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ Xk Xm) Xn)) (not (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn))))))))))) (lambda ((Xu $$unsorted) (Xv $$unsorted)) (and (= tptp.c1 Xu) (= tptp.c1 Xv)))) true)) :rule trans :premises (t40 t61))
% 0.22/0.60  (step t63 (cl (= (not (@ (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ Xk Xm) Xn)) (not (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn))))))))))) (lambda ((Xu $$unsorted) (Xv $$unsorted)) (and (= tptp.c1 Xu) (= tptp.c1 Xv))))) (not true))) :rule cong :premises (t62))
% 0.22/0.60  (step t64 (cl (= (not (@ (lambda ((Xk (-> $$unsorted $$unsorted Bool))) (forall ((Xh (-> $$unsorted $$unsorted $$unsorted $$unsorted Bool)) (Xm $$unsorted) (Xn $$unsorted)) (or (not (forall ((Xx1 $$unsorted) (Xy1 $$unsorted) (Xx2 $$unsorted) (Xy2 $$unsorted) (Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx1) Xy1) Xu) Xv)) (not (@ (@ (@ (@ Xh Xx2) Xy2) Xu) Xv)) (and (= Xx1 Xx2) (= Xy1 Xy2))))) (not (@ (@ Xk Xm) Xn)) (not (forall ((Xx $$unsorted) (Xy $$unsorted)) (or (not (@ (@ Xk Xx) Xy)) (not (forall ((Xu $$unsorted) (Xv $$unsorted)) (or (not (@ (@ (@ (@ Xh Xx) Xy) Xu) Xv)) (not (@ (@ Xk Xu) Xv)) (and (= Xu Xm) (= Xv Xn))))))))))) (lambda ((Xu $$unsorted) (Xv $$unsorted)) (and (= tptp.c1 Xu) (= tptp.c1 Xv))))) false)) :rule trans :premises (t63 t48))
% 0.22/0.60  (step t65 (cl (= (not (@ tptp.cCKB_FIN (lambda ((Xu $$unsorted) (Xv $$unsorted)) (and (= tptp.c1 Xu) (= tptp.c1 Xv))))) false)) :rule trans :premises (t39 t64))
% 0.22/0.60  (step t66 (cl (not (= (not (@ tptp.cCKB_FIN (lambda ((Xu $$unsorted) (Xv $$unsorted)) (and (= Xu tptp.c1) (= Xv tptp.c1))))) (not (@ tptp.cCKB_FIN (lambda ((Xu $$unsorted) (Xv $$unsorted)) (and (= tptp.c1 Xu) (= tptp.c1 Xv))))))) (not (not (@ tptp.cCKB_FIN (lambda ((Xu $$unsorted) (Xv $$unsorted)) (and (= Xu tptp.c1) (= Xv tptp.c1)))))) (not (@ tptp.cCKB_FIN (lambda ((Xu $$unsorted) (Xv $$unsorted)) (and (= tptp.c1 Xu) (= tptp.c1 Xv)))))) :rule equiv_pos2)
% 0.22/0.60  (anchor :step t67 :args ((Xu $$unsorted) (:= Xu Xu) (Xv $$unsorted) (:= Xv Xv)))
% 0.22/0.60  (step t67.t1 (cl (= Xu Xu)) :rule refl)
% 0.22/0.60  (step t67.t2 (cl (= Xv Xv)) :rule refl)
% 0.22/0.60  (step t67.t3 (cl (= (= Xu tptp.c1) (= tptp.c1 Xu))) :rule all_simplify)
% 0.22/0.60  (step t67.t4 (cl (= (= Xv tptp.c1) (= tptp.c1 Xv))) :rule all_simplify)
% 0.22/0.60  (step t67.t5 (cl (= (and (= Xu tptp.c1) (= Xv tptp.c1)) (and (= tptp.c1 Xu) (= tptp.c1 Xv)))) :rule cong :premises (t67.t3 t67.t4))
% 0.22/0.60  (step t67 (cl (= (lambda ((Xu $$unsorted) (Xv $$unsorted)) (and (= Xu tptp.c1) (= Xv tptp.c1))) (lambda ((Xu $$unsorted) (Xv $$unsorted)) (and (= tptp.c1 Xu) (= tptp.c1 Xv))))) :rule bind)
% 0.22/0.60  (step t68 (cl (= (@ tptp.cCKB_FIN (lambda ((Xu $$unsorted) (Xv $$unsorted)) (and (= Xu tptp.c1) (= Xv tptp.c1)))) (@ tptp.cCKB_FIN (lambda ((Xu $$unsorted) (Xv $$unsorted)) (and (= tptp.c1 Xu) (= tptp.c1 Xv)))))) :rule cong :premises (t7 t67))
% 0.22/0.60  (step t69 (cl (= (not (@ tptp.cCKB_FIN (lambda ((Xu $$unsorted) (Xv $$unsorted)) (and (= Xu tptp.c1) (= Xv tptp.c1))))) (not (@ tptp.cCKB_FIN (lambda ((Xu $$unsorted) (Xv $$unsorted)) (and (= tptp.c1 Xu) (= tptp.c1 Xv))))))) :rule cong :premises (t68))
% 0.22/0.60  (step t70 (cl (not (@ tptp.cCKB_FIN (lambda ((Xu $$unsorted) (Xv $$unsorted)) (and (= tptp.c1 Xu) (= tptp.c1 Xv)))))) :rule resolution :premises (t66 t69 a4))
% 0.22/0.60  (step t71 (cl false) :rule resolution :premises (t1 t65 t70))
% 0.22/0.60  (step t72 (cl (not false)) :rule false)
% 0.22/0.60  (step t73 (cl) :rule resolution :premises (t71 t72))
% 0.22/0.60  
% 0.22/0.60  % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.8hUflAYcHJ/cvc5---1.0.5_12126.smt2
% 0.22/0.60  % cvc5---1.0.5 exiting
% 0.22/0.61  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------