%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : LCL859^1 : TPTP v9.3.1. Bugfixed v5.0.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/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 : 8046.5625MB % OS : Linux 6.8.0-71-generic % CPULimit : 300s % WCLimit : 300s % DateTime : Mon Sep 7 11:24:03 AM UTC 2026 % Result : Theorem 0.30s 0.60s % Output : Proof 0.30s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL859^1 : TPTP v9.3.1. Bugfixed v5.0.0. % 0.00/0.05 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.11/0.37 % Computer : n018.cluster.edu % 0.11/0.37 % Model : x86_64 x86_64 % 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.37 % Memory : 8046.5625MB % 0.11/0.37 % OS : Linux 6.8.0-71-generic % 0.11/0.37 % CPULimit : 300 % 0.11/0.37 % WCLimit : 300 % 0.11/0.37 % DateTime : Sat Sep 5 09:04:33 UTC 2026 % 0.15/0.38 % CPUTime : % 0.15/0.44 %----Proving TH0 % 0.30/0.60 --- 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.30/0.60 % SZS status Theorem % 0.30/0.60 % SZS output start Proof % 0.30/0.60 ( % 0.30/0.60 (declare-sort $$unsorted 0) % 0.30/0.60 (declare-sort tptp.mu 0) % 0.30/0.60 (declare-const tptp.mfalse (-> $$unsorted Bool)) % 0.30/0.60 (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.30/0.60 (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.30/0.60 (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.30/0.60 (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.30/0.60 (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.30/0.60 (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.30/0.60 (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.30/0.60 (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.30/0.60 (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.30/0.60 (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.30/0.60 (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.30/0.60 (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.30/0.60 (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.30/0.60 (define tptp.mtrue () (lambda (@list (@var "W" $$unsorted)) true)) % 0.30/0.60 (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.30/0.60 (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.30/0.60 (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.30/0.60 (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.30/0.60 (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.30/0.60 (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.30/0.60 (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.30/0.60 (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.30/0.60 (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.30/0.60 (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.30/0.60 (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.30/0.60 (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.30/0.60 (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.30/0.60 (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.30/0.60 (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.30/0.60 (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.30/0.60 (define @t1 () (@var "R" (-> $$unsorted $$unsorted Bool))) % 0.30/0.60 (define @t2 () (_ tptp.meuclidean @t1)) % 0.30/0.60 (define @t3 () (_ tptp.mreflexive @t1)) % 0.30/0.60 (define @t4 () (and @t3 (_ tptp.msymmetric @t1) @t2)) % 0.30/0.60 (define @t5 () (and @t3 @t2)) % 0.30/0.60 (define @t6 () (= @t5 @t4)) % 0.30/0.60 (define @t7 () (@list @t1)) % 0.30/0.60 (define @t8 () (forall @t7 @t6)) % 0.30/0.60 (define @t9 () (not @t8)) % 0.30/0.60 (define @t10 () (@var "Y" tptp.mu)) % 0.30/0.60 (define @t11 () (@var "X" tptp.mu)) % 0.30/0.60 (define @t12 () (@var "W" $$unsorted)) % 0.30/0.60 (define @t13 () (lambda (@list @t11 @t10 @t12) (= @t11 @t10))) % 0.30/0.60 (define @t14 () (@var "Y" (-> $$unsorted Bool))) % 0.30/0.60 (define @t15 () (@var "X" (-> $$unsorted Bool))) % 0.30/0.60 (define @t16 () (lambda (@list @t15 @t14 @t12) (= (_ @t15 @t12) (_ @t14 @t12)))) % 0.30/0.60 (define @t17 () (@var "Phi" (-> $$unsorted Bool))) % 0.30/0.60 (define @t18 () (_ @t17 @t12)) % 0.30/0.60 (define @t19 () (not @t18)) % 0.30/0.60 (define @t20 () (lambda (@list @t17 @t12) @t19)) % 0.30/0.60 (define @t21 () (@var "Psi" (-> $$unsorted Bool))) % 0.30/0.60 (define @t22 () (lambda (@list @t17 @t21 @t12) (or @t18 (_ @t21 @t12)))) % 0.30/0.60 (define @t23 () (@var "__flatten_var_0" $$unsorted)) % 0.30/0.60 (define @t24 () (_ tptp.mnot @t21)) % 0.30/0.60 (define @t25 () (_ tptp.mnot @t17)) % 0.30/0.60 (define @t26 () (_ tptp.mor @t25)) % 0.30/0.60 (define @t27 () (@list @t17 @t21 @t23)) % 0.30/0.60 (define @t28 () (lambda @t27 (_ (_ tptp.mnot (_ @t26 @t24)) @t23))) % 0.30/0.60 (define @t29 () (lambda @t27 (_ (_ @t26 @t21) @t23))) % 0.30/0.60 (define @t30 () (lambda @t27 (_ (_ (_ tptp.mor @t24) @t17) @t23))) % 0.30/0.60 (define @t31 () (lambda @t27 (_ (_ (_ tptp.mand (_ (_ tptp.mimplies @t17) @t21)) (_ (_ tptp.mimplies @t21) @t17)) @t23))) % 0.30/0.60 (define @t32 () (lambda @t27 (_ (_ tptp.mnot (_ (_ tptp.mequiv @t17) @t21)) @t23))) % 0.30/0.60 (define @t33 () (@var "Phi" (-> tptp.mu $$unsorted Bool))) % 0.30/0.60 (define @t34 () (_ @t33 @t11)) % 0.30/0.60 (define @t35 () (lambda (@list @t33 @t12) (forall (@list @t11) (_ @t34 @t12)))) % 0.30/0.60 (define @t36 () (@var "P" (-> $$unsorted Bool))) % 0.30/0.60 (define @t37 () (@var "Phi" (-> (-> $$unsorted Bool) $$unsorted Bool))) % 0.30/0.60 (define @t38 () (_ @t37 @t36)) % 0.30/0.60 (define @t39 () (lambda (@list @t37 @t12) (forall (@list @t36) (_ @t38 @t12)))) % 0.30/0.60 (define @t40 () (lambda (@list @t33 @t23) (_ (_ tptp.mnot (_ tptp.mforall_ind (lambda (@list @t11 @t23) (_ (_ tptp.mnot @t34) @t23)))) @t23))) % 0.30/0.60 (define @t41 () (lambda (@list @t37 @t23) (_ (_ tptp.mnot (_ tptp.mforall_prop (lambda (@list @t36 @t23) (_ (_ tptp.mnot @t38) @t23)))) @t23))) % 0.30/0.60 (define @t42 () (@list @t12)) % 0.30/0.60 (define @t43 () (lambda @t42 true)) % 0.30/0.60 (define @t44 () (@var "V" $$unsorted)) % 0.30/0.60 (define @t45 () (@list @t44)) % 0.30/0.60 (define @t46 () (lambda (@list @t1 @t17 @t12) (forall @t45 (or (not (_ (_ @t1 @t12) @t44)) (_ @t17 @t44))))) % 0.30/0.60 (define @t47 () (lambda (@list @t1 @t17 @t23) (_ (_ tptp.mnot (_ (_ tptp.mbox @t1) @t25)) @t23))) % 0.30/0.60 (define @t48 () (@var "S" $$unsorted)) % 0.30/0.60 (define @t49 () (_ @t1 @t48)) % 0.30/0.60 (define @t50 () (_ @t49 @t48)) % 0.30/0.60 (define @t51 () (@list @t48)) % 0.30/0.60 (define @t52 () (forall @t51 @t50)) % 0.30/0.60 (define @t53 () (lambda @t7 @t52)) % 0.30/0.60 (define @t54 () (@var "T" $$unsorted)) % 0.30/0.60 (define @t55 () (_ @t1 @t54)) % 0.30/0.60 (define @t56 () (_ @t55 @t48)) % 0.30/0.60 (define @t57 () (_ @t49 @t54)) % 0.30/0.60 (define @t58 () (@list @t48 @t54)) % 0.30/0.60 (define @t59 () (forall @t58 (=> @t57 @t56))) % 0.30/0.60 (define @t60 () (lambda @t7 @t59)) % 0.30/0.60 (define @t61 () (@list @t54)) % 0.30/0.60 (define @t62 () (lambda @t7 (forall @t51 (exists @t61 @t57)))) % 0.30/0.60 (define @t63 () (@var "U" $$unsorted)) % 0.30/0.60 (define @t64 () (_ @t49 @t63)) % 0.30/0.60 (define @t65 () (_ @t55 @t63)) % 0.30/0.60 (define @t66 () (@list @t48 @t54 @t63)) % 0.30/0.60 (define @t67 () (lambda @t7 (forall @t66 (=> (and @t57 @t65) @t64)))) % 0.30/0.60 (define @t68 () (and @t57 @t64)) % 0.30/0.60 (define @t69 () (forall @t66 (=> @t68 @t65))) % 0.30/0.60 (define @t70 () (lambda @t7 @t69)) % 0.30/0.60 (define @t71 () (= @t54 @t63)) % 0.30/0.60 (define @t72 () (lambda @t7 (forall @t66 (=> @t68 @t71)))) % 0.30/0.60 (define @t73 () (@list @t63)) % 0.30/0.60 (define @t74 () (lambda @t7 (forall @t51 (exists @t61 (and @t57 (forall @t73 (=> @t64 @t71))))))) % 0.30/0.60 (define @t75 () (_ @t1 @t63)) % 0.30/0.60 (define @t76 () (_ @t75 @t54)) % 0.30/0.60 (define @t77 () (lambda @t7 (forall @t66 (=> @t57 (exists @t73 (and @t64 @t76)))))) % 0.30/0.60 (define @t78 () (lambda @t7 (forall @t66 (=> @t68 (or @t65 @t71 @t76))))) % 0.30/0.60 (define @t79 () (lambda @t7 (forall @t66 (=> @t68 (exists @t45 (and (_ @t55 @t44) (_ @t75 @t44))))))) % 0.30/0.60 (define @t80 () (@list @t17)) % 0.30/0.60 (define @t81 () (lambda @t80 (forall @t42 @t18))) % 0.30/0.60 (define @t82 () (lambda @t80 (forall @t42 @t19))) % 0.30/0.60 (define @t83 () (lambda @t80 (exists @t42 @t18))) % 0.30/0.60 (define @t84 () (lambda @t80 (exists @t42 @t19))) % 0.30/0.60 (define @t85 () (_ @t1 @t54 @t63)) % 0.30/0.60 (define @t86 () (_ @t1 @t48 @t63)) % 0.30/0.60 (define @t87 () (_ @t1 @t48 @t54)) % 0.30/0.60 (define @t88 () (not @t87)) % 0.30/0.60 (define @t89 () (forall @t66 (or @t88 (not @t86) @t85))) % 0.30/0.60 (define @t90 () (_ (lambda @t7 @t89) @t1)) % 0.30/0.60 (define @t91 () (_ @t1 @t48 @t48)) % 0.30/0.60 (define @t92 () (forall @t51 @t91)) % 0.30/0.60 (define @t93 () (_ (lambda @t7 @t92) @t1)) % 0.30/0.60 (define @t94 () (and @t93 @t90)) % 0.30/0.60 (define @t95 () (_ @t1 @t54 @t48)) % 0.30/0.60 (define @t96 () (forall @t58 (or @t88 @t95))) % 0.30/0.60 (define @t97 () (_ (lambda @t7 @t96) @t1)) % 0.30/0.60 (define @t98 () (and @t93 @t97 @t90)) % 0.30/0.60 (define @t99 () (forall @t7 (= @t94 @t98))) % 0.30/0.60 (define @t100 () (not @t64)) % 0.30/0.60 (define @t101 () (not @t57)) % 0.30/0.60 (define @t102 () (or @t101 @t100 @t65)) % 0.30/0.60 (define @t103 () (or @t101 @t56)) % 0.30/0.60 (define @t104 () (@quantifiers_skolemize (forall @t7 (= (and @t92 @t96 @t89) (and @t92 @t89))) 0)) % 0.30/0.60 (define @t105 () (not (_ @t104 @t48 @t54))) % 0.30/0.60 (define @t106 () (forall @t66 (or @t105 (not (_ @t104 @t48 @t63)) (_ @t104 @t54 @t63)))) % 0.30/0.60 (define @t107 () (forall @t58 (or @t105 (_ @t104 @t54 @t48)))) % 0.30/0.60 (define @t108 () (forall @t51 (_ @t104 @t48 @t48))) % 0.30/0.60 (define @t109 () (and @t108 @t107 @t106)) % 0.30/0.60 (define @t110 () (not @t109)) % 0.30/0.60 (define @t111 () (and @t108 @t106)) % 0.30/0.60 (define @t112 () (not @t111)) % 0.30/0.60 (define @t113 () (= @t109 @t111)) % 0.30/0.60 (define @t114 () (@list true true true)) % 0.30/0.60 (define @t115 () (not @t107)) % 0.30/0.60 (define @t116 () (not @t108)) % 0.30/0.60 (define @t117 () (@quantifiers_skolemize @t107 0)) % 0.30/0.60 (define @t118 () (_ @t104 @t117 @t117)) % 0.30/0.60 (define @t119 () (@quantifiers_skolemize @t107 1)) % 0.30/0.60 (define @t120 () (_ @t104 @t119 @t117)) % 0.30/0.60 (define @t121 () (_ @t104 @t117 @t119)) % 0.30/0.60 (define @t122 () (not @t121)) % 0.30/0.60 (define @t123 () (or @t122 @t120)) % 0.30/0.60 (define @t124 () (not @t123)) % 0.30/0.60 (define @t125 () (not @t118)) % 0.30/0.60 (define @t126 () (or @t122 @t125 @t120)) % 0.30/0.60 (define @t127 () (@list true)) % 0.30/0.60 (define @t128 () (@list @t108)) % 0.30/0.60 (assume @p1 (= tptp.mfalse (_ tptp.mnot tptp.mtrue))) % 0.30/0.60 (assume @p2 @t9) % 0.30/0.60 (assume @p3 true) % 0.30/0.60 (step @p4 (= tptp.meq_ind @t13) :rule refl :args (@t13)) % 0.30/0.60 (step @p5 (= tptp.meq_prop @t16) :rule refl :args (@t16)) % 0.30/0.60 (step @p6 (= tptp.mnot @t20) :rule refl :args (@t20)) % 0.30/0.60 (step @p7 (= tptp.mor @t22) :rule refl :args (@t22)) % 0.30/0.60 (step @p8 (= tptp.mand @t28) :rule refl :args (@t28)) % 0.30/0.60 (step @p9 (= tptp.mimplies @t29) :rule refl :args (@t29)) % 0.30/0.60 (step @p10 (= tptp.mimplied @t30) :rule refl :args (@t30)) % 0.30/0.60 (step @p11 (= tptp.mequiv @t31) :rule refl :args (@t31)) % 0.30/0.60 (step @p12 (= tptp.mxor @t32) :rule refl :args (@t32)) % 0.30/0.60 (step @p13 (= tptp.mforall_ind @t35) :rule refl :args (@t35)) % 0.30/0.60 (step @p14 (= tptp.mforall_prop @t39) :rule refl :args (@t39)) % 0.30/0.60 (step @p15 (= tptp.mexists_ind @t40) :rule refl :args (@t40)) % 0.30/0.60 (step @p16 (= tptp.mexists_prop @t41) :rule refl :args (@t41)) % 0.30/0.60 (step @p17 (= tptp.mtrue @t43) :rule refl :args (@t43)) % 0.30/0.60 (step @p18 (= tptp.mbox @t46) :rule refl :args (@t46)) % 0.30/0.60 (step @p19 (= tptp.mdia @t47) :rule refl :args (@t47)) % 0.30/0.60 (step @p20 (= tptp.mreflexive @t53) :rule refl :args (@t53)) % 0.30/0.60 (step @p21 (= tptp.msymmetric @t60) :rule refl :args (@t60)) % 0.30/0.60 (step @p22 (= tptp.mserial @t62) :rule refl :args (@t62)) % 0.30/0.60 (step @p23 (= tptp.mtransitive @t67) :rule refl :args (@t67)) % 0.30/0.60 (step @p24 (= tptp.meuclidean @t70) :rule refl :args (@t70)) % 0.30/0.60 (step @p25 (= tptp.mpartially_functional @t72) :rule refl :args (@t72)) % 0.30/0.60 (step @p26 (= tptp.mfunctional @t74) :rule refl :args (@t74)) % 0.30/0.60 (step @p27 (= tptp.mweakly_dense @t77) :rule refl :args (@t77)) % 0.30/0.60 (step @p28 (= tptp.mweakly_connected @t78) :rule refl :args (@t78)) % 0.30/0.60 (step @p29 (= tptp.mweakly_directed @t79) :rule refl :args (@t79)) % 0.30/0.60 (step @p30 (= tptp.mvalid @t81) :rule refl :args (@t81)) % 0.30/0.60 (step @p31 (= tptp.minvalid @t82) :rule refl :args (@t82)) % 0.30/0.60 (step @p32 (= tptp.msatisfiable @t83) :rule refl :args (@t83)) % 0.30/0.60 (step @p33 (= tptp.mcountersatisfiable @t84) :rule refl :args (@t84)) % 0.30/0.60 (step @p34 :rule beta-reduce :args ((= @t90 @t89))) % 0.30/0.60 (step @p35 :rule beta-reduce :args ((= @t93 @t92))) % 0.30/0.60 (step @p36 :rule nary_cong :premises (@p35 @p34) :args (@t94)) % 0.30/0.60 (step @p37 :rule beta-reduce :args ((= @t97 @t96))) % 0.30/0.60 (step @p38 :rule nary_cong :premises (@p35 @p37 @p34) :args (@t98)) % 0.30/0.60 (step @p39 :rule cong :premises (@p38 @p36) :args ((= @t98 @t94))) % 0.30/0.60 (step @p40 :rule eq-symm :args (@t94 @t98)) % 0.30/0.60 (step @p41 :rule trans :premises (@p40 @p39)) % 0.30/0.60 (step @p42 :rule cong :premises (@p41) :args (@t99)) % 0.30/0.60 (step @p43 :rule cong :premises (@p42) :args ((not @t99))) % 0.30/0.60 (step @p44 :rule refl :args (@t1)) % 0.30/0.60 (step @p45 :rule refl :args (@t85)) % 0.30/0.60 (step @p46 :rule refl :args (@t65)) % 0.30/0.60 (step @p47 :rule cong :premises (@p46 @p45) :args ((= @t65 @t85))) % 0.30/0.60 (step @p48 :rule symm :premises (@p47)) % 0.30/0.60 (step @p49 :rule eq_resolve :premises (@p46 @p48)) % 0.30/0.60 (step @p50 :rule refl :args (@t86)) % 0.30/0.60 (step @p51 :rule refl :args (@t64)) % 0.30/0.60 (step @p52 :rule cong :premises (@p51 @p50) :args ((= @t64 @t86))) % 0.30/0.60 (step @p53 :rule symm :premises (@p52)) % 0.30/0.60 (step @p54 :rule eq_resolve :premises (@p51 @p53)) % 0.30/0.60 (step @p55 :rule cong :premises (@p54) :args (@t100)) % 0.30/0.60 (step @p56 :rule refl :args (@t87)) % 0.30/0.60 (step @p57 :rule refl :args (@t57)) % 0.30/0.60 (step @p58 :rule cong :premises (@p57 @p56) :args ((= @t57 @t87))) % 0.30/0.60 (step @p59 :rule symm :premises (@p58)) % 0.30/0.60 (step @p60 :rule eq_resolve :premises (@p57 @p59)) % 0.30/0.60 (step @p61 :rule cong :premises (@p60) :args (@t101)) % 0.30/0.60 (step @p62 :rule nary_cong :premises (@p61 @p55 @p49) :args (@t102)) % 0.30/0.60 (step @p63 :rule cong :premises (@p62) :args ((forall @t66 @t102))) % 0.30/0.60 (step @p64 :rule aci_norm :args ((= (or (or @t101 @t100) @t65) @t102))) % 0.30/0.60 (step @p65 :rule bool-and-de-morgan :args (@t57 @t64 true)) % 0.30/0.60 (step @p66 :rule nary_cong :premises (@p65 @p46) :args ((or (not @t68) @t65))) % 0.30/0.60 (step @p67 :rule trans :premises (@p66 @p64)) % 0.30/0.60 (step @p68 :rule bool-impl-elim :args (@t68 @t65)) % 0.30/0.60 (step @p69 :rule trans :premises (@p68 @p67)) % 0.30/0.60 (step @p70 :rule cong :premises (@p69) :args (@t69)) % 0.30/0.60 (step @p71 :rule trans :premises (@p70 @p63)) % 0.30/0.60 (step @p72 :rule cong :premises (@p71) :args (@t70)) % 0.30/0.60 (step @p73 :rule trans :premises (@p24 @p72)) % 0.30/0.60 (step @p74 :rule ho_cong :premises (@p73 @p44)) % 0.30/0.60 (step @p75 :rule refl :args (@t95)) % 0.30/0.60 (step @p76 :rule refl :args (@t56)) % 0.30/0.60 (step @p77 :rule cong :premises (@p76 @p75) :args ((= @t56 @t95))) % 0.30/0.60 (step @p78 :rule symm :premises (@p77)) % 0.30/0.60 (step @p79 :rule eq_resolve :premises (@p76 @p78)) % 0.30/0.60 (step @p80 :rule nary_cong :premises (@p61 @p79) :args (@t103)) % 0.30/0.60 (step @p81 :rule cong :premises (@p80) :args ((forall @t58 @t103))) % 0.30/0.60 (step @p82 :rule bool-impl-elim :args (@t57 @t56)) % 0.30/0.60 (step @p83 :rule cong :premises (@p82) :args (@t59)) % 0.30/0.60 (step @p84 :rule trans :premises (@p83 @p81)) % 0.30/0.60 (step @p85 :rule cong :premises (@p84) :args (@t60)) % 0.30/0.60 (step @p86 :rule trans :premises (@p21 @p85)) % 0.30/0.60 (step @p87 :rule ho_cong :premises (@p86 @p44)) % 0.30/0.60 (step @p88 :rule refl :args (@t91)) % 0.30/0.60 (step @p89 :rule refl :args (@t50)) % 0.30/0.60 (step @p90 :rule cong :premises (@p89 @p88) :args ((= @t50 @t91))) % 0.30/0.60 (step @p91 :rule symm :premises (@p90)) % 0.30/0.60 (step @p92 :rule eq_resolve :premises (@p89 @p91)) % 0.30/0.60 (step @p93 :rule cong :premises (@p92) :args (@t52)) % 0.30/0.60 (step @p94 :rule cong :premises (@p93) :args (@t53)) % 0.30/0.60 (step @p95 :rule trans :premises (@p20 @p94)) % 0.30/0.60 (step @p96 :rule ho_cong :premises (@p95 @p44)) % 0.30/0.60 (step @p97 :rule nary_cong :premises (@p96 @p87 @p74) :args (@t4)) % 0.30/0.60 (step @p98 :rule nary_cong :premises (@p96 @p74) :args (@t5)) % 0.30/0.60 (step @p99 :rule cong :premises (@p98 @p97) :args (@t6)) % 0.30/0.60 (step @p100 :rule cong :premises (@p99) :args (@t8)) % 0.30/0.60 (step @p101 :rule cong :premises (@p100) :args (@t9)) % 0.30/0.60 (step @p102 :rule trans :premises (@p101 @p43)) % 0.30/0.60 (step @p103 :rule eq_resolve :premises (@p2 @p102)) % 0.30/0.60 (step @p104 :rule skolemize :premises (@p103)) % 0.30/0.60 (step @p105 :rule cnf_and_pos :args (@t109 2)) % 0.30/0.60 (step @p106 :rule reordering :premises (@p105) :args ((or @t106 @t110))) % 0.30/0.60 (step @p107 :rule cnf_and_pos :args (@t111 1)) % 0.30/0.60 (step @p108 :rule reordering :premises (@p107) :args ((or @t106 @t112))) % 0.30/0.60 (step @p109 :rule cnf_equiv_neg1 :args (@t113)) % 0.30/0.60 (step @p110 :rule reordering :premises (@p109) :args ((or @t109 @t111 @t113))) % 0.30/0.60 (step @p111 :rule chain_m_resolution :premises (@p110 @p104 @p108 @p106) :args (@t106 @t114 (@list @t113 @t111 @t109))) % 0.30/0.60 (step @p112 :rule cnf_and_neg :args (@t111)) % 0.30/0.60 (step @p113 :rule cnf_and_neg :args (@t109)) % 0.30/0.60 (step @p114 :rule cnf_equiv_neg2 :args (@t113)) % 0.30/0.60 (step @p115 :rule chain_m_resolution :premises (@p114 @p104 @p113 @p112) :args ((or @t116 @t115 (not @t106)) (@list true false false) (@list @t113 @t109 @t111))) % 0.30/0.60 (assume-push @p148 @t108) % 0.30/0.60 (step @p117 :rule instantiate :premises (@p148) :args ((@list @t117))) % 0.30/0.60 (step-pop @p149 :rule scope :premises (@p117)) % 0.30/0.60 (step @p118 :rule process_scope :premises (@p149) :args (@t118)) % 0.30/0.60 (step @p120 :rule implies_elim :premises (@p118)) % 0.30/0.60 (step @p121 :rule refl :args (@t124)) % 0.30/0.60 (step @p122 :rule bool-double-not-elim :args (@t107)) % 0.30/0.60 (step @p123 :rule nary_cong :premises (@p122 @p121) :args ((or (not @t115) @t124))) % 0.30/0.60 (assume-push @p150 @t115) % 0.30/0.60 (step @p125 :rule skolemize :premises (@p150)) % 0.30/0.60 (step-pop @p151 :rule scope :premises (@p125)) % 0.30/0.60 (step @p126 :rule process_scope :premises (@p151) :args (@t124)) % 0.30/0.60 (step @p128 :rule implies_elim :premises (@p126)) % 0.30/0.60 (step @p129 :rule eq_resolve :premises (@p128 @p123)) % 0.30/0.60 (step @p130 :rule bool-double-not-elim :args (@t121)) % 0.30/0.60 (step @p131 :rule refl :args (@t123)) % 0.30/0.60 (step @p132 :rule nary_cong :premises (@p131 @p130) :args ((or @t123 (not @t122)))) % 0.30/0.60 (step @p133 :rule cnf_or_neg :args (@t123 0)) % 0.30/0.60 (step @p134 :rule eq_resolve :premises (@p133 @p132)) % 0.30/0.60 (step @p135 :rule reordering :premises (@p134) :args ((or @t121 @t123))) % 0.30/0.60 (step @p136 :rule cnf_or_neg :args (@t123 1)) % 0.30/0.60 (step @p137 :rule instantiate :premises (@p111) :args ((@list @t117 @t119 @t117))) % 0.30/0.60 (step @p138 :rule cnf_or_pos :args (@t126)) % 0.30/0.60 (step @p139 :rule reordering :premises (@p138) :args ((or @t122 @t120 @t125 (not @t126)))) % 0.30/0.60 (step @p140 :rule chain_m_resolution :premises (@p139 @p137 @p136 @p135 @p129 @p120 @p115 @p111) :args (@t116 (@list false true false true false true false) (@list @t126 @t120 @t121 @t123 @t118 @t107 @t106))) % 0.30/0.60 (step @p141 :rule cnf_and_pos :args (@t109 0)) % 0.30/0.60 (step @p142 :rule reordering :premises (@p141) :args ((or @t108 @t110))) % 0.30/0.60 (step @p143 :rule chain_m_resolution :premises (@p142 @p140) :args (@t110 @t127 @t128)) % 0.30/0.60 (step @p144 :rule cnf_and_pos :args (@t111 0)) % 0.30/0.60 (step @p145 :rule reordering :premises (@p144) :args ((or @t108 @t112))) % 0.30/0.60 (step @p146 :rule chain_m_resolution :premises (@p145 @p140) :args (@t112 @t127 @t128)) % 0.30/0.60 (step @p147 false :rule chain_m_resolution :premises (@p110 @p146 @p143 @p104) :args (false @t114 (@list @t111 @t109 @t113))) % 0.30/0.60 ) % 0.30/0.60 % SZS output end Proof % 0.30/0.60 % cvc5 exiting %------------------------------------------------------------------------------