%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SYN073+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 : 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:00 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 : SYN073+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 : n023.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:20:58 EDT 2026 % 0.17/0.34 % CPUTime : % 0.30/0.48 %----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.a $$unsorted) % 0.30/0.55 (declare-const tptp.big_f (-> $$unsorted $$unsorted Bool)) % 0.30/0.55 (define @t1 () (@var "Y1" $$unsorted)) % 0.30/0.55 (define @t2 () (@var "X1" $$unsorted)) % 0.30/0.55 (define @t3 () (@list @t1)) % 0.30/0.55 (define @t4 () (forall @t3 (tptp.big_f @t2 @t1))) % 0.30/0.55 (define @t5 () (@list @t2)) % 0.30/0.55 (define @t6 () (exists @t5 @t4)) % 0.30/0.55 (define @t7 () (@var "Y" $$unsorted)) % 0.30/0.55 (define @t8 () (@var "X" $$unsorted)) % 0.30/0.55 (define @t9 () (tptp.big_f tptp.a @t8)) % 0.30/0.55 (define @t10 () (@list @t8)) % 0.30/0.55 (define @t11 () (forall @t10 (or @t9 (forall (@list @t7) (tptp.big_f @t8 @t7))))) % 0.30/0.55 (define @t12 () (=> @t11 @t6)) % 0.30/0.55 (define @t13 () (not @t12)) % 0.30/0.55 (define @t14 () (@var "BOUND_VARIABLE_7428" $$unsorted)) % 0.30/0.55 (define @t15 () (tptp.big_f @t8 @t14)) % 0.30/0.55 (define @t16 () (or @t9 @t15)) % 0.30/0.55 (define @t17 () (forall (@list @t8 @t14) @t16)) % 0.30/0.55 (define @t18 () (@list @t14)) % 0.30/0.55 (define @t19 () (forall @t18 @t16)) % 0.30/0.55 (define @t20 () (forall @t18 @t15)) % 0.30/0.55 (define @t21 () (or @t9 @t20)) % 0.30/0.55 (define @t22 () (@quantifiers_skolemize (forall @t3 (tptp.big_f tptp.a @t1)) 0)) % 0.30/0.55 (define @t23 () (@quantifiers_skolemize (forall @t3 (tptp.big_f @t22 @t1)) 0)) % 0.30/0.55 (define @t24 () (tptp.big_f @t22 @t23)) % 0.30/0.55 (define @t25 () (tptp.big_f tptp.a @t22)) % 0.30/0.55 (define @t26 () (or @t25 @t24)) % 0.30/0.55 (define @t27 () (not @t26)) % 0.30/0.55 (assume @p1 @t13) % 0.30/0.55 (assume @p2 true) % 0.30/0.55 (step @p3 :rule exists-elim :args ((= @t6 (not (forall @t5 (not @t4)))))) % 0.30/0.55 (step @p4 :rule quant-merge-prenex :args ((= (forall @t10 @t19) @t17))) % 0.30/0.55 (step @p5 :rule alpha_equiv :args (@t20 (@list @t14) (@list @t7))) % 0.30/0.55 (step @p6 :rule refl :args (@t9)) % 0.30/0.55 (step @p7 :rule nary_cong :premises (@p6 @p5) :args (@t21)) % 0.30/0.55 (step @p8 :rule quant-miniscope-or :args ((= @t19 @t21))) % 0.30/0.55 (step @p9 :rule trans :premises (@p8 @p7)) % 0.30/0.55 (step @p10 :rule symm :premises (@p9)) % 0.30/0.55 (step @p11 :rule cong :premises (@p10) :args (@t11)) % 0.30/0.55 (step @p12 :rule trans :premises (@p11 @p4)) % 0.30/0.55 (step @p13 :rule cong :premises (@p12 @p3) :args (@t12)) % 0.30/0.55 (step @p14 :rule cong :premises (@p13) :args (@t13)) % 0.30/0.55 (step @p15 :rule eq_resolve :premises (@p1 @p14)) % 0.30/0.55 (step @p16 :rule not_implies_elim1 :premises (@p15)) % 0.30/0.55 (step @p17 :rule not_implies_elim2 :premises (@p15)) % 0.30/0.55 (step @p18 :rule not_not_elim :premises (@p17)) % 0.30/0.55 (step @p19 :rule instantiate :premises (@p18) :args ((@list @t22))) % 0.30/0.55 (step @p20 :rule skolemize :premises (@p19)) % 0.30/0.55 (step @p21 :rule instantiate :premises (@p18) :args ((@list tptp.a))) % 0.30/0.55 (step @p22 :rule skolemize :premises (@p21)) % 0.30/0.55 (step @p23 :rule cnf_or_pos :args (@t26)) % 0.30/0.55 (step @p24 :rule reordering :premises (@p23) :args ((or @t25 @t24 @t27))) % 0.30/0.55 (step @p25 :rule chain_m_resolution :premises (@p24 @p22 @p20) :args (@t27 (@list true true) (@list @t25 @t24))) % 0.30/0.55 (assume-push @p32 @t17) % 0.30/0.55 (step @p27 :rule instantiate :premises (@p16) :args ((@list @t22 @t23))) % 0.30/0.55 (step-pop @p33 :rule scope :premises (@p27)) % 0.30/0.55 (step @p28 :rule process_scope :premises (@p33) :args (@t26)) % 0.30/0.55 (step @p30 :rule implies_elim :premises (@p28)) % 0.30/0.55 (step @p31 false :rule chain_m_resolution :premises (@p30 @p25 @p16) :args (false (@list true false) (@list @t26 @t17))) % 0.30/0.55 ) % 0.30/0.55 % SZS output end Proof % 0.30/0.55 % cvc5 exiting %------------------------------------------------------------------------------