%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SYN395+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 : 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:08:47 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 : SYN395+1 : TPTP v9.2.1. Released v2.0.0. % 0.12/0.13 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.17/0.34 % Computer : n016.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:26:39 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.f (-> $$unsorted Bool)) % 0.30/0.55 (declare-const tptp.g (-> $$unsorted Bool)) % 0.30/0.55 (define @t1 () (@var "Z" $$unsorted)) % 0.30/0.55 (define @t2 () (tptp.g @t1)) % 0.30/0.55 (define @t3 () (@list @t1)) % 0.30/0.55 (define @t4 () (exists @t3 @t2)) % 0.30/0.55 (define @t5 () (@var "Y" $$unsorted)) % 0.30/0.55 (define @t6 () (tptp.f @t5)) % 0.30/0.55 (define @t7 () (@list @t5)) % 0.30/0.55 (define @t8 () (exists @t7 @t6)) % 0.30/0.55 (define @t9 () (=> @t8 @t4)) % 0.30/0.55 (define @t10 () (@var "X" $$unsorted)) % 0.30/0.55 (define @t11 () (tptp.g @t10)) % 0.30/0.55 (define @t12 () (tptp.f @t10)) % 0.30/0.55 (define @t13 () (forall (@list @t10) (=> @t12 @t11))) % 0.30/0.55 (define @t14 () (=> @t13 @t9)) % 0.30/0.55 (define @t15 () (not @t14)) % 0.30/0.55 (define @t16 () (forall @t3 (not @t2))) % 0.30/0.55 (define @t17 () (forall @t7 (not @t6))) % 0.30/0.55 (define @t18 () (not @t17)) % 0.30/0.55 (define @t19 () (@quantifiers_skolemize @t17 0)) % 0.30/0.55 (define @t20 () (@list @t19)) % 0.30/0.55 (define @t21 () (tptp.f @t19)) % 0.30/0.55 (define @t22 () (not @t21)) % 0.30/0.55 (define @t23 () (not @t22)) % 0.30/0.55 (define @t24 () (tptp.g @t19)) % 0.30/0.55 (define @t25 () (or @t22 @t24)) % 0.30/0.55 (define @t26 () (@list false false)) % 0.30/0.55 (assume @p1 @t15) % 0.30/0.55 (assume @p2 true) % 0.30/0.55 (step @p3 :rule exists-elim :args ((= @t4 (not @t16)))) % 0.30/0.55 (step @p4 :rule exists-elim :args ((= @t8 @t18))) % 0.30/0.55 (step @p5 :rule cong :premises (@p4 @p3) :args (@t9)) % 0.30/0.55 (step @p6 :rule bool-impl-elim :args (@t12 @t11)) % 0.30/0.55 (step @p7 :rule cong :premises (@p6) :args (@t13)) % 0.30/0.55 (step @p8 :rule cong :premises (@p7 @p5) :args (@t14)) % 0.30/0.55 (step @p9 :rule cong :premises (@p8) :args (@t15)) % 0.30/0.55 (step @p10 :rule eq_resolve :premises (@p1 @p9)) % 0.30/0.55 (step @p11 :rule not_implies_elim2 :premises (@p10)) % 0.30/0.55 (step @p12 :rule not_implies_elim2 :premises (@p11)) % 0.30/0.55 (step @p13 :rule not_not_elim :premises (@p12)) % 0.30/0.55 (step @p14 :rule not_implies_elim1 :premises (@p10)) % 0.30/0.55 (step @p15 :rule instantiate :premises (@p14) :args (@t20)) % 0.30/0.55 (step @p16 :rule not_implies_elim1 :premises (@p11)) % 0.30/0.55 (step @p17 :rule refl :args (@t21)) % 0.30/0.55 (step @p18 :rule bool-double-not-elim :args (@t17)) % 0.30/0.55 (step @p19 :rule nary_cong :premises (@p18 @p17) :args ((or (not @t18) @t21))) % 0.30/0.55 (step @p20 :rule bool-double-not-elim :args (@t21)) % 0.30/0.55 (step @p21 :rule refl :args (@t18)) % 0.30/0.55 (step @p22 :rule cong :premises (@p21 @p20) :args ((=> @t18 @t23))) % 0.30/0.55 (assume-push @p40 @t18) % 0.30/0.55 (step @p24 :rule skolemize :premises (@p16)) % 0.30/0.55 (step-pop @p41 :rule scope :premises (@p24)) % 0.30/0.55 (step @p25 :rule process_scope :premises (@p41) :args (@t23)) % 0.30/0.55 (step @p27 :rule eq_resolve :premises (@p25 @p22)) % 0.30/0.55 (step @p28 :rule implies_elim :premises (@p27)) % 0.30/0.55 (step @p29 :rule eq_resolve :premises (@p28 @p19)) % 0.30/0.55 (step @p30 :rule chain_m_resolution :premises (@p29 @p16) :args (@t21 (@list true) (@list @t17))) % 0.30/0.55 (step @p31 :rule cnf_or_pos :args (@t25)) % 0.30/0.55 (step @p32 :rule reordering :premises (@p31) :args ((or @t22 @t24 (not @t25)))) % 0.30/0.55 (step @p33 :rule chain_m_resolution :premises (@p32 @p30 @p15) :args (@t24 @t26 (@list @t21 @t25))) % 0.30/0.55 (assume-push @p42 @t16) % 0.30/0.55 (step @p35 :rule instantiate :premises (@p13) :args (@t20)) % 0.30/0.55 (step-pop @p43 :rule scope :premises (@p35)) % 0.30/0.55 (step @p36 :rule process_scope :premises (@p43) :args ((not @t24))) % 0.30/0.55 (step @p38 :rule implies_elim :premises (@p36)) % 0.30/0.55 (step @p39 false :rule chain_m_resolution :premises (@p38 @p33 @p13) :args (false @t26 (@list @t24 @t16))) % 0.30/0.55 ) % 0.30/0.55 % SZS output end Proof % 0.30/0.55 % cvc5 exiting %------------------------------------------------------------------------------