%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SEU477^1 : TPTP v9.2.1. Released v3.6.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % Computer : n023.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:51:55 AM UTC 2026 % Result : Theorem 0.36s 0.61s % Output : Proof 0.36s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SEU477^1 : TPTP v9.2.1. Released v3.6.0. % 0.12/0.13 % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % 0.16/0.34 % Computer : n023.cluster.edu % 0.16/0.34 % Model : x86_64 x86_64 % 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.16/0.34 % Memory : 8042.1875MB % 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.16/0.34 % CPULimit : 300 % 0.16/0.34 % WCLimit : 300 % 0.16/0.34 % DateTime : Tue Jun 2 17:37:43 EDT 2026 % 0.16/0.34 % CPUTime : % 0.28/0.50 %----Proving TH0 % 0.36/0.61 --- 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.36/0.61 % SZS status Theorem % 0.36/0.61 % SZS output start Proof % 0.36/0.61 ( % 0.36/0.61 (declare-sort $$unsorted 0) % 0.36/0.61 (define tptp.subrel () (let ((_let_1 (@var "Y" $$unsorted))) (let ((_let_2 (@var "X" $$unsorted))) (let ((_let_3 (@var "S" (-> $$unsorted $$unsorted Bool)))) (let ((_let_4 (@var "R" (-> $$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.36/0.61 (define tptp.inv () (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.36/0.61 (define tptp.idem () (let ((_let_1 (@var "R" (-> $$unsorted $$unsorted Bool)))) (let ((_let_2 (@var "F" (-> (-> $$unsorted $$unsorted Bool) $$unsorted $$unsorted Bool)))) (let ((_let_3 (_ _let_2 _let_1))) (lambda (@list _let_2) (forall (@list _let_1) (= (_ _let_2 _let_3) _let_3))))))) % 0.36/0.61 (define tptp.infl () (let ((_let_1 (@var "R" (-> $$unsorted $$unsorted Bool)))) (let ((_let_2 (@var "F" (-> (-> $$unsorted $$unsorted Bool) $$unsorted $$unsorted Bool)))) (lambda (@list _let_2) (forall (@list _let_1) (_ (_ tptp.subrel _let_1) (_ _let_2 _let_1))))))) % 0.36/0.61 (define tptp.mono () (let ((_let_1 (@var "S" (-> $$unsorted $$unsorted Bool)))) (let ((_let_2 (@var "F" (-> (-> $$unsorted $$unsorted Bool) $$unsorted $$unsorted Bool)))) (let ((_let_3 (@var "R" (-> $$unsorted $$unsorted Bool)))) (lambda (@list _let_2) (forall (@list _let_3 _let_1) (=> (_ (_ tptp.subrel _let_3) _let_1) (_ (_ tptp.subrel (_ _let_2 _let_3)) (_ _let_2 _let_1))))))))) % 0.36/0.61 (define tptp.refl () (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.36/0.61 (define tptp.irrefl () (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.36/0.61 (define tptp.rc () (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 _let_1) (or (= _let_2 _let_1) (_ (_ _let_3 _let_2) _let_1))))))) % 0.36/0.61 (define tptp.symm () (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.36/0.61 (define tptp.antisymm () (let ((_let_1 (@var "Y" $$unsorted))) (let ((_let_2 (@var "X" $$unsorted))) (let ((_let_3 (@var "R" (-> $$unsorted $$unsorted Bool)))) (lambda (@list _let_3) (forall (@list _let_2 _let_1) (=> (and (_ (_ _let_3 _let_2) _let_1) (_ (_ _let_3 _let_1) _let_2)) (= _let_2 _let_1)))))))) % 0.36/0.61 (define tptp.asymm () (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) (not (_ (_ _let_3 _let_2) _let_1))))))))) % 0.36/0.61 (define tptp.sc () (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 _let_1) (or (_ (_ _let_3 _let_1) _let_2) (_ (_ _let_3 _let_2) _let_1))))))) % 0.36/0.61 (define tptp.trans () (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.36/0.61 (define tptp.tc () (let ((_let_1 (@var "Y" $$unsorted))) (let ((_let_2 (@var "X" $$unsorted))) (let ((_let_3 (@var "S" (-> $$unsorted $$unsorted Bool)))) (let ((_let_4 (@var "R" (-> $$unsorted $$unsorted Bool)))) (lambda (@list _let_4 _let_2 _let_1) (forall (@list _let_3) (=> (and (_ tptp.trans _let_3) (_ (_ tptp.subrel _let_4) _let_3)) (_ (_ _let_3 _let_2) _let_1))))))))) % 0.36/0.61 (define tptp.trc () (let ((_let_1 (@var "__flatten_var_1" $$unsorted))) (let ((_let_2 (@var "__flatten_var_0" $$unsorted))) (let ((_let_3 (@var "R" (-> $$unsorted $$unsorted Bool)))) (lambda (@list _let_3 _let_2 _let_1) (_ (_ (_ tptp.rc (_ tptp.tc _let_3)) _let_2) _let_1)))))) % 0.36/0.61 (define tptp.trsc () (let ((_let_1 (@var "__flatten_var_1" $$unsorted))) (let ((_let_2 (@var "__flatten_var_0" $$unsorted))) (let ((_let_3 (@var "R" (-> $$unsorted $$unsorted Bool)))) (lambda (@list _let_3 _let_2 _let_1) (_ (_ (_ tptp.sc (_ tptp.rc (_ tptp.tc _let_3))) _let_2) _let_1)))))) % 0.36/0.61 (define tptp.po () (let ((_let_1 (@var "R" (-> $$unsorted $$unsorted Bool)))) (lambda (@list _let_1) (and (_ tptp.refl _let_1) (_ tptp.antisymm _let_1) (_ tptp.trans _let_1))))) % 0.36/0.61 (define tptp.so () (let ((_let_1 (@var "R" (-> $$unsorted $$unsorted Bool)))) (lambda (@list _let_1) (and (_ tptp.asymm _let_1) (_ tptp.trans _let_1))))) % 0.36/0.61 (define tptp.total () (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) (or (= _let_1 _let_2) (_ (_ _let_3 _let_1) _let_2) (_ (_ _let_3 _let_2) _let_1)))))))) % 0.36/0.61 (define tptp.term () (let ((_let_1 (@var "Y" $$unsorted))) (let ((_let_2 (@var "X" $$unsorted))) (let ((_let_3 (@var "R" (-> $$unsorted $$unsorted Bool)))) (let ((_let_4 (@var "A" (-> $$unsorted Bool)))) (let ((_let_5 (_ _let_4 _let_2))) (let ((_let_6 (@list _let_2))) (lambda (@list _let_3) (forall (@list _let_4) (=> (exists _let_6 _let_5) (exists _let_6 (and _let_5 (forall (@list _let_1) (=> (_ _let_4 _let_1) (not (_ (_ _let_3 _let_2) _let_1)))))))))))))))) % 0.36/0.61 (define tptp.ind () (let ((_let_1 (@var "X" $$unsorted))) (let ((_let_2 (@var "P" (-> $$unsorted Bool)))) (let ((_let_3 (_ _let_2 _let_1))) (let ((_let_4 (@list _let_1))) (let ((_let_5 (@var "Y" $$unsorted))) (let ((_let_6 (@var "R" (-> $$unsorted $$unsorted Bool)))) (lambda (@list _let_6) (forall (@list _let_2) (=> (forall _let_4 (=> (forall (@list _let_5) (=> (_ (_ (_ tptp.tc _let_6) _let_1) _let_5) (_ _let_2 _let_5))) _let_3)) (forall _let_4 _let_3))))))))))) % 0.36/0.61 (define tptp.innf () (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) (not (exists (@list _let_1) (_ (_ _let_3 _let_2) _let_1)))))))) % 0.36/0.61 (define tptp.nfof () (let ((_let_1 (@var "X" $$unsorted))) (let ((_let_2 (@var "R" (-> $$unsorted $$unsorted Bool)))) (let ((_let_3 (@var "Y" $$unsorted))) (lambda (@list _let_2 _let_1 _let_3) (and (_ (_ (_ tptp.trc _let_2) _let_3) _let_1) (_ (_ tptp.innf _let_2) _let_1))))))) % 0.36/0.61 (define tptp.norm () (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) (exists (@list _let_2) (_ (_ (_ tptp.nfof _let_3) _let_2) _let_1)))))))) % 0.36/0.61 (define tptp.join () (let ((_let_1 (@var "Z" $$unsorted))) (let ((_let_2 (@var "Y" $$unsorted))) (let ((_let_3 (@var "R" (-> $$unsorted $$unsorted Bool)))) (let ((_let_4 (_ tptp.trc _let_3))) (let ((_let_5 (@var "X" $$unsorted))) (lambda (@list _let_3 _let_5 _let_2) (exists (@list _let_1) (and (_ (_ _let_4 _let_5) _let_1) (_ (_ _let_4 _let_2) _let_1)))))))))) % 0.36/0.61 (define tptp.lconfl () (let ((_let_1 (@var "Y" $$unsorted))) (let ((_let_2 (@var "Z" $$unsorted))) (let ((_let_3 (@var "R" (-> $$unsorted $$unsorted Bool)))) (let ((_let_4 (@var "X" $$unsorted))) (let ((_let_5 (_ _let_3 _let_4))) (lambda (@list _let_3) (forall (@list _let_4 _let_1 _let_2) (=> (and (_ _let_5 _let_2) (_ _let_5 _let_1)) (_ (_ (_ tptp.join _let_3) _let_2) _let_1)))))))))) % 0.36/0.61 (define tptp.sconfl () (let ((_let_1 (@var "Y" $$unsorted))) (let ((_let_2 (@var "Z" $$unsorted))) (let ((_let_3 (@var "R" (-> $$unsorted $$unsorted Bool)))) (let ((_let_4 (@var "X" $$unsorted))) (lambda (@list _let_3) (forall (@list _let_4 _let_1 _let_2) (=> (and (_ (_ _let_3 _let_4) _let_2) (_ (_ (_ tptp.trc _let_3) _let_4) _let_1)) (_ (_ (_ tptp.join _let_3) _let_2) _let_1))))))))) % 0.36/0.61 (define tptp.confl () (let ((_let_1 (@var "Y" $$unsorted))) (let ((_let_2 (@var "Z" $$unsorted))) (let ((_let_3 (@var "R" (-> $$unsorted $$unsorted Bool)))) (let ((_let_4 (@var "X" $$unsorted))) (let ((_let_5 (_ (_ tptp.trc _let_3) _let_4))) (lambda (@list _let_3) (forall (@list _let_4 _let_1 _let_2) (=> (and (_ _let_5 _let_2) (_ _let_5 _let_1)) (_ (_ (_ tptp.join _let_3) _let_2) _let_1)))))))))) % 0.36/0.61 (define tptp.cr () (let ((_let_1 (@var "Y" $$unsorted))) (let ((_let_2 (@var "X" $$unsorted))) (let ((_let_3 (@var "R" (-> $$unsorted $$unsorted Bool)))) (lambda (@list _let_3) (forall (@list _let_2 _let_1) (=> (_ (_ (_ tptp.trsc _let_3) _let_2) _let_1) (_ (_ (_ tptp.join _let_3) _let_2) _let_1)))))))) % 0.36/0.61 (define @t1 () (@var "Y" $$unsorted)) % 0.36/0.61 (define @t2 () (@var "X" $$unsorted)) % 0.36/0.61 (define @t3 () (@var "R" (-> $$unsorted $$unsorted Bool))) % 0.36/0.61 (define @t4 () (_ @t3 @t2)) % 0.36/0.61 (define @t5 () (_ @t4 @t1)) % 0.36/0.61 (define @t6 () (@var "A" (-> $$unsorted Bool))) % 0.36/0.61 (define @t7 () (_ @t6 @t1)) % 0.36/0.61 (define @t8 () (and @t7 @t5)) % 0.36/0.61 (define @t9 () (@list @t1)) % 0.36/0.61 (define @t10 () (exists @t9 @t8)) % 0.36/0.61 (define @t11 () (_ @t6 @t2)) % 0.36/0.61 (define @t12 () (=> @t11 @t10)) % 0.36/0.61 (define @t13 () (@list @t2)) % 0.36/0.61 (define @t14 () (forall @t13 @t12)) % 0.36/0.61 (define @t15 () (exists @t13 @t11)) % 0.36/0.61 (define @t16 () (and @t15 @t14)) % 0.36/0.61 (define @t17 () (@list @t6)) % 0.36/0.61 (define @t18 () (exists @t17 @t16)) % 0.36/0.61 (define @t19 () (not @t18)) % 0.36/0.61 (define @t20 () (@list @t3)) % 0.36/0.61 (define @t21 () (lambda @t20 @t19)) % 0.36/0.61 (define @t22 () (= tptp.term @t21)) % 0.36/0.61 (define @t23 () (not @t22)) % 0.36/0.61 (define @t24 () (@var "S" (-> $$unsorted $$unsorted Bool))) % 0.36/0.61 (define @t25 () (_ (_ @t24 @t2) @t1)) % 0.36/0.61 (define @t26 () (@list @t2 @t1)) % 0.36/0.61 (define @t27 () (@list @t3 @t24)) % 0.36/0.61 (define @t28 () (lambda @t27 (forall @t26 (=> @t5 @t25)))) % 0.36/0.61 (define @t29 () (_ @t3 @t1)) % 0.36/0.61 (define @t30 () (_ @t29 @t2)) % 0.36/0.61 (define @t31 () (@list @t3 @t2 @t1)) % 0.36/0.61 (define @t32 () (lambda @t31 @t30)) % 0.36/0.61 (define @t33 () (@var "F" (-> (-> $$unsorted $$unsorted Bool) $$unsorted $$unsorted Bool))) % 0.36/0.61 (define @t34 () (_ @t33 @t3)) % 0.36/0.61 (define @t35 () (@list @t33)) % 0.36/0.61 (define @t36 () (lambda @t35 (forall @t20 (= (_ @t33 @t34) @t34)))) % 0.36/0.61 (define @t37 () (_ tptp.subrel @t3)) % 0.36/0.61 (define @t38 () (lambda @t35 (forall @t20 (_ @t37 @t34)))) % 0.36/0.61 (define @t39 () (_ @t37 @t24)) % 0.36/0.61 (define @t40 () (lambda @t35 (forall @t27 (=> @t39 (_ (_ tptp.subrel @t34) (_ @t33 @t24)))))) % 0.36/0.61 (define @t41 () (_ @t4 @t2)) % 0.36/0.61 (define @t42 () (lambda @t20 (forall @t13 @t41))) % 0.36/0.61 (define @t43 () (lambda @t20 (forall @t13 (not @t41)))) % 0.36/0.61 (define @t44 () (= @t2 @t1)) % 0.36/0.61 (define @t45 () (lambda @t31 (or @t44 @t5))) % 0.36/0.61 (define @t46 () (lambda @t20 (forall @t26 (=> @t5 @t30)))) % 0.36/0.61 (define @t47 () (lambda @t20 (forall @t26 (=> (and @t5 @t30) @t44)))) % 0.36/0.61 (define @t48 () (lambda @t20 (forall @t26 (=> @t5 (not @t30))))) % 0.36/0.61 (define @t49 () (lambda @t31 (or @t30 @t5))) % 0.36/0.61 (define @t50 () (@var "Z" $$unsorted)) % 0.36/0.61 (define @t51 () (_ @t4 @t50)) % 0.36/0.61 (define @t52 () (@list @t2 @t1 @t50)) % 0.36/0.61 (define @t53 () (lambda @t20 (forall @t52 (=> (and @t5 (_ @t29 @t50)) @t51)))) % 0.36/0.61 (define @t54 () (lambda @t31 (forall (@list @t24) (=> (and (_ tptp.trans @t24) @t39) @t25)))) % 0.36/0.61 (define @t55 () (@var "__flatten_var_1" $$unsorted)) % 0.36/0.61 (define @t56 () (@var "__flatten_var_0" $$unsorted)) % 0.36/0.61 (define @t57 () (_ tptp.tc @t3)) % 0.36/0.61 (define @t58 () (_ tptp.rc @t57)) % 0.36/0.61 (define @t59 () (@list @t3 @t56 @t55)) % 0.36/0.61 (define @t60 () (lambda @t59 (_ (_ @t58 @t56) @t55))) % 0.36/0.61 (define @t61 () (lambda @t59 (_ (_ (_ tptp.sc @t58) @t56) @t55))) % 0.36/0.61 (define @t62 () (_ tptp.trans @t3)) % 0.36/0.61 (define @t63 () (lambda @t20 (and (_ tptp.refl @t3) (_ tptp.antisymm @t3) @t62))) % 0.36/0.61 (define @t64 () (lambda @t20 (and (_ tptp.asymm @t3) @t62))) % 0.36/0.61 (define @t65 () (lambda @t20 (forall @t26 (or @t44 @t5 @t30)))) % 0.36/0.61 (define @t66 () (not @t5)) % 0.36/0.61 (define @t67 () (forall @t9 (=> @t7 @t66))) % 0.36/0.61 (define @t68 () (and @t11 @t67)) % 0.36/0.61 (define @t69 () (exists @t13 @t68)) % 0.36/0.61 (define @t70 () (=> @t15 @t69)) % 0.36/0.61 (define @t71 () (forall @t17 @t70)) % 0.36/0.61 (define @t72 () (lambda @t20 @t71)) % 0.36/0.61 (define @t73 () (@var "P" (-> $$unsorted Bool))) % 0.36/0.61 (define @t74 () (_ @t73 @t2)) % 0.36/0.61 (define @t75 () (lambda @t20 (forall (@list @t73) (=> (forall @t13 (=> (forall @t9 (=> (_ (_ @t57 @t2) @t1) (_ @t73 @t1))) @t74)) (forall @t13 @t74))))) % 0.36/0.61 (define @t76 () (lambda (@list @t3 @t2) (not (exists @t9 @t5)))) % 0.36/0.61 (define @t77 () (_ tptp.trc @t3)) % 0.36/0.61 (define @t78 () (_ @t77 @t1)) % 0.36/0.61 (define @t79 () (lambda @t31 (and (_ @t78 @t2) (_ (_ tptp.innf @t3) @t2)))) % 0.36/0.61 (define @t80 () (lambda @t20 (forall @t13 (exists @t9 (_ (_ (_ tptp.nfof @t3) @t1) @t2))))) % 0.36/0.61 (define @t81 () (_ @t77 @t2)) % 0.36/0.61 (define @t82 () (_ @t81 @t50)) % 0.36/0.61 (define @t83 () (lambda @t31 (exists (@list @t50) (and @t82 (_ @t78 @t50))))) % 0.36/0.61 (define @t84 () (_ tptp.join @t3)) % 0.36/0.61 (define @t85 () (_ (_ @t84 @t50) @t1)) % 0.36/0.61 (define @t86 () (lambda @t20 (forall @t52 (=> (and @t51 @t5) @t85)))) % 0.36/0.61 (define @t87 () (_ @t81 @t1)) % 0.36/0.61 (define @t88 () (lambda @t20 (forall @t52 (=> (and @t51 @t87) @t85)))) % 0.36/0.61 (define @t89 () (lambda @t20 (forall @t52 (=> (and @t82 @t87) @t85)))) % 0.36/0.61 (define @t90 () (lambda @t20 (forall @t26 (=> (_ (_ (_ tptp.trsc @t3) @t2) @t1) (_ (_ @t84 @t2) @t1))))) % 0.36/0.61 (define @t91 () (_ @t3 @t2 @t1)) % 0.36/0.61 (define @t92 () (_ @t6 @t1)) % 0.36/0.61 (define @t93 () (forall @t9 (or (not @t92) (not @t91)))) % 0.36/0.61 (define @t94 () (not @t93)) % 0.36/0.61 (define @t95 () (_ @t6 @t2)) % 0.36/0.61 (define @t96 () (not @t95)) % 0.36/0.61 (define @t97 () (forall @t13 (or @t96 @t94))) % 0.36/0.61 (define @t98 () (not @t97)) % 0.36/0.61 (define @t99 () (@var "BOUND_VARIABLE_7975" $$unsorted)) % 0.36/0.61 (define @t100 () (not (_ @t6 @t99))) % 0.36/0.61 (define @t101 () (or @t100 @t98)) % 0.36/0.61 (define @t102 () (forall (@list @t6 @t99) @t101)) % 0.36/0.61 (define @t103 () (lambda @t20 @t102)) % 0.36/0.61 (define @t104 () (@list @t99)) % 0.36/0.61 (define @t105 () (forall @t104 @t101)) % 0.36/0.61 (define @t106 () (forall @t104 @t100)) % 0.36/0.61 (define @t107 () (or @t106 @t98)) % 0.36/0.61 (define @t108 () (forall @t13 @t96)) % 0.36/0.61 (define @t109 () (not @t108)) % 0.36/0.61 (define @t110 () (and @t109 @t97)) % 0.36/0.61 (define @t111 () (forall @t17 (not @t110))) % 0.36/0.61 (define @t112 () (not @t111)) % 0.36/0.61 (define @t113 () (not @t11)) % 0.36/0.61 (define @t114 () (or @t113 @t94)) % 0.36/0.61 (define @t115 () (not @t7)) % 0.36/0.61 (define @t116 () (or @t115 @t66)) % 0.36/0.61 (define @t117 () (forall @t9 (not @t8))) % 0.36/0.61 (define @t118 () (not @t117)) % 0.36/0.61 (define @t119 () (forall @t13 @t113)) % 0.36/0.61 (define @t120 () (not @t119)) % 0.36/0.61 (define @t121 () (= @t103 @t21)) % 0.36/0.61 (define @t122 () (and @t11 @t93)) % 0.36/0.61 (define @t123 () (forall @t13 (not @t122))) % 0.36/0.61 (define @t124 () (not @t123)) % 0.36/0.61 (assume @p1 @t23) % 0.36/0.61 (assume @p2 true) % 0.36/0.61 (step @p3 (= tptp.subrel @t28) :rule refl :args (@t28)) % 0.36/0.61 (step @p4 (= tptp.inv @t32) :rule refl :args (@t32)) % 0.36/0.61 (step @p5 (= tptp.idem @t36) :rule refl :args (@t36)) % 0.36/0.61 (step @p6 (= tptp.infl @t38) :rule refl :args (@t38)) % 0.36/0.61 (step @p7 (= tptp.mono @t40) :rule refl :args (@t40)) % 0.36/0.61 (step @p8 (= tptp.refl @t42) :rule refl :args (@t42)) % 0.36/0.61 (step @p9 (= tptp.irrefl @t43) :rule refl :args (@t43)) % 0.36/0.61 (step @p10 (= tptp.rc @t45) :rule refl :args (@t45)) % 0.36/0.61 (step @p11 (= tptp.symm @t46) :rule refl :args (@t46)) % 0.36/0.61 (step @p12 (= tptp.antisymm @t47) :rule refl :args (@t47)) % 0.36/0.61 (step @p13 (= tptp.asymm @t48) :rule refl :args (@t48)) % 0.36/0.61 (step @p14 (= tptp.sc @t49) :rule refl :args (@t49)) % 0.36/0.61 (step @p15 (= tptp.trans @t53) :rule refl :args (@t53)) % 0.36/0.61 (step @p16 (= tptp.tc @t54) :rule refl :args (@t54)) % 0.36/0.61 (step @p17 (= tptp.trc @t60) :rule refl :args (@t60)) % 0.36/0.61 (step @p18 (= tptp.trsc @t61) :rule refl :args (@t61)) % 0.36/0.61 (step @p19 (= tptp.po @t63) :rule refl :args (@t63)) % 0.36/0.61 (step @p20 (= tptp.so @t64) :rule refl :args (@t64)) % 0.36/0.61 (step @p21 (= tptp.total @t65) :rule refl :args (@t65)) % 0.36/0.61 (step @p22 (= tptp.term @t72) :rule refl :args (@t72)) % 0.36/0.61 (step @p23 (= tptp.ind @t75) :rule refl :args (@t75)) % 0.36/0.61 (step @p24 (= tptp.innf @t76) :rule refl :args (@t76)) % 0.36/0.61 (step @p25 (= tptp.nfof @t79) :rule refl :args (@t79)) % 0.36/0.61 (step @p26 (= tptp.norm @t80) :rule refl :args (@t80)) % 0.36/0.61 (step @p27 (= tptp.join @t83) :rule refl :args (@t83)) % 0.36/0.61 (step @p28 (= tptp.lconfl @t86) :rule refl :args (@t86)) % 0.36/0.61 (step @p29 (= tptp.sconfl @t88) :rule refl :args (@t88)) % 0.36/0.61 (step @p30 (= tptp.confl @t89) :rule refl :args (@t89)) % 0.36/0.61 (step @p31 (= tptp.cr @t90) :rule refl :args (@t90)) % 0.36/0.61 (step @p32 :rule evaluate :args ((not true))) % 0.36/0.61 (step @p33 :rule eq-refl :args (@t103)) % 0.36/0.61 (step @p34 :rule bool-double-not-elim :args (@t102)) % 0.36/0.61 (step @p35 :rule quant-merge-prenex :args ((= (forall @t17 @t105) @t102))) % 0.36/0.61 (step @p36 :rule refl :args (@t98)) % 0.36/0.61 (step @p37 :rule alpha_equiv :args (@t106 (@list @t99) (@list @t2))) % 0.36/0.61 (step @p38 :rule nary_cong :premises (@p37 @p36) :args (@t107)) % 0.36/0.61 (step @p39 :rule quant-miniscope-or :args ((= @t105 @t107))) % 0.36/0.61 (step @p40 :rule trans :premises (@p39 @p38)) % 0.36/0.61 (step @p41 :rule symm :premises (@p40)) % 0.36/0.61 (step @p42 :rule cong :premises (@p41) :args ((forall @t17 (or @t108 @t98)))) % 0.36/0.61 (step @p43 :rule trans :premises (@p42 @p35)) % 0.36/0.61 (step @p44 :rule bool-double-not-elim :args (@t108)) % 0.36/0.61 (step @p45 :rule nary_cong :premises (@p44 @p36) :args ((or (not @t109) @t98))) % 0.36/0.61 (step @p46 :rule bool-and-de-morgan :args (@t109 @t97 true)) % 0.36/0.61 (step @p47 :rule trans :premises (@p46 @p45)) % 0.36/0.61 (step @p48 :rule cong :premises (@p47) :args (@t111)) % 0.36/0.61 (step @p49 :rule trans :premises (@p48 @p43)) % 0.36/0.61 (step @p50 :rule cong :premises (@p49) :args (@t112)) % 0.36/0.61 (step @p51 :rule exists-elim :args ((= (exists @t17 @t110) @t112))) % 0.36/0.61 (step @p52 :rule trans :premises (@p51 @p50)) % 0.36/0.61 (step @p53 :rule refl :args (@t94)) % 0.36/0.61 (step @p54 :rule refl :args (@t95)) % 0.36/0.61 (step @p55 :rule refl :args (@t11)) % 0.36/0.61 (step @p56 :rule cong :premises (@p55 @p54) :args ((= @t11 @t95))) % 0.36/0.61 (step @p57 :rule symm :premises (@p56)) % 0.36/0.61 (step @p58 :rule eq_resolve :premises (@p55 @p57)) % 0.36/0.61 (step @p59 :rule cong :premises (@p58) :args (@t113)) % 0.36/0.61 (step @p60 :rule nary_cong :premises (@p59 @p53) :args (@t114)) % 0.36/0.61 (step @p61 :rule cong :premises (@p60) :args ((forall @t13 @t114))) % 0.36/0.61 (step @p62 :rule bool-impl-elim :args (@t11 @t94)) % 0.36/0.61 (step @p63 :rule cong :premises (@p62) :args ((forall @t13 (=> @t11 @t94)))) % 0.36/0.61 (step @p64 :rule trans :premises (@p63 @p61)) % 0.36/0.61 (step @p65 :rule refl :args (@t91)) % 0.36/0.61 (step @p66 :rule refl :args (@t5)) % 0.36/0.61 (step @p67 :rule cong :premises (@p66 @p65) :args ((= @t5 @t91))) % 0.36/0.61 (step @p68 :rule symm :premises (@p67)) % 0.36/0.61 (step @p69 :rule eq_resolve :premises (@p66 @p68)) % 0.36/0.61 (step @p70 :rule cong :premises (@p69) :args (@t66)) % 0.36/0.61 (step @p71 :rule refl :args (@t92)) % 0.36/0.61 (step @p72 :rule refl :args (@t7)) % 0.36/0.61 (step @p73 :rule cong :premises (@p72 @p71) :args ((= @t7 @t92))) % 0.36/0.61 (step @p74 :rule symm :premises (@p73)) % 0.36/0.61 (step @p75 :rule eq_resolve :premises (@p72 @p74)) % 0.36/0.61 (step @p76 :rule cong :premises (@p75) :args (@t115)) % 0.36/0.61 (step @p77 :rule nary_cong :premises (@p76 @p70) :args (@t116)) % 0.36/0.61 (step @p78 :rule cong :premises (@p77) :args ((forall @t9 @t116))) % 0.36/0.61 (step @p79 :rule bool-and-de-morgan :args (@t7 @t5 true)) % 0.36/0.61 (step @p80 :rule cong :premises (@p79) :args (@t117)) % 0.36/0.61 (step @p81 :rule trans :premises (@p80 @p78)) % 0.36/0.61 (step @p82 :rule cong :premises (@p81) :args (@t118)) % 0.36/0.61 (step @p83 :rule exists-elim :args ((= @t10 @t118))) % 0.36/0.61 (step @p84 :rule trans :premises (@p83 @p82)) % 0.36/0.61 (step @p85 :rule refl :args (@t11)) % 0.36/0.61 (step @p86 :rule cong :premises (@p85 @p84) :args (@t12)) % 0.36/0.61 (step @p87 :rule cong :premises (@p86) :args (@t14)) % 0.36/0.61 (step @p88 :rule trans :premises (@p87 @p64)) % 0.36/0.61 (step @p89 :rule cong :premises (@p59) :args (@t119)) % 0.36/0.61 (step @p90 :rule cong :premises (@p89) :args (@t120)) % 0.36/0.61 (step @p91 :rule exists-elim :args ((= @t15 @t120))) % 0.36/0.61 (step @p92 :rule trans :premises (@p91 @p90)) % 0.36/0.61 (step @p93 :rule nary_cong :premises (@p92 @p88) :args (@t16)) % 0.36/0.61 (step @p94 :rule cong :premises (@p93) :args (@t18)) % 0.36/0.61 (step @p95 :rule trans :premises (@p94 @p52)) % 0.36/0.61 (step @p96 :rule cong :premises (@p95) :args (@t19)) % 0.36/0.61 (step @p97 :rule trans :premises (@p96 @p34)) % 0.36/0.61 (step @p98 :rule cong :premises (@p97) :args (@t21)) % 0.36/0.61 (step @p99 :rule refl :args (@t103)) % 0.36/0.61 (step @p100 :rule cong :premises (@p99 @p98) :args (@t121)) % 0.36/0.61 (step @p101 :rule trans :premises (@p100 @p33)) % 0.36/0.61 (step @p102 :rule cong :premises (@p101) :args ((not @t121))) % 0.36/0.61 (step @p103 :rule trans :premises (@p102 @p32)) % 0.36/0.61 (step @p104 :rule refl :args (@t21)) % 0.36/0.61 (step @p105 :rule bool-impl-elim :args (@t109 @t98)) % 0.36/0.61 (step @p106 :rule trans :premises (@p105 @p45)) % 0.36/0.61 (step @p107 :rule cong :premises (@p106) :args ((forall @t17 (=> @t109 @t98)))) % 0.36/0.61 (step @p108 :rule trans :premises (@p107 @p43)) % 0.36/0.61 (step @p109 :rule bool-and-de-morgan :args (@t11 @t93 true)) % 0.36/0.61 (step @p110 :rule cong :premises (@p109) :args (@t123)) % 0.36/0.61 (step @p111 :rule trans :premises (@p110 @p61)) % 0.36/0.61 (step @p112 :rule cong :premises (@p111) :args (@t124)) % 0.36/0.61 (step @p113 :rule exists-elim :args ((= (exists @t13 @t122) @t124))) % 0.36/0.61 (step @p114 :rule trans :premises (@p113 @p112)) % 0.36/0.61 (step @p115 :rule bool-impl-elim :args (@t7 @t66)) % 0.36/0.62 (step @p116 :rule cong :premises (@p115) :args (@t67)) % 0.36/0.62 (step @p117 :rule trans :premises (@p116 @p78)) % 0.36/0.62 (step @p118 :rule nary_cong :premises (@p85 @p117) :args (@t68)) % 0.36/0.62 (step @p119 :rule cong :premises (@p118) :args (@t69)) % 0.36/0.62 (step @p120 :rule trans :premises (@p119 @p114)) % 0.36/0.62 (step @p121 :rule cong :premises (@p92 @p120) :args (@t70)) % 0.36/0.62 (step @p122 :rule cong :premises (@p121) :args (@t71)) % 0.36/0.62 (step @p123 :rule trans :premises (@p122 @p108)) % 0.36/0.62 (step @p124 :rule cong :premises (@p123) :args (@t72)) % 0.36/0.62 (step @p125 :rule trans :premises (@p22 @p124)) % 0.36/0.62 (step @p126 :rule cong :premises (@p125 @p104) :args (@t22)) % 0.36/0.62 (step @p127 :rule cong :premises (@p126) :args (@t23)) % 0.36/0.62 (step @p128 :rule trans :premises (@p127 @p103)) % 0.36/0.62 (step @p129 false :rule eq_resolve :premises (@p1 @p128)) % 0.36/0.62 ) % 0.36/0.62 % SZS output end Proof % 0.36/0.62 % cvc5 exiting %------------------------------------------------------------------------------