%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SYO258^5 : 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 : n027.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8042.1875MB % OS : Linux 3.10.0-693.el7.x86_64 % CPULimit : 300s % WCLimit : 300s % DateTime : Wed Jun 3 09:12:19 AM UTC 2026 % Result : Theorem 0.45s 0.62s % Output : Proof 0.45s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SYO258^5 : TPTP v9.2.1. Released v4.0.0. % 0.12/0.13 % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % 0.17/0.34 % Computer : n027.cluster.edu % 0.17/0.34 % Model : x86_64 x86_64 % 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.17/0.34 % Memory : 8042.1875MB % 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.17/0.34 % CPULimit : 300 % 0.17/0.34 % WCLimit : 300 % 0.17/0.34 % DateTime : Wed Jun 3 00:01:36 EDT 2026 % 0.17/0.34 % CPUTime : % 0.32/0.48 %----Proving TH0 % 0.45/0.62 --- 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.45/0.62 % SZS status Theorem % 0.45/0.62 % SZS output start Proof % 0.45/0.62 ( % 0.45/0.62 (declare-sort $$unsorted 0) % 0.45/0.62 (declare-const tptp.b $$unsorted) % 0.45/0.62 (declare-const tptp.cP (-> $$unsorted $$unsorted Bool)) % 0.45/0.62 (declare-const tptp.cQ (-> $$unsorted (-> $$unsorted Bool) Bool)) % 0.45/0.62 (declare-const tptp.a $$unsorted) % 0.45/0.62 (define @t1 () (@var "A" (-> $$unsorted Bool))) % 0.45/0.62 (define @t2 () (_ @t1 tptp.a)) % 0.45/0.62 (define @t3 () (@var "Xx" $$unsorted)) % 0.45/0.62 (define @t4 () (_ (_ tptp.cQ @t3) @t1)) % 0.45/0.62 (define @t5 () (@var "Xg" $$unsorted)) % 0.45/0.62 (define @t6 () (_ (_ tptp.cP @t5) @t3)) % 0.45/0.62 (define @t7 () (and @t6 @t4)) % 0.45/0.62 (define @t8 () (@list @t3)) % 0.45/0.62 (define @t9 () (exists @t8 @t7)) % 0.45/0.62 (define @t10 () (and @t9 @t2)) % 0.45/0.62 (define @t11 () (_ @t1 @t5)) % 0.45/0.62 (define @t12 () (=> @t11 @t10)) % 0.45/0.62 (define @t13 () (@list @t5)) % 0.45/0.62 (define @t14 () (forall @t13 @t12)) % 0.45/0.62 (define @t15 () (@list @t1)) % 0.45/0.62 (define @t16 () (exists @t15 @t14)) % 0.45/0.62 (define @t17 () (@var "E" (-> $$unsorted Bool))) % 0.45/0.62 (define @t18 () (_ (_ tptp.cQ tptp.b) @t17)) % 0.45/0.62 (define @t19 () (@list @t17)) % 0.45/0.62 (define @t20 () (forall @t19 @t18)) % 0.45/0.62 (define @t21 () (_ (_ tptp.cP tptp.a) tptp.b)) % 0.45/0.62 (define @t22 () (and @t21 @t20)) % 0.45/0.62 (define @t23 () (=> @t22 @t16)) % 0.45/0.62 (define @t24 () (not @t23)) % 0.45/0.62 (define @t25 () (_ @t1 tptp.a)) % 0.45/0.62 (define @t26 () (tptp.cQ @t3 @t1)) % 0.45/0.62 (define @t27 () (tptp.cP @t5 @t3)) % 0.45/0.62 (define @t28 () (not @t27)) % 0.45/0.62 (define @t29 () (not (forall @t8 (or @t28 (not @t26))))) % 0.45/0.62 (define @t30 () (_ @t1 @t5)) % 0.45/0.62 (define @t31 () (forall @t13 (or (not @t30) (and @t29 @t25)))) % 0.45/0.62 (define @t32 () (forall @t15 (not @t31))) % 0.45/0.62 (define @t33 () (not @t32)) % 0.45/0.62 (define @t34 () (tptp.cQ tptp.b @t17)) % 0.45/0.62 (define @t35 () (forall @t19 @t34)) % 0.45/0.62 (define @t36 () (tptp.cP tptp.a tptp.b)) % 0.45/0.62 (define @t37 () (and @t21 @t35)) % 0.45/0.62 (define @t38 () (=> @t37 @t33)) % 0.45/0.62 (define @t39 () (and @t29 @t2)) % 0.45/0.62 (define @t40 () (not @t11)) % 0.45/0.62 (define @t41 () (or @t40 @t39)) % 0.45/0.62 (define @t42 () (not @t4)) % 0.45/0.62 (define @t43 () (not @t6)) % 0.45/0.62 (define @t44 () (or @t43 @t42)) % 0.45/0.62 (define @t45 () (forall @t8 (not @t7))) % 0.45/0.62 (define @t46 () (not @t45)) % 0.45/0.62 (define @t47 () (@var "BOUND_VARIABLE_14552" $$unsorted)) % 0.45/0.62 (define @t48 () (lambda (@list @t47) false)) % 0.45/0.62 (define @t49 () (@var "BOUND_VARIABLE_22067" $$unsorted)) % 0.45/0.62 (define @t50 () (lambda (@list @t49) false)) % 0.45/0.62 (define @t51 () (_ @t50 tptp.a)) % 0.45/0.62 (define @t52 () (tptp.cQ @t3 @t50)) % 0.45/0.62 (define @t53 () (not @t52)) % 0.45/0.62 (define @t54 () (or @t28 @t53)) % 0.45/0.62 (define @t55 () (forall @t8 @t54)) % 0.45/0.62 (define @t56 () (not @t55)) % 0.45/0.62 (define @t57 () (and @t56 @t51)) % 0.45/0.62 (define @t58 () (_ @t50 @t5)) % 0.45/0.62 (define @t59 () (not @t58)) % 0.45/0.62 (define @t60 () (or @t59 @t57)) % 0.45/0.62 (define @t61 () (forall @t13 @t60)) % 0.45/0.62 (define @t62 () (not @t61)) % 0.45/0.62 (assume @p1 @t24) % 0.45/0.62 (assume @p2 true) % 0.45/0.62 (step @p3 :rule refl :args (@t33)) % 0.45/0.62 (step @p4 :rule refl :args (@t35)) % 0.45/0.62 (step @p5 :rule refl :args (@t36)) % 0.45/0.62 (step @p6 :rule refl :args (@t21)) % 0.45/0.62 (step @p7 :rule cong :premises (@p6 @p5) :args ((= @t21 @t36))) % 0.45/0.62 (step @p8 :rule symm :premises (@p7)) % 0.45/0.62 (step @p9 :rule eq_resolve :premises (@p6 @p8)) % 0.45/0.62 (step @p10 :rule nary_cong :premises (@p9 @p4) :args (@t37)) % 0.45/0.62 (step @p11 :rule cong :premises (@p10 @p3) :args (@t38)) % 0.45/0.62 (step @p12 :rule cong :premises (@p11) :args ((not @t38))) % 0.45/0.62 (step @p13 :rule exists-elim :args ((= (exists @t15 @t31) @t33))) % 0.45/0.62 (step @p14 :rule refl :args (@t25)) % 0.45/0.62 (step @p15 :rule refl :args (@t2)) % 0.45/0.62 (step @p16 :rule cong :premises (@p15 @p14) :args ((= @t2 @t25))) % 0.45/0.62 (step @p17 :rule symm :premises (@p16)) % 0.45/0.62 (step @p18 :rule eq_resolve :premises (@p15 @p17)) % 0.45/0.62 (step @p19 :rule refl :args (@t29)) % 0.45/0.62 (step @p20 :rule nary_cong :premises (@p19 @p18) :args (@t39)) % 0.45/0.62 (step @p21 :rule refl :args (@t30)) % 0.45/0.62 (step @p22 :rule refl :args (@t11)) % 0.45/0.62 (step @p23 :rule cong :premises (@p22 @p21) :args ((= @t11 @t30))) % 0.45/0.62 (step @p24 :rule symm :premises (@p23)) % 0.45/0.62 (step @p25 :rule eq_resolve :premises (@p22 @p24)) % 0.45/0.62 (step @p26 :rule cong :premises (@p25) :args (@t40)) % 0.45/0.62 (step @p27 :rule nary_cong :premises (@p26 @p20) :args (@t41)) % 0.45/0.62 (step @p28 :rule cong :premises (@p27) :args ((forall @t13 @t41))) % 0.45/0.62 (step @p29 :rule bool-impl-elim :args (@t11 @t39)) % 0.45/0.62 (step @p30 :rule cong :premises (@p29) :args ((forall @t13 (=> @t11 @t39)))) % 0.45/0.62 (step @p31 :rule trans :premises (@p30 @p28)) % 0.45/0.62 (step @p32 :rule refl :args (@t2)) % 0.45/0.62 (step @p33 :rule refl :args (@t26)) % 0.45/0.62 (step @p34 :rule refl :args (@t4)) % 0.45/0.62 (step @p35 :rule cong :premises (@p34 @p33) :args ((= @t4 @t26))) % 0.45/0.62 (step @p36 :rule symm :premises (@p35)) % 0.45/0.62 (step @p37 :rule eq_resolve :premises (@p34 @p36)) % 0.45/0.62 (step @p38 :rule cong :premises (@p37) :args (@t42)) % 0.45/0.62 (step @p39 :rule refl :args (@t27)) % 0.45/0.62 (step @p40 :rule refl :args (@t6)) % 0.45/0.62 (step @p41 :rule cong :premises (@p40 @p39) :args ((= @t6 @t27))) % 0.45/0.62 (step @p42 :rule symm :premises (@p41)) % 0.45/0.62 (step @p43 :rule eq_resolve :premises (@p40 @p42)) % 0.45/0.62 (step @p44 :rule cong :premises (@p43) :args (@t43)) % 0.45/0.62 (step @p45 :rule nary_cong :premises (@p44 @p38) :args (@t44)) % 0.45/0.62 (step @p46 :rule cong :premises (@p45) :args ((forall @t8 @t44))) % 0.45/0.62 (step @p47 :rule bool-and-de-morgan :args (@t6 @t4 true)) % 0.45/0.62 (step @p48 :rule cong :premises (@p47) :args (@t45)) % 0.45/0.62 (step @p49 :rule trans :premises (@p48 @p46)) % 0.45/0.62 (step @p50 :rule cong :premises (@p49) :args (@t46)) % 0.45/0.62 (step @p51 :rule exists-elim :args ((= @t9 @t46))) % 0.45/0.62 (step @p52 :rule trans :premises (@p51 @p50)) % 0.45/0.62 (step @p53 :rule nary_cong :premises (@p52 @p32) :args (@t10)) % 0.45/0.62 (step @p54 :rule refl :args (@t11)) % 0.45/0.62 (step @p55 :rule cong :premises (@p54 @p53) :args (@t12)) % 0.45/0.62 (step @p56 :rule cong :premises (@p55) :args (@t14)) % 0.45/0.62 (step @p57 :rule trans :premises (@p56 @p31)) % 0.45/0.62 (step @p58 :rule cong :premises (@p57) :args (@t16)) % 0.45/0.62 (step @p59 :rule trans :premises (@p58 @p13)) % 0.45/0.62 (step @p60 :rule refl :args (@t34)) % 0.45/0.62 (step @p61 :rule refl :args (@t18)) % 0.45/0.62 (step @p62 :rule cong :premises (@p61 @p60) :args ((= @t18 @t34))) % 0.45/0.62 (step @p63 :rule symm :premises (@p62)) % 0.45/0.62 (step @p64 :rule eq_resolve :premises (@p61 @p63)) % 0.45/0.62 (step @p65 :rule cong :premises (@p64) :args (@t20)) % 0.45/0.62 (step @p66 :rule refl :args (@t21)) % 0.45/0.62 (step @p67 :rule nary_cong :premises (@p66 @p65) :args (@t22)) % 0.45/0.62 (step @p68 :rule cong :premises (@p67 @p59) :args (@t23)) % 0.45/0.62 (step @p69 :rule cong :premises (@p68) :args (@t24)) % 0.45/0.62 (step @p70 :rule trans :premises (@p69 @p12)) % 0.45/0.62 (step @p71 :rule eq_resolve :premises (@p1 @p70)) % 0.45/0.62 (step @p72 :rule not_implies_elim2 :premises (@p71)) % 0.45/0.62 (step @p73 :rule not_not_elim :premises (@p72)) % 0.45/0.62 (step @p74 :rule bool-impl-false1 :args (@t32)) % 0.45/0.62 (step @p75 :rule evaluate :args ((not true))) % 0.45/0.62 (step @p76 :rule quant-unused-vars :args ((= (forall @t13 true) true))) % 0.45/0.62 (step @p77 :rule evaluate :args ((or true false))) % 0.45/0.62 (step @p78 :rule absorb :args ((= (and (not (forall @t8 (or @t28 (not (tptp.cQ @t3 @t48))))) false) false))) % 0.45/0.62 (step @p79 :rule beta-reduce :args ((= @t51 false))) % 0.45/0.62 (step @p80 :rule refl :args (@t48)) % 0.45/0.62 (step @p81 :rule symm :premises (@p80)) % 0.45/0.62 (step @p82 :rule alpha_equiv :args (@t50 (@list @t49) (@list @t47))) % 0.45/0.62 (step @p83 :rule trans :premises (@p82 @p81)) % 0.45/0.62 (step @p84 :rule refl :args (@t3)) % 0.45/0.62 (step @p85 :rule cong :premises (@p84 @p83) :args (@t52)) % 0.45/0.62 (step @p86 :rule cong :premises (@p85) :args (@t53)) % 0.45/0.62 (step @p87 :rule refl :args (@t28)) % 0.45/0.62 (step @p88 :rule nary_cong :premises (@p87 @p86) :args (@t54)) % 0.45/0.62 (step @p89 :rule cong :premises (@p88) :args (@t55)) % 0.45/0.62 (step @p90 :rule cong :premises (@p89) :args (@t56)) % 0.45/0.62 (step @p91 :rule nary_cong :premises (@p90 @p79) :args (@t57)) % 0.45/0.62 (step @p92 :rule trans :premises (@p91 @p78)) % 0.45/0.62 (step @p93 :rule evaluate :args ((not false))) % 0.45/0.62 (step @p94 :rule beta-reduce :args ((= @t58 false))) % 0.45/0.62 (step @p95 :rule cong :premises (@p94) :args (@t59)) % 0.45/0.62 (step @p96 :rule trans :premises (@p95 @p93)) % 0.45/0.62 (step @p97 :rule nary_cong :premises (@p96 @p92) :args (@t60)) % 0.45/0.62 (step @p98 :rule trans :premises (@p97 @p77)) % 0.45/0.62 (step @p99 :rule cong :premises (@p98) :args (@t61)) % 0.45/0.62 (step @p100 :rule trans :premises (@p99 @p76)) % 0.45/0.62 (step @p101 :rule cong :premises (@p100) :args (@t62)) % 0.45/0.62 (step @p102 :rule trans :premises (@p101 @p75)) % 0.45/0.62 (step @p103 :rule refl :args (@t32)) % 0.45/0.62 (step @p104 :rule cong :premises (@p103 @p102) :args ((=> @t32 @t62))) % 0.45/0.62 (step @p105 :rule trans :premises (@p104 @p74)) % 0.45/0.62 (assume-push @p112 @t32) % 0.45/0.62 (step @p107 :rule instantiate :premises (@p73) :args ((@list @t50))) % 0.45/0.62 (step-pop @p113 :rule scope :premises (@p107)) % 0.45/0.62 (step @p108 :rule process_scope :premises (@p113) :args (@t62)) % 0.45/0.62 (step @p110 :rule eq_resolve :premises (@p108 @p105)) % 0.45/0.62 (step @p111 false :rule chain_m_resolution :premises (@p110 @p73) :args (false (@list false) (@list @t32))) % 0.45/0.63 ) % 0.45/0.63 % SZS output end Proof % 0.45/0.63 % cvc5 exiting %------------------------------------------------------------------------------