↑ Up

cvc5---1.3.4.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : cvc5---1.3.4
% Problem  : SYO482^6 : TPTP v9.2.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n018.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed Jun  3 09:12:57 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SYO482^6 : TPTP v9.2.1. Released v4.0.0.
% 0.12/0.14  % Command  : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.35  % Computer : n018.cluster.edu
% 0.16/0.35  % Model    : x86_64 x86_64
% 0.16/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.35  % Memory   : 8042.1875MB
% 0.16/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.35  % CPULimit : 300
% 0.16/0.35  % WCLimit  : 300
% 0.16/0.35  % DateTime : Wed Jun  3 00:16:20 EDT 2026
% 0.16/0.35  % CPUTime  : 
% 0.27/0.51  %----Proving TH0
% 0.37/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.37/0.59  % SZS status Theorem
% 0.37/0.59  % SZS output start Proof
% 0.37/0.59  (
% 0.37/0.59  (declare-sort $$unsorted 0)
% 0.37/0.59  (declare-sort tptp.mu 0)
% 0.37/0.59  (declare-const tptp.rel_s5 (-> $$unsorted $$unsorted Bool))
% 0.37/0.59  (declare-const tptp.mfalse (-> $$unsorted Bool))
% 0.37/0.59  (define tptp.meq_ind () (let ((_let_1 (@var "Y" tptp.mu))) (let ((_let_2 (@var "X" tptp.mu))) (lambda (@list _let_2 _let_1 (@var "W" $$unsorted)) (= _let_2 _let_1)))))
% 0.37/0.59  (define tptp.meq_prop () (let ((_let_1 (@var "W" $$unsorted))) (let ((_let_2 (@var "Y" (-> $$unsorted Bool)))) (let ((_let_3 (@var "X" (-> $$unsorted Bool)))) (lambda (@list _let_3 _let_2 _let_1) (= (_ _let_3 _let_1) (_ _let_2 _let_1)))))))
% 0.37/0.59  (define tptp.mnot () (let ((_let_1 (@var "W" $$unsorted))) (let ((_let_2 (@var "Phi" (-> $$unsorted Bool)))) (lambda (@list _let_2 _let_1) (not (_ _let_2 _let_1))))))
% 0.37/0.59  (define tptp.mor () (let ((_let_1 (@var "W" $$unsorted))) (let ((_let_2 (@var "Psi" (-> $$unsorted Bool)))) (let ((_let_3 (@var "Phi" (-> $$unsorted Bool)))) (lambda (@list _let_3 _let_2 _let_1) (or (_ _let_3 _let_1) (_ _let_2 _let_1)))))))
% 0.37/0.59  (define tptp.mand () (let ((_let_1 (@var "__flatten_var_0" $$unsorted))) (let ((_let_2 (@var "Psi" (-> $$unsorted Bool)))) (let ((_let_3 (@var "Phi" (-> $$unsorted Bool)))) (lambda (@list _let_3 _let_2 _let_1) (_ (_ tptp.mnot (_ (_ tptp.mor (_ tptp.mnot _let_3)) (_ tptp.mnot _let_2))) _let_1))))))
% 0.37/0.59  (define tptp.mimplies () (let ((_let_1 (@var "__flatten_var_0" $$unsorted))) (let ((_let_2 (@var "Psi" (-> $$unsorted Bool)))) (let ((_let_3 (@var "Phi" (-> $$unsorted Bool)))) (lambda (@list _let_3 _let_2 _let_1) (_ (_ (_ tptp.mor (_ tptp.mnot _let_3)) _let_2) _let_1))))))
% 0.37/0.59  (define tptp.mimplied () (let ((_let_1 (@var "__flatten_var_0" $$unsorted))) (let ((_let_2 (@var "Phi" (-> $$unsorted Bool)))) (let ((_let_3 (@var "Psi" (-> $$unsorted Bool)))) (lambda (@list _let_2 _let_3 _let_1) (_ (_ (_ tptp.mor (_ tptp.mnot _let_3)) _let_2) _let_1))))))
% 0.37/0.59  (define tptp.mequiv () (let ((_let_1 (@var "__flatten_var_0" $$unsorted))) (let ((_let_2 (@var "Phi" (-> $$unsorted Bool)))) (let ((_let_3 (@var "Psi" (-> $$unsorted Bool)))) (lambda (@list _let_2 _let_3 _let_1) (_ (_ (_ tptp.mand (_ (_ tptp.mimplies _let_2) _let_3)) (_ (_ tptp.mimplies _let_3) _let_2)) _let_1))))))
% 0.37/0.59  (define tptp.mxor () (let ((_let_1 (@var "__flatten_var_0" $$unsorted))) (let ((_let_2 (@var "Psi" (-> $$unsorted Bool)))) (let ((_let_3 (@var "Phi" (-> $$unsorted Bool)))) (lambda (@list _let_3 _let_2 _let_1) (_ (_ tptp.mnot (_ (_ tptp.mequiv _let_3) _let_2)) _let_1))))))
% 0.37/0.59  (define tptp.mforall_ind () (let ((_let_1 (@var "W" $$unsorted))) (let ((_let_2 (@var "X" tptp.mu))) (let ((_let_3 (@var "Phi" (-> tptp.mu $$unsorted Bool)))) (lambda (@list _let_3 _let_1) (forall (@list _let_2) (_ (_ _let_3 _let_2) _let_1)))))))
% 0.37/0.59  (define tptp.mforall_prop () (let ((_let_1 (@var "W" $$unsorted))) (let ((_let_2 (@var "P" (-> $$unsorted Bool)))) (let ((_let_3 (@var "Phi" (-> (-> $$unsorted Bool) $$unsorted Bool)))) (lambda (@list _let_3 _let_1) (forall (@list _let_2) (_ (_ _let_3 _let_2) _let_1)))))))
% 0.37/0.59  (define tptp.mexists_ind () (let ((_let_1 (@var "__flatten_var_0" $$unsorted))) (let ((_let_2 (@var "X" tptp.mu))) (let ((_let_3 (@var "Phi" (-> tptp.mu $$unsorted Bool)))) (lambda (@list _let_3 _let_1) (_ (_ tptp.mnot (_ tptp.mforall_ind (lambda (@list _let_2 _let_1) (_ (_ tptp.mnot (_ _let_3 _let_2)) _let_1)))) _let_1))))))
% 0.37/0.59  (define tptp.mexists_prop () (let ((_let_1 (@var "__flatten_var_0" $$unsorted))) (let ((_let_2 (@var "P" (-> $$unsorted Bool)))) (let ((_let_3 (@var "Phi" (-> (-> $$unsorted Bool) $$unsorted Bool)))) (lambda (@list _let_3 _let_1) (_ (_ tptp.mnot (_ tptp.mforall_prop (lambda (@list _let_2 _let_1) (_ (_ tptp.mnot (_ _let_3 _let_2)) _let_1)))) _let_1))))))
% 0.37/0.59  (define tptp.mtrue () (lambda (@list (@var "W" $$unsorted)) true))
% 0.37/0.59  (define tptp.mbox () (let ((_let_1 (@var "V" $$unsorted))) (let ((_let_2 (@var "Phi" (-> $$unsorted Bool)))) (let ((_let_3 (@var "W" $$unsorted))) (let ((_let_4 (@var "R" (-> $$unsorted $$unsorted Bool)))) (lambda (@list _let_4 _let_2 _let_3) (forall (@list _let_1) (or (not (_ (_ _let_4 _let_3) _let_1)) (_ _let_2 _let_1)))))))))
% 0.37/0.59  (define tptp.mdia () (let ((_let_1 (@var "__flatten_var_0" $$unsorted))) (let ((_let_2 (@var "Phi" (-> $$unsorted Bool)))) (let ((_let_3 (@var "R" (-> $$unsorted $$unsorted Bool)))) (lambda (@list _let_3 _let_2 _let_1) (_ (_ tptp.mnot (_ (_ tptp.mbox _let_3) (_ tptp.mnot _let_2))) _let_1))))))
% 0.37/0.59  (define tptp.mreflexive () (let ((_let_1 (@var "S" $$unsorted))) (let ((_let_2 (@var "R" (-> $$unsorted $$unsorted Bool)))) (lambda (@list _let_2) (forall (@list _let_1) (_ (_ _let_2 _let_1) _let_1))))))
% 0.37/0.59  (define tptp.msymmetric () (let ((_let_1 (@var "S" $$unsorted))) (let ((_let_2 (@var "T" $$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.37/0.59  (define tptp.mserial () (let ((_let_1 (@var "T" $$unsorted))) (let ((_let_2 (@var "S" $$unsorted))) (let ((_let_3 (@var "R" (-> $$unsorted $$unsorted Bool)))) (lambda (@list _let_3) (forall (@list _let_2) (exists (@list _let_1) (_ (_ _let_3 _let_2) _let_1))))))))
% 0.37/0.59  (define tptp.mtransitive () (let ((_let_1 (@var "U" $$unsorted))) (let ((_let_2 (@var "S" $$unsorted))) (let ((_let_3 (@var "R" (-> $$unsorted $$unsorted Bool)))) (let ((_let_4 (_ _let_3 _let_2))) (let ((_let_5 (@var "T" $$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.37/0.59  (define tptp.meuclidean () (let ((_let_1 (@var "U" $$unsorted))) (let ((_let_2 (@var "T" $$unsorted))) (let ((_let_3 (@var "R" (-> $$unsorted $$unsorted Bool)))) (let ((_let_4 (@var "S" $$unsorted))) (let ((_let_5 (_ _let_3 _let_4))) (lambda (@list _let_3) (forall (@list _let_4 _let_2 _let_1) (=> (and (_ _let_5 _let_2) (_ _let_5 _let_1)) (_ (_ _let_3 _let_2) _let_1))))))))))
% 0.37/0.59  (define tptp.mpartially_functional () (let ((_let_1 (@var "U" $$unsorted))) (let ((_let_2 (@var "T" $$unsorted))) (let ((_let_3 (@var "S" $$unsorted))) (let ((_let_4 (@var "R" (-> $$unsorted $$unsorted Bool)))) (let ((_let_5 (_ _let_4 _let_3))) (lambda (@list _let_4) (forall (@list _let_3 _let_2 _let_1) (=> (and (_ _let_5 _let_2) (_ _let_5 _let_1)) (= _let_2 _let_1))))))))))
% 0.37/0.59  (define tptp.mfunctional () (let ((_let_1 (@var "U" $$unsorted))) (let ((_let_2 (@var "T" $$unsorted))) (let ((_let_3 (@var "S" $$unsorted))) (let ((_let_4 (@var "R" (-> $$unsorted $$unsorted Bool)))) (let ((_let_5 (_ _let_4 _let_3))) (lambda (@list _let_4) (forall (@list _let_3) (exists (@list _let_2) (and (_ _let_5 _let_2) (forall (@list _let_1) (=> (_ _let_5 _let_1) (= _let_2 _let_1)))))))))))))
% 0.37/0.59  (define tptp.mweakly_dense () (let ((_let_1 (@var "T" $$unsorted))) (let ((_let_2 (@var "U" $$unsorted))) (let ((_let_3 (@var "R" (-> $$unsorted $$unsorted Bool)))) (let ((_let_4 (@var "S" $$unsorted))) (let ((_let_5 (_ _let_3 _let_4))) (lambda (@list _let_3) (forall (@list _let_4 _let_1 _let_2) (=> (_ _let_5 _let_1) (exists (@list _let_2) (and (_ _let_5 _let_2) (_ (_ _let_3 _let_2) _let_1))))))))))))
% 0.37/0.59  (define tptp.mweakly_connected () (let ((_let_1 (@var "T" $$unsorted))) (let ((_let_2 (@var "U" $$unsorted))) (let ((_let_3 (@var "R" (-> $$unsorted $$unsorted Bool)))) (let ((_let_4 (@var "S" $$unsorted))) (let ((_let_5 (_ _let_3 _let_4))) (lambda (@list _let_3) (forall (@list _let_4 _let_1 _let_2) (=> (and (_ _let_5 _let_1) (_ _let_5 _let_2)) (or (_ (_ _let_3 _let_1) _let_2) (= _let_1 _let_2) (_ (_ _let_3 _let_2) _let_1)))))))))))
% 0.37/0.59  (define tptp.mweakly_directed () (let ((_let_1 (@var "V" $$unsorted))) (let ((_let_2 (@var "U" $$unsorted))) (let ((_let_3 (@var "R" (-> $$unsorted $$unsorted Bool)))) (let ((_let_4 (@var "T" $$unsorted))) (let ((_let_5 (@var "S" $$unsorted))) (let ((_let_6 (_ _let_3 _let_5))) (lambda (@list _let_3) (forall (@list _let_5 _let_4 _let_2) (=> (and (_ _let_6 _let_4) (_ _let_6 _let_2)) (exists (@list _let_1) (and (_ (_ _let_3 _let_4) _let_1) (_ (_ _let_3 _let_2) _let_1)))))))))))))
% 0.37/0.59  (define tptp.mvalid () (let ((_let_1 (@var "W" $$unsorted))) (let ((_let_2 (@var "Phi" (-> $$unsorted Bool)))) (lambda (@list _let_2) (forall (@list _let_1) (_ _let_2 _let_1))))))
% 0.37/0.59  (define tptp.minvalid () (let ((_let_1 (@var "W" $$unsorted))) (let ((_let_2 (@var "Phi" (-> $$unsorted Bool)))) (lambda (@list _let_2) (forall (@list _let_1) (not (_ _let_2 _let_1)))))))
% 0.37/0.59  (define tptp.msatisfiable () (let ((_let_1 (@var "W" $$unsorted))) (let ((_let_2 (@var "Phi" (-> $$unsorted Bool)))) (lambda (@list _let_2) (exists (@list _let_1) (_ _let_2 _let_1))))))
% 0.37/0.59  (define tptp.mcountersatisfiable () (let ((_let_1 (@var "W" $$unsorted))) (let ((_let_2 (@var "Phi" (-> $$unsorted Bool)))) (lambda (@list _let_2) (exists (@list _let_1) (not (_ _let_2 _let_1)))))))
% 0.37/0.59  (define tptp.mbox_s5 () (let ((_let_1 (@var "V" $$unsorted))) (let ((_let_2 (@var "Phi" (-> $$unsorted Bool)))) (let ((_let_3 (@var "W" $$unsorted))) (lambda (@list _let_2 _let_3) (forall (@list _let_1) (or (not (_ (_ tptp.rel_s5 _let_3) _let_1)) (_ _let_2 _let_1))))))))
% 0.37/0.59  (define tptp.mdia_s5 () (let ((_let_1 (@var "__flatten_var_0" $$unsorted))) (let ((_let_2 (@var "Phi" (-> $$unsorted Bool)))) (lambda (@list _let_2 _let_1) (_ (_ tptp.mnot (_ tptp.mbox_s5 (_ tptp.mnot _let_2))) _let_1)))))
% 0.37/0.59  (define @t1 () (@var "__flatten_var_0" $$unsorted))
% 0.37/0.59  (define @t2 () (@var "Y" tptp.mu))
% 0.37/0.59  (define @t3 () (@var "X" tptp.mu))
% 0.37/0.59  (define @t4 () (@list @t2 @t1))
% 0.37/0.59  (define @t5 () (lambda @t4 (_ (_ (_ tptp.meq_ind @t3) @t2) @t1)))
% 0.37/0.59  (define @t6 () (@list @t3 @t1))
% 0.37/0.59  (define @t7 () (lambda @t6 (_ (_ tptp.mbox_s5 (_ tptp.mexists_ind @t5)) @t1)))
% 0.37/0.59  (define @t8 () (not (_ tptp.mvalid (_ tptp.mforall_ind @t7))))
% 0.37/0.59  (define @t9 () (= @t3 @t2))
% 0.37/0.59  (define @t10 () (@var "W" $$unsorted))
% 0.37/0.59  (define @t11 () (lambda (@list @t3 @t2 @t10) @t9))
% 0.37/0.59  (define @t12 () (@var "Y" (-> $$unsorted Bool)))
% 0.37/0.59  (define @t13 () (@var "X" (-> $$unsorted Bool)))
% 0.37/0.59  (define @t14 () (lambda (@list @t13 @t12 @t10) (= (_ @t13 @t10) (_ @t12 @t10))))
% 0.37/0.59  (define @t15 () (@var "Phi" (-> $$unsorted Bool)))
% 0.37/0.59  (define @t16 () (_ @t15 @t10))
% 0.37/0.59  (define @t17 () (not @t16))
% 0.37/0.59  (define @t18 () (@list @t15 @t10))
% 0.37/0.59  (define @t19 () (lambda @t18 @t17))
% 0.37/0.59  (define @t20 () (@var "Psi" (-> $$unsorted Bool)))
% 0.37/0.59  (define @t21 () (lambda (@list @t15 @t20 @t10) (or @t16 (_ @t20 @t10))))
% 0.37/0.59  (define @t22 () (_ tptp.mnot @t20))
% 0.37/0.59  (define @t23 () (_ tptp.mnot @t15))
% 0.37/0.59  (define @t24 () (_ tptp.mor @t23))
% 0.37/0.59  (define @t25 () (@list @t15 @t20 @t1))
% 0.37/0.59  (define @t26 () (lambda @t25 (_ (_ tptp.mnot (_ @t24 @t22)) @t1)))
% 0.37/0.59  (define @t27 () (lambda @t25 (_ (_ @t24 @t20) @t1)))
% 0.37/0.59  (define @t28 () (lambda @t25 (_ (_ (_ tptp.mor @t22) @t15) @t1)))
% 0.37/0.59  (define @t29 () (lambda @t25 (_ (_ (_ tptp.mand (_ (_ tptp.mimplies @t15) @t20)) (_ (_ tptp.mimplies @t20) @t15)) @t1)))
% 0.37/0.59  (define @t30 () (lambda @t25 (_ (_ tptp.mnot (_ (_ tptp.mequiv @t15) @t20)) @t1)))
% 0.37/0.59  (define @t31 () (@var "Phi" (-> tptp.mu $$unsorted Bool)))
% 0.37/0.59  (define @t32 () (_ @t31 @t3))
% 0.37/0.59  (define @t33 () (_ @t32 @t10))
% 0.37/0.59  (define @t34 () (@list @t3))
% 0.37/0.59  (define @t35 () (forall @t34 @t33))
% 0.37/0.59  (define @t36 () (@list @t31 @t10))
% 0.37/0.59  (define @t37 () (lambda @t36 @t35))
% 0.37/0.59  (define @t38 () (@var "P" (-> $$unsorted Bool)))
% 0.37/0.59  (define @t39 () (@var "Phi" (-> (-> $$unsorted Bool) $$unsorted Bool)))
% 0.37/0.59  (define @t40 () (_ @t39 @t38))
% 0.37/0.59  (define @t41 () (lambda (@list @t39 @t10) (forall (@list @t38) (_ @t40 @t10))))
% 0.37/0.59  (define @t42 () (lambda @t6 (_ (_ tptp.mnot @t32) @t1)))
% 0.37/0.59  (define @t43 () (@list @t31 @t1))
% 0.37/0.59  (define @t44 () (lambda @t43 (_ (_ tptp.mnot (_ tptp.mforall_ind @t42)) @t1)))
% 0.37/0.59  (define @t45 () (lambda (@list @t39 @t1) (_ (_ tptp.mnot (_ tptp.mforall_prop (lambda (@list @t38 @t1) (_ (_ tptp.mnot @t40) @t1)))) @t1)))
% 0.37/0.59  (define @t46 () (@list @t10))
% 0.37/0.59  (define @t47 () (lambda @t46 true))
% 0.37/0.59  (define @t48 () (@var "V" $$unsorted))
% 0.37/0.59  (define @t49 () (_ @t15 @t48))
% 0.37/0.59  (define @t50 () (@var "R" (-> $$unsorted $$unsorted Bool)))
% 0.37/0.59  (define @t51 () (@list @t48))
% 0.37/0.59  (define @t52 () (lambda (@list @t50 @t15 @t10) (forall @t51 (or (not (_ (_ @t50 @t10) @t48)) @t49))))
% 0.37/0.59  (define @t53 () (lambda (@list @t50 @t15 @t1) (_ (_ tptp.mnot (_ (_ tptp.mbox @t50) @t23)) @t1)))
% 0.37/0.59  (define @t54 () (@var "S" $$unsorted))
% 0.37/0.59  (define @t55 () (_ @t50 @t54))
% 0.37/0.59  (define @t56 () (@list @t54))
% 0.37/0.59  (define @t57 () (@list @t50))
% 0.37/0.59  (define @t58 () (lambda @t57 (forall @t56 (_ @t55 @t54))))
% 0.37/0.59  (define @t59 () (@var "T" $$unsorted))
% 0.37/0.59  (define @t60 () (_ @t50 @t59))
% 0.37/0.59  (define @t61 () (_ @t55 @t59))
% 0.37/0.59  (define @t62 () (lambda @t57 (forall (@list @t54 @t59) (=> @t61 (_ @t60 @t54)))))
% 0.37/0.59  (define @t63 () (@list @t59))
% 0.37/0.59  (define @t64 () (lambda @t57 (forall @t56 (exists @t63 @t61))))
% 0.37/0.59  (define @t65 () (@var "U" $$unsorted))
% 0.37/0.59  (define @t66 () (_ @t55 @t65))
% 0.37/0.59  (define @t67 () (_ @t60 @t65))
% 0.37/0.59  (define @t68 () (@list @t54 @t59 @t65))
% 0.37/0.59  (define @t69 () (lambda @t57 (forall @t68 (=> (and @t61 @t67) @t66))))
% 0.37/0.59  (define @t70 () (and @t61 @t66))
% 0.37/0.59  (define @t71 () (lambda @t57 (forall @t68 (=> @t70 @t67))))
% 0.37/0.59  (define @t72 () (= @t59 @t65))
% 0.37/0.59  (define @t73 () (lambda @t57 (forall @t68 (=> @t70 @t72))))
% 0.37/0.59  (define @t74 () (@list @t65))
% 0.37/0.59  (define @t75 () (lambda @t57 (forall @t56 (exists @t63 (and @t61 (forall @t74 (=> @t66 @t72)))))))
% 0.37/0.59  (define @t76 () (_ @t50 @t65))
% 0.37/0.59  (define @t77 () (_ @t76 @t59))
% 0.37/0.59  (define @t78 () (lambda @t57 (forall @t68 (=> @t61 (exists @t74 (and @t66 @t77))))))
% 0.37/0.59  (define @t79 () (lambda @t57 (forall @t68 (=> @t70 (or @t67 @t72 @t77)))))
% 0.37/0.59  (define @t80 () (lambda @t57 (forall @t68 (=> @t70 (exists @t51 (and (_ @t60 @t48) (_ @t76 @t48)))))))
% 0.37/0.59  (define @t81 () (forall @t46 @t16))
% 0.37/0.59  (define @t82 () (@list @t15))
% 0.37/0.59  (define @t83 () (lambda @t82 @t81))
% 0.37/0.59  (define @t84 () (lambda @t82 (forall @t46 @t17)))
% 0.37/0.59  (define @t85 () (lambda @t82 (exists @t46 @t16)))
% 0.37/0.59  (define @t86 () (lambda @t82 (exists @t46 @t17)))
% 0.37/0.59  (define @t87 () (_ (_ tptp.rel_s5 @t10) @t48))
% 0.37/0.59  (define @t88 () (not @t87))
% 0.37/0.59  (define @t89 () (or @t88 @t49))
% 0.37/0.59  (define @t90 () (forall @t51 @t89))
% 0.37/0.59  (define @t91 () (lambda @t18 @t90))
% 0.37/0.59  (define @t92 () (lambda (@list @t15 @t1) (_ (_ tptp.mnot (_ tptp.mbox_s5 @t23)) @t1)))
% 0.37/0.59  (define @t93 () (@var "BOUND_VARIABLE_8348" $$unsorted))
% 0.37/0.59  (define @t94 () (lambda (@list @t93) true))
% 0.37/0.59  (define @t95 () (_ @t94 @t10))
% 0.37/0.59  (define @t96 () (forall @t46 @t95))
% 0.37/0.59  (define @t97 () (_ @t15 @t10))
% 0.37/0.59  (define @t98 () (lambda @t82 (forall @t46 @t97)))
% 0.37/0.59  (define @t99 () (@list @t93))
% 0.37/0.59  (define @t100 () (@var "BOUND_VARIABLE_8474" $$unsorted))
% 0.37/0.59  (define @t101 () (@var "BOUND_VARIABLE_8472" tptp.mu))
% 0.37/0.59  (define @t102 () (lambda (@list @t101 @t100) true))
% 0.37/0.59  (define @t103 () (_ @t102 @t3 @t10))
% 0.37/0.59  (define @t104 () (forall @t34 @t103))
% 0.37/0.59  (define @t105 () (lambda @t46 @t104))
% 0.37/0.59  (define @t106 () (_ @t31 @t3 @t10))
% 0.37/0.59  (define @t107 () (lambda @t36 (forall @t34 @t106)))
% 0.37/0.59  (define @t108 () (tptp.rel_s5 @t10 @t48))
% 0.37/0.59  (define @t109 () (not @t108))
% 0.37/0.59  (define @t110 () (_ @t94 @t48))
% 0.37/0.59  (define @t111 () (or @t109 @t110))
% 0.37/0.59  (define @t112 () (forall @t51 @t111))
% 0.37/0.59  (define @t113 () (lambda @t46 @t112))
% 0.37/0.59  (define @t114 () (_ @t15 @t48))
% 0.37/0.59  (define @t115 () (lambda @t18 (forall @t51 (or @t109 @t114))))
% 0.37/0.59  (define @t116 () (@list @t1))
% 0.37/0.59  (define @t117 () (not (= @t3 @t3)))
% 0.37/0.59  (define @t118 () (@var "BOUND_VARIABLE_8438" tptp.mu))
% 0.37/0.59  (define @t119 () (= @t3 @t118))
% 0.37/0.59  (define @t120 () (not @t119))
% 0.37/0.59  (define @t121 () (@list @t118))
% 0.37/0.59  (define @t122 () (or @t120 @t120))
% 0.37/0.59  (define @t123 () (lambda @t4 @t9))
% 0.37/0.59  (define @t124 () (_ @t123 @t118 @t1))
% 0.37/0.59  (define @t125 () (not @t124))
% 0.37/0.59  (define @t126 () (forall @t121 @t125))
% 0.37/0.59  (define @t127 () (not @t126))
% 0.37/0.59  (define @t128 () (lambda @t116 @t127))
% 0.37/0.59  (define @t129 () (forall @t34 (not (_ @t31 @t3 @t1))))
% 0.37/0.59  (define @t130 () (not @t129))
% 0.37/0.59  (define @t131 () (lambda @t43 @t130))
% 0.37/0.59  (define @t132 () (lambda @t46 @t9))
% 0.37/0.59  (define @t133 () (lambda (@list @t2 @t10) @t9))
% 0.37/0.59  (define @t134 () (_ @t11 @t3))
% 0.37/0.59  (define @t135 () (lambda @t4 (_ (_ @t134 @t2) @t1)))
% 0.37/0.59  (define @t136 () (lambda @t6 (_ (_ @t115 (_ @t131 @t135)) @t1)))
% 0.37/0.59  (define @t137 () (forall @t34 (not @t106)))
% 0.37/0.59  (define @t138 () (lambda @t46 @t137))
% 0.37/0.59  (define @t139 () (_ @t138 @t10))
% 0.37/0.59  (define @t140 () (not @t139))
% 0.37/0.59  (define @t141 () (lambda @t46 @t140))
% 0.37/0.59  (define @t142 () (not @t33))
% 0.37/0.59  (define @t143 () (not (_ @t32 @t1)))
% 0.37/0.59  (define @t144 () (lambda @t6 @t143))
% 0.37/0.59  (define @t145 () (_ @t144 @t3 @t10))
% 0.37/0.59  (define @t146 () (forall @t34 @t145))
% 0.37/0.59  (define @t147 () (lambda @t46 @t146))
% 0.37/0.59  (define @t148 () (lambda @t46 @t142))
% 0.37/0.59  (define @t149 () (_ @t19 @t32))
% 0.37/0.59  (assume @p1 (= tptp.mfalse (_ tptp.mnot tptp.mtrue)))
% 0.37/0.59  (assume @p2 (_ tptp.mreflexive tptp.rel_s5))
% 0.37/0.59  (assume @p3 (_ tptp.mtransitive tptp.rel_s5))
% 0.37/0.59  (assume @p4 (_ tptp.msymmetric tptp.rel_s5))
% 0.37/0.59  (assume @p5 @t8)
% 0.37/0.59  (assume @p6 true)
% 0.37/0.59  (step @p7 (= tptp.meq_ind @t11) :rule refl :args (@t11))
% 0.37/0.59  (step @p8 (= tptp.meq_prop @t14) :rule refl :args (@t14))
% 0.37/0.59  (step @p9 (= tptp.mnot @t19) :rule refl :args (@t19))
% 0.37/0.59  (step @p10 (= tptp.mor @t21) :rule refl :args (@t21))
% 0.37/0.59  (step @p11 (= tptp.mand @t26) :rule refl :args (@t26))
% 0.37/0.59  (step @p12 (= tptp.mimplies @t27) :rule refl :args (@t27))
% 0.37/0.59  (step @p13 (= tptp.mimplied @t28) :rule refl :args (@t28))
% 0.37/0.59  (step @p14 (= tptp.mequiv @t29) :rule refl :args (@t29))
% 0.37/0.59  (step @p15 (= tptp.mxor @t30) :rule refl :args (@t30))
% 0.37/0.59  (step @p16 (= tptp.mforall_ind @t37) :rule refl :args (@t37))
% 0.37/0.59  (step @p17 (= tptp.mforall_prop @t41) :rule refl :args (@t41))
% 0.37/0.59  (step @p18 (= tptp.mexists_ind @t44) :rule refl :args (@t44))
% 0.37/0.59  (step @p19 (= tptp.mexists_prop @t45) :rule refl :args (@t45))
% 0.37/0.59  (step @p20 (= tptp.mtrue @t47) :rule refl :args (@t47))
% 0.37/0.59  (step @p21 (= tptp.mbox @t52) :rule refl :args (@t52))
% 0.37/0.59  (step @p22 (= tptp.mdia @t53) :rule refl :args (@t53))
% 0.37/0.59  (step @p23 (= tptp.mreflexive @t58) :rule refl :args (@t58))
% 0.37/0.59  (step @p24 (= tptp.msymmetric @t62) :rule refl :args (@t62))
% 0.37/0.59  (step @p25 (= tptp.mserial @t64) :rule refl :args (@t64))
% 0.37/0.59  (step @p26 (= tptp.mtransitive @t69) :rule refl :args (@t69))
% 0.37/0.59  (step @p27 (= tptp.meuclidean @t71) :rule refl :args (@t71))
% 0.37/0.59  (step @p28 (= tptp.mpartially_functional @t73) :rule refl :args (@t73))
% 0.37/0.59  (step @p29 (= tptp.mfunctional @t75) :rule refl :args (@t75))
% 0.37/0.59  (step @p30 (= tptp.mweakly_dense @t78) :rule refl :args (@t78))
% 0.37/0.59  (step @p31 (= tptp.mweakly_connected @t79) :rule refl :args (@t79))
% 0.37/0.59  (step @p32 (= tptp.mweakly_directed @t80) :rule refl :args (@t80))
% 0.37/0.59  (step @p33 (= tptp.mvalid @t83) :rule refl :args (@t83))
% 0.37/0.59  (step @p34 (= tptp.minvalid @t84) :rule refl :args (@t84))
% 0.37/0.59  (step @p35 (= tptp.msatisfiable @t85) :rule refl :args (@t85))
% 0.37/0.59  (step @p36 (= tptp.mcountersatisfiable @t86) :rule refl :args (@t86))
% 0.37/0.59  (step @p37 (= tptp.mbox_s5 @t91) :rule refl :args (@t91))
% 0.37/0.59  (step @p38 (= tptp.mdia_s5 @t92) :rule refl :args (@t92))
% 0.37/0.59  (step @p39 :rule evaluate :args ((not true)))
% 0.37/0.59  (step @p40 :rule quant-unused-vars :args ((= (forall @t46 true) true)))
% 0.37/0.59  (step @p41 :rule beta-reduce :args ((= @t95 true)))
% 0.37/0.59  (step @p42 :rule cong :premises (@p41) :args (@t96))
% 0.37/0.59  (step @p43 :rule trans :premises (@p42 @p40))
% 0.37/0.59  (step @p44 :rule beta-reduce :args ((= (_ @t98 @t94) @t96)))
% 0.37/0.59  (step @p45 :rule trans :premises (@p44 @p43))
% 0.37/0.59  (step @p46 :rule refl :args (@t94))
% 0.37/0.59  (step @p47 :rule symm :premises (@p46))
% 0.37/0.59  (step @p48 :rule alpha_equiv :args (@t47 (@list @t10) @t99))
% 0.37/0.59  (step @p49 :rule trans :premises (@p48 @p47))
% 0.37/0.59  (step @p50 :rule quant-unused-vars :args ((= (forall @t34 true) true)))
% 0.37/0.59  (step @p51 :rule beta-reduce :args ((= @t103 true)))
% 0.37/0.59  (step @p52 :rule cong :premises (@p51) :args (@t104))
% 0.37/0.59  (step @p53 :rule trans :premises (@p52 @p50))
% 0.37/0.59  (step @p54 :rule cong :premises (@p53) :args (@t105))
% 0.37/0.59  (step @p55 :rule trans :premises (@p54 @p49))
% 0.37/0.59  (step @p56 :rule beta-reduce :args ((= (_ @t107 @t102) @t105)))
% 0.37/0.59  (step @p57 :rule trans :premises (@p56 @p55))
% 0.37/0.59  (step @p58 :rule refl :args (@t102))
% 0.37/0.59  (step @p59 :rule symm :premises (@p58))
% 0.37/0.59  (step @p60 :rule alpha_equiv :args ((lambda @t6 true) (@list @t3 @t1) (@list @t101 @t100)))
% 0.37/0.59  (step @p61 :rule trans :premises (@p60 @p59))
% 0.37/0.59  (step @p62 :rule beta-reduce :args ((= (_ @t94 @t1) true)))
% 0.37/0.59  (step @p63 :rule refl :args (@t1))
% 0.37/0.59  (step @p64 :rule quant-unused-vars :args ((= (forall @t51 true) true)))
% 0.37/0.59  (step @p65 :rule absorb :args ((= (or @t109 true) true)))
% 0.37/0.59  (step @p66 :rule beta-reduce :args ((= @t110 true)))
% 0.37/0.59  (step @p67 :rule refl :args (@t109))
% 0.37/0.59  (step @p68 :rule nary_cong :premises (@p67 @p66) :args (@t111))
% 0.37/0.59  (step @p69 :rule trans :premises (@p68 @p65))
% 0.37/0.59  (step @p70 :rule cong :premises (@p69) :args (@t112))
% 0.37/0.59  (step @p71 :rule trans :premises (@p70 @p64))
% 0.37/0.59  (step @p72 :rule cong :premises (@p71) :args (@t113))
% 0.37/0.59  (step @p73 :rule trans :premises (@p72 @p49))
% 0.37/0.59  (step @p74 :rule beta-reduce :args ((= (_ @t115 @t94) @t113)))
% 0.37/0.59  (step @p75 :rule trans :premises (@p74 @p73))
% 0.37/0.59  (step @p76 :rule alpha_equiv :args ((lambda @t116 true) (@list @t1) @t99))
% 0.37/0.59  (step @p77 :rule trans :premises (@p76 @p47))
% 0.37/0.59  (step @p78 :rule evaluate :args ((not false)))
% 0.37/0.59  (step @p79 :rule eq-refl :args (@t3))
% 0.37/0.59  (step @p80 :rule cong :premises (@p79) :args (@t117))
% 0.37/0.59  (step @p81 :rule trans :premises (@p80 @p39))
% 0.37/0.59  (step @p82 :rule quant-var-elim-eq :args ((= (forall @t121 (or (not (= @t118 @t3)) @t120)) @t117)))
% 0.37/0.59  (step @p83 :rule refl :args (@t120))
% 0.37/0.59  (step @p84 :rule eq-symm :args (@t3 @t118))
% 0.37/0.59  (step @p85 :rule cong :premises (@p84) :args (@t120))
% 0.37/0.59  (step @p86 :rule nary_cong :premises (@p85 @p83) :args (@t122))
% 0.37/0.59  (step @p87 :rule aci_norm :args ((= @t120 @t122)))
% 0.37/0.59  (step @p88 :rule trans :premises (@p87 @p86))
% 0.37/0.59  (step @p89 :rule cong :premises (@p88) :args ((forall @t121 @t120)))
% 0.37/0.59  (step @p90 :rule trans :premises (@p89 @p82))
% 0.37/0.59  (step @p91 :rule trans :premises (@p90 @p81))
% 0.37/0.59  (step @p92 :rule beta-reduce :args ((= @t124 @t119)))
% 0.37/0.59  (step @p93 :rule cong :premises (@p92) :args (@t125))
% 0.37/0.59  (step @p94 :rule cong :premises (@p93) :args (@t126))
% 0.37/0.59  (step @p95 :rule trans :premises (@p94 @p91))
% 0.37/0.59  (step @p96 :rule cong :premises (@p95) :args (@t127))
% 0.37/0.59  (step @p97 :rule trans :premises (@p96 @p78))
% 0.37/0.59  (step @p98 :rule cong :premises (@p97) :args (@t128))
% 0.37/0.59  (step @p99 :rule trans :premises (@p98 @p77))
% 0.37/0.59  (step @p100 :rule beta-reduce :args ((= (_ (lambda @t43 (not (forall @t121 (not (_ @t31 @t118 @t1))))) @t123) @t128)))
% 0.37/0.59  (step @p101 :rule trans :premises (@p100 @p99))
% 0.37/0.59  (step @p102 :rule refl :args (@t123))
% 0.37/0.59  (step @p103 :rule alpha_equiv :args (@t129 (@list @t3) (@list @t118)))
% 0.37/0.59  (step @p104 :rule cong :premises (@p103) :args (@t130))
% 0.37/0.59  (step @p105 :rule cong :premises (@p104) :args (@t131))
% 0.37/0.59  (step @p106 :rule ho_cong :premises (@p105 @p102))
% 0.37/0.59  (step @p107 :rule trans :premises (@p106 @p101))
% 0.37/0.59  (step @p108 :rule beta-reduce :args ((= (_ @t132 @t1) @t9)))
% 0.37/0.59  (step @p109 :rule beta-reduce :args ((= (_ @t133 @t2) @t132)))
% 0.37/0.59  (step @p110 :rule refl :args (@t2))
% 0.37/0.59  (step @p111 :rule beta-reduce :args ((= @t134 @t133)))
% 0.37/0.59  (step @p112 :rule ho_cong :premises (@p111 @p110))
% 0.37/0.59  (step @p113 :rule trans :premises (@p112 @p109))
% 0.37/0.59  (step @p114 :rule ho_cong :premises (@p113 @p63))
% 0.37/0.59  (step @p115 :rule trans :premises (@p114 @p108))
% 0.37/0.59  (step @p116 :rule cong :premises (@p115) :args (@t135))
% 0.37/0.59  (step @p117 :rule refl :args (@t131))
% 0.37/0.59  (step @p118 :rule ho_cong :premises (@p117 @p116))
% 0.37/0.59  (step @p119 :rule trans :premises (@p118 @p107))
% 0.37/0.59  (step @p120 :rule refl :args (@t115))
% 0.37/0.59  (step @p121 :rule ho_cong :premises (@p120 @p119))
% 0.37/0.59  (step @p122 :rule trans :premises (@p121 @p75))
% 0.37/0.59  (step @p123 :rule ho_cong :premises (@p122 @p63))
% 0.37/0.59  (step @p124 :rule trans :premises (@p123 @p62))
% 0.37/0.59  (step @p125 :rule cong :premises (@p124) :args (@t136))
% 0.37/0.59  (step @p126 :rule trans :premises (@p125 @p61))
% 0.37/0.59  (step @p127 :rule refl :args (@t107))
% 0.37/0.59  (step @p128 :rule ho_cong :premises (@p127 @p126))
% 0.37/0.59  (step @p129 :rule trans :premises (@p128 @p57))
% 0.37/0.59  (step @p130 :rule refl :args (@t98))
% 0.37/0.59  (step @p131 :rule ho_cong :premises (@p130 @p129))
% 0.37/0.59  (step @p132 :rule trans :premises (@p131 @p45))
% 0.37/0.59  (step @p133 :rule cong :premises (@p132) :args ((not (_ @t98 (_ @t107 @t136)))))
% 0.37/0.59  (step @p134 :rule trans :premises (@p133 @p39))
% 0.37/0.59  (step @p135 :rule refl :args (@t3))
% 0.37/0.59  (step @p136 :rule ho_cong :premises (@p7 @p135))
% 0.37/0.59  (step @p137 :rule ho_cong :premises (@p136 @p110))
% 0.37/0.59  (step @p138 :rule ho_cong :premises (@p137 @p63))
% 0.37/0.59  (step @p139 :rule cong :premises (@p138) :args (@t5))
% 0.37/0.59  (step @p140 :rule beta-reduce :args ((= (_ (lambda @t46 (not @t137)) @t1) @t130)))
% 0.37/0.59  (step @p141 :rule beta-reduce :args ((= @t139 @t137)))
% 0.37/0.59  (step @p142 :rule cong :premises (@p141) :args (@t140))
% 0.37/0.59  (step @p143 :rule cong :premises (@p142) :args (@t141))
% 0.37/0.59  (step @p144 :rule beta-reduce :args ((= (_ @t19 @t138) @t141)))
% 0.37/0.59  (step @p145 :rule trans :premises (@p144 @p143))
% 0.37/0.59  (step @p146 :rule refl :args (@t106))
% 0.37/0.59  (step @p147 :rule refl :args (@t33))
% 0.37/0.59  (step @p148 :rule cong :premises (@p147 @p146) :args ((= @t33 @t106)))
% 0.37/0.59  (step @p149 :rule symm :premises (@p148))
% 0.37/0.59  (step @p150 :rule eq_resolve :premises (@p147 @p149))
% 0.37/0.59  (step @p151 :rule cong :premises (@p150) :args (@t142))
% 0.37/0.59  (step @p152 :rule cong :premises (@p151) :args ((forall @t34 @t142)))
% 0.37/0.59  (step @p153 :rule beta-reduce :args ((= @t145 @t142)))
% 0.37/0.59  (step @p154 :rule cong :premises (@p153) :args (@t146))
% 0.37/0.59  (step @p155 :rule trans :premises (@p154 @p152))
% 0.37/0.59  (step @p156 :rule cong :premises (@p155) :args (@t147))
% 0.37/0.60  (step @p157 :rule beta-reduce :args ((= (_ @t107 @t144) @t147)))
% 0.37/0.60  (step @p158 :rule trans :premises (@p157 @p156))
% 0.37/0.60  (step @p159 :rule beta-reduce :args ((= (_ @t148 @t1) @t143)))
% 0.37/0.60  (step @p160 :rule beta-reduce :args ((= @t149 @t148)))
% 0.37/0.60  (step @p161 :rule ho_cong :premises (@p160 @p63))
% 0.37/0.60  (step @p162 :rule trans :premises (@p161 @p159))
% 0.37/0.60  (step @p163 :rule cong :premises (@p162) :args ((lambda @t6 (_ @t149 @t1))))
% 0.37/0.60  (step @p164 :rule ho_cong :premises (@p127 @p163))
% 0.37/0.60  (step @p165 :rule trans :premises (@p164 @p158))
% 0.37/0.60  (step @p166 :rule refl :args (@t19))
% 0.37/0.60  (step @p167 :rule ho_cong :premises (@p166 @p165))
% 0.37/0.60  (step @p168 :rule trans :premises (@p167 @p145))
% 0.37/0.60  (step @p169 :rule ho_cong :premises (@p168 @p63))
% 0.37/0.60  (step @p170 :rule trans :premises (@p169 @p140))
% 0.37/0.60  (step @p171 :rule refl :args (@t32))
% 0.37/0.60  (step @p172 :rule ho_cong :premises (@p9 @p171))
% 0.37/0.60  (step @p173 :rule ho_cong :premises (@p172 @p63))
% 0.37/0.60  (step @p174 :rule cong :premises (@p173) :args (@t42))
% 0.37/0.60  (step @p175 :rule cong :premises (@p150) :args (@t35))
% 0.37/0.60  (step @p176 :rule cong :premises (@p175) :args (@t37))
% 0.37/0.60  (step @p177 :rule trans :premises (@p16 @p176))
% 0.37/0.60  (step @p178 :rule ho_cong :premises (@p177 @p174))
% 0.37/0.60  (step @p179 :rule ho_cong :premises (@p9 @p178))
% 0.37/0.60  (step @p180 :rule ho_cong :premises (@p179 @p63))
% 0.37/0.60  (step @p181 :rule trans :premises (@p180 @p170))
% 0.37/0.60  (step @p182 :rule cong :premises (@p181) :args (@t44))
% 0.37/0.60  (step @p183 :rule trans :premises (@p18 @p182))
% 0.37/0.60  (step @p184 :rule ho_cong :premises (@p183 @p139))
% 0.37/0.60  (step @p185 :rule refl :args (@t114))
% 0.37/0.60  (step @p186 :rule refl :args (@t49))
% 0.37/0.60  (step @p187 :rule cong :premises (@p186 @p185) :args ((= @t49 @t114)))
% 0.37/0.60  (step @p188 :rule symm :premises (@p187))
% 0.37/0.60  (step @p189 :rule eq_resolve :premises (@p186 @p188))
% 0.37/0.60  (step @p190 :rule refl :args (@t108))
% 0.37/0.60  (step @p191 :rule refl :args (@t87))
% 0.37/0.60  (step @p192 :rule cong :premises (@p191 @p190) :args ((= @t87 @t108)))
% 0.37/0.60  (step @p193 :rule symm :premises (@p192))
% 0.37/0.60  (step @p194 :rule eq_resolve :premises (@p191 @p193))
% 0.37/0.60  (step @p195 :rule cong :premises (@p194) :args (@t88))
% 0.37/0.60  (step @p196 :rule nary_cong :premises (@p195 @p189) :args (@t89))
% 0.37/0.60  (step @p197 :rule cong :premises (@p196) :args (@t90))
% 0.37/0.60  (step @p198 :rule cong :premises (@p197) :args (@t91))
% 0.37/0.60  (step @p199 :rule trans :premises (@p37 @p198))
% 0.37/0.60  (step @p200 :rule ho_cong :premises (@p199 @p184))
% 0.37/0.60  (step @p201 :rule ho_cong :premises (@p200 @p63))
% 0.37/0.60  (step @p202 :rule cong :premises (@p201) :args (@t7))
% 0.37/0.60  (step @p203 :rule ho_cong :premises (@p177 @p202))
% 0.37/0.60  (step @p204 :rule refl :args (@t97))
% 0.37/0.60  (step @p205 :rule refl :args (@t16))
% 0.37/0.60  (step @p206 :rule cong :premises (@p205 @p204) :args ((= @t16 @t97)))
% 0.37/0.60  (step @p207 :rule symm :premises (@p206))
% 0.37/0.60  (step @p208 :rule eq_resolve :premises (@p205 @p207))
% 0.37/0.60  (step @p209 :rule cong :premises (@p208) :args (@t81))
% 0.37/0.60  (step @p210 :rule cong :premises (@p209) :args (@t83))
% 0.37/0.60  (step @p211 :rule trans :premises (@p33 @p210))
% 0.37/0.60  (step @p212 :rule ho_cong :premises (@p211 @p203))
% 0.37/0.60  (step @p213 :rule cong :premises (@p212) :args (@t8))
% 0.37/0.60  (step @p214 :rule trans :premises (@p213 @p134))
% 0.37/0.60  (step @p215 false :rule eq_resolve :premises (@p5 @p214))
% 0.37/0.60  )
% 0.37/0.60  % SZS output end Proof
% 0.37/0.60  % cvc5 exiting
%------------------------------------------------------------------------------