%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SYN915^4 : TPTP v9.2.1. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % Computer : n003.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:10:03 AM UTC 2026 % Result : Theorem 0.37s 0.56s % Output : Proof 0.37s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SYN915^4 : TPTP v9.2.1. Released v4.0.0. % 0.13/0.13 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.16/0.34 % Computer : n003.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 23:46:44 EDT 2026 % 0.16/0.35 % CPUTime : % 0.31/0.50 %----Proving TH0 % 0.37/0.56 --- 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.56 % SZS status Theorem % 0.37/0.56 % SZS output start Proof % 0.37/0.56 ( % 0.37/0.56 (declare-sort $$unsorted 0) % 0.37/0.56 (declare-const tptp.irel (-> $$unsorted $$unsorted Bool)) % 0.37/0.56 (declare-const tptp.ifalse (-> $$unsorted Bool)) % 0.37/0.56 (define tptp.mnot () (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.37/0.56 (define tptp.mor () (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.37/0.56 (define tptp.mand () (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.37/0.56 (define tptp.mimplies () (let ((_let_1 (@var "__flatten_var_0" $$unsorted))) (let ((_let_2 (@var "V" (-> $$unsorted Bool)))) (let ((_let_3 (@var "U" (-> $$unsorted Bool)))) (lambda (@list _let_3 _let_2 _let_1) (_ (_ (_ tptp.mor (_ tptp.mnot _let_3)) _let_2) _let_1)))))) % 0.37/0.56 (define tptp.mbox_s4 () (let ((_let_1 (@var "Y" $$unsorted))) (let ((_let_2 (@var "P" (-> $$unsorted Bool)))) (let ((_let_3 (@var "X" $$unsorted))) (lambda (@list _let_2 _let_3) (forall (@list _let_1) (=> (_ (_ tptp.irel _let_3) _let_1) (_ _let_2 _let_1)))))))) % 0.37/0.56 (define tptp.iatom () (let ((_let_1 (@var "__flatten_var_0" $$unsorted))) (let ((_let_2 (@var "P" (-> $$unsorted Bool)))) (lambda (@list _let_2 _let_1) (_ _let_2 _let_1))))) % 0.37/0.56 (define tptp.inot () (let ((_let_1 (@var "__flatten_var_0" $$unsorted))) (let ((_let_2 (@var "P" (-> $$unsorted Bool)))) (lambda (@list _let_2 _let_1) (_ (_ tptp.mnot (_ tptp.mbox_s4 _let_2)) _let_1))))) % 0.37/0.56 (define tptp.itrue () (lambda (@list (@var "W" $$unsorted)) true)) % 0.37/0.56 (define tptp.iand () (let ((_let_1 (@var "__flatten_var_0" $$unsorted))) (let ((_let_2 (@var "Q" (-> $$unsorted Bool)))) (let ((_let_3 (@var "P" (-> $$unsorted Bool)))) (lambda (@list _let_3 _let_2 _let_1) (_ (_ (_ tptp.mand _let_3) _let_2) _let_1)))))) % 0.37/0.56 (define tptp.ior () (let ((_let_1 (@var "__flatten_var_0" $$unsorted))) (let ((_let_2 (@var "Q" (-> $$unsorted Bool)))) (let ((_let_3 (@var "P" (-> $$unsorted Bool)))) (lambda (@list _let_3 _let_2 _let_1) (_ (_ (_ tptp.mor (_ tptp.mbox_s4 _let_3)) (_ tptp.mbox_s4 _let_2)) _let_1)))))) % 0.37/0.56 (define tptp.iimplies () (let ((_let_1 (@var "__flatten_var_0" $$unsorted))) (let ((_let_2 (@var "Q" (-> $$unsorted Bool)))) (let ((_let_3 (@var "P" (-> $$unsorted Bool)))) (lambda (@list _let_3 _let_2 _let_1) (_ (_ (_ tptp.mimplies (_ tptp.mbox_s4 _let_3)) (_ tptp.mbox_s4 _let_2)) _let_1)))))) % 0.37/0.56 (define tptp.iimplied () (let ((_let_1 (@var "__flatten_var_0" $$unsorted))) (let ((_let_2 (@var "P" (-> $$unsorted Bool)))) (let ((_let_3 (@var "Q" (-> $$unsorted Bool)))) (lambda (@list _let_2 _let_3 _let_1) (_ (_ (_ tptp.iimplies _let_3) _let_2) _let_1)))))) % 0.37/0.56 (define tptp.iequiv () (let ((_let_1 (@var "__flatten_var_0" $$unsorted))) (let ((_let_2 (@var "P" (-> $$unsorted Bool)))) (let ((_let_3 (@var "Q" (-> $$unsorted Bool)))) (lambda (@list _let_2 _let_3 _let_1) (_ (_ (_ tptp.iand (_ (_ tptp.iimplies _let_2) _let_3)) (_ (_ tptp.iimplies _let_3) _let_2)) _let_1)))))) % 0.37/0.56 (define tptp.ixor () (let ((_let_1 (@var "__flatten_var_0" $$unsorted))) (let ((_let_2 (@var "Q" (-> $$unsorted Bool)))) (let ((_let_3 (@var "P" (-> $$unsorted Bool)))) (lambda (@list _let_3 _let_2 _let_1) (_ (_ tptp.inot (_ (_ tptp.iequiv _let_3) _let_2)) _let_1)))))) % 0.37/0.56 (define tptp.ivalid () (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.56 (define tptp.isatisfiable () (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.56 (define tptp.icountersatisfiable () (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.56 (define tptp.iinvalid () (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.56 (define @t1 () (@var "X" $$unsorted)) % 0.37/0.56 (define @t2 () (_ tptp.irel @t1)) % 0.37/0.56 (define @t3 () (@var "Z" $$unsorted)) % 0.37/0.56 (define @t4 () (@var "Y" $$unsorted)) % 0.37/0.56 (define @t5 () (_ @t2 @t4)) % 0.37/0.56 (define @t6 () (not (_ tptp.ivalid (_ tptp.iatom tptp.itrue)))) % 0.37/0.56 (define @t7 () (@var "U" $$unsorted)) % 0.37/0.56 (define @t8 () (@var "X" (-> $$unsorted Bool))) % 0.37/0.56 (define @t9 () (_ @t8 @t7)) % 0.37/0.56 (define @t10 () (lambda (@list @t8 @t7) (not @t9))) % 0.37/0.56 (define @t11 () (@var "Y" (-> $$unsorted Bool))) % 0.37/0.56 (define @t12 () (_ @t11 @t7)) % 0.37/0.56 (define @t13 () (@list @t8 @t11 @t7)) % 0.37/0.56 (define @t14 () (lambda @t13 (or @t9 @t12))) % 0.37/0.56 (define @t15 () (lambda @t13 (and @t9 @t12))) % 0.37/0.56 (define @t16 () (@var "__flatten_var_0" $$unsorted)) % 0.37/0.56 (define @t17 () (@var "V" (-> $$unsorted Bool))) % 0.37/0.56 (define @t18 () (@var "U" (-> $$unsorted Bool))) % 0.37/0.56 (define @t19 () (lambda (@list @t18 @t17 @t16) (_ (_ (_ tptp.mor (_ tptp.mnot @t18)) @t17) @t16))) % 0.37/0.56 (define @t20 () (@var "P" (-> $$unsorted Bool))) % 0.37/0.56 (define @t21 () (lambda (@list @t20 @t1) (forall (@list @t4) (=> @t5 (_ @t20 @t4))))) % 0.37/0.56 (define @t22 () (@list @t20 @t16)) % 0.37/0.56 (define @t23 () (lambda @t22 (_ @t20 @t16))) % 0.37/0.56 (define @t24 () (_ tptp.mbox_s4 @t20)) % 0.37/0.56 (define @t25 () (lambda @t22 (_ (_ tptp.mnot @t24) @t16))) % 0.37/0.56 (define @t26 () (@var "W" $$unsorted)) % 0.37/0.56 (define @t27 () (@list @t26)) % 0.37/0.56 (define @t28 () (lambda @t27 true)) % 0.37/0.56 (define @t29 () (@var "Q" (-> $$unsorted Bool))) % 0.37/0.56 (define @t30 () (@list @t20 @t29 @t16)) % 0.37/0.56 (define @t31 () (lambda @t30 (_ (_ (_ tptp.mand @t20) @t29) @t16))) % 0.37/0.56 (define @t32 () (_ tptp.mbox_s4 @t29)) % 0.37/0.56 (define @t33 () (lambda @t30 (_ (_ (_ tptp.mor @t24) @t32) @t16))) % 0.37/0.56 (define @t34 () (lambda @t30 (_ (_ (_ tptp.mimplies @t24) @t32) @t16))) % 0.37/0.56 (define @t35 () (_ (_ tptp.iimplies @t29) @t20)) % 0.37/0.56 (define @t36 () (lambda @t30 (_ @t35 @t16))) % 0.37/0.56 (define @t37 () (lambda @t30 (_ (_ (_ tptp.iand (_ (_ tptp.iimplies @t20) @t29)) @t35) @t16))) % 0.37/0.56 (define @t38 () (lambda @t30 (_ (_ tptp.inot (_ (_ tptp.iequiv @t20) @t29)) @t16))) % 0.37/0.56 (define @t39 () (@var "Phi" (-> $$unsorted Bool))) % 0.37/0.56 (define @t40 () (_ @t39 @t26)) % 0.37/0.56 (define @t41 () (forall @t27 @t40)) % 0.37/0.56 (define @t42 () (@list @t39)) % 0.37/0.56 (define @t43 () (lambda @t42 @t41)) % 0.37/0.56 (define @t44 () (lambda @t42 (exists @t27 @t40))) % 0.37/0.56 (define @t45 () (not @t40)) % 0.37/0.56 (define @t46 () (lambda @t42 (exists @t27 @t45))) % 0.37/0.56 (define @t47 () (lambda @t42 (forall @t27 @t45))) % 0.37/0.56 (define @t48 () (@var "BOUND_VARIABLE_7960" $$unsorted)) % 0.37/0.56 (define @t49 () (lambda (@list @t48) true)) % 0.37/0.56 (define @t50 () (_ @t49 @t26)) % 0.37/0.56 (define @t51 () (forall @t27 @t50)) % 0.37/0.56 (define @t52 () (_ @t39 @t26)) % 0.37/0.56 (define @t53 () (lambda @t42 (forall @t27 @t52))) % 0.37/0.56 (define @t54 () (@list @t16)) % 0.37/0.56 (define @t55 () (@list @t48)) % 0.37/0.56 (define @t56 () (_ @t49 @t16)) % 0.37/0.56 (define @t57 () (lambda @t54 @t56)) % 0.37/0.56 (assume @p1 (forall (@list @t1) (_ @t2 @t1))) % 0.37/0.56 (assume @p2 (forall (@list @t1 @t4 @t3) (=> (and @t5 (_ (_ tptp.irel @t4) @t3)) (_ @t2 @t3)))) % 0.37/0.56 (assume @p3 (= tptp.ifalse (_ tptp.inot tptp.itrue))) % 0.37/0.56 (assume @p4 @t6) % 0.37/0.56 (assume @p5 true) % 0.37/0.56 (step @p6 (= tptp.mnot @t10) :rule refl :args (@t10)) % 0.37/0.56 (step @p7 (= tptp.mor @t14) :rule refl :args (@t14)) % 0.37/0.56 (step @p8 (= tptp.mand @t15) :rule refl :args (@t15)) % 0.37/0.56 (step @p9 (= tptp.mimplies @t19) :rule refl :args (@t19)) % 0.37/0.56 (step @p10 (= tptp.mbox_s4 @t21) :rule refl :args (@t21)) % 0.37/0.56 (step @p11 (= tptp.iatom @t23) :rule refl :args (@t23)) % 0.37/0.56 (step @p12 (= tptp.inot @t25) :rule refl :args (@t25)) % 0.37/0.56 (step @p13 (= tptp.itrue @t28) :rule refl :args (@t28)) % 0.37/0.56 (step @p14 (= tptp.iand @t31) :rule refl :args (@t31)) % 0.37/0.56 (step @p15 (= tptp.ior @t33) :rule refl :args (@t33)) % 0.37/0.56 (step @p16 (= tptp.iimplies @t34) :rule refl :args (@t34)) % 0.37/0.56 (step @p17 (= tptp.iimplied @t36) :rule refl :args (@t36)) % 0.37/0.56 (step @p18 (= tptp.iequiv @t37) :rule refl :args (@t37)) % 0.37/0.56 (step @p19 (= tptp.ixor @t38) :rule refl :args (@t38)) % 0.37/0.56 (step @p20 (= tptp.ivalid @t43) :rule refl :args (@t43)) % 0.37/0.56 (step @p21 (= tptp.isatisfiable @t44) :rule refl :args (@t44)) % 0.37/0.56 (step @p22 (= tptp.icountersatisfiable @t46) :rule refl :args (@t46)) % 0.37/0.57 (step @p23 (= tptp.iinvalid @t47) :rule refl :args (@t47)) % 0.37/0.57 (step @p24 :rule evaluate :args ((not true))) % 0.37/0.57 (step @p25 :rule quant-unused-vars :args ((= (forall @t27 true) true))) % 0.37/0.57 (step @p26 :rule beta-reduce :args ((= @t50 true))) % 0.37/0.57 (step @p27 :rule cong :premises (@p26) :args (@t51)) % 0.37/0.57 (step @p28 :rule trans :premises (@p27 @p25)) % 0.37/0.57 (step @p29 :rule beta-reduce :args ((= (_ @t53 @t49) @t51))) % 0.37/0.57 (step @p30 :rule trans :premises (@p29 @p28)) % 0.37/0.57 (step @p31 :rule refl :args (@t49)) % 0.37/0.57 (step @p32 :rule symm :premises (@p31)) % 0.37/0.57 (step @p33 :rule alpha_equiv :args ((lambda @t54 true) (@list @t16) @t55)) % 0.37/0.57 (step @p34 :rule trans :premises (@p33 @p32)) % 0.37/0.57 (step @p35 :rule beta-reduce :args ((= @t56 true))) % 0.37/0.57 (step @p36 :rule cong :premises (@p35) :args (@t57)) % 0.37/0.57 (step @p37 :rule trans :premises (@p36 @p34)) % 0.37/0.57 (step @p38 :rule beta-reduce :args ((= (_ @t23 @t49) @t57))) % 0.37/0.57 (step @p39 :rule trans :premises (@p38 @p37)) % 0.37/0.57 (step @p40 :rule alpha_equiv :args (@t28 (@list @t26) @t55)) % 0.37/0.57 (step @p41 :rule trans :premises (@p40 @p32)) % 0.37/0.57 (step @p42 :rule refl :args (@t23)) % 0.37/0.57 (step @p43 :rule ho_cong :premises (@p42 @p41)) % 0.37/0.57 (step @p44 :rule trans :premises (@p43 @p39)) % 0.37/0.57 (step @p45 :rule refl :args (@t53)) % 0.37/0.57 (step @p46 :rule ho_cong :premises (@p45 @p44)) % 0.37/0.57 (step @p47 :rule trans :premises (@p46 @p30)) % 0.37/0.57 (step @p48 :rule cong :premises (@p47) :args ((not (_ @t53 (_ @t23 @t28))))) % 0.37/0.57 (step @p49 :rule trans :premises (@p48 @p24)) % 0.37/0.57 (step @p50 :rule ho_cong :premises (@p11 @p13)) % 0.37/0.57 (step @p51 :rule refl :args (@t52)) % 0.37/0.57 (step @p52 :rule refl :args (@t40)) % 0.37/0.57 (step @p53 :rule cong :premises (@p52 @p51) :args ((= @t40 @t52))) % 0.37/0.57 (step @p54 :rule symm :premises (@p53)) % 0.37/0.57 (step @p55 :rule eq_resolve :premises (@p52 @p54)) % 0.37/0.57 (step @p56 :rule cong :premises (@p55) :args (@t41)) % 0.37/0.57 (step @p57 :rule cong :premises (@p56) :args (@t43)) % 0.37/0.57 (step @p58 :rule trans :premises (@p20 @p57)) % 0.37/0.57 (step @p59 :rule ho_cong :premises (@p58 @p50)) % 0.37/0.57 (step @p60 :rule cong :premises (@p59) :args (@t6)) % 0.37/0.57 (step @p61 :rule trans :premises (@p60 @p49)) % 0.37/0.57 (step @p62 false :rule eq_resolve :premises (@p4 @p61)) % 0.37/0.57 ) % 0.37/0.57 % SZS output end Proof % 0.37/0.57 % cvc5 exiting %------------------------------------------------------------------------------