%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SYN340+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 : n012.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:36 AM UTC 2026 % Result : Theorem 0.15s 0.37s % Output : Proof 0.15s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.06 % Problem : SYN340+1 : TPTP v9.2.1. Released v2.0.0. % 0.00/0.07 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.08/0.25 % Computer : n012.cluster.edu % 0.08/0.25 % Model : x86_64 x86_64 % 0.08/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.08/0.25 % Memory : 8042.1875MB % 0.08/0.25 % OS : Linux 3.10.0-693.el7.x86_64 % 0.08/0.25 % CPULimit : 300 % 0.08/0.25 % WCLimit : 300 % 0.08/0.25 % DateTime : Tue Jun 2 23:23:48 EDT 2026 % 0.08/0.25 % CPUTime : % 0.15/0.33 %----Proving TF0_NAR, FOF, or CNF % 0.15/0.37 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.15/0.37 % SZS status Theorem % 0.15/0.37 % SZS output start Proof % 0.15/0.37 ( % 0.15/0.37 (declare-sort $$unsorted 0) % 0.15/0.37 (declare-const tptp.big_f (-> $$unsorted $$unsorted $$unsorted $$unsorted $$unsorted Bool)) % 0.15/0.37 (define @t1 () (@var "Z2" $$unsorted)) % 0.15/0.37 (define @t2 () (@var "Z1" $$unsorted)) % 0.15/0.37 (define @t3 () (@var "Y" $$unsorted)) % 0.15/0.37 (define @t4 () (@var "X" $$unsorted)) % 0.15/0.37 (define @t5 () (tptp.big_f @t2 @t4 @t3 @t2 @t1)) % 0.15/0.37 (define @t6 () (tptp.big_f @t4 @t3 @t2 @t1 @t2)) % 0.15/0.37 (define @t7 () (=> @t6 @t5)) % 0.15/0.37 (define @t8 () (@list @t2 @t1)) % 0.15/0.37 (define @t9 () (exists @t8 @t7)) % 0.15/0.37 (define @t10 () (@list @t3)) % 0.15/0.37 (define @t11 () (forall @t10 @t9)) % 0.15/0.37 (define @t12 () (@list @t4)) % 0.15/0.37 (define @t13 () (exists @t12 @t11)) % 0.15/0.37 (define @t14 () (not @t13)) % 0.15/0.37 (define @t15 () (@var "BOUND_VARIABLE_7438" $$unsorted)) % 0.15/0.37 (define @t16 () (@var "BOUND_VARIABLE_7436" $$unsorted)) % 0.15/0.37 (define @t17 () (@list @t16 @t15)) % 0.15/0.37 (define @t18 () (forall @t17 (not (tptp.big_f @t16 @t4 @t3 @t16 @t15)))) % 0.15/0.37 (define @t19 () (@var "BOUND_VARIABLE_7429" $$unsorted)) % 0.15/0.37 (define @t20 () (@var "BOUND_VARIABLE_7431" $$unsorted)) % 0.15/0.37 (define @t21 () (@list @t19 @t20)) % 0.15/0.37 (define @t22 () (forall @t21 (tptp.big_f @t4 @t3 @t19 @t20 @t19))) % 0.15/0.37 (define @t23 () (forall @t10 (or (not @t22) (not @t18)))) % 0.15/0.37 (define @t24 () (forall @t12 (not @t23))) % 0.15/0.37 (define @t25 () (not @t5)) % 0.15/0.37 (define @t26 () (forall @t8 @t25)) % 0.15/0.37 (define @t27 () (@list @t2 @t1)) % 0.15/0.37 (define @t28 () (forall @t8 @t6)) % 0.15/0.37 (define @t29 () (and @t28 @t26)) % 0.15/0.37 (define @t30 () (forall @t8 (not @t7))) % 0.15/0.37 (define @t31 () (not @t30)) % 0.15/0.37 (define @t32 () (@const 0 $$unsorted)) % 0.15/0.37 (define @t33 () (@quantifiers_skolemize (forall @t10 (or (not (forall @t21 (tptp.big_f @t32 @t3 @t19 @t20 @t19))) (not (forall @t17 (not (tptp.big_f @t16 @t32 @t3 @t16 @t15)))))) 0)) % 0.15/0.37 (define @t34 () (@quantifiers_skolemize (forall @t10 (or (not (forall @t21 (tptp.big_f @t33 @t3 @t19 @t20 @t19))) (not (forall @t17 (not (tptp.big_f @t16 @t33 @t3 @t16 @t15)))))) 0)) % 0.15/0.37 (define @t35 () (forall @t17 (not (tptp.big_f @t16 @t33 @t34 @t16 @t15)))) % 0.15/0.37 (define @t36 () (not @t35)) % 0.15/0.37 (define @t37 () (or (not (forall @t21 (tptp.big_f @t33 @t34 @t19 @t20 @t19))) @t36)) % 0.15/0.37 (define @t38 () (@list true)) % 0.15/0.37 (define @t39 () (forall @t21 (tptp.big_f @t32 @t33 @t19 @t20 @t19))) % 0.15/0.37 (define @t40 () (not @t39)) % 0.15/0.37 (define @t41 () (or @t40 (not (forall @t17 (not (tptp.big_f @t16 @t32 @t33 @t16 @t15)))))) % 0.15/0.37 (define @t42 () (tptp.big_f @t32 @t33 @t34 @t32 @t34)) % 0.15/0.37 (assume @p1 @t14) % 0.15/0.37 (assume @p2 true) % 0.15/0.37 (step @p3 :rule bool-double-not-elim :args (@t24)) % 0.15/0.37 (step @p4 :rule exists-elim :args ((= (exists @t12 @t23) (not @t24)))) % 0.15/0.37 (step @p5 :rule bool-and-de-morgan :args (@t22 @t18 true)) % 0.15/0.37 (step @p6 :rule cong :premises (@p5) :args ((forall @t10 (not (and @t22 @t18))))) % 0.15/0.37 (step @p7 :rule alpha_equiv :args (@t26 @t27 (@list @t16 @t15))) % 0.15/0.37 (step @p8 :rule alpha_equiv :args (@t28 @t27 (@list @t19 @t20))) % 0.15/0.37 (step @p9 :rule nary_cong :premises (@p8 @p7) :args (@t29)) % 0.15/0.37 (step @p10 :rule quant-miniscope-and :args ((= (forall @t8 (and @t6 @t25)) @t29))) % 0.15/0.37 (step @p11 :rule trans :premises (@p10 @p9)) % 0.15/0.37 (step @p12 :rule bool-implies-de-morgan :args (@t6 @t5)) % 0.15/0.37 (step @p13 :rule cong :premises (@p12) :args (@t30)) % 0.15/0.37 (step @p14 :rule trans :premises (@p13 @p11)) % 0.15/0.37 (step @p15 :rule cong :premises (@p14) :args (@t31)) % 0.15/0.37 (step @p16 :rule exists-elim :args ((= @t9 @t31))) % 0.15/0.37 (step @p17 :rule trans :premises (@p16 @p15)) % 0.15/0.37 (step @p18 :rule cong :premises (@p17) :args (@t11)) % 0.15/0.37 (step @p19 :rule trans :premises (@p18 @p6)) % 0.15/0.37 (step @p20 :rule cong :premises (@p19) :args (@t13)) % 0.15/0.37 (step @p21 :rule trans :premises (@p20 @p4)) % 0.15/0.37 (step @p22 :rule cong :premises (@p21) :args (@t14)) % 0.15/0.37 (step @p23 :rule trans :premises (@p22 @p3)) % 0.15/0.37 (step @p24 :rule eq_resolve :premises (@p1 @p23)) % 0.15/0.37 (step @p25 :rule instantiate :premises (@p24) :args ((@list @t33))) % 0.15/0.37 (step @p26 :rule skolemize :premises (@p25)) % 0.15/0.37 (step @p27 :rule bool-double-not-elim :args (@t35)) % 0.15/0.37 (step @p28 :rule refl :args (@t37)) % 0.15/0.37 (step @p29 :rule nary_cong :premises (@p28 @p27) :args ((or @t37 (not @t36)))) % 0.15/0.37 (step @p30 :rule cnf_or_neg :args (@t37 1)) % 0.15/0.37 (step @p31 :rule eq_resolve :premises (@p30 @p29)) % 0.15/0.37 (step @p32 :rule reordering :premises (@p31) :args ((or @t35 @t37))) % 0.15/0.37 (step @p33 :rule chain_m_resolution :premises (@p32 @p26) :args (@t35 @t38 (@list @t37))) % 0.15/0.37 (step @p34 :rule instantiate :premises (@p24) :args ((@list @t32))) % 0.15/0.37 (step @p35 :rule skolemize :premises (@p34)) % 0.15/0.37 (step @p36 :rule bool-double-not-elim :args (@t39)) % 0.15/0.37 (step @p37 :rule refl :args (@t41)) % 0.15/0.37 (step @p38 :rule nary_cong :premises (@p37 @p36) :args ((or @t41 (not @t40)))) % 0.15/0.37 (step @p39 :rule cnf_or_neg :args (@t41 0)) % 0.15/0.37 (step @p40 :rule eq_resolve :premises (@p39 @p38)) % 0.15/0.37 (step @p41 :rule reordering :premises (@p40) :args ((or @t39 @t41))) % 0.15/0.37 (step @p42 :rule chain_m_resolution :premises (@p41 @p35) :args (@t39 @t38 (@list @t41))) % 0.15/0.37 (step @p43 :rule instantiate :premises (@p42) :args ((@list @t34 @t32))) % 0.15/0.37 (assume-push @p50 @t35) % 0.15/0.37 (step @p45 :rule instantiate :premises (@p33) :args ((@list @t32 @t34))) % 0.15/0.37 (step-pop @p51 :rule scope :premises (@p45)) % 0.15/0.37 (step @p46 :rule process_scope :premises (@p51) :args ((not @t42))) % 0.15/0.37 (step @p48 :rule implies_elim :premises (@p46)) % 0.15/0.37 (step @p49 false :rule chain_m_resolution :premises (@p48 @p43 @p33) :args (false (@list false false) (@list @t42 @t35))) % 0.15/0.37 ) % 0.15/0.37 % SZS output end Proof % 0.15/0.37 % cvc5 exiting %------------------------------------------------------------------------------