%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SYN399+1 : TPTP v9.2.1. Released v2.0.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % Computer : n015.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:08:48 AM UTC 2026 % Result : Theorem 0.35s 0.55s % Output : Proof 0.35s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SYN399+1 : TPTP v9.2.1. Released v2.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 : n015.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 : Tue Jun 2 23:27:04 EDT 2026 % 0.17/0.34 % CPUTime : % 0.31/0.49 %----Proving TF0_NAR, FOF, or CNF % 0.35/0.55 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.35/0.55 % SZS status Theorem % 0.35/0.55 % SZS output start Proof % 0.35/0.55 ( % 0.35/0.55 (declare-sort $$unsorted 0) % 0.35/0.55 (declare-const tptp.f (-> $$unsorted Bool)) % 0.35/0.55 (declare-const tptp.p Bool) % 0.35/0.55 (define @t1 () (@var "Y" $$unsorted)) % 0.35/0.55 (define @t2 () (forall (@list @t1) (tptp.f @t1))) % 0.35/0.55 (define @t3 () (@var "X" $$unsorted)) % 0.35/0.55 (define @t4 () (tptp.f @t3)) % 0.35/0.55 (define @t5 () (@list @t3)) % 0.35/0.55 (define @t6 () (forall @t5 (= @t4 tptp.p))) % 0.35/0.55 (define @t7 () (=> @t6 (= @t2 tptp.p))) % 0.35/0.55 (define @t8 () (not @t7)) % 0.35/0.55 (define @t9 () (@const 0 $$unsorted)) % 0.35/0.55 (define @t10 () (@list @t9)) % 0.35/0.55 (define @t11 () (tptp.f @t9)) % 0.35/0.55 (define @t12 () (= tptp.p @t11)) % 0.35/0.55 (define @t13 () (not @t12)) % 0.35/0.55 (define @t14 () (not tptp.p)) % 0.35/0.55 (define @t15 () (not @t2)) % 0.35/0.55 (define @t16 () (@quantifiers_skolemize @t2 0)) % 0.35/0.55 (define @t17 () (tptp.f @t16)) % 0.35/0.55 (define @t18 () (not @t17)) % 0.35/0.55 (define @t19 () (= tptp.p @t17)) % 0.35/0.55 (define @t20 () (not @t19)) % 0.35/0.55 (define @t21 () (forall @t5 (= tptp.p @t4))) % 0.35/0.55 (assume @p1 @t8) % 0.35/0.55 (assume @p2 true) % 0.35/0.55 (step @p3 :rule eq-symm :args (@t2 tptp.p)) % 0.35/0.55 (step @p4 :rule eq-symm :args (@t4 tptp.p)) % 0.35/0.55 (step @p5 :rule cong :premises (@p4) :args (@t6)) % 0.35/0.55 (step @p6 :rule cong :premises (@p5 @p3) :args (@t7)) % 0.35/0.55 (step @p7 :rule cong :premises (@p6) :args (@t8)) % 0.35/0.55 (step @p8 :rule eq_resolve :premises (@p1 @p7)) % 0.35/0.55 (step @p9 :rule not_implies_elim1 :premises (@p8)) % 0.35/0.55 (step @p10 :rule instantiate :premises (@p9) :args (@t10)) % 0.35/0.55 (step @p11 :rule cnf_equiv_pos1 :args (@t12)) % 0.35/0.55 (step @p12 :rule reordering :premises (@p11) :args ((or @t14 @t11 @t13))) % 0.35/0.55 (assume-push @p45 @t2) % 0.35/0.55 (step @p14 :rule instantiate :premises (@p45) :args (@t10)) % 0.35/0.55 (step-pop @p46 :rule scope :premises (@p14)) % 0.35/0.55 (step @p15 :rule process_scope :premises (@p46) :args (@t11)) % 0.35/0.55 (step @p17 :rule implies_elim :premises (@p15)) % 0.35/0.55 (step @p18 :rule not_implies_elim2 :premises (@p8)) % 0.35/0.55 (step @p19 :rule not_equiv_elim1 :premises (@p18)) % 0.35/0.55 (step @p20 :rule chain_m_resolution :premises (@p19 @p17 @p12 @p10) :args (@t11 (@list true true false) (@list @t2 tptp.p @t12))) % 0.35/0.55 (step @p21 :rule cnf_equiv_pos2 :args (@t12)) % 0.35/0.55 (step @p22 :rule reordering :premises (@p21) :args ((or tptp.p (not @t11) @t13))) % 0.35/0.55 (step @p23 :rule chain_m_resolution :premises (@p22 @p20 @p10) :args (tptp.p (@list false false) (@list @t11 @t12))) % 0.35/0.55 (step @p24 :rule not_equiv_elim2 :premises (@p18)) % 0.35/0.55 (step @p25 :rule chain_m_resolution :premises (@p24 @p23) :args (@t15 (@list false) (@list tptp.p))) % 0.35/0.55 (step @p26 :rule refl :args (@t18)) % 0.35/0.55 (step @p27 :rule bool-double-not-elim :args (@t2)) % 0.35/0.55 (step @p28 :rule nary_cong :premises (@p27 @p26) :args ((or (not @t15) @t18))) % 0.35/0.55 (assume-push @p47 @t15) % 0.35/0.55 (step @p30 :rule skolemize :premises (@p47)) % 0.35/0.55 (step-pop @p48 :rule scope :premises (@p30)) % 0.35/0.55 (step @p31 :rule process_scope :premises (@p48) :args (@t18)) % 0.35/0.55 (step @p33 :rule implies_elim :premises (@p31)) % 0.35/0.55 (step @p34 :rule eq_resolve :premises (@p33 @p28)) % 0.35/0.55 (step @p35 :rule chain_m_resolution :premises (@p34 @p25) :args (@t18 (@list true) (@list @t2))) % 0.35/0.55 (step @p36 :rule cnf_equiv_pos1 :args (@t19)) % 0.35/0.55 (step @p37 :rule reordering :premises (@p36) :args ((or @t14 @t17 @t20))) % 0.35/0.55 (step @p38 :rule chain_m_resolution :premises (@p37 @p23 @p35) :args (@t20 (@list false true) (@list tptp.p @t17))) % 0.35/0.55 (assume-push @p49 @t21) % 0.35/0.55 (step @p40 :rule instantiate :premises (@p9) :args ((@list @t16))) % 0.35/0.55 (step-pop @p50 :rule scope :premises (@p40)) % 0.35/0.55 (step @p41 :rule process_scope :premises (@p50) :args (@t19)) % 0.35/0.55 (step @p43 :rule implies_elim :premises (@p41)) % 0.35/0.55 (step @p44 false :rule chain_m_resolution :premises (@p43 @p38 @p9) :args (false (@list true false) (@list @t19 @t21))) % 0.35/0.55 ) % 0.35/0.55 % SZS output end Proof % 0.35/0.55 % cvc5 exiting %------------------------------------------------------------------------------