↑ Up

cvc5---1.3.4.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : cvc5---1.3.4
% Problem  : SET683^3 : TPTP v9.2.1. Released v3.6.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n029.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 Jun  3 08:48:26 AM UTC 2026

% Result   : Theorem 0.38s 0.59s
% Output   : Proof 0.38s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SET683^3 : TPTP v9.2.1. Released v3.6.0.
% 0.12/0.13  % Command  : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.34  % Computer : n029.cluster.edu
% 0.17/0.34  % Model    : x86_64 x86_64
% 0.17/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.34  % Memory   : 8042.1875MB
% 0.17/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.17/0.34  % CPULimit : 300
% 0.17/0.34  % WCLimit  : 300
% 0.17/0.34  % DateTime : Tue Jun  2 16:08:17 EDT 2026
% 0.17/0.34  % CPUTime  : 
% 0.28/0.50  %----Proving TH0
% 0.38/0.59  --- Run --mbqi --mbqi-enum --mbqi-enum-choice-grammar --mbqi-enum-global-syms-grammar --sygus-grammar-ho-partial --no-cegqi --no-sygus-inst at 90s...
% 0.38/0.59  % SZS status Theorem
% 0.38/0.59  % SZS output start Proof
% 0.38/0.59  (
% 0.38/0.59  (declare-sort $$unsorted 0)
% 0.38/0.59  (define tptp.in () (let ((_let_1 (@var "X" $$unsorted))) (let ((_let_2 (@var "M" (-> $$unsorted Bool)))) (lambda (@list _let_1 _let_2) (_ _let_2 _let_1)))))
% 0.38/0.59  (define tptp.is_a () (let ((_let_1 (@var "X" $$unsorted))) (let ((_let_2 (@var "M" (-> $$unsorted Bool)))) (lambda (@list _let_1 _let_2) (_ _let_2 _let_1)))))
% 0.38/0.59  (define tptp.emptyset () (lambda (@list (@var "X" $$unsorted)) false))
% 0.38/0.59  (define tptp.unord_pair () (let ((_let_1 (@var "Y" $$unsorted))) (let ((_let_2 (@var "U" $$unsorted))) (let ((_let_3 (@var "X" $$unsorted))) (lambda (@list _let_3 _let_1 _let_2) (or (= _let_2 _let_3) (= _let_2 _let_1)))))))
% 0.38/0.59  (define tptp.singleton () (let ((_let_1 (@var "X" $$unsorted))) (let ((_let_2 (@var "U" $$unsorted))) (lambda (@list _let_1 _let_2) (= _let_2 _let_1)))))
% 0.38/0.59  (define tptp.union () (let ((_let_1 (@var "U" $$unsorted))) (let ((_let_2 (@var "Y" (-> $$unsorted Bool)))) (let ((_let_3 (@var "X" (-> $$unsorted Bool)))) (lambda (@list _let_3 _let_2 _let_1) (or (_ _let_3 _let_1) (_ _let_2 _let_1)))))))
% 0.38/0.59  (define tptp.excl_union () (let ((_let_1 (@var "U" $$unsorted))) (let ((_let_2 (@var "Y" (-> $$unsorted Bool)))) (let ((_let_3 (_ _let_2 _let_1))) (let ((_let_4 (@var "X" (-> $$unsorted Bool)))) (let ((_let_5 (_ _let_4 _let_1))) (lambda (@list _let_4 _let_2 _let_1) (or (and _let_5 (not _let_3)) (and (not _let_5) _let_3)))))))))
% 0.38/0.59  (define tptp.intersection () (let ((_let_1 (@var "U" $$unsorted))) (let ((_let_2 (@var "Y" (-> $$unsorted Bool)))) (let ((_let_3 (@var "X" (-> $$unsorted Bool)))) (lambda (@list _let_3 _let_2 _let_1) (and (_ _let_3 _let_1) (_ _let_2 _let_1)))))))
% 0.38/0.59  (define tptp.setminus () (let ((_let_1 (@var "U" $$unsorted))) (let ((_let_2 (@var "Y" (-> $$unsorted Bool)))) (let ((_let_3 (@var "X" (-> $$unsorted Bool)))) (lambda (@list _let_3 _let_2 _let_1) (and (_ _let_3 _let_1) (not (_ _let_2 _let_1))))))))
% 0.38/0.59  (define tptp.complement () (let ((_let_1 (@var "U" $$unsorted))) (let ((_let_2 (@var "X" (-> $$unsorted Bool)))) (lambda (@list _let_2 _let_1) (not (_ _let_2 _let_1))))))
% 0.38/0.59  (define tptp.disjoint () (let ((_let_1 (@var "Y" (-> $$unsorted Bool)))) (let ((_let_2 (@var "X" (-> $$unsorted Bool)))) (lambda (@list _let_2 _let_1) (= (_ (_ tptp.intersection _let_2) _let_1) tptp.emptyset)))))
% 0.38/0.59  (define tptp.subset () (let ((_let_1 (@var "U" $$unsorted))) (let ((_let_2 (@var "Y" (-> $$unsorted Bool)))) (let ((_let_3 (@var "X" (-> $$unsorted Bool)))) (lambda (@list _let_3 _let_2) (forall (@list _let_1) (=> (_ _let_3 _let_1) (_ _let_2 _let_1))))))))
% 0.38/0.59  (define tptp.meets () (let ((_let_1 (@var "U" $$unsorted))) (let ((_let_2 (@var "Y" (-> $$unsorted Bool)))) (let ((_let_3 (@var "X" (-> $$unsorted Bool)))) (lambda (@list _let_3 _let_2) (exists (@list _let_1) (and (_ _let_3 _let_1) (_ _let_2 _let_1))))))))
% 0.38/0.59  (define tptp.misses () (let ((_let_1 (@var "U" $$unsorted))) (let ((_let_2 (@var "Y" (-> $$unsorted Bool)))) (let ((_let_3 (@var "X" (-> $$unsorted Bool)))) (lambda (@list _let_3 _let_2) (not (exists (@list _let_1) (and (_ _let_3 _let_1) (_ _let_2 _let_1)))))))))
% 0.38/0.59  (define tptp.cartesian_product () (let ((_let_1 (@var "V" $$unsorted))) (let ((_let_2 (@var "Y" (-> $$unsorted Bool)))) (let ((_let_3 (@var "U" $$unsorted))) (let ((_let_4 (@var "X" (-> $$unsorted Bool)))) (lambda (@list _let_4 _let_2 _let_3 _let_1) (and (_ _let_4 _let_3) (_ _let_2 _let_1))))))))
% 0.38/0.59  (define tptp.pair_rel () (let ((_let_1 (@var "Y" $$unsorted))) (let ((_let_2 (@var "V" $$unsorted))) (let ((_let_3 (@var "X" $$unsorted))) (let ((_let_4 (@var "U" $$unsorted))) (lambda (@list _let_3 _let_1 _let_4 _let_2) (or (= _let_4 _let_3) (= _let_2 _let_1))))))))
% 0.38/0.59  (define tptp.id_rel () (let ((_let_1 (@var "Y" $$unsorted))) (let ((_let_2 (@var "X" $$unsorted))) (let ((_let_3 (@var "S" (-> $$unsorted Bool)))) (lambda (@list _let_3 _let_2 _let_1) (and (_ _let_3 _let_2) (= _let_2 _let_1)))))))
% 0.38/0.59  (define tptp.sub_rel () (let ((_let_1 (@var "Y" $$unsorted))) (let ((_let_2 (@var "X" $$unsorted))) (let ((_let_3 (@var "R2" (-> $$unsorted $$unsorted Bool)))) (let ((_let_4 (@var "R1" (-> $$unsorted $$unsorted Bool)))) (lambda (@list _let_4 _let_3) (forall (@list _let_2 _let_1) (=> (_ (_ _let_4 _let_2) _let_1) (_ (_ _let_3 _let_2) _let_1)))))))))
% 0.38/0.59  (define tptp.is_rel_on () (let ((_let_1 (@var "Y" $$unsorted))) (let ((_let_2 (@var "B" (-> $$unsorted Bool)))) (let ((_let_3 (@var "X" $$unsorted))) (let ((_let_4 (@var "A" (-> $$unsorted Bool)))) (let ((_let_5 (@var "R" (-> $$unsorted $$unsorted Bool)))) (lambda (@list _let_5 _let_4 _let_2) (forall (@list _let_3 _let_1) (=> (_ (_ _let_5 _let_3) _let_1) (and (_ _let_4 _let_3) (_ _let_2 _let_1)))))))))))
% 0.38/0.59  (define tptp.restrict_rel_domain () (let ((_let_1 (@var "Y" $$unsorted))) (let ((_let_2 (@var "X" $$unsorted))) (let ((_let_3 (@var "R" (-> $$unsorted $$unsorted Bool)))) (let ((_let_4 (@var "S" (-> $$unsorted Bool)))) (lambda (@list _let_3 _let_4 _let_2 _let_1) (and (_ _let_4 _let_2) (_ (_ _let_3 _let_2) _let_1))))))))
% 0.38/0.59  (define tptp.rel_diagonal () (let ((_let_1 (@var "Y" $$unsorted))) (let ((_let_2 (@var "X" $$unsorted))) (lambda (@list _let_2 _let_1) (= _let_2 _let_1)))))
% 0.38/0.59  (define tptp.rel_composition () (let ((_let_1 (@var "Z" $$unsorted))) (let ((_let_2 (@var "Y" $$unsorted))) (let ((_let_3 (@var "R2" (-> $$unsorted $$unsorted Bool)))) (let ((_let_4 (@var "X" $$unsorted))) (let ((_let_5 (@var "R1" (-> $$unsorted $$unsorted Bool)))) (lambda (@list _let_5 _let_3 _let_4 _let_1) (exists (@list _let_2) (and (_ (_ _let_5 _let_4) _let_2) (_ (_ _let_3 _let_2) _let_1))))))))))
% 0.38/0.59  (define tptp.reflexive () (let ((_let_1 (@var "X" $$unsorted))) (let ((_let_2 (@var "R" (-> $$unsorted $$unsorted Bool)))) (lambda (@list _let_2) (forall (@list _let_1) (_ (_ _let_2 _let_1) _let_1))))))
% 0.38/0.59  (define tptp.irreflexive () (let ((_let_1 (@var "X" $$unsorted))) (let ((_let_2 (@var "R" (-> $$unsorted $$unsorted Bool)))) (lambda (@list _let_2) (forall (@list _let_1) (not (_ (_ _let_2 _let_1) _let_1)))))))
% 0.38/0.59  (define tptp.symmetric () (let ((_let_1 (@var "X" $$unsorted))) (let ((_let_2 (@var "Y" $$unsorted))) (let ((_let_3 (@var "R" (-> $$unsorted $$unsorted Bool)))) (lambda (@list _let_3) (forall (@list _let_1 _let_2) (=> (_ (_ _let_3 _let_1) _let_2) (_ (_ _let_3 _let_2) _let_1))))))))
% 0.38/0.59  (define tptp.transitive () (let ((_let_1 (@var "Z" $$unsorted))) (let ((_let_2 (@var "X" $$unsorted))) (let ((_let_3 (@var "R" (-> $$unsorted $$unsorted Bool)))) (let ((_let_4 (_ _let_3 _let_2))) (let ((_let_5 (@var "Y" $$unsorted))) (lambda (@list _let_3) (forall (@list _let_2 _let_5 _let_1) (=> (and (_ _let_4 _let_5) (_ (_ _let_3 _let_5) _let_1)) (_ _let_4 _let_1))))))))))
% 0.38/0.59  (define tptp.equiv_rel () (let ((_let_1 (@var "R" (-> $$unsorted $$unsorted Bool)))) (lambda (@list _let_1) (and (_ tptp.reflexive _let_1) (_ tptp.symmetric _let_1) (_ tptp.transitive _let_1)))))
% 0.38/0.59  (define tptp.rel_codomain () (let ((_let_1 (@var "Y" $$unsorted))) (let ((_let_2 (@var "X" $$unsorted))) (let ((_let_3 (@var "R" (-> $$unsorted $$unsorted Bool)))) (lambda (@list _let_3 _let_1) (exists (@list _let_2) (_ (_ _let_3 _let_2) _let_1)))))))
% 0.38/0.59  (define tptp.rel_domain () (let ((_let_1 (@var "Y" $$unsorted))) (let ((_let_2 (@var "X" $$unsorted))) (let ((_let_3 (@var "R" (-> $$unsorted $$unsorted Bool)))) (lambda (@list _let_3 _let_2) (exists (@list _let_1) (_ (_ _let_3 _let_2) _let_1)))))))
% 0.38/0.59  (define tptp.rel_inverse () (let ((_let_1 (@var "X" $$unsorted))) (let ((_let_2 (@var "Y" $$unsorted))) (let ((_let_3 (@var "R" (-> $$unsorted $$unsorted Bool)))) (lambda (@list _let_3 _let_1 _let_2) (_ (_ _let_3 _let_2) _let_1))))))
% 0.38/0.59  (define tptp.equiv_classes () (let ((_let_1 (@var "Y" $$unsorted))) (let ((_let_2 (@var "X" $$unsorted))) (let ((_let_3 (@var "R" (-> $$unsorted $$unsorted Bool)))) (let ((_let_4 (@var "S1" (-> $$unsorted Bool)))) (lambda (@list _let_3 _let_4) (exists (@list _let_2) (and (_ _let_4 _let_2) (forall (@list _let_1) (= (_ _let_4 _let_1) (_ (_ _let_3 _let_2) _let_1)))))))))))
% 0.38/0.59  (define tptp.restrict_rel_codomain () (let ((_let_1 (@var "Y" $$unsorted))) (let ((_let_2 (@var "X" $$unsorted))) (let ((_let_3 (@var "R" (-> $$unsorted $$unsorted Bool)))) (let ((_let_4 (@var "S" (-> $$unsorted Bool)))) (lambda (@list _let_3 _let_4 _let_2 _let_1) (and (_ _let_4 _let_1) (_ (_ _let_3 _let_2) _let_1))))))))
% 0.38/0.59  (define tptp.rel_field () (let ((_let_1 (@var "X" $$unsorted))) (let ((_let_2 (@var "R" (-> $$unsorted $$unsorted Bool)))) (lambda (@list _let_2 _let_1) (or (_ (_ tptp.rel_domain _let_2) _let_1) (_ (_ tptp.rel_codomain _let_2) _let_1))))))
% 0.38/0.59  (define tptp.well_founded () (let ((_let_1 (@var "W" $$unsorted))) (let ((_let_2 (@var "X" (-> $$unsorted Bool)))) (let ((_let_3 (@var "Y" $$unsorted))) (let ((_let_4 (@var "R" (-> $$unsorted $$unsorted Bool)))) (let ((_let_5 (@var "Z" $$unsorted))) (lambda (@list _let_4) (forall (@list _let_2 _let_5) (=> (_ _let_2 _let_5) (exists (@list _let_3) (and (_ _let_2 _let_3) (forall (@list _let_1) (=> (_ (_ _let_4 _let_3) _let_1) (not (_ _let_2 _let_1)))))))))))))))
% 0.38/0.59  (define tptp.upwards_well_founded () (let ((_let_1 (@var "W" $$unsorted))) (let ((_let_2 (@var "X" (-> $$unsorted Bool)))) (let ((_let_3 (@var "Y" $$unsorted))) (let ((_let_4 (@var "R" (-> $$unsorted $$unsorted Bool)))) (let ((_let_5 (@var "Z" $$unsorted))) (lambda (@list _let_4) (forall (@list _let_2 _let_5) (=> (_ _let_2 _let_5) (exists (@list _let_3) (and (_ _let_2 _let_3) (forall (@list _let_1) (=> (_ (_ _let_4 _let_3) _let_3) (not (_ _let_2 _let_1)))))))))))))))
% 0.38/0.59  (define @t1 () (@var "U" $$unsorted))
% 0.38/0.59  (define @t2 () (@var "R" (-> $$unsorted $$unsorted Bool)))
% 0.38/0.59  (define @t3 () (_ tptp.rel_domain @t2))
% 0.38/0.59  (define @t4 () (@var "X" (-> $$unsorted Bool)))
% 0.38/0.59  (define @t5 () (_ @t4 @t1))
% 0.38/0.59  (define @t6 () (and @t5 (_ @t3 @t1)))
% 0.38/0.59  (define @t7 () (@list @t1))
% 0.38/0.59  (define @t8 () (exists @t7 @t6))
% 0.38/0.59  (define @t9 () (@var "V" $$unsorted))
% 0.38/0.59  (define @t10 () (_ tptp.rel_codomain @t2))
% 0.38/0.59  (define @t11 () (=> (_ @t10 @t9) @t8))
% 0.38/0.59  (define @t12 () (@var "Y" (-> $$unsorted Bool)))
% 0.38/0.59  (define @t13 () (_ @t12 @t9))
% 0.38/0.59  (define @t14 () (=> @t13 @t11))
% 0.38/0.59  (define @t15 () (@list @t9))
% 0.38/0.59  (define @t16 () (forall @t15 @t14))
% 0.38/0.59  (define @t17 () (=> (_ (_ (_ tptp.is_rel_on @t2) @t4) @t12) @t16))
% 0.38/0.59  (define @t18 () (@list @t2 @t4 @t12))
% 0.38/0.59  (define @t19 () (forall @t18 @t17))
% 0.38/0.59  (define @t20 () (not @t19))
% 0.38/0.59  (define @t21 () (@var "X" $$unsorted))
% 0.38/0.59  (define @t22 () (@var "M" (-> $$unsorted Bool)))
% 0.38/0.59  (define @t23 () (lambda (@list @t21 @t22) (_ @t22 @t21)))
% 0.38/0.59  (define @t24 () (@list @t21))
% 0.38/0.59  (define @t25 () (lambda @t24 false))
% 0.38/0.59  (define @t26 () (@var "Y" $$unsorted))
% 0.38/0.59  (define @t27 () (= @t1 @t21))
% 0.38/0.59  (define @t28 () (lambda (@list @t21 @t26 @t1) (or @t27 (= @t1 @t26))))
% 0.38/0.59  (define @t29 () (lambda (@list @t21 @t1) @t27))
% 0.38/0.59  (define @t30 () (_ @t12 @t1))
% 0.38/0.59  (define @t31 () (@list @t4 @t12 @t1))
% 0.38/0.59  (define @t32 () (lambda @t31 (or @t5 @t30)))
% 0.38/0.59  (define @t33 () (not @t5))
% 0.38/0.59  (define @t34 () (and @t5 (not @t30)))
% 0.38/0.59  (define @t35 () (lambda @t31 (or @t34 (and @t33 @t30))))
% 0.38/0.59  (define @t36 () (and @t5 @t30))
% 0.38/0.59  (define @t37 () (lambda @t31 @t36))
% 0.38/0.59  (define @t38 () (lambda @t31 @t34))
% 0.38/0.59  (define @t39 () (lambda (@list @t4 @t1) @t33))
% 0.38/0.59  (define @t40 () (@list @t4 @t12))
% 0.38/0.59  (define @t41 () (lambda @t40 (= (_ (_ tptp.intersection @t4) @t12) tptp.emptyset)))
% 0.38/0.59  (define @t42 () (lambda @t40 (forall @t7 (=> @t5 @t30))))
% 0.38/0.59  (define @t43 () (exists @t7 @t36))
% 0.38/0.59  (define @t44 () (lambda @t40 @t43))
% 0.38/0.59  (define @t45 () (lambda @t40 (not @t43)))
% 0.38/0.59  (define @t46 () (lambda (@list @t4 @t12 @t1 @t9) (and @t5 @t13)))
% 0.38/0.59  (define @t47 () (lambda (@list @t21 @t26 @t1 @t9) (or @t27 (= @t9 @t26))))
% 0.38/0.59  (define @t48 () (= @t21 @t26))
% 0.38/0.59  (define @t49 () (@var "S" (-> $$unsorted Bool)))
% 0.38/0.59  (define @t50 () (_ @t49 @t21))
% 0.38/0.59  (define @t51 () (lambda (@list @t49 @t21 @t26) (and @t50 @t48)))
% 0.38/0.59  (define @t52 () (@var "R2" (-> $$unsorted $$unsorted Bool)))
% 0.38/0.59  (define @t53 () (@var "R1" (-> $$unsorted $$unsorted Bool)))
% 0.38/0.59  (define @t54 () (_ (_ @t53 @t21) @t26))
% 0.38/0.59  (define @t55 () (@list @t21 @t26))
% 0.38/0.59  (define @t56 () (lambda (@list @t53 @t52) (forall @t55 (=> @t54 (_ (_ @t52 @t21) @t26)))))
% 0.38/0.59  (define @t57 () (@var "B" (-> $$unsorted Bool)))
% 0.38/0.59  (define @t58 () (_ @t57 @t26))
% 0.38/0.59  (define @t59 () (@var "A" (-> $$unsorted Bool)))
% 0.38/0.59  (define @t60 () (_ @t59 @t21))
% 0.38/0.59  (define @t61 () (and @t60 @t58))
% 0.38/0.59  (define @t62 () (_ @t2 @t21))
% 0.38/0.59  (define @t63 () (_ @t62 @t26))
% 0.38/0.59  (define @t64 () (forall @t55 (=> @t63 @t61)))
% 0.38/0.59  (define @t65 () (@list @t2 @t59 @t57))
% 0.38/0.59  (define @t66 () (lambda @t65 @t64))
% 0.38/0.59  (define @t67 () (@list @t2 @t49 @t21 @t26))
% 0.38/0.59  (define @t68 () (lambda @t67 (and @t50 @t63)))
% 0.38/0.59  (define @t69 () (lambda @t55 @t48))
% 0.38/0.59  (define @t70 () (@var "Z" $$unsorted))
% 0.38/0.59  (define @t71 () (@list @t26))
% 0.38/0.59  (define @t72 () (lambda (@list @t53 @t52 @t21 @t70) (exists @t71 (and @t54 (_ (_ @t52 @t26) @t70)))))
% 0.38/0.59  (define @t73 () (_ @t62 @t21))
% 0.38/0.59  (define @t74 () (@list @t2))
% 0.38/0.59  (define @t75 () (lambda @t74 (forall @t24 @t73)))
% 0.38/0.59  (define @t76 () (lambda @t74 (forall @t24 (not @t73))))
% 0.38/0.59  (define @t77 () (_ @t2 @t26))
% 0.38/0.59  (define @t78 () (_ @t77 @t21))
% 0.38/0.59  (define @t79 () (lambda @t74 (forall @t55 (=> @t63 @t78))))
% 0.38/0.59  (define @t80 () (lambda @t74 (forall (@list @t21 @t26 @t70) (=> (and @t63 (_ @t77 @t70)) (_ @t62 @t70)))))
% 0.38/0.59  (define @t81 () (lambda @t74 (and (_ tptp.reflexive @t2) (_ tptp.symmetric @t2) (_ tptp.transitive @t2))))
% 0.38/0.59  (define @t82 () (exists @t24 @t63))
% 0.38/0.59  (define @t83 () (@list @t2 @t26))
% 0.38/0.59  (define @t84 () (lambda @t83 @t82))
% 0.38/0.59  (define @t85 () (exists @t71 @t63))
% 0.38/0.59  (define @t86 () (@list @t2 @t21))
% 0.38/0.59  (define @t87 () (lambda @t86 @t85))
% 0.38/0.59  (define @t88 () (lambda (@list @t2 @t21 @t26) @t78))
% 0.38/0.59  (define @t89 () (@var "S1" (-> $$unsorted Bool)))
% 0.38/0.59  (define @t90 () (lambda (@list @t2 @t89) (exists @t24 (and (_ @t89 @t21) (forall @t71 (= (_ @t89 @t26) @t63))))))
% 0.38/0.59  (define @t91 () (lambda @t67 (and (_ @t49 @t26) @t63)))
% 0.38/0.59  (define @t92 () (lambda @t86 (or (_ @t3 @t21) (_ @t10 @t21))))
% 0.38/0.59  (define @t93 () (@var "W" $$unsorted))
% 0.38/0.59  (define @t94 () (not (_ @t4 @t93)))
% 0.38/0.59  (define @t95 () (@list @t93))
% 0.38/0.59  (define @t96 () (_ @t4 @t26))
% 0.38/0.59  (define @t97 () (_ @t4 @t70))
% 0.38/0.59  (define @t98 () (@list @t4 @t70))
% 0.38/0.59  (define @t99 () (lambda @t74 (forall @t98 (=> @t97 (exists @t71 (and @t96 (forall @t95 (=> (_ @t77 @t93) @t94))))))))
% 0.38/0.59  (define @t100 () (lambda @t74 (forall @t98 (=> @t97 (exists @t71 (and @t96 (forall @t95 (=> (_ @t77 @t26) @t94))))))))
% 0.38/0.59  (define @t101 () (@var "BOUND_VARIABLE_8237" $$unsorted))
% 0.38/0.59  (define @t102 () (@var "BOUND_VARIABLE_8239" $$unsorted))
% 0.38/0.59  (define @t103 () (not (_ @t2 @t102 @t101)))
% 0.38/0.59  (define @t104 () (not (_ @t12 @t101)))
% 0.38/0.59  (define @t105 () (@var "BOUND_VARIABLE_8202" $$unsorted))
% 0.38/0.59  (define @t106 () (not (_ @t2 @t1 @t105)))
% 0.38/0.59  (define @t107 () (_ @t4 @t1))
% 0.38/0.59  (define @t108 () (not @t107))
% 0.38/0.59  (define @t109 () (or @t108 @t106))
% 0.38/0.59  (define @t110 () (@list @t1 @t105))
% 0.38/0.59  (define @t111 () (forall @t110 @t109))
% 0.38/0.59  (define @t112 () (not @t111))
% 0.38/0.59  (define @t113 () (_ @t4 @t21))
% 0.38/0.59  (define @t114 () (_ @t2 @t21 @t26))
% 0.38/0.59  (define @t115 () (not @t114))
% 0.38/0.59  (define @t116 () (forall @t55 (or @t115 (and @t113 (_ @t12 @t26)))))
% 0.38/0.59  (define @t117 () (not @t116))
% 0.38/0.59  (define @t118 () (or @t117 @t112 @t104 @t103))
% 0.38/0.59  (define @t119 () (or @t104 @t103))
% 0.38/0.59  (define @t120 () (or @t117 @t112 @t119))
% 0.38/0.59  (define @t121 () (@list @t2 @t4 @t12 @t101 @t102))
% 0.38/0.59  (define @t122 () (forall @t121 @t120))
% 0.38/0.59  (define @t123 () (@list @t101 @t102))
% 0.38/0.59  (define @t124 () (forall @t123 @t120))
% 0.38/0.59  (define @t125 () (forall @t123 @t119))
% 0.38/0.59  (define @t126 () (@var "BOUND_VARIABLE_8224" $$unsorted))
% 0.38/0.59  (define @t127 () (or @t117 @t112 @t125))
% 0.38/0.59  (define @t128 () (not (_ @t2 @t126 @t9)))
% 0.38/0.59  (define @t129 () (_ @t12 @t9))
% 0.38/0.59  (define @t130 () (not @t129))
% 0.38/0.59  (define @t131 () (or @t130 @t128))
% 0.38/0.59  (define @t132 () (forall (@list @t9 @t126) @t131))
% 0.38/0.59  (define @t133 () (or @t117 @t112 @t132))
% 0.38/0.59  (define @t134 () (or @t112 @t132))
% 0.38/0.59  (define @t135 () (@list @t126))
% 0.38/0.59  (define @t136 () (forall @t135 @t131))
% 0.38/0.59  (define @t137 () (forall @t135 @t128))
% 0.38/0.59  (define @t138 () (or @t130 @t137))
% 0.38/0.59  (define @t139 () (forall @t24 (not (_ @t2 @t21 @t9))))
% 0.38/0.59  (define @t140 () (not @t13))
% 0.38/0.59  (define @t141 () (or @t140 @t139))
% 0.38/0.59  (define @t142 () (forall @t15 @t141))
% 0.38/0.59  (define @t143 () (or @t112 @t142))
% 0.38/0.59  (define @t144 () (or @t112 @t141))
% 0.38/0.59  (define @t145 () (or @t140 @t139 @t112))
% 0.38/0.59  (define @t146 () (not @t139))
% 0.38/0.59  (define @t147 () (=> @t146 @t112))
% 0.38/0.59  (define @t148 () (@list @t105))
% 0.38/0.59  (define @t149 () (forall @t148 @t109))
% 0.38/0.59  (define @t150 () (forall @t148 @t106))
% 0.38/0.59  (define @t151 () (or @t108 @t150))
% 0.38/0.59  (define @t152 () (forall @t71 (not (_ @t2 @t1 @t26))))
% 0.38/0.59  (define @t153 () (or @t33 @t152))
% 0.38/0.59  (define @t154 () (not @t152))
% 0.38/0.59  (define @t155 () (and @t5 @t154))
% 0.38/0.59  (define @t156 () (forall @t7 (not @t155)))
% 0.38/0.59  (define @t157 () (not @t156))
% 0.38/0.59  (define @t158 () (not (forall @t71 @t115)))
% 0.38/0.59  (define @t159 () (lambda @t24 @t158))
% 0.38/0.59  (define @t160 () (_ (lambda @t86 @t158) @t2))
% 0.38/0.59  (define @t161 () (and @t5 (_ @t160 @t1)))
% 0.38/0.59  (define @t162 () (exists @t7 @t161))
% 0.38/0.59  (define @t163 () (not (forall @t24 @t115)))
% 0.38/0.59  (define @t164 () (lambda @t71 @t163))
% 0.38/0.59  (define @t165 () (_ (lambda @t83 @t163) @t2))
% 0.38/0.59  (define @t166 () (=> (_ @t165 @t9) @t162))
% 0.38/0.59  (define @t167 () (=> @t13 @t166))
% 0.38/0.59  (define @t168 () (forall @t15 @t167))
% 0.38/0.59  (define @t169 () (_ @t57 @t26))
% 0.38/0.59  (define @t170 () (lambda (@list @t57) (forall @t55 (or @t115 (and @t113 @t169)))))
% 0.38/0.59  (define @t171 () (_ @t59 @t21))
% 0.38/0.59  (define @t172 () (forall @t55 (or @t115 (and @t171 @t169))))
% 0.38/0.59  (define @t173 () (lambda (@list @t59 @t57) @t172))
% 0.38/0.59  (define @t174 () (_ (lambda @t65 @t172) @t2))
% 0.38/0.59  (define @t175 () (=> (_ (_ @t174 @t4) @t12) @t168))
% 0.38/0.59  (define @t176 () (forall @t18 @t175))
% 0.38/0.59  (define @t177 () (not @t63))
% 0.38/0.59  (define @t178 () (forall @t71 @t177))
% 0.38/0.59  (define @t179 () (not @t178))
% 0.38/0.59  (define @t180 () (forall @t24 @t177))
% 0.38/0.59  (define @t181 () (not @t180))
% 0.38/0.59  (define @t182 () (or @t177 @t61))
% 0.38/0.59  (define @t183 () (forall @t121 @t118))
% 0.38/0.59  (define @t184 () (@quantifiers_skolemize @t183 2))
% 0.38/0.59  (define @t185 () (@quantifiers_skolemize @t183 1))
% 0.38/0.59  (define @t186 () (@quantifiers_skolemize @t183 0))
% 0.38/0.59  (define @t187 () (forall @t55 (or (not (_ @t186 @t21 @t26)) (and (_ @t185 @t21) (_ @t184 @t26)))))
% 0.38/0.59  (define @t188 () (@quantifiers_skolemize @t183 3))
% 0.38/0.59  (define @t189 () (@quantifiers_skolemize @t183 4))
% 0.38/0.59  (define @t190 () (_ @t186 @t189 @t188))
% 0.38/0.59  (define @t191 () (not @t190))
% 0.38/0.59  (define @t192 () (_ @t184 @t188))
% 0.38/0.59  (define @t193 () (forall @t110 (or (not (_ @t185 @t1)) (not (_ @t186 @t1 @t105)))))
% 0.38/0.59  (define @t194 () (not @t193))
% 0.38/0.59  (define @t195 () (not @t187))
% 0.38/0.59  (define @t196 () (or @t195 @t194 (not @t192) @t191))
% 0.38/0.59  (define @t197 () (@list true))
% 0.38/0.59  (define @t198 () (@list @t196))
% 0.38/0.59  (define @t199 () (@list @t189 @t188))
% 0.38/0.59  (define @t200 () (_ @t185 @t189))
% 0.38/0.59  (define @t201 () (and @t200 @t192))
% 0.38/0.59  (define @t202 () (or @t191 @t201))
% 0.38/0.59  (define @t203 () (@list false false))
% 0.38/0.59  (define @t204 () (not @t200))
% 0.38/0.59  (define @t205 () (or @t204 @t191))
% 0.38/0.59  (assume @p1 @t20)
% 0.38/0.59  (assume @p2 true)
% 0.38/0.59  (step @p3 (= tptp.in @t23) :rule refl :args (@t23))
% 0.38/0.59  (step @p4 (= tptp.is_a @t23) :rule refl :args (@t23))
% 0.38/0.59  (step @p5 (= tptp.emptyset @t25) :rule refl :args (@t25))
% 0.38/0.59  (step @p6 (= tptp.unord_pair @t28) :rule refl :args (@t28))
% 0.38/0.59  (step @p7 (= tptp.singleton @t29) :rule refl :args (@t29))
% 0.38/0.59  (step @p8 (= tptp.union @t32) :rule refl :args (@t32))
% 0.38/0.59  (step @p9 (= tptp.excl_union @t35) :rule refl :args (@t35))
% 0.38/0.59  (step @p10 (= tptp.intersection @t37) :rule refl :args (@t37))
% 0.38/0.59  (step @p11 (= tptp.setminus @t38) :rule refl :args (@t38))
% 0.38/0.59  (step @p12 (= tptp.complement @t39) :rule refl :args (@t39))
% 0.38/0.59  (step @p13 (= tptp.disjoint @t41) :rule refl :args (@t41))
% 0.38/0.59  (step @p14 (= tptp.subset @t42) :rule refl :args (@t42))
% 0.38/0.59  (step @p15 (= tptp.meets @t44) :rule refl :args (@t44))
% 0.38/0.59  (step @p16 (= tptp.misses @t45) :rule refl :args (@t45))
% 0.38/0.59  (step @p17 (= tptp.cartesian_product @t46) :rule refl :args (@t46))
% 0.38/0.59  (step @p18 (= tptp.pair_rel @t47) :rule refl :args (@t47))
% 0.38/0.59  (step @p19 (= tptp.id_rel @t51) :rule refl :args (@t51))
% 0.38/0.59  (step @p20 (= tptp.sub_rel @t56) :rule refl :args (@t56))
% 0.38/0.59  (step @p21 (= tptp.is_rel_on @t66) :rule refl :args (@t66))
% 0.38/0.59  (step @p22 (= tptp.restrict_rel_domain @t68) :rule refl :args (@t68))
% 0.38/0.59  (step @p23 (= tptp.rel_diagonal @t69) :rule refl :args (@t69))
% 0.38/0.59  (step @p24 (= tptp.rel_composition @t72) :rule refl :args (@t72))
% 0.38/0.59  (step @p25 (= tptp.reflexive @t75) :rule refl :args (@t75))
% 0.38/0.59  (step @p26 (= tptp.irreflexive @t76) :rule refl :args (@t76))
% 0.38/0.59  (step @p27 (= tptp.symmetric @t79) :rule refl :args (@t79))
% 0.38/0.59  (step @p28 (= tptp.transitive @t80) :rule refl :args (@t80))
% 0.38/0.59  (step @p29 (= tptp.equiv_rel @t81) :rule refl :args (@t81))
% 0.38/0.59  (step @p30 (= tptp.rel_codomain @t84) :rule refl :args (@t84))
% 0.38/0.59  (step @p31 (= tptp.rel_domain @t87) :rule refl :args (@t87))
% 0.38/0.59  (step @p32 (= tptp.rel_inverse @t88) :rule refl :args (@t88))
% 0.38/0.59  (step @p33 (= tptp.equiv_classes @t90) :rule refl :args (@t90))
% 0.38/0.59  (step @p34 (= tptp.restrict_rel_codomain @t91) :rule refl :args (@t91))
% 0.38/0.59  (step @p35 (= tptp.rel_field @t92) :rule refl :args (@t92))
% 0.38/0.59  (step @p36 (= tptp.well_founded @t99) :rule refl :args (@t99))
% 0.38/0.59  (step @p37 (= tptp.upwards_well_founded @t100) :rule refl :args (@t100))
% 0.38/0.59  (step @p38 :rule aci_norm :args ((= @t120 @t118)))
% 0.38/0.59  (step @p39 :rule cong :premises (@p38) :args (@t122))
% 0.38/0.59  (step @p40 :rule quant-merge-prenex :args ((= (forall @t18 @t124) @t122)))
% 0.38/0.59  (step @p41 :rule alpha_equiv :args (@t125 (@list @t101 @t102) (@list @t9 @t126)))
% 0.38/0.59  (step @p42 :rule refl :args (@t112))
% 0.38/0.59  (step @p43 :rule refl :args (@t117))
% 0.38/0.59  (step @p44 :rule nary_cong :premises (@p43 @p42 @p41) :args (@t127))
% 0.38/0.59  (step @p45 :rule quant-miniscope-or :args ((= @t124 @t127)))
% 0.38/0.59  (step @p46 :rule trans :premises (@p45 @p44))
% 0.38/0.59  (step @p47 :rule symm :premises (@p46))
% 0.38/0.59  (step @p48 :rule cong :premises (@p47) :args ((forall @t18 @t133)))
% 0.38/0.59  (step @p49 :rule trans :premises (@p48 @p40))
% 0.38/0.59  (step @p50 :rule trans :premises (@p49 @p39))
% 0.38/0.59  (step @p51 :rule aci_norm :args ((= (or @t117 @t134) @t133)))
% 0.38/0.59  (step @p52 :rule bool-impl-elim :args (@t116 @t134))
% 0.38/0.59  (step @p53 :rule trans :premises (@p52 @p51))
% 0.38/0.59  (step @p54 :rule cong :premises (@p53) :args ((forall @t18 (=> @t116 @t134))))
% 0.38/0.59  (step @p55 :rule trans :premises (@p54 @p50))
% 0.38/0.59  (step @p56 :rule quant-merge-prenex :args ((= (forall @t15 @t136) @t132)))
% 0.38/0.59  (step @p57 :rule alpha_equiv :args (@t137 (@list @t126) (@list @t21)))
% 0.38/0.59  (step @p58 :rule refl :args (@t130))
% 0.38/0.59  (step @p59 :rule nary_cong :premises (@p58 @p57) :args (@t138))
% 0.38/0.59  (step @p60 :rule quant-miniscope-or :args ((= @t136 @t138)))
% 0.38/0.59  (step @p61 :rule trans :premises (@p60 @p59))
% 0.38/0.59  (step @p62 :rule symm :premises (@p61))
% 0.38/0.59  (step @p63 :rule cong :premises (@p62) :args ((forall @t15 (or @t130 @t139))))
% 0.38/0.59  (step @p64 :rule trans :premises (@p63 @p56))
% 0.38/0.59  (step @p65 :rule refl :args (@t139))
% 0.38/0.59  (step @p66 :rule refl :args (@t129))
% 0.38/0.59  (step @p67 :rule refl :args (@t13))
% 0.38/0.59  (step @p68 :rule cong :premises (@p67 @p66) :args ((= @t13 @t129)))
% 0.38/0.59  (step @p69 :rule symm :premises (@p68))
% 0.38/0.59  (step @p70 :rule eq_resolve :premises (@p67 @p69))
% 0.38/0.59  (step @p71 :rule cong :premises (@p70) :args (@t140))
% 0.38/0.59  (step @p72 :rule nary_cong :premises (@p71 @p65) :args (@t141))
% 0.38/0.59  (step @p73 :rule cong :premises (@p72) :args (@t142))
% 0.38/0.59  (step @p74 :rule trans :premises (@p73 @p64))
% 0.38/0.59  (step @p75 :rule refl :args (@t112))
% 0.38/0.59  (step @p76 :rule nary_cong :premises (@p75 @p74) :args (@t143))
% 0.38/0.59  (step @p77 :rule quant-miniscope-or :args ((= (forall @t15 @t144) @t143)))
% 0.38/0.59  (step @p78 :rule aci_norm :args ((= @t145 @t144)))
% 0.38/0.59  (step @p79 :rule cong :premises (@p78) :args ((forall @t15 @t145)))
% 0.38/0.59  (step @p80 :rule trans :premises (@p79 @p77))
% 0.38/0.59  (step @p81 :rule trans :premises (@p80 @p76))
% 0.38/0.59  (step @p82 :rule aci_norm :args ((= (or @t140 (or @t139 @t112)) @t145)))
% 0.38/0.59  (step @p83 :rule bool-double-not-elim :args (@t139))
% 0.38/0.59  (step @p84 :rule nary_cong :premises (@p83 @p42) :args ((or (not @t146) @t112)))
% 0.38/0.59  (step @p85 :rule bool-impl-elim :args (@t146 @t112))
% 0.38/0.59  (step @p86 :rule trans :premises (@p85 @p84))
% 0.38/0.59  (step @p87 :rule refl :args (@t140))
% 0.38/0.59  (step @p88 :rule nary_cong :premises (@p87 @p86) :args ((or @t140 @t147)))
% 0.38/0.59  (step @p89 :rule trans :premises (@p88 @p82))
% 0.38/0.59  (step @p90 :rule bool-impl-elim :args (@t13 @t147))
% 0.38/0.59  (step @p91 :rule trans :premises (@p90 @p89))
% 0.38/0.59  (step @p92 :rule cong :premises (@p91) :args ((forall @t15 (=> @t13 @t147))))
% 0.38/0.59  (step @p93 :rule trans :premises (@p92 @p81))
% 0.38/0.59  (step @p94 :rule quant-merge-prenex :args ((= (forall @t7 @t149) @t111)))
% 0.38/0.59  (step @p95 :rule alpha_equiv :args (@t150 (@list @t105) (@list @t26)))
% 0.38/0.59  (step @p96 :rule refl :args (@t108))
% 0.38/0.59  (step @p97 :rule nary_cong :premises (@p96 @p95) :args (@t151))
% 0.38/0.59  (step @p98 :rule quant-miniscope-or :args ((= @t149 @t151)))
% 0.38/0.59  (step @p99 :rule trans :premises (@p98 @p97))
% 0.38/0.59  (step @p100 :rule symm :premises (@p99))
% 0.38/0.59  (step @p101 :rule cong :premises (@p100) :args ((forall @t7 (or @t108 @t152))))
% 0.38/0.59  (step @p102 :rule trans :premises (@p101 @p94))
% 0.38/0.59  (step @p103 :rule refl :args (@t152))
% 0.38/0.59  (step @p104 :rule refl :args (@t107))
% 0.38/0.59  (step @p105 :rule refl :args (@t5))
% 0.38/0.59  (step @p106 :rule cong :premises (@p105 @p104) :args ((= @t5 @t107)))
% 0.38/0.59  (step @p107 :rule symm :premises (@p106))
% 0.38/0.59  (step @p108 :rule eq_resolve :premises (@p105 @p107))
% 0.38/0.59  (step @p109 :rule cong :premises (@p108) :args (@t33))
% 0.38/0.59  (step @p110 :rule nary_cong :premises (@p109 @p103) :args (@t153))
% 0.38/0.59  (step @p111 :rule cong :premises (@p110) :args ((forall @t7 @t153)))
% 0.38/0.59  (step @p112 :rule trans :premises (@p111 @p102))
% 0.38/0.59  (step @p113 :rule bool-double-not-elim :args (@t152))
% 0.38/0.59  (step @p114 :rule refl :args (@t33))
% 0.38/0.59  (step @p115 :rule nary_cong :premises (@p114 @p113) :args ((or @t33 (not @t154))))
% 0.38/0.59  (step @p116 :rule bool-and-de-morgan :args (@t5 @t154 true))
% 0.38/0.59  (step @p117 :rule trans :premises (@p116 @p115))
% 0.38/0.59  (step @p118 :rule cong :premises (@p117) :args (@t156))
% 0.38/0.59  (step @p119 :rule trans :premises (@p118 @p112))
% 0.38/0.59  (step @p120 :rule cong :premises (@p119) :args (@t157))
% 0.38/0.59  (step @p121 :rule exists-elim :args ((= (exists @t7 @t155) @t157)))
% 0.38/0.59  (step @p122 :rule trans :premises (@p121 @p120))
% 0.38/0.59  (step @p123 :rule beta-reduce :args ((= (_ @t159 @t1) @t154)))
% 0.38/0.59  (step @p124 :rule refl :args (@t1))
% 0.38/0.59  (step @p125 :rule beta-reduce :args ((= @t160 @t159)))
% 0.38/0.59  (step @p126 :rule ho_cong :premises (@p125 @p124))
% 0.38/0.59  (step @p127 :rule trans :premises (@p126 @p123))
% 0.38/0.59  (step @p128 :rule refl :args (@t5))
% 0.38/0.59  (step @p129 :rule nary_cong :premises (@p128 @p127) :args (@t161))
% 0.38/0.59  (step @p130 :rule cong :premises (@p129) :args (@t162))
% 0.38/0.59  (step @p131 :rule trans :premises (@p130 @p122))
% 0.38/0.59  (step @p132 :rule beta-reduce :args ((= (_ @t164 @t9) @t146)))
% 0.38/0.59  (step @p133 :rule refl :args (@t9))
% 0.38/0.59  (step @p134 :rule beta-reduce :args ((= @t165 @t164)))
% 0.38/0.59  (step @p135 :rule ho_cong :premises (@p134 @p133))
% 0.38/0.59  (step @p136 :rule trans :premises (@p135 @p132))
% 0.38/0.59  (step @p137 :rule cong :premises (@p136 @p131) :args (@t166))
% 0.38/0.59  (step @p138 :rule refl :args (@t13))
% 0.38/0.59  (step @p139 :rule cong :premises (@p138 @p137) :args (@t167))
% 0.38/0.59  (step @p140 :rule cong :premises (@p139) :args (@t168))
% 0.38/0.59  (step @p141 :rule trans :premises (@p140 @p93))
% 0.38/0.59  (step @p142 :rule beta-reduce :args ((= (_ @t170 @t12) @t116)))
% 0.38/0.59  (step @p143 :rule refl :args (@t12))
% 0.38/0.59  (step @p144 :rule beta-reduce :args ((= (_ @t173 @t4) @t170)))
% 0.38/0.59  (step @p145 :rule refl :args (@t4))
% 0.38/0.59  (step @p146 :rule beta-reduce :args ((= @t174 @t173)))
% 0.38/0.59  (step @p147 :rule ho_cong :premises (@p146 @p145))
% 0.38/0.59  (step @p148 :rule trans :premises (@p147 @p144))
% 0.38/0.59  (step @p149 :rule ho_cong :premises (@p148 @p143))
% 0.38/0.59  (step @p150 :rule trans :premises (@p149 @p142))
% 0.38/0.59  (step @p151 :rule cong :premises (@p150 @p141) :args (@t175))
% 0.38/0.59  (step @p152 :rule cong :premises (@p151) :args (@t176))
% 0.38/0.59  (step @p153 :rule trans :premises (@p152 @p55))
% 0.38/0.59  (step @p154 :rule cong :premises (@p153) :args ((not @t176)))
% 0.38/0.59  (step @p155 :rule refl :args (@t2))
% 0.38/0.59  (step @p156 :rule refl :args (@t114))
% 0.38/0.59  (step @p157 :rule refl :args (@t63))
% 0.38/0.59  (step @p158 :rule cong :premises (@p157 @p156) :args ((= @t63 @t114)))
% 0.38/0.59  (step @p159 :rule symm :premises (@p158))
% 0.38/0.59  (step @p160 :rule eq_resolve :premises (@p157 @p159))
% 0.38/0.59  (step @p161 :rule cong :premises (@p160) :args (@t177))
% 0.38/0.59  (step @p162 :rule cong :premises (@p161) :args (@t178))
% 0.38/0.59  (step @p163 :rule cong :premises (@p162) :args (@t179))
% 0.38/0.59  (step @p164 :rule exists-elim :args ((= @t85 @t179)))
% 0.38/0.59  (step @p165 :rule trans :premises (@p164 @p163))
% 0.38/0.59  (step @p166 :rule cong :premises (@p165) :args (@t87))
% 0.38/0.59  (step @p167 :rule trans :premises (@p31 @p166))
% 0.38/0.59  (step @p168 :rule ho_cong :premises (@p167 @p155))
% 0.38/0.59  (step @p169 :rule ho_cong :premises (@p168 @p124))
% 0.38/0.59  (step @p170 :rule nary_cong :premises (@p128 @p169) :args (@t6))
% 0.38/0.59  (step @p171 :rule cong :premises (@p170) :args (@t8))
% 0.38/0.59  (step @p172 :rule cong :premises (@p161) :args (@t180))
% 0.38/0.59  (step @p173 :rule cong :premises (@p172) :args (@t181))
% 0.38/0.59  (step @p174 :rule exists-elim :args ((= @t82 @t181)))
% 0.38/0.59  (step @p175 :rule trans :premises (@p174 @p173))
% 0.38/0.59  (step @p176 :rule cong :premises (@p175) :args (@t84))
% 0.38/0.59  (step @p177 :rule trans :premises (@p30 @p176))
% 0.38/0.59  (step @p178 :rule ho_cong :premises (@p177 @p155))
% 0.38/0.59  (step @p179 :rule ho_cong :premises (@p178 @p133))
% 0.38/0.59  (step @p180 :rule cong :premises (@p179 @p171) :args (@t11))
% 0.38/0.59  (step @p181 :rule cong :premises (@p138 @p180) :args (@t14))
% 0.38/0.59  (step @p182 :rule cong :premises (@p181) :args (@t16))
% 0.38/0.59  (step @p183 :rule refl :args (@t169))
% 0.38/0.59  (step @p184 :rule refl :args (@t58))
% 0.38/0.59  (step @p185 :rule cong :premises (@p184 @p183) :args ((= @t58 @t169)))
% 0.38/0.59  (step @p186 :rule symm :premises (@p185))
% 0.38/0.59  (step @p187 :rule eq_resolve :premises (@p184 @p186))
% 0.38/0.59  (step @p188 :rule refl :args (@t171))
% 0.38/0.59  (step @p189 :rule refl :args (@t60))
% 0.38/0.59  (step @p190 :rule cong :premises (@p189 @p188) :args ((= @t60 @t171)))
% 0.38/0.59  (step @p191 :rule symm :premises (@p190))
% 0.38/0.59  (step @p192 :rule eq_resolve :premises (@p189 @p191))
% 0.38/0.59  (step @p193 :rule nary_cong :premises (@p192 @p187) :args (@t61))
% 0.38/0.59  (step @p194 :rule nary_cong :premises (@p161 @p193) :args (@t182))
% 0.38/0.59  (step @p195 :rule cong :premises (@p194) :args ((forall @t55 @t182)))
% 0.38/0.59  (step @p196 :rule bool-impl-elim :args (@t63 @t61))
% 0.38/0.59  (step @p197 :rule cong :premises (@p196) :args (@t64))
% 0.38/0.59  (step @p198 :rule trans :premises (@p197 @p195))
% 0.38/0.59  (step @p199 :rule cong :premises (@p198) :args (@t66))
% 0.38/0.59  (step @p200 :rule trans :premises (@p21 @p199))
% 0.38/0.59  (step @p201 :rule ho_cong :premises (@p200 @p155))
% 0.38/0.59  (step @p202 :rule ho_cong :premises (@p201 @p145))
% 0.38/0.59  (step @p203 :rule ho_cong :premises (@p202 @p143))
% 0.38/0.59  (step @p204 :rule cong :premises (@p203 @p182) :args (@t17))
% 0.38/0.59  (step @p205 :rule cong :premises (@p204) :args (@t19))
% 0.38/0.59  (step @p206 :rule cong :premises (@p205) :args (@t20))
% 0.38/0.59  (step @p207 :rule trans :premises (@p206 @p154))
% 0.38/0.59  (step @p208 :rule eq_resolve :premises (@p1 @p207))
% 0.38/0.59  (step @p209 :rule skolemize :premises (@p208))
% 0.38/0.59  (step @p210 :rule bool-double-not-elim :args (@t187))
% 0.38/0.59  (step @p211 :rule refl :args (@t196))
% 0.38/0.59  (step @p212 :rule nary_cong :premises (@p211 @p210) :args ((or @t196 (not @t195))))
% 0.38/0.59  (step @p213 :rule cnf_or_neg :args (@t196 0))
% 0.38/0.59  (step @p214 :rule eq_resolve :premises (@p213 @p212))
% 0.38/0.59  (step @p215 :rule reordering :premises (@p214) :args ((or @t187 @t196)))
% 0.38/0.59  (step @p216 :rule chain_m_resolution :premises (@p215 @p209) :args (@t187 @t197 @t198))
% 0.38/0.59  (step @p217 :rule instantiate :premises (@p216) :args (@t199))
% 0.38/0.59  (step @p218 :rule bool-double-not-elim :args (@t190))
% 0.38/0.59  (step @p219 :rule nary_cong :premises (@p211 @p218) :args ((or @t196 (not @t191))))
% 0.38/0.59  (step @p220 :rule cnf_or_neg :args (@t196 3))
% 0.38/0.59  (step @p221 :rule eq_resolve :premises (@p220 @p219))
% 0.38/0.59  (step @p222 :rule reordering :premises (@p221) :args ((or @t190 @t196)))
% 0.38/0.59  (step @p223 :rule chain_m_resolution :premises (@p222 @p209) :args (@t190 @t197 @t198))
% 0.38/0.59  (step @p224 :rule cnf_or_pos :args (@t202))
% 0.38/0.59  (step @p225 :rule reordering :premises (@p224) :args ((or @t191 @t201 (not @t202))))
% 0.38/0.59  (step @p226 :rule chain_m_resolution :premises (@p225 @p223 @p217) :args (@t201 @t203 (@list @t190 @t202)))
% 0.38/0.59  (step @p227 :rule bool-double-not-elim :args (@t193))
% 0.38/0.59  (step @p228 :rule nary_cong :premises (@p211 @p227) :args ((or @t196 (not @t194))))
% 0.38/0.59  (step @p229 :rule cnf_or_neg :args (@t196 1))
% 0.38/0.59  (step @p230 :rule eq_resolve :premises (@p229 @p228))
% 0.38/0.59  (step @p231 :rule reordering :premises (@p230) :args ((or @t193 @t196)))
% 0.38/0.59  (step @p232 :rule chain_m_resolution :premises (@p231 @p209) :args (@t193 @t197 @t198))
% 0.38/0.59  (step @p233 :rule instantiate :premises (@p232) :args (@t199))
% 0.38/0.59  (step @p234 :rule cnf_or_pos :args (@t205))
% 0.38/0.59  (step @p235 :rule reordering :premises (@p234) :args ((or @t191 @t204 (not @t205))))
% 0.38/0.59  (step @p236 :rule chain_m_resolution :premises (@p235 @p223 @p233) :args (@t204 @t203 (@list @t190 @t205)))
% 0.38/0.59  (step @p237 :rule cnf_and_pos :args (@t201 0))
% 0.38/0.59  (step @p238 :rule reordering :premises (@p237) :args ((or @t200 (not @t201))))
% 0.38/0.59  (step @p239 false :rule chain_m_resolution :premises (@p238 @p236 @p226) :args (false (@list true false) (@list @t200 @t201)))
% 0.38/0.59  )
% 0.38/0.59  % SZS output end Proof
% 0.38/0.59  % cvc5 exiting
%------------------------------------------------------------------------------