%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SYN730+1 : TPTP v9.2.1. Released v2.5.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % Computer : n016.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:09:44 AM UTC 2026 % Result : Theorem 0.31s 0.57s % Output : Proof 0.31s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.13 % Problem : SYN730+1 : TPTP v9.2.1. Released v2.5.0. % 0.12/0.14 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.17/0.35 % Computer : n016.cluster.edu % 0.17/0.35 % Model : x86_64 x86_64 % 0.17/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.17/0.35 % Memory : 8042.1875MB % 0.17/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.17/0.35 % CPULimit : 300 % 0.17/0.35 % WCLimit : 300 % 0.17/0.35 % DateTime : Tue Jun 2 23:34:54 EDT 2026 % 0.17/0.35 % CPUTime : % 0.31/0.50 %----Proving TF0_NAR, FOF, or CNF % 0.31/0.57 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.31/0.57 % SZS status Theorem % 0.31/0.57 % SZS output start Proof % 0.31/0.57 ( % 0.31/0.57 (declare-sort $$unsorted 0) % 0.31/0.57 (declare-const tptp.a $$unsorted) % 0.31/0.57 (declare-const tptp.h (-> $$unsorted $$unsorted)) % 0.31/0.57 (declare-const tptp.k (-> $$unsorted $$unsorted)) % 0.31/0.57 (declare-const tptp.p (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.31/0.57 (define @t1 () (@var "Q" $$unsorted)) % 0.31/0.57 (define @t2 () (@var "J" $$unsorted)) % 0.31/0.57 (define @t3 () (@var "V" $$unsorted)) % 0.31/0.57 (define @t4 () (tptp.p @t3 @t2 @t1)) % 0.31/0.57 (define @t5 () (tptp.k @t2)) % 0.31/0.57 (define @t6 () (tptp.p @t3 @t2 @t5)) % 0.31/0.57 (define @t7 () (tptp.p tptp.a @t2 (tptp.h @t2))) % 0.31/0.57 (define @t8 () (or @t7 @t6)) % 0.31/0.57 (define @t9 () (=> @t8 @t4)) % 0.31/0.57 (define @t10 () (@list @t1)) % 0.31/0.57 (define @t11 () (exists @t10 @t9)) % 0.31/0.57 (define @t12 () (@list @t2)) % 0.31/0.57 (define @t13 () (forall @t12 @t11)) % 0.31/0.57 (define @t14 () (@list @t3)) % 0.31/0.57 (define @t15 () (exists @t14 @t13)) % 0.31/0.57 (define @t16 () (not @t15)) % 0.31/0.57 (define @t17 () (@var "BOUND_VARIABLE_7436" $$unsorted)) % 0.31/0.57 (define @t18 () (@list @t17)) % 0.31/0.57 (define @t19 () (forall @t18 (not (tptp.p @t3 @t2 @t17)))) % 0.31/0.57 (define @t20 () (not @t19)) % 0.31/0.57 (define @t21 () (not @t7)) % 0.31/0.57 (define @t22 () (forall @t12 (or (and @t21 (not @t6)) @t20))) % 0.31/0.57 (define @t23 () (forall @t14 (not @t22))) % 0.31/0.57 (define @t24 () (not @t4)) % 0.31/0.57 (define @t25 () (forall @t10 @t24)) % 0.31/0.57 (define @t26 () (forall @t10 @t8)) % 0.31/0.57 (define @t27 () (and @t26 @t25)) % 0.31/0.57 (define @t28 () (forall @t10 (not @t9))) % 0.31/0.57 (define @t29 () (not @t28)) % 0.31/0.57 (define @t30 () (@quantifiers_skolemize (forall @t12 (or (and @t21 (not (tptp.p tptp.a @t2 @t5))) (not (forall @t18 (not (tptp.p tptp.a @t2 @t17)))))) 0)) % 0.31/0.57 (define @t31 () (forall @t18 (not (tptp.p tptp.a @t30 @t17)))) % 0.31/0.57 (define @t32 () (not @t31)) % 0.31/0.57 (define @t33 () (tptp.k @t30)) % 0.31/0.57 (define @t34 () (tptp.p tptp.a @t30 @t33)) % 0.31/0.57 (define @t35 () (not @t34)) % 0.31/0.57 (define @t36 () (tptp.h @t30)) % 0.31/0.57 (define @t37 () (tptp.p tptp.a @t30 @t36)) % 0.31/0.57 (define @t38 () (not @t37)) % 0.31/0.57 (define @t39 () (and @t38 @t35)) % 0.31/0.57 (define @t40 () (or @t39 @t32)) % 0.31/0.57 (define @t41 () (@list true)) % 0.31/0.57 (define @t42 () (@list @t40)) % 0.31/0.57 (assume @p1 @t16) % 0.31/0.57 (assume @p2 true) % 0.31/0.57 (step @p3 :rule bool-double-not-elim :args (@t23)) % 0.31/0.57 (step @p4 :rule exists-elim :args ((= (exists @t14 @t22) (not @t23)))) % 0.31/0.57 (step @p5 :rule refl :args (@t20)) % 0.31/0.57 (step @p6 :rule bool-or-de-morgan :args (@t7 @t6 false)) % 0.31/0.57 (step @p7 :rule nary_cong :premises (@p6 @p5) :args ((or (not @t8) @t20))) % 0.31/0.57 (step @p8 :rule bool-and-de-morgan :args (@t8 @t19 true)) % 0.31/0.57 (step @p9 :rule trans :premises (@p8 @p7)) % 0.31/0.57 (step @p10 :rule cong :premises (@p9) :args ((forall @t12 (not (and @t8 @t19))))) % 0.31/0.57 (step @p11 :rule alpha_equiv :args (@t25 (@list @t1) (@list @t17))) % 0.31/0.57 (step @p12 :rule quant-unused-vars :args ((= @t26 @t8))) % 0.31/0.57 (step @p13 :rule nary_cong :premises (@p12 @p11) :args (@t27)) % 0.31/0.57 (step @p14 :rule quant-miniscope-and :args ((= (forall @t10 (and @t8 @t24)) @t27))) % 0.31/0.57 (step @p15 :rule trans :premises (@p14 @p13)) % 0.31/0.57 (step @p16 :rule bool-implies-de-morgan :args (@t8 @t4)) % 0.31/0.57 (step @p17 :rule cong :premises (@p16) :args (@t28)) % 0.31/0.57 (step @p18 :rule trans :premises (@p17 @p15)) % 0.31/0.57 (step @p19 :rule cong :premises (@p18) :args (@t29)) % 0.31/0.57 (step @p20 :rule exists-elim :args ((= @t11 @t29))) % 0.31/0.57 (step @p21 :rule trans :premises (@p20 @p19)) % 0.31/0.57 (step @p22 :rule cong :premises (@p21) :args (@t13)) % 0.31/0.57 (step @p23 :rule trans :premises (@p22 @p10)) % 0.31/0.57 (step @p24 :rule cong :premises (@p23) :args (@t15)) % 0.31/0.57 (step @p25 :rule trans :premises (@p24 @p4)) % 0.31/0.57 (step @p26 :rule cong :premises (@p25) :args (@t16)) % 0.31/0.57 (step @p27 :rule trans :premises (@p26 @p3)) % 0.31/0.57 (step @p28 :rule eq_resolve :premises (@p1 @p27)) % 0.31/0.57 (step @p29 :rule instantiate :premises (@p28) :args ((@list tptp.a))) % 0.31/0.57 (step @p30 :rule skolemize :premises (@p29)) % 0.31/0.57 (step @p31 :rule bool-double-not-elim :args (@t31)) % 0.31/0.57 (step @p32 :rule refl :args (@t40)) % 0.31/0.57 (step @p33 :rule nary_cong :premises (@p32 @p31) :args ((or @t40 (not @t32)))) % 0.31/0.57 (step @p34 :rule cnf_or_neg :args (@t40 1)) % 0.31/0.57 (step @p35 :rule eq_resolve :premises (@p34 @p33)) % 0.31/0.57 (step @p36 :rule reordering :premises (@p35) :args ((or @t31 @t40))) % 0.31/0.57 (step @p37 :rule chain_m_resolution :premises (@p36 @p30) :args (@t31 @t41 @t42)) % 0.31/0.57 (step @p38 :rule cnf_or_neg :args (@t40 0)) % 0.31/0.57 (step @p39 :rule chain_m_resolution :premises (@p38 @p30) :args ((not @t39) @t41 @t42)) % 0.31/0.57 (step @p40 :rule instantiate :premises (@p37) :args ((@list @t36))) % 0.31/0.57 (step @p41 :rule bool-double-not-elim :args (@t34)) % 0.31/0.57 (step @p42 :rule bool-double-not-elim :args (@t37)) % 0.31/0.57 (step @p43 :rule refl :args (@t39)) % 0.31/0.57 (step @p44 :rule nary_cong :premises (@p43 @p42 @p41) :args ((or @t39 (not @t38) (not @t35)))) % 0.31/0.57 (step @p45 :rule cnf_and_neg :args (@t39)) % 0.31/0.57 (step @p46 :rule eq_resolve :premises (@p45 @p44)) % 0.31/0.57 (step @p47 :rule reordering :premises (@p46) :args ((or @t37 @t34 @t39))) % 0.31/0.57 (step @p48 :rule chain_m_resolution :premises (@p47 @p40 @p39) :args (@t34 (@list true true) (@list @t37 @t39))) % 0.31/0.57 (assume-push @p56 @t31) % 0.31/0.57 (step @p50 :rule instantiate :premises (@p37) :args ((@list @t33))) % 0.31/0.57 (step-pop @p57 :rule scope :premises (@p50)) % 0.31/0.57 (step @p51 :rule process_scope :premises (@p57) :args (@t35)) % 0.31/0.57 (step @p53 :rule implies_elim :premises (@p51)) % 0.31/0.57 (step @p54 :rule reordering :premises (@p53) :args ((or @t35 @t32))) % 0.31/0.57 (step @p55 false :rule chain_m_resolution :premises (@p54 @p48 @p37) :args (false (@list false false) (@list @t34 @t31))) % 0.31/0.57 ) % 0.31/0.57 % SZS output end Proof % 0.31/0.57 % cvc5 exiting %------------------------------------------------------------------------------