%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SYO355^5 : TPTP v9.2.1. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % Computer : n010.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:12:29 AM UTC 2026 % Result : Theorem 0.31s 0.54s % Output : Proof 0.31s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SYO355^5 : TPTP v9.2.1. Released v4.0.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 : n010.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 : Wed Jun 3 00:05:25 EDT 2026 % 0.16/0.34 % CPUTime : % 0.31/0.49 %----Proving TH0 % 0.31/0.54 --- Run --mbqi --mbqi-enum --mbqi-enum-choice-grammar --mbqi-enum-global-syms-grammar --sygus-grammar-ho-partial --no-cegqi --no-sygus-inst at 90s... % 0.31/0.54 % SZS status Theorem % 0.31/0.54 % SZS output start Proof % 0.31/0.54 ( % 0.31/0.54 (declare-sort $$unsorted 0) % 0.31/0.54 (define @t1 () (@var "Xg" (-> $$unsorted $$unsorted))) % 0.31/0.54 (define @t2 () (@var "Xf" (-> $$unsorted $$unsorted))) % 0.31/0.54 (define @t3 () (forall (@list @t2 @t1) (= @t2 @t1))) % 0.31/0.54 (define @t4 () (@var "Xb" $$unsorted)) % 0.31/0.54 (define @t5 () (@var "Xa" $$unsorted)) % 0.31/0.54 (define @t6 () (forall (@list @t5 @t4) (= @t5 @t4))) % 0.31/0.54 (define @t7 () (@const 0 $$unsorted)) % 0.31/0.54 (define @t8 () (@quantifiers_skolemize @t3 1)) % 0.31/0.54 (define @t9 () (_ @t8 @t7)) % 0.31/0.54 (define @t10 () (@quantifiers_skolemize @t3 0)) % 0.31/0.54 (define @t11 () (_ @t10 @t7)) % 0.31/0.54 (define @t12 () (= @t11 @t9)) % 0.31/0.54 (define @t13 () (not @t12)) % 0.31/0.54 (define @t14 () (= @t10 @t8)) % 0.31/0.54 (define @t15 () (= @t9 @t11)) % 0.31/0.54 (assume @p1 (not (=> @t6 @t3))) % 0.31/0.54 (assume @p2 true) % 0.31/0.54 (step @p3 :rule not_implies_elim1 :premises (@p1)) % 0.31/0.54 (step @p4 :rule not_implies_elim2 :premises (@p1)) % 0.31/0.54 (step @p5 :rule skolemize :premises (@p4)) % 0.31/0.54 ; WARNING: add trust step for TRUST % 0.31/0.54 ; trust TRUST THEORY_LEMMA % 0.31/0.54 (step @p6 :rule trust :premises () :args ((or @t14 @t13))) % 0.31/0.54 (step @p7 :rule chain_m_resolution :premises (@p6 @p5) :args (@t13 (@list true) (@list @t14))) % 0.31/0.54 (step @p8 :rule eq-symm :args (@t9 @t11)) % 0.31/0.54 (step @p9 :rule refl :args (@t6)) % 0.31/0.54 (step @p10 :rule cong :premises (@p9 @p8) :args ((=> @t6 @t15))) % 0.31/0.54 (assume-push @p18 @t6) % 0.31/0.54 (step @p12 :rule instantiate :premises (@p3) :args ((@list @t9 @t11))) % 0.31/0.54 (step-pop @p19 :rule scope :premises (@p12)) % 0.31/0.54 (step @p13 :rule process_scope :premises (@p19) :args (@t15)) % 0.31/0.54 (step @p15 :rule eq_resolve :premises (@p13 @p10)) % 0.31/0.54 (step @p16 :rule implies_elim :premises (@p15)) % 0.31/0.54 (step @p17 false :rule chain_m_resolution :premises (@p16 @p7 @p3) :args (false (@list true false) (@list @t12 @t6))) % 0.31/0.54 ) % 0.31/0.54 % SZS output end Proof % 0.31/0.54 % cvc5 exiting %------------------------------------------------------------------------------