%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SYN358+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 : n023.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:41 AM UTC 2026 % Result : Theorem 0.30s 0.54s % Output : Proof 0.30s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SYN358+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.15/0.34 % Computer : n023.cluster.edu % 0.15/0.34 % Model : x86_64 x86_64 % 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.34 % Memory : 8042.1875MB % 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.34 % CPULimit : 300 % 0.15/0.34 % WCLimit : 300 % 0.15/0.34 % DateTime : Tue Jun 2 23:25:43 EDT 2026 % 0.15/0.34 % CPUTime : % 0.30/0.49 %----Proving TF0_NAR, FOF, or CNF % 0.30/0.54 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.30/0.54 % SZS status Theorem % 0.30/0.54 % SZS output start Proof % 0.30/0.54 ( % 0.30/0.54 (declare-sort $$unsorted 0) % 0.30/0.54 (declare-const tptp.p Bool) % 0.30/0.54 (declare-const tptp.big_q (-> $$unsorted Bool)) % 0.30/0.54 (define @t1 () (@var "X" $$unsorted)) % 0.30/0.54 (define @t2 () (tptp.big_q @t1)) % 0.30/0.54 (define @t3 () (@list @t1)) % 0.30/0.54 (define @t4 () (exists @t3 @t2)) % 0.30/0.54 (define @t5 () (and tptp.p @t4)) % 0.30/0.54 (define @t6 () (and tptp.p @t2)) % 0.30/0.54 (define @t7 () (exists @t3 @t6)) % 0.30/0.54 (define @t8 () (= @t7 @t5)) % 0.30/0.54 (define @t9 () (not @t8)) % 0.30/0.54 (define @t10 () (not @t2)) % 0.30/0.54 (define @t11 () (forall @t3 @t10)) % 0.30/0.54 (define @t12 () (not tptp.p)) % 0.30/0.54 (define @t13 () (or @t12 @t11)) % 0.30/0.54 (define @t14 () (not @t11)) % 0.30/0.54 (define @t15 () (and tptp.p @t14)) % 0.30/0.54 (define @t16 () (not @t15)) % 0.30/0.54 (define @t17 () (forall @t3 (not @t6))) % 0.30/0.54 (define @t18 () (not @t17)) % 0.30/0.54 (define @t19 () (@list false)) % 0.30/0.54 (define @t20 () (@list @t15)) % 0.30/0.54 (define @t21 () (not @t13)) % 0.30/0.54 (assume @p1 @t9) % 0.30/0.54 (assume @p2 true) % 0.30/0.54 (step @p3 :rule bool-double-not-elim :args (tptp.p)) % 0.30/0.54 (step @p4 :rule refl :args (@t13)) % 0.30/0.54 (step @p5 :rule nary_cong :premises (@p4 @p3) :args ((or @t13 (not @t12)))) % 0.30/0.54 (step @p6 :rule cnf_or_neg :args (@t13 0)) % 0.30/0.54 (step @p7 :rule eq_resolve :premises (@p6 @p5)) % 0.30/0.54 (step @p8 :rule reordering :premises (@p7) :args ((or tptp.p @t13))) % 0.30/0.54 (step @p9 :rule cnf_and_pos :args (@t15 0)) % 0.30/0.54 (step @p10 :rule reordering :premises (@p9) :args ((or tptp.p @t16))) % 0.30/0.54 (step @p11 :rule exists-elim :args ((= @t4 @t14))) % 0.30/0.54 (step @p12 :rule refl :args (tptp.p)) % 0.30/0.54 (step @p13 :rule nary_cong :premises (@p12 @p11) :args (@t5)) % 0.30/0.54 (step @p14 :rule quant-miniscope-or :args ((= (forall @t3 (or @t12 @t10)) @t13))) % 0.30/0.54 (step @p15 :rule bool-and-de-morgan :args (tptp.p @t2 true)) % 0.30/0.54 (step @p16 :rule cong :premises (@p15) :args (@t17)) % 0.30/0.54 (step @p17 :rule trans :premises (@p16 @p14)) % 0.30/0.54 (step @p18 :rule cong :premises (@p17) :args (@t18)) % 0.30/0.54 (step @p19 :rule exists-elim :args ((= @t7 @t18))) % 0.30/0.54 (step @p20 :rule trans :premises (@p19 @p18)) % 0.30/0.54 (step @p21 :rule cong :premises (@p20 @p13) :args (@t8)) % 0.30/0.54 (step @p22 :rule cong :premises (@p21) :args (@t9)) % 0.30/0.54 (step @p23 :rule eq_resolve :premises (@p1 @p22)) % 0.30/0.54 (step @p24 :rule not_equiv_elim1 :premises (@p23)) % 0.30/0.54 (step @p25 :rule chain_m_resolution :premises (@p24 @p10 @p8) :args (tptp.p (@list true false) (@list @t15 @t13))) % 0.30/0.54 (step @p26 :rule bool-double-not-elim :args (@t11)) % 0.30/0.54 (step @p27 :rule refl :args (@t12)) % 0.30/0.54 (step @p28 :rule refl :args (@t15)) % 0.30/0.54 (step @p29 :rule nary_cong :premises (@p28 @p27 @p26) :args ((or @t15 @t12 (not @t14)))) % 0.30/0.54 (step @p30 :rule cnf_and_neg :args (@t15)) % 0.30/0.54 (step @p31 :rule eq_resolve :premises (@p30 @p29)) % 0.30/0.54 (step @p32 :rule reordering :premises (@p31) :args ((or @t12 @t11 @t15))) % 0.30/0.54 (step @p33 :rule cnf_or_neg :args (@t13 1)) % 0.30/0.54 (step @p34 :rule chain_m_resolution :premises (@p33 @p32 @p25 @p24) :args (@t15 (@list false false true) (@list @t11 tptp.p @t13))) % 0.30/0.54 (step @p35 :rule cnf_and_pos :args (@t15 1)) % 0.30/0.54 (step @p36 :rule reordering :premises (@p35) :args ((or @t14 @t16))) % 0.30/0.54 (step @p37 :rule chain_m_resolution :premises (@p36 @p34) :args (@t14 @t19 @t20)) % 0.30/0.54 (step @p38 :rule refl :args (@t16)) % 0.30/0.54 (step @p39 :rule bool-double-not-elim :args (@t13)) % 0.30/0.54 (step @p40 :rule nary_cong :premises (@p39 @p38) :args ((or (not @t21) @t16))) % 0.30/0.54 (step @p41 :rule not_equiv_elim2 :premises (@p23)) % 0.30/0.54 (step @p42 :rule eq_resolve :premises (@p41 @p40)) % 0.30/0.54 (step @p43 :rule chain_m_resolution :premises (@p42 @p34) :args (@t13 @t19 @t20)) % 0.30/0.54 (step @p44 :rule cnf_or_pos :args (@t13)) % 0.30/0.54 (step @p45 :rule reordering :premises (@p44) :args ((or @t12 @t11 @t21))) % 0.30/0.54 (step @p46 false :rule chain_m_resolution :premises (@p45 @p43 @p37 @p25) :args (false (@list false true false) (@list @t13 @t11 tptp.p))) % 0.30/0.54 ) % 0.30/0.54 % SZS output end Proof % 0.30/0.54 % cvc5 exiting %------------------------------------------------------------------------------