%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SYN731+1 : TPTP v9.2.1. Released v2.5.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % Computer : n001.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:09:44 AM UTC 2026 % Result : Theorem 0.29s 0.55s % Output : Proof 0.29s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SYN731+1 : TPTP v9.2.1. Released v2.5.0. % 0.12/0.13 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.16/0.34 % Computer : n001.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:35:05 EDT 2026 % 0.16/0.34 % CPUTime : % 0.29/0.49 %----Proving TF0_NAR, FOF, or CNF % 0.29/0.55 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.29/0.55 % SZS status Theorem % 0.29/0.55 % SZS output start Proof % 0.29/0.55 ( % 0.29/0.55 (declare-sort $$unsorted 0) % 0.29/0.55 (declare-const tptp.p (-> $$unsorted $$unsorted $$unsorted Bool)) % 0.29/0.55 (define @t1 () (@var "W" $$unsorted)) % 0.29/0.55 (define @t2 () (@var "Z" $$unsorted)) % 0.29/0.55 (define @t3 () (tptp.p @t2 @t2 @t1)) % 0.29/0.55 (define @t4 () (@list @t2)) % 0.29/0.55 (define @t5 () (exists @t4 @t3)) % 0.29/0.55 (define @t6 () (@var "Y" $$unsorted)) % 0.29/0.55 (define @t7 () (@var "X" $$unsorted)) % 0.29/0.55 (define @t8 () (tptp.p @t1 @t7 @t6)) % 0.29/0.55 (define @t9 () (@list @t6)) % 0.29/0.55 (define @t10 () (exists @t9 @t8)) % 0.29/0.55 (define @t11 () (@list @t7)) % 0.29/0.55 (define @t12 () (forall @t11 @t10)) % 0.29/0.55 (define @t13 () (=> @t12 @t5)) % 0.29/0.55 (define @t14 () (@list @t1)) % 0.29/0.55 (define @t15 () (exists @t14 @t13)) % 0.29/0.55 (define @t16 () (not @t15)) % 0.29/0.55 (define @t17 () (@var "BOUND_VARIABLE_7448" $$unsorted)) % 0.29/0.55 (define @t18 () (not (tptp.p @t2 @t2 @t17))) % 0.29/0.55 (define @t19 () (forall (@list @t17 @t2) @t18)) % 0.29/0.55 (define @t20 () (@var "BOUND_VARIABLE_7439" $$unsorted)) % 0.29/0.55 (define @t21 () (not (forall @t9 (not (tptp.p @t20 @t7 @t6))))) % 0.29/0.55 (define @t22 () (forall (@list @t20 @t7) @t21)) % 0.29/0.55 (define @t23 () (forall (@list @t17) (forall @t4 @t18))) % 0.29/0.55 (define @t24 () (forall (@list @t20) (forall @t11 @t21))) % 0.29/0.55 (define @t25 () (forall @t4 (not @t3))) % 0.29/0.55 (define @t26 () (forall @t14 @t25)) % 0.29/0.55 (define @t27 () (@list @t1)) % 0.29/0.55 (define @t28 () (not (forall @t9 (not @t8)))) % 0.29/0.55 (define @t29 () (forall @t11 @t28)) % 0.29/0.55 (define @t30 () (forall @t14 @t29)) % 0.29/0.55 (define @t31 () (and @t30 @t26)) % 0.29/0.55 (define @t32 () (not @t25)) % 0.29/0.55 (define @t33 () (=> @t29 @t32)) % 0.29/0.55 (define @t34 () (forall @t14 (not @t33))) % 0.29/0.55 (define @t35 () (not @t34)) % 0.29/0.55 (define @t36 () (@const 0 $$unsorted)) % 0.29/0.55 (define @t37 () (forall @t9 (not (tptp.p @t36 @t36 @t6)))) % 0.29/0.55 (define @t38 () (@quantifiers_skolemize @t37 0)) % 0.29/0.55 (define @t39 () (tptp.p @t36 @t36 @t38)) % 0.29/0.55 (define @t40 () (not @t37)) % 0.29/0.55 (define @t41 () (not @t39)) % 0.29/0.55 (define @t42 () (not @t41)) % 0.29/0.55 (assume @p1 @t16) % 0.29/0.55 (assume @p2 true) % 0.29/0.55 (step @p3 :rule bool-double-not-elim :args ((and @t22 @t19))) % 0.29/0.55 (step @p4 :rule quant-merge-prenex :args ((= @t23 @t19))) % 0.29/0.55 (step @p5 :rule quant-merge-prenex :args ((= @t24 @t22))) % 0.29/0.55 (step @p6 :rule nary_cong :premises (@p5 @p4) :args ((and @t24 @t23))) % 0.29/0.55 (step @p7 :rule alpha_equiv :args (@t26 @t27 (@list @t17))) % 0.29/0.55 (step @p8 :rule alpha_equiv :args (@t30 @t27 (@list @t20))) % 0.29/0.55 (step @p9 :rule nary_cong :premises (@p8 @p7) :args (@t31)) % 0.29/0.55 (step @p10 :rule quant-miniscope-and :args ((= (forall @t14 (and @t29 @t25)) @t31))) % 0.29/0.55 (step @p11 :rule trans :premises (@p10 @p9)) % 0.29/0.55 (step @p12 :rule trans :premises (@p11 @p6)) % 0.29/0.55 (step @p13 :rule bool-double-not-elim :args (@t25)) % 0.29/0.55 (step @p14 :rule refl :args (@t29)) % 0.29/0.55 (step @p15 :rule nary_cong :premises (@p14 @p13) :args ((and @t29 (not @t32)))) % 0.29/0.55 (step @p16 :rule bool-implies-de-morgan :args (@t29 @t32)) % 0.29/0.55 (step @p17 :rule trans :premises (@p16 @p15)) % 0.29/0.55 (step @p18 :rule cong :premises (@p17) :args (@t34)) % 0.29/0.55 (step @p19 :rule trans :premises (@p18 @p12)) % 0.29/0.55 (step @p20 :rule cong :premises (@p19) :args (@t35)) % 0.29/0.55 (step @p21 :rule exists-elim :args ((= (exists @t14 @t33) @t35))) % 0.29/0.55 (step @p22 :rule trans :premises (@p21 @p20)) % 0.29/0.55 (step @p23 :rule exists-elim :args ((= @t5 @t32))) % 0.29/0.55 (step @p24 :rule exists-elim :args ((= @t10 @t28))) % 0.29/0.55 (step @p25 :rule cong :premises (@p24) :args (@t12)) % 0.29/0.55 (step @p26 :rule cong :premises (@p25 @p23) :args (@t13)) % 0.29/0.55 (step @p27 :rule cong :premises (@p26) :args (@t15)) % 0.29/0.55 (step @p28 :rule trans :premises (@p27 @p22)) % 0.29/0.55 (step @p29 :rule cong :premises (@p28) :args (@t16)) % 0.29/0.55 (step @p30 :rule trans :premises (@p29 @p3)) % 0.29/0.55 (step @p31 :rule eq_resolve :premises (@p1 @p30)) % 0.29/0.55 (step @p32 :rule and_elim :premises (@p31) :args (1)) % 0.29/0.55 (step @p33 :rule and_elim :premises (@p31) :args (0)) % 0.29/0.55 (step @p34 :rule instantiate :premises (@p33) :args ((@list @t36 @t36))) % 0.29/0.55 (step @p35 :rule refl :args (@t39)) % 0.29/0.55 (step @p36 :rule bool-double-not-elim :args (@t37)) % 0.29/0.55 (step @p37 :rule nary_cong :premises (@p36 @p35) :args ((or (not @t40) @t39))) % 0.29/0.55 (step @p38 :rule bool-double-not-elim :args (@t39)) % 0.29/0.55 (step @p39 :rule refl :args (@t40)) % 0.29/0.55 (step @p40 :rule cong :premises (@p39 @p38) :args ((=> @t40 @t42))) % 0.29/0.55 (assume-push @p55 @t40) % 0.29/0.55 (step @p42 :rule skolemize :premises (@p34)) % 0.29/0.55 (step-pop @p56 :rule scope :premises (@p42)) % 0.29/0.55 (step @p43 :rule process_scope :premises (@p56) :args (@t42)) % 0.29/0.55 (step @p45 :rule eq_resolve :premises (@p43 @p40)) % 0.29/0.55 (step @p46 :rule implies_elim :premises (@p45)) % 0.29/0.55 (step @p47 :rule eq_resolve :premises (@p46 @p37)) % 0.29/0.55 (step @p48 :rule chain_m_resolution :premises (@p47 @p34) :args (@t39 (@list true) (@list @t37))) % 0.29/0.55 (assume-push @p57 @t19) % 0.29/0.55 (step @p50 :rule instantiate :premises (@p32) :args ((@list @t38 @t36))) % 0.29/0.55 (step-pop @p58 :rule scope :premises (@p50)) % 0.29/0.55 (step @p51 :rule process_scope :premises (@p58) :args (@t41)) % 0.29/0.55 (step @p53 :rule implies_elim :premises (@p51)) % 0.29/0.55 (step @p54 false :rule chain_m_resolution :premises (@p53 @p48 @p32) :args (false (@list false false) (@list @t39 @t19))) % 0.29/0.55 ) % 0.29/0.55 % SZS output end Proof % 0.29/0.55 % cvc5 exiting %------------------------------------------------------------------------------