%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SYO526^1 : TPTP v9.2.1. Released v5.2.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % Computer : n006.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:13:04 AM UTC 2026 % Result : Theorem 0.30s 0.56s % Output : Proof 0.30s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.13 % Problem : SYO526^1 : TPTP v9.2.1. Released v5.2.0. % 0.12/0.14 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.18/0.35 % Computer : n006.cluster.edu % 0.18/0.35 % Model : x86_64 x86_64 % 0.18/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.18/0.35 % Memory : 8042.1875MB % 0.18/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.18/0.35 % CPULimit : 300 % 0.18/0.35 % WCLimit : 300 % 0.18/0.35 % DateTime : Wed Jun 3 00:19:19 EDT 2026 % 0.18/0.35 % CPUTime : % 0.30/0.51 %----Proving TH0 % 0.30/0.56 --- 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.30/0.56 % SZS status Theorem % 0.30/0.56 % SZS output start Proof % 0.30/0.56 ( % 0.30/0.56 (declare-sort $$unsorted 0) % 0.30/0.56 (declare-const tptp.a Bool) % 0.30/0.56 (declare-const tptp.g (-> $$unsorted Bool)) % 0.30/0.56 (declare-const tptp.b Bool) % 0.30/0.56 (define tptp.f () (lambda (@list (@var "X" $$unsorted)) tptp.a)) % 0.30/0.56 (define @t1 () (= tptp.f tptp.g)) % 0.30/0.56 (define @t2 () (@list (@var "X" $$unsorted))) % 0.30/0.56 (define @t3 () (lambda @t2 tptp.b)) % 0.30/0.56 (define @t4 () (= tptp.g @t3)) % 0.30/0.56 (define @t5 () (not @t4)) % 0.30/0.56 (define @t6 () (lambda @t2 tptp.a)) % 0.30/0.56 (assume @p1 (= tptp.a tptp.b)) % 0.30/0.56 (assume @p2 @t1) % 0.30/0.56 (assume @p3 @t5) % 0.30/0.56 (assume @p4 true) % 0.30/0.56 (step @p5 (= tptp.f @t6) :rule refl :args (@t6)) % 0.30/0.56 (step @p6 :rule evaluate :args ((not true))) % 0.30/0.56 (step @p7 :rule eq-refl :args (@t3)) % 0.30/0.56 (step @p8 :rule cong :premises (@p7) :args ((not (= @t3 @t3)))) % 0.30/0.56 (step @p9 :rule trans :premises (@p8 @p6)) % 0.30/0.56 (step @p10 :rule refl :args (@t3)) % 0.30/0.56 (step @p11 :rule cong :premises (@p1) :args (@t6)) % 0.30/0.56 (step @p12 :rule refl :args (tptp.g)) % 0.30/0.56 (step @p13 :rule cong :premises (@p12 @p11) :args ((= tptp.g @t6))) % 0.30/0.56 (step @p14 :rule eq-symm :args (@t6 tptp.g)) % 0.30/0.56 (step @p15 :rule cong :premises (@p5 @p12) :args (@t1)) % 0.30/0.56 (step @p16 :rule trans :premises (@p15 @p14)) % 0.30/0.56 (step @p17 :rule eq_resolve :premises (@p2 @p16)) % 0.30/0.56 (step @p18 :rule eq_resolve :premises (@p17 @p13)) % 0.30/0.56 (step @p19 :rule cong :premises (@p18 @p10) :args (@t4)) % 0.30/0.56 (step @p20 :rule cong :premises (@p19) :args (@t5)) % 0.30/0.56 (step @p21 :rule trans :premises (@p20 @p9)) % 0.30/0.56 (step @p22 false :rule eq_resolve :premises (@p3 @p21)) % 0.30/0.56 ) % 0.30/0.56 % SZS output end Proof % 0.30/0.56 % cvc5 exiting %------------------------------------------------------------------------------