↑ Up

cvc5---1.3.4.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : cvc5---1.3.4
% Problem  : SET680^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 : n027.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:25 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  : SET680^3 : TPTP v9.2.1. Released v3.6.0.
% 0.11/0.13  % Command  : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.34  % Computer : n027.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:51 EDT 2026
% 0.17/0.34  % CPUTime  : 
% 0.29/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 "V" $$unsorted))
% 0.38/0.59  (define @t2 () (@var "U" $$unsorted))
% 0.38/0.59  (define @t3 () (@var "R" (-> $$unsorted $$unsorted Bool)))
% 0.38/0.59  (define @t4 () (_ (_ @t3 @t2) @t1))
% 0.38/0.59  (define @t5 () (@var "Y" (-> $$unsorted Bool)))
% 0.38/0.59  (define @t6 () (_ @t5 @t1))
% 0.38/0.59  (define @t7 () (and @t6 @t4))
% 0.38/0.59  (define @t8 () (@list @t1))
% 0.38/0.59  (define @t9 () (exists @t8 @t7))
% 0.38/0.59  (define @t10 () (_ tptp.rel_domain @t3))
% 0.38/0.59  (define @t11 () (= (_ @t10 @t2) @t9))
% 0.38/0.59  (define @t12 () (@var "X" (-> $$unsorted Bool)))
% 0.38/0.59  (define @t13 () (_ @t12 @t2))
% 0.38/0.59  (define @t14 () (=> @t13 @t11))
% 0.38/0.59  (define @t15 () (@list @t2))
% 0.38/0.59  (define @t16 () (forall @t15 @t14))
% 0.38/0.59  (define @t17 () (=> (_ (_ (_ tptp.is_rel_on @t3) @t12) @t5) @t16))
% 0.38/0.59  (define @t18 () (@list @t3 @t12 @t5))
% 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 () (= @t2 @t21))
% 0.38/0.59  (define @t28 () (lambda (@list @t21 @t26 @t2) (or @t27 (= @t2 @t26))))
% 0.38/0.59  (define @t29 () (lambda (@list @t21 @t2) @t27))
% 0.38/0.59  (define @t30 () (_ @t5 @t2))
% 0.38/0.59  (define @t31 () (@list @t12 @t5 @t2))
% 0.38/0.59  (define @t32 () (lambda @t31 (or @t13 @t30)))
% 0.38/0.59  (define @t33 () (not @t13))
% 0.38/0.59  (define @t34 () (and @t13 (not @t30)))
% 0.38/0.59  (define @t35 () (lambda @t31 (or @t34 (and @t33 @t30))))
% 0.38/0.59  (define @t36 () (and @t13 @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 @t12 @t2) @t33))
% 0.38/0.59  (define @t40 () (@list @t12 @t5))
% 0.38/0.59  (define @t41 () (lambda @t40 (= (_ (_ tptp.intersection @t12) @t5) tptp.emptyset)))
% 0.38/0.59  (define @t42 () (lambda @t40 (forall @t15 (=> @t13 @t30))))
% 0.38/0.59  (define @t43 () (exists @t15 @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 @t12 @t5 @t2 @t1) (and @t13 @t6)))
% 0.38/0.59  (define @t47 () (lambda (@list @t21 @t26 @t2 @t1) (or @t27 (= @t1 @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 () (_ @t3 @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 @t3 @t59 @t57))
% 0.38/0.59  (define @t66 () (lambda @t65 @t64))
% 0.38/0.59  (define @t67 () (@list @t3 @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 @t3))
% 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 () (_ @t3 @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 @t3) (_ tptp.symmetric @t3) (_ tptp.transitive @t3))))
% 0.38/0.59  (define @t82 () (lambda (@list @t3 @t26) (exists @t24 @t63)))
% 0.38/0.59  (define @t83 () (exists @t71 @t63))
% 0.38/0.59  (define @t84 () (@list @t3 @t21))
% 0.38/0.59  (define @t85 () (lambda @t84 @t83))
% 0.38/0.59  (define @t86 () (lambda (@list @t3 @t21 @t26) @t78))
% 0.38/0.59  (define @t87 () (@var "S1" (-> $$unsorted Bool)))
% 0.38/0.59  (define @t88 () (lambda (@list @t3 @t87) (exists @t24 (and (_ @t87 @t21) (forall @t71 (= (_ @t87 @t26) @t63))))))
% 0.38/0.59  (define @t89 () (lambda @t67 (and (_ @t49 @t26) @t63)))
% 0.38/0.59  (define @t90 () (lambda @t84 (or (_ @t10 @t21) (_ (_ tptp.rel_codomain @t3) @t21))))
% 0.38/0.59  (define @t91 () (@var "W" $$unsorted))
% 0.38/0.59  (define @t92 () (not (_ @t12 @t91)))
% 0.38/0.59  (define @t93 () (@list @t91))
% 0.38/0.59  (define @t94 () (_ @t12 @t26))
% 0.38/0.59  (define @t95 () (_ @t12 @t70))
% 0.38/0.59  (define @t96 () (@list @t12 @t70))
% 0.38/0.59  (define @t97 () (lambda @t74 (forall @t96 (=> @t95 (exists @t71 (and @t94 (forall @t93 (=> (_ @t77 @t91) @t92))))))))
% 0.38/0.59  (define @t98 () (lambda @t74 (forall @t96 (=> @t95 (exists @t71 (and @t94 (forall @t93 (=> (_ @t77 @t26) @t92))))))))
% 0.38/0.59  (define @t99 () (@var "BOUND_VARIABLE_8213" $$unsorted))
% 0.38/0.59  (define @t100 () (_ @t5 @t1))
% 0.38/0.59  (define @t101 () (not @t100))
% 0.38/0.59  (define @t102 () (= (not (forall @t8 (or @t101 (not (_ @t3 @t99 @t1))))) (not (forall @t71 (not (_ @t3 @t99 @t26))))))
% 0.38/0.59  (define @t103 () (not (_ @t12 @t99)))
% 0.38/0.59  (define @t104 () (_ @t12 @t21))
% 0.38/0.59  (define @t105 () (_ @t3 @t21 @t26))
% 0.38/0.59  (define @t106 () (not @t105))
% 0.38/0.59  (define @t107 () (forall @t55 (or @t106 (and @t104 (_ @t5 @t26)))))
% 0.38/0.59  (define @t108 () (not @t107))
% 0.38/0.59  (define @t109 () (or @t108 @t103 @t102))
% 0.38/0.59  (define @t110 () (or @t103 @t102))
% 0.38/0.59  (define @t111 () (or @t108 @t110))
% 0.38/0.59  (define @t112 () (@list @t3 @t12 @t5 @t99))
% 0.38/0.59  (define @t113 () (forall @t112 @t111))
% 0.38/0.59  (define @t114 () (@list @t99))
% 0.38/0.59  (define @t115 () (forall @t114 @t111))
% 0.38/0.59  (define @t116 () (forall @t114 @t110))
% 0.38/0.59  (define @t117 () (or @t108 @t116))
% 0.38/0.59  (define @t118 () (not (forall @t71 (not (_ @t3 @t2 @t26)))))
% 0.38/0.59  (define @t119 () (_ @t3 @t2 @t1))
% 0.38/0.59  (define @t120 () (= (not (forall @t8 (or @t101 (not @t119)))) @t118))
% 0.38/0.59  (define @t121 () (_ @t12 @t2))
% 0.38/0.59  (define @t122 () (forall @t15 (or (not @t121) @t120)))
% 0.38/0.59  (define @t123 () (or @t33 @t120))
% 0.38/0.59  (define @t124 () (not (forall @t71 @t106)))
% 0.38/0.59  (define @t125 () (lambda @t24 @t124))
% 0.38/0.59  (define @t126 () (_ (lambda @t84 @t124) @t3))
% 0.38/0.59  (define @t127 () (not @t4))
% 0.38/0.59  (define @t128 () (not @t6))
% 0.38/0.59  (define @t129 () (or @t128 @t127))
% 0.38/0.59  (define @t130 () (forall @t8 (not @t7)))
% 0.38/0.59  (define @t131 () (not @t130))
% 0.38/0.59  (define @t132 () (_ @t126 @t2))
% 0.38/0.59  (define @t133 () (=> @t13 (= @t132 @t9)))
% 0.38/0.59  (define @t134 () (forall @t15 @t133))
% 0.38/0.59  (define @t135 () (_ @t57 @t26))
% 0.38/0.59  (define @t136 () (lambda (@list @t57) (forall @t55 (or @t106 (and @t104 @t135)))))
% 0.38/0.59  (define @t137 () (_ @t59 @t21))
% 0.38/0.59  (define @t138 () (forall @t55 (or @t106 (and @t137 @t135))))
% 0.38/0.59  (define @t139 () (lambda (@list @t59 @t57) @t138))
% 0.38/0.59  (define @t140 () (_ (lambda @t65 @t138) @t3))
% 0.38/0.59  (define @t141 () (=> (_ (_ @t140 @t12) @t5) @t134))
% 0.38/0.59  (define @t142 () (forall @t18 @t141))
% 0.38/0.59  (define @t143 () (not @t63))
% 0.38/0.59  (define @t144 () (forall @t71 @t143))
% 0.38/0.59  (define @t145 () (not @t144))
% 0.38/0.59  (define @t146 () (or @t143 @t61))
% 0.38/0.59  (define @t147 () (forall @t112 @t109))
% 0.38/0.59  (define @t148 () (@quantifiers_skolemize @t147 2))
% 0.38/0.59  (define @t149 () (@quantifiers_skolemize @t147 1))
% 0.38/0.59  (define @t150 () (@quantifiers_skolemize @t147 0))
% 0.38/0.59  (define @t151 () (forall @t55 (or (not (_ @t150 @t21 @t26)) (and (_ @t149 @t21) (_ @t148 @t26)))))
% 0.38/0.59  (define @t152 () (@quantifiers_skolemize @t147 3))
% 0.38/0.59  (define @t153 () (forall @t71 (not (_ @t150 @t152 @t26))))
% 0.38/0.59  (define @t154 () (not @t153))
% 0.38/0.59  (define @t155 () (forall @t8 (or (not (_ @t148 @t1)) (not (_ @t150 @t152 @t1)))))
% 0.38/0.59  (define @t156 () (not @t155))
% 0.38/0.59  (define @t157 () (= @t156 @t154))
% 0.38/0.59  (define @t158 () (_ @t149 @t152))
% 0.38/0.59  (define @t159 () (not @t151))
% 0.38/0.59  (define @t160 () (or @t159 (not @t158) @t157))
% 0.38/0.59  (define @t161 () (@list true))
% 0.38/0.59  (define @t162 () (@list @t160))
% 0.38/0.59  (define @t163 () (@quantifiers_skolemize @t153 0))
% 0.38/0.59  (define @t164 () (not @t154))
% 0.38/0.59  (define @t165 () (not @t156))
% 0.38/0.59  (define @t166 () (@quantifiers_skolemize @t155 0))
% 0.38/0.59  (define @t167 () (_ @t150 @t152 @t166))
% 0.38/0.59  (define @t168 () (not @t167))
% 0.38/0.59  (define @t169 () (or (not (_ @t148 @t166)) @t168))
% 0.38/0.59  (define @t170 () (not @t169))
% 0.38/0.59  (define @t171 () (_ @t150 @t152 @t163))
% 0.38/0.59  (define @t172 () (not @t171))
% 0.38/0.59  (define @t173 () (not @t172))
% 0.38/0.59  (define @t174 () (_ @t148 @t163))
% 0.38/0.59  (define @t175 () (and @t158 @t174))
% 0.38/0.59  (define @t176 () (or @t172 @t175))
% 0.38/0.59  (define @t177 () (@list false false))
% 0.38/0.59  (define @t178 () (not @t174))
% 0.38/0.59  (define @t179 () (or @t178 @t172))
% 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 @t82) :rule refl :args (@t82))
% 0.38/0.59  (step @p31 (= tptp.rel_domain @t85) :rule refl :args (@t85))
% 0.38/0.59  (step @p32 (= tptp.rel_inverse @t86) :rule refl :args (@t86))
% 0.38/0.59  (step @p33 (= tptp.equiv_classes @t88) :rule refl :args (@t88))
% 0.38/0.59  (step @p34 (= tptp.restrict_rel_codomain @t89) :rule refl :args (@t89))
% 0.38/0.59  (step @p35 (= tptp.rel_field @t90) :rule refl :args (@t90))
% 0.38/0.59  (step @p36 (= tptp.well_founded @t97) :rule refl :args (@t97))
% 0.38/0.59  (step @p37 (= tptp.upwards_well_founded @t98) :rule refl :args (@t98))
% 0.38/0.59  (step @p38 :rule aci_norm :args ((= @t111 @t109)))
% 0.38/0.59  (step @p39 :rule cong :premises (@p38) :args (@t113))
% 0.38/0.59  (step @p40 :rule quant-merge-prenex :args ((= (forall @t18 @t115) @t113)))
% 0.38/0.59  (step @p41 :rule alpha_equiv :args (@t116 (@list @t99) (@list @t2)))
% 0.38/0.59  (step @p42 :rule refl :args (@t108))
% 0.38/0.59  (step @p43 :rule nary_cong :premises (@p42 @p41) :args (@t117))
% 0.38/0.59  (step @p44 :rule quant-miniscope-or :args ((= @t115 @t117)))
% 0.38/0.59  (step @p45 :rule trans :premises (@p44 @p43))
% 0.38/0.59  (step @p46 :rule symm :premises (@p45))
% 0.38/0.59  (step @p47 :rule cong :premises (@p46) :args ((forall @t18 (or @t108 @t122))))
% 0.38/0.59  (step @p48 :rule trans :premises (@p47 @p40))
% 0.38/0.59  (step @p49 :rule trans :premises (@p48 @p39))
% 0.38/0.59  (step @p50 :rule bool-impl-elim :args (@t107 @t122))
% 0.38/0.59  (step @p51 :rule cong :premises (@p50) :args ((forall @t18 (=> @t107 @t122))))
% 0.38/0.59  (step @p52 :rule trans :premises (@p51 @p49))
% 0.38/0.59  (step @p53 :rule refl :args (@t120))
% 0.38/0.59  (step @p54 :rule refl :args (@t121))
% 0.38/0.59  (step @p55 :rule refl :args (@t13))
% 0.38/0.59  (step @p56 :rule cong :premises (@p55 @p54) :args ((= @t13 @t121)))
% 0.38/0.59  (step @p57 :rule symm :premises (@p56))
% 0.38/0.59  (step @p58 :rule eq_resolve :premises (@p55 @p57))
% 0.38/0.59  (step @p59 :rule cong :premises (@p58) :args (@t33))
% 0.38/0.59  (step @p60 :rule nary_cong :premises (@p59 @p53) :args (@t123))
% 0.38/0.59  (step @p61 :rule cong :premises (@p60) :args ((forall @t15 @t123)))
% 0.38/0.59  (step @p62 :rule bool-impl-elim :args (@t13 @t120))
% 0.38/0.59  (step @p63 :rule cong :premises (@p62) :args ((forall @t15 (=> @t13 @t120))))
% 0.38/0.59  (step @p64 :rule trans :premises (@p63 @p61))
% 0.38/0.59  (step @p65 :rule beta-reduce :args ((= (_ @t125 @t2) @t118)))
% 0.38/0.59  (step @p66 :rule refl :args (@t2))
% 0.38/0.59  (step @p67 :rule beta-reduce :args ((= @t126 @t125)))
% 0.38/0.59  (step @p68 :rule ho_cong :premises (@p67 @p66))
% 0.38/0.59  (step @p69 :rule trans :premises (@p68 @p65))
% 0.38/0.59  (step @p70 :rule refl :args (@t119))
% 0.38/0.59  (step @p71 :rule refl :args (@t4))
% 0.38/0.59  (step @p72 :rule cong :premises (@p71 @p70) :args ((= @t4 @t119)))
% 0.38/0.59  (step @p73 :rule symm :premises (@p72))
% 0.38/0.59  (step @p74 :rule eq_resolve :premises (@p71 @p73))
% 0.38/0.59  (step @p75 :rule cong :premises (@p74) :args (@t127))
% 0.38/0.59  (step @p76 :rule refl :args (@t100))
% 0.38/0.59  (step @p77 :rule refl :args (@t6))
% 0.38/0.59  (step @p78 :rule cong :premises (@p77 @p76) :args ((= @t6 @t100)))
% 0.38/0.59  (step @p79 :rule symm :premises (@p78))
% 0.38/0.59  (step @p80 :rule eq_resolve :premises (@p77 @p79))
% 0.38/0.59  (step @p81 :rule cong :premises (@p80) :args (@t128))
% 0.38/0.59  (step @p82 :rule nary_cong :premises (@p81 @p75) :args (@t129))
% 0.38/0.59  (step @p83 :rule cong :premises (@p82) :args ((forall @t8 @t129)))
% 0.38/0.59  (step @p84 :rule bool-and-de-morgan :args (@t6 @t4 true))
% 0.38/0.59  (step @p85 :rule cong :premises (@p84) :args (@t130))
% 0.38/0.59  (step @p86 :rule trans :premises (@p85 @p83))
% 0.38/0.59  (step @p87 :rule cong :premises (@p86) :args (@t131))
% 0.38/0.59  (step @p88 :rule exists-elim :args ((= @t9 @t131)))
% 0.38/0.59  (step @p89 :rule trans :premises (@p88 @p87))
% 0.38/0.59  (step @p90 :rule cong :premises (@p89 @p69) :args ((= @t9 @t132)))
% 0.38/0.59  (step @p91 :rule eq-symm :args (@t132 @t9))
% 0.38/0.59  (step @p92 :rule trans :premises (@p91 @p90))
% 0.38/0.59  (step @p93 :rule refl :args (@t13))
% 0.38/0.59  (step @p94 :rule cong :premises (@p93 @p92) :args (@t133))
% 0.38/0.59  (step @p95 :rule cong :premises (@p94) :args (@t134))
% 0.38/0.59  (step @p96 :rule trans :premises (@p95 @p64))
% 0.38/0.59  (step @p97 :rule beta-reduce :args ((= (_ @t136 @t5) @t107)))
% 0.38/0.59  (step @p98 :rule refl :args (@t5))
% 0.38/0.59  (step @p99 :rule beta-reduce :args ((= (_ @t139 @t12) @t136)))
% 0.38/0.59  (step @p100 :rule refl :args (@t12))
% 0.38/0.59  (step @p101 :rule beta-reduce :args ((= @t140 @t139)))
% 0.38/0.59  (step @p102 :rule ho_cong :premises (@p101 @p100))
% 0.38/0.59  (step @p103 :rule trans :premises (@p102 @p99))
% 0.38/0.59  (step @p104 :rule ho_cong :premises (@p103 @p98))
% 0.38/0.59  (step @p105 :rule trans :premises (@p104 @p97))
% 0.38/0.59  (step @p106 :rule cong :premises (@p105 @p96) :args (@t141))
% 0.38/0.59  (step @p107 :rule cong :premises (@p106) :args (@t142))
% 0.38/0.59  (step @p108 :rule trans :premises (@p107 @p52))
% 0.38/0.59  (step @p109 :rule cong :premises (@p108) :args ((not @t142)))
% 0.38/0.59  (step @p110 :rule refl :args (@t9))
% 0.38/0.59  (step @p111 :rule refl :args (@t3))
% 0.38/0.59  (step @p112 :rule refl :args (@t105))
% 0.38/0.59  (step @p113 :rule refl :args (@t63))
% 0.38/0.59  (step @p114 :rule cong :premises (@p113 @p112) :args ((= @t63 @t105)))
% 0.38/0.59  (step @p115 :rule symm :premises (@p114))
% 0.38/0.59  (step @p116 :rule eq_resolve :premises (@p113 @p115))
% 0.38/0.59  (step @p117 :rule cong :premises (@p116) :args (@t143))
% 0.38/0.59  (step @p118 :rule cong :premises (@p117) :args (@t144))
% 0.38/0.59  (step @p119 :rule cong :premises (@p118) :args (@t145))
% 0.38/0.59  (step @p120 :rule exists-elim :args ((= @t83 @t145)))
% 0.38/0.59  (step @p121 :rule trans :premises (@p120 @p119))
% 0.38/0.59  (step @p122 :rule cong :premises (@p121) :args (@t85))
% 0.38/0.59  (step @p123 :rule trans :premises (@p31 @p122))
% 0.38/0.59  (step @p124 :rule ho_cong :premises (@p123 @p111))
% 0.38/0.59  (step @p125 :rule ho_cong :premises (@p124 @p66))
% 0.38/0.59  (step @p126 :rule cong :premises (@p125 @p110) :args (@t11))
% 0.38/0.59  (step @p127 :rule cong :premises (@p93 @p126) :args (@t14))
% 0.38/0.59  (step @p128 :rule cong :premises (@p127) :args (@t16))
% 0.38/0.59  (step @p129 :rule refl :args (@t135))
% 0.38/0.59  (step @p130 :rule refl :args (@t58))
% 0.38/0.59  (step @p131 :rule cong :premises (@p130 @p129) :args ((= @t58 @t135)))
% 0.38/0.59  (step @p132 :rule symm :premises (@p131))
% 0.38/0.59  (step @p133 :rule eq_resolve :premises (@p130 @p132))
% 0.38/0.59  (step @p134 :rule refl :args (@t137))
% 0.38/0.59  (step @p135 :rule refl :args (@t60))
% 0.38/0.59  (step @p136 :rule cong :premises (@p135 @p134) :args ((= @t60 @t137)))
% 0.38/0.59  (step @p137 :rule symm :premises (@p136))
% 0.38/0.59  (step @p138 :rule eq_resolve :premises (@p135 @p137))
% 0.38/0.59  (step @p139 :rule nary_cong :premises (@p138 @p133) :args (@t61))
% 0.38/0.59  (step @p140 :rule nary_cong :premises (@p117 @p139) :args (@t146))
% 0.38/0.59  (step @p141 :rule cong :premises (@p140) :args ((forall @t55 @t146)))
% 0.38/0.59  (step @p142 :rule bool-impl-elim :args (@t63 @t61))
% 0.38/0.59  (step @p143 :rule cong :premises (@p142) :args (@t64))
% 0.38/0.59  (step @p144 :rule trans :premises (@p143 @p141))
% 0.38/0.59  (step @p145 :rule cong :premises (@p144) :args (@t66))
% 0.38/0.59  (step @p146 :rule trans :premises (@p21 @p145))
% 0.38/0.59  (step @p147 :rule ho_cong :premises (@p146 @p111))
% 0.38/0.59  (step @p148 :rule ho_cong :premises (@p147 @p100))
% 0.38/0.59  (step @p149 :rule ho_cong :premises (@p148 @p98))
% 0.38/0.59  (step @p150 :rule cong :premises (@p149 @p128) :args (@t17))
% 0.38/0.59  (step @p151 :rule cong :premises (@p150) :args (@t19))
% 0.38/0.59  (step @p152 :rule cong :premises (@p151) :args (@t20))
% 0.38/0.59  (step @p153 :rule trans :premises (@p152 @p109))
% 0.38/0.59  (step @p154 :rule eq_resolve :premises (@p1 @p153))
% 0.38/0.59  (step @p155 :rule skolemize :premises (@p154))
% 0.38/0.59  (step @p156 :rule bool-double-not-elim :args (@t151))
% 0.38/0.59  (step @p157 :rule refl :args (@t160))
% 0.38/0.59  (step @p158 :rule nary_cong :premises (@p157 @p156) :args ((or @t160 (not @t159))))
% 0.38/0.59  (step @p159 :rule cnf_or_neg :args (@t160 0))
% 0.38/0.59  (step @p160 :rule eq_resolve :premises (@p159 @p158))
% 0.38/0.59  (step @p161 :rule reordering :premises (@p160) :args ((or @t151 @t160)))
% 0.38/0.59  (step @p162 :rule chain_m_resolution :premises (@p161 @p155) :args (@t151 @t161 @t162))
% 0.38/0.59  (step @p163 :rule instantiate :premises (@p162) :args ((@list @t152 @t163)))
% 0.38/0.59  (step @p164 :rule cnf_or_neg :args (@t160 2))
% 0.38/0.59  (step @p165 :rule chain_m_resolution :premises (@p164 @p155) :args ((not @t157) @t161 @t162))
% 0.38/0.59  (step @p166 :rule bool-double-not-elim :args (@t153))
% 0.38/0.59  (step @p167 :rule bool-double-not-elim :args (@t155))
% 0.38/0.59  (step @p168 :rule refl :args (@t157))
% 0.38/0.59  (step @p169 :rule nary_cong :premises (@p168 @p167 @p166) :args ((or @t157 @t165 @t164)))
% 0.38/0.59  (step @p170 :rule cnf_equiv_neg2 :args (@t157))
% 0.38/0.59  (step @p171 :rule eq_resolve :premises (@p170 @p169))
% 0.38/0.59  (step @p172 :rule reordering :premises (@p171) :args ((or @t155 @t153 @t157)))
% 0.38/0.59  (step @p173 :rule refl :args (@t170))
% 0.38/0.59  (step @p174 :rule nary_cong :premises (@p167 @p173) :args ((or @t165 @t170)))
% 0.38/0.59  (assume-push @p224 @t156)
% 0.38/0.59  (step @p176 :rule skolemize :premises (@p224))
% 0.38/0.59  (step-pop @p225 :rule scope :premises (@p176))
% 0.38/0.59  (step @p177 :rule process_scope :premises (@p225) :args (@t170))
% 0.38/0.59  (step @p179 :rule implies_elim :premises (@p177))
% 0.38/0.59  (step @p180 :rule eq_resolve :premises (@p179 @p174))
% 0.38/0.59  (step @p181 :rule bool-double-not-elim :args (@t167))
% 0.38/0.59  (step @p182 :rule refl :args (@t169))
% 0.38/0.59  (step @p183 :rule nary_cong :premises (@p182 @p181) :args ((or @t169 (not @t168))))
% 0.38/0.59  (step @p184 :rule cnf_or_neg :args (@t169 1))
% 0.38/0.59  (step @p185 :rule eq_resolve :premises (@p184 @p183))
% 0.38/0.59  (step @p186 :rule reordering :premises (@p185) :args ((or @t167 @t169)))
% 0.38/0.59  (assume-push @p226 @t153)
% 0.38/0.59  (step @p188 :rule instantiate :premises (@p226) :args ((@list @t166)))
% 0.38/0.59  (step-pop @p227 :rule scope :premises (@p188))
% 0.38/0.59  (step @p189 :rule process_scope :premises (@p227) :args (@t168))
% 0.38/0.59  (step @p191 :rule implies_elim :premises (@p189))
% 0.38/0.59  (step @p192 :rule chain_m_resolution :premises (@p191 @p186 @p180 @p172 @p165) :args (@t155 (@list false true false true) (@list @t167 @t169 @t153 @t157)))
% 0.38/0.59  (step @p193 :rule cnf_equiv_neg1 :args (@t157))
% 0.38/0.59  (step @p194 :rule reordering :premises (@p193) :args ((or @t156 @t154 @t157)))
% 0.38/0.59  (step @p195 :rule chain_m_resolution :premises (@p194 @p192 @p165) :args (@t154 (@list false true) (@list @t155 @t157)))
% 0.38/0.59  (step @p196 :rule refl :args (@t171))
% 0.38/0.59  (step @p197 :rule nary_cong :premises (@p166 @p196) :args ((or @t164 @t171)))
% 0.38/0.59  (step @p198 :rule bool-double-not-elim :args (@t171))
% 0.38/0.59  (step @p199 :rule refl :args (@t154))
% 0.38/0.59  (step @p200 :rule cong :premises (@p199 @p198) :args ((=> @t154 @t173)))
% 0.38/0.59  (assume-push @p228 @t154)
% 0.38/0.59  (step @p202 :rule skolemize :premises (@p228))
% 0.38/0.59  (step-pop @p229 :rule scope :premises (@p202))
% 0.38/0.59  (step @p203 :rule process_scope :premises (@p229) :args (@t173))
% 0.38/0.59  (step @p205 :rule eq_resolve :premises (@p203 @p200))
% 0.38/0.59  (step @p206 :rule implies_elim :premises (@p205))
% 0.38/0.59  (step @p207 :rule eq_resolve :premises (@p206 @p197))
% 0.38/0.59  (step @p208 :rule chain_m_resolution :premises (@p207 @p195) :args (@t171 @t161 (@list @t153)))
% 0.38/0.59  (step @p209 :rule cnf_or_pos :args (@t176))
% 0.38/0.59  (step @p210 :rule reordering :premises (@p209) :args ((or @t172 @t175 (not @t176))))
% 0.38/0.59  (step @p211 :rule chain_m_resolution :premises (@p210 @p208 @p163) :args (@t175 @t177 (@list @t171 @t176)))
% 0.38/0.59  (assume-push @p230 @t155)
% 0.38/0.59  (step @p213 :rule instantiate :premises (@p230) :args ((@list @t163)))
% 0.38/0.59  (step-pop @p231 :rule scope :premises (@p213))
% 0.38/0.59  (step @p214 :rule process_scope :premises (@p231) :args (@t179))
% 0.38/0.59  (step @p216 :rule implies_elim :premises (@p214))
% 0.38/0.59  (step @p217 :rule chain_m_resolution :premises (@p216 @p192) :args (@t179 (@list false) (@list @t155)))
% 0.38/0.59  (step @p218 :rule cnf_or_pos :args (@t179))
% 0.38/0.59  (step @p219 :rule reordering :premises (@p218) :args ((or @t172 @t178 (not @t179))))
% 0.38/0.59  (step @p220 :rule chain_m_resolution :premises (@p219 @p208 @p217) :args (@t178 @t177 (@list @t171 @t179)))
% 0.38/0.59  (step @p221 :rule cnf_and_pos :args (@t175 1))
% 0.38/0.59  (step @p222 :rule reordering :premises (@p221) :args ((or @t174 (not @t175))))
% 0.38/0.59  (step @p223 false :rule chain_m_resolution :premises (@p222 @p220 @p211) :args (false (@list true false) (@list @t174 @t175)))
% 0.38/0.59  )
% 0.38/0.59  % SZS output end Proof
% 0.38/0.59  % cvc5 exiting
%------------------------------------------------------------------------------