%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SYN362+1 : TPTP v9.2.1. Released v2.0.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % Computer : n025.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.55s % Output : Proof 0.30s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SYN362+1 : TPTP v9.2.1. Released v2.0.0. % 0.11/0.13 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.17/0.34 % Computer : n025.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:25:16 EDT 2026 % 0.17/0.34 % CPUTime : % 0.30/0.49 %----Proving TF0_NAR, FOF, or CNF % 0.30/0.55 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.30/0.55 % SZS status Theorem % 0.30/0.55 % SZS output start Proof % 0.30/0.55 ( % 0.30/0.55 (declare-sort $$unsorted 0) % 0.30/0.55 (declare-const tptp.big_r (-> $$unsorted $$unsorted Bool)) % 0.30/0.55 (declare-const tptp.big_p (-> $$unsorted Bool)) % 0.30/0.55 (define @t1 () (@var "X" $$unsorted)) % 0.30/0.55 (define @t2 () (tptp.big_p @t1)) % 0.30/0.55 (define @t3 () (not @t2)) % 0.30/0.55 (define @t4 () (@list @t1)) % 0.30/0.55 (define @t5 () (exists @t4 @t3)) % 0.30/0.55 (define @t6 () (@var "Z" $$unsorted)) % 0.30/0.55 (define @t7 () (not (tptp.big_r @t6 @t1))) % 0.30/0.55 (define @t8 () (forall @t4 (=> @t2 @t7))) % 0.30/0.55 (define @t9 () (@list @t6)) % 0.30/0.55 (define @t10 () (exists @t9 @t8)) % 0.30/0.55 (define @t11 () (@var "W" $$unsorted)) % 0.30/0.55 (define @t12 () (@var "Y" $$unsorted)) % 0.30/0.55 (define @t13 () (tptp.big_r @t12 @t11)) % 0.30/0.55 (define @t14 () (@list @t11)) % 0.30/0.55 (define @t15 () (exists @t14 @t13)) % 0.30/0.55 (define @t16 () (forall (@list @t12) @t15)) % 0.30/0.55 (define @t17 () (and @t16 @t10)) % 0.30/0.55 (define @t18 () (=> @t17 @t5)) % 0.30/0.55 (define @t19 () (not @t18)) % 0.30/0.55 (define @t20 () (forall @t4 (not @t3))) % 0.30/0.55 (define @t21 () (not @t20)) % 0.30/0.55 (define @t22 () (forall @t4 (or @t3 @t7))) % 0.30/0.55 (define @t23 () (forall @t9 (not @t22))) % 0.30/0.55 (define @t24 () (not @t23)) % 0.30/0.55 (define @t25 () (@quantifiers_skolemize @t23 0)) % 0.30/0.55 (define @t26 () (forall @t4 (or @t3 (not (tptp.big_r @t25 @t1))))) % 0.30/0.55 (define @t27 () (not (not @t26))) % 0.30/0.55 (define @t28 () (@list true)) % 0.30/0.55 (define @t29 () (forall @t14 (not (tptp.big_r @t25 @t11)))) % 0.30/0.55 (define @t30 () (@quantifiers_skolemize @t29 0)) % 0.30/0.55 (define @t31 () (@list @t30)) % 0.30/0.55 (define @t32 () (tptp.big_r @t25 @t30)) % 0.30/0.55 (define @t33 () (not @t29)) % 0.30/0.55 (define @t34 () (not @t32)) % 0.30/0.55 (define @t35 () (not @t34)) % 0.30/0.55 (define @t36 () (tptp.big_p @t30)) % 0.30/0.55 (define @t37 () (not @t36)) % 0.30/0.55 (define @t38 () (or @t37 @t34)) % 0.30/0.55 (define @t39 () (forall @t4 @t2)) % 0.30/0.55 (assume @p1 @t19) % 0.30/0.55 (assume @p2 true) % 0.30/0.55 (step @p3 :rule bool-double-not-elim :args (@t2)) % 0.30/0.55 (step @p4 :rule cong :premises (@p3) :args (@t20)) % 0.30/0.55 (step @p5 :rule cong :premises (@p4) :args (@t21)) % 0.30/0.55 (step @p6 :rule exists-elim :args ((= @t5 @t21))) % 0.30/0.55 (step @p7 :rule trans :premises (@p6 @p5)) % 0.30/0.55 (step @p8 :rule exists-elim :args ((= (exists @t9 @t22) @t24))) % 0.30/0.55 (step @p9 :rule bool-impl-elim :args (@t2 @t7)) % 0.30/0.55 (step @p10 :rule cong :premises (@p9) :args (@t8)) % 0.30/0.55 (step @p11 :rule cong :premises (@p10) :args (@t10)) % 0.30/0.55 (step @p12 :rule trans :premises (@p11 @p8)) % 0.30/0.55 (step @p13 :rule exists-elim :args ((= @t15 (not (forall @t14 (not @t13)))))) % 0.30/0.55 (step @p14 :rule cong :premises (@p13) :args (@t16)) % 0.30/0.55 (step @p15 :rule nary_cong :premises (@p14 @p12) :args (@t17)) % 0.30/0.55 (step @p16 :rule cong :premises (@p15 @p7) :args (@t18)) % 0.30/0.55 (step @p17 :rule cong :premises (@p16) :args (@t19)) % 0.30/0.55 (step @p18 :rule eq_resolve :premises (@p1 @p17)) % 0.30/0.55 (step @p19 :rule not_implies_elim2 :premises (@p18)) % 0.30/0.55 (step @p20 :rule not_not_elim :premises (@p19)) % 0.30/0.55 (step @p21 :rule not_implies_elim1 :premises (@p18)) % 0.30/0.55 (step @p22 :rule and_elim :premises (@p21) :args (1)) % 0.30/0.55 (step @p23 :rule refl :args (@t26)) % 0.30/0.55 (step @p24 :rule bool-double-not-elim :args (@t23)) % 0.30/0.55 (step @p25 :rule nary_cong :premises (@p24 @p23) :args ((or (not @t24) @t26))) % 0.30/0.55 (step @p26 :rule bool-double-not-elim :args (@t26)) % 0.30/0.55 (step @p27 :rule refl :args (@t24)) % 0.30/0.55 (step @p28 :rule cong :premises (@p27 @p26) :args ((=> @t24 @t27))) % 0.30/0.55 (assume-push @p63 @t24) % 0.30/0.55 (step @p30 :rule skolemize :premises (@p22)) % 0.30/0.55 (step-pop @p64 :rule scope :premises (@p30)) % 0.30/0.55 (step @p31 :rule process_scope :premises (@p64) :args (@t27)) % 0.30/0.55 (step @p33 :rule eq_resolve :premises (@p31 @p28)) % 0.30/0.55 (step @p34 :rule implies_elim :premises (@p33)) % 0.30/0.55 (step @p35 :rule eq_resolve :premises (@p34 @p25)) % 0.30/0.55 (step @p36 :rule chain_m_resolution :premises (@p35 @p22) :args (@t26 @t28 (@list @t23))) % 0.30/0.55 (step @p37 :rule instantiate :premises (@p36) :args (@t31)) % 0.30/0.55 (step @p38 :rule and_elim :premises (@p21) :args (0)) % 0.30/0.55 (step @p39 :rule instantiate :premises (@p38) :args ((@list @t25))) % 0.30/0.55 (step @p40 :rule refl :args (@t32)) % 0.30/0.55 (step @p41 :rule bool-double-not-elim :args (@t29)) % 0.30/0.55 (step @p42 :rule nary_cong :premises (@p41 @p40) :args ((or (not @t33) @t32))) % 0.30/0.55 (step @p43 :rule bool-double-not-elim :args (@t32)) % 0.30/0.55 (step @p44 :rule refl :args (@t33)) % 0.30/0.55 (step @p45 :rule cong :premises (@p44 @p43) :args ((=> @t33 @t35))) % 0.30/0.55 (assume-push @p65 @t33) % 0.30/0.55 (step @p47 :rule skolemize :premises (@p39)) % 0.30/0.55 (step-pop @p66 :rule scope :premises (@p47)) % 0.30/0.55 (step @p48 :rule process_scope :premises (@p66) :args (@t35)) % 0.30/0.55 (step @p50 :rule eq_resolve :premises (@p48 @p45)) % 0.30/0.55 (step @p51 :rule implies_elim :premises (@p50)) % 0.30/0.55 (step @p52 :rule eq_resolve :premises (@p51 @p42)) % 0.30/0.55 (step @p53 :rule chain_m_resolution :premises (@p52 @p39) :args (@t32 @t28 (@list @t29))) % 0.30/0.55 (step @p54 :rule cnf_or_pos :args (@t38)) % 0.30/0.55 (step @p55 :rule reordering :premises (@p54) :args ((or @t34 @t37 (not @t38)))) % 0.30/0.55 (step @p56 :rule chain_m_resolution :premises (@p55 @p53 @p37) :args (@t37 (@list false false) (@list @t32 @t38))) % 0.30/0.55 (assume-push @p67 @t39) % 0.30/0.55 (step @p58 :rule instantiate :premises (@p20) :args (@t31)) % 0.30/0.55 (step-pop @p68 :rule scope :premises (@p58)) % 0.30/0.55 (step @p59 :rule process_scope :premises (@p68) :args (@t36)) % 0.30/0.55 (step @p61 :rule implies_elim :premises (@p59)) % 0.30/0.55 (step @p62 false :rule chain_m_resolution :premises (@p61 @p56 @p20) :args (false (@list true false) (@list @t36 @t39))) % 0.30/0.55 ) % 0.30/0.55 % SZS output end Proof % 0.30/0.55 % cvc5 exiting %------------------------------------------------------------------------------