%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SYN360+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: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 : SYN360+1 : TPTP v9.2.1. Released v2.0.0. % 0.13/0.13 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.16/0.34 % Computer : n016.cluster.edu % 0.16/0.34 % Model : x86_64 x86_64 % 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.16/0.34 % Memory : 8042.1875MB % 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.16/0.34 % CPULimit : 300 % 0.16/0.34 % WCLimit : 300 % 0.16/0.34 % DateTime : Tue Jun 2 23:25:24 EDT 2026 % 0.16/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_p (-> $$unsorted $$unsorted Bool)) % 0.30/0.55 (declare-const tptp.big_q (-> $$unsorted $$unsorted Bool)) % 0.30/0.55 (define @t1 () (@var "Y" $$unsorted)) % 0.30/0.55 (define @t2 () (@var "X" $$unsorted)) % 0.30/0.55 (define @t3 () (tptp.big_q @t2 @t1)) % 0.30/0.55 (define @t4 () (forall (@list @t1 @t2) @t3)) % 0.30/0.55 (define @t5 () (@var "Z" $$unsorted)) % 0.30/0.55 (define @t6 () (tptp.big_p @t5 @t1)) % 0.30/0.55 (define @t7 () (@list @t1)) % 0.30/0.55 (define @t8 () (exists @t7 @t6)) % 0.30/0.55 (define @t9 () (forall (@list @t5) @t8)) % 0.30/0.55 (define @t10 () (forall @t7 @t3)) % 0.30/0.55 (define @t11 () (tptp.big_p @t2 @t1)) % 0.30/0.55 (define @t12 () (exists @t7 @t11)) % 0.30/0.55 (define @t13 () (=> @t12 @t10)) % 0.30/0.55 (define @t14 () (@list @t2)) % 0.30/0.55 (define @t15 () (forall @t14 @t13)) % 0.30/0.55 (define @t16 () (and @t15 @t9)) % 0.30/0.55 (define @t17 () (=> @t16 @t4)) % 0.30/0.55 (define @t18 () (not @t17)) % 0.30/0.55 (define @t19 () (@var "BOUND_VARIABLE_7441" $$unsorted)) % 0.30/0.55 (define @t20 () (tptp.big_q @t2 @t19)) % 0.30/0.55 (define @t21 () (@var "BOUND_VARIABLE_7437" $$unsorted)) % 0.30/0.55 (define @t22 () (not (tptp.big_p @t2 @t21))) % 0.30/0.55 (define @t23 () (or @t22 @t20)) % 0.30/0.55 (define @t24 () (forall (@list @t2 @t21 @t19) @t23)) % 0.30/0.55 (define @t25 () (forall (@list @t21 @t19) @t23)) % 0.30/0.55 (define @t26 () (forall (@list @t19) @t20)) % 0.30/0.55 (define @t27 () (@list @t1)) % 0.30/0.55 (define @t28 () (forall (@list @t21) @t22)) % 0.30/0.55 (define @t29 () (or @t28 @t26)) % 0.30/0.55 (define @t30 () (forall @t7 (not @t11))) % 0.30/0.55 (define @t31 () (not @t30)) % 0.30/0.55 (define @t32 () (@quantifiers_skolemize @t4 1)) % 0.30/0.55 (define @t33 () (forall @t7 (not (tptp.big_p @t32 @t1)))) % 0.30/0.55 (define @t34 () (@quantifiers_skolemize @t33 0)) % 0.30/0.55 (define @t35 () (tptp.big_p @t32 @t34)) % 0.30/0.55 (define @t36 () (not @t33)) % 0.30/0.55 (define @t37 () (not @t35)) % 0.30/0.55 (define @t38 () (not @t37)) % 0.30/0.55 (define @t39 () (@quantifiers_skolemize @t4 0)) % 0.30/0.55 (define @t40 () (tptp.big_q @t32 @t39)) % 0.30/0.55 (define @t41 () (or @t37 @t40)) % 0.30/0.55 (define @t42 () (not @t41)) % 0.30/0.55 (define @t43 () (@list true false)) % 0.30/0.55 (assume @p1 @t18) % 0.30/0.55 (assume @p2 true) % 0.30/0.55 (step @p3 :rule refl :args (@t4)) % 0.30/0.55 (step @p4 :rule exists-elim :args ((= @t8 (not (forall @t7 (not @t6)))))) % 0.30/0.55 (step @p5 :rule cong :premises (@p4) :args (@t9)) % 0.30/0.55 (step @p6 :rule quant-merge-prenex :args ((= (forall @t14 @t25) @t24))) % 0.30/0.55 (step @p7 :rule alpha_equiv :args (@t26 (@list @t19) @t27)) % 0.30/0.55 (step @p8 :rule alpha_equiv :args (@t28 (@list @t21) @t27)) % 0.30/0.55 (step @p9 :rule nary_cong :premises (@p8 @p7) :args (@t29)) % 0.30/0.55 (step @p10 :rule quant-miniscope-or :args ((= @t25 @t29))) % 0.30/0.55 (step @p11 :rule trans :premises (@p10 @p9)) % 0.30/0.55 (step @p12 :rule symm :premises (@p11)) % 0.30/0.55 (step @p13 :rule cong :premises (@p12) :args ((forall @t14 (or @t30 @t10)))) % 0.30/0.55 (step @p14 :rule trans :premises (@p13 @p6)) % 0.30/0.55 (step @p15 :rule refl :args (@t10)) % 0.30/0.55 (step @p16 :rule bool-double-not-elim :args (@t30)) % 0.30/0.55 (step @p17 :rule nary_cong :premises (@p16 @p15) :args ((or (not @t31) @t10))) % 0.30/0.55 (step @p18 :rule bool-impl-elim :args (@t31 @t10)) % 0.30/0.55 (step @p19 :rule trans :premises (@p18 @p17)) % 0.30/0.55 (step @p20 :rule cong :premises (@p19) :args ((forall @t14 (=> @t31 @t10)))) % 0.30/0.55 (step @p21 :rule trans :premises (@p20 @p14)) % 0.30/0.55 (step @p22 :rule refl :args (@t10)) % 0.30/0.55 (step @p23 :rule exists-elim :args ((= @t12 @t31))) % 0.30/0.55 (step @p24 :rule cong :premises (@p23 @p22) :args (@t13)) % 0.30/0.55 (step @p25 :rule cong :premises (@p24) :args (@t15)) % 0.30/0.55 (step @p26 :rule trans :premises (@p25 @p21)) % 0.30/0.55 (step @p27 :rule nary_cong :premises (@p26 @p5) :args (@t16)) % 0.30/0.55 (step @p28 :rule cong :premises (@p27 @p3) :args (@t17)) % 0.30/0.55 (step @p29 :rule cong :premises (@p28) :args (@t18)) % 0.30/0.55 (step @p30 :rule eq_resolve :premises (@p1 @p29)) % 0.30/0.55 (step @p31 :rule not_implies_elim1 :premises (@p30)) % 0.30/0.55 (step @p32 :rule and_elim :premises (@p31) :args (0)) % 0.30/0.55 (step @p33 :rule and_elim :premises (@p31) :args (1)) % 0.30/0.55 (step @p34 :rule instantiate :premises (@p33) :args ((@list @t32))) % 0.30/0.55 (step @p35 :rule refl :args (@t35)) % 0.30/0.55 (step @p36 :rule bool-double-not-elim :args (@t33)) % 0.30/0.55 (step @p37 :rule nary_cong :premises (@p36 @p35) :args ((or (not @t36) @t35))) % 0.30/0.55 (step @p38 :rule bool-double-not-elim :args (@t35)) % 0.30/0.55 (step @p39 :rule refl :args (@t36)) % 0.30/0.55 (step @p40 :rule cong :premises (@p39 @p38) :args ((=> @t36 @t38))) % 0.30/0.55 (assume-push @p60 @t36) % 0.30/0.55 (step @p42 :rule skolemize :premises (@p34)) % 0.30/0.55 (step-pop @p61 :rule scope :premises (@p42)) % 0.30/0.55 (step @p43 :rule process_scope :premises (@p61) :args (@t38)) % 0.30/0.55 (step @p45 :rule eq_resolve :premises (@p43 @p40)) % 0.30/0.55 (step @p46 :rule implies_elim :premises (@p45)) % 0.30/0.55 (step @p47 :rule eq_resolve :premises (@p46 @p37)) % 0.30/0.55 (step @p48 :rule chain_m_resolution :premises (@p47 @p34) :args (@t35 (@list true) (@list @t33))) % 0.30/0.55 (step @p49 :rule not_implies_elim2 :premises (@p30)) % 0.30/0.55 (step @p50 :rule skolemize :premises (@p49)) % 0.30/0.55 (step @p51 :rule cnf_or_pos :args (@t41)) % 0.30/0.55 (step @p52 :rule reordering :premises (@p51) :args ((or @t40 @t37 @t42))) % 0.30/0.55 (step @p53 :rule chain_m_resolution :premises (@p52 @p50 @p48) :args (@t42 @t43 (@list @t40 @t35))) % 0.30/0.55 (assume-push @p62 @t24) % 0.30/0.55 (step @p55 :rule instantiate :premises (@p32) :args ((@list @t32 @t34 @t39))) % 0.30/0.55 (step-pop @p63 :rule scope :premises (@p55)) % 0.30/0.55 (step @p56 :rule process_scope :premises (@p63) :args (@t41)) % 0.30/0.55 (step @p58 :rule implies_elim :premises (@p56)) % 0.30/0.55 (step @p59 false :rule chain_m_resolution :premises (@p58 @p53 @p32) :args (false @t43 (@list @t41 @t24))) % 0.30/0.55 ) % 0.30/0.55 % SZS output end Proof % 0.30/0.55 % cvc5 exiting %------------------------------------------------------------------------------