%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SYN992^1 : TPTP v9.2.1. Bugfixed 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 : n029.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:10:14 AM UTC 2026 % Result : Theorem 0.47s 0.66s % Output : Proof 0.47s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.13 % Problem : SYN992^1 : TPTP v9.2.1. Bugfixed v4.0.0. % 0.11/0.14 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.18/0.35 % Computer : n029.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 : Tue Jun 2 23:51:17 EDT 2026 % 0.18/0.35 % CPUTime : % 0.33/0.51 %----Proving TH0 % 0.47/0.66 --- 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.47/0.66 % SZS status Theorem % 0.47/0.66 % SZS output start Proof % 0.47/0.66 ( % 0.47/0.66 (declare-sort $$unsorted 0) % 0.47/0.66 (define tptp.refl () (let ((_let_1 (@var "X" $$unsorted))) (let ((_let_2 (@var "R" (-> $$unsorted $$unsorted Bool)))) (lambda (@list _let_2) (forall (@list _let_1) (_ (_ _let_2 _let_1) _let_1)))))) % 0.47/0.66 (define @t1 () (@var "R" (-> $$unsorted $$unsorted Bool))) % 0.47/0.66 (define @t2 () (@list @t1)) % 0.47/0.66 (define @t3 () (exists @t2 (_ tptp.refl @t1))) % 0.47/0.66 (define @t4 () (not @t3)) % 0.47/0.66 (define @t5 () (@var "X" $$unsorted)) % 0.47/0.66 (define @t6 () (_ (_ @t1 @t5) @t5)) % 0.47/0.66 (define @t7 () (@list @t5)) % 0.47/0.66 (define @t8 () (forall @t7 @t6)) % 0.47/0.66 (define @t9 () (lambda @t2 @t8)) % 0.47/0.66 (define @t10 () (_ @t1 @t5 @t5)) % 0.47/0.66 (define @t11 () (forall @t7 @t10)) % 0.47/0.66 (define @t12 () (forall @t2 (not @t11))) % 0.47/0.66 (define @t13 () (_ (lambda @t2 @t11) @t1)) % 0.47/0.66 (define @t14 () (exists @t2 @t13)) % 0.47/0.66 (define @t15 () (lambda (@list (@var "BOUND_VARIABLE_28493" $$unsorted) (@var "BOUND_VARIABLE_28494" $$unsorted)) true)) % 0.47/0.66 (define @t16 () (_ @t15 @t5 @t5)) % 0.47/0.66 (define @t17 () (forall @t7 @t16)) % 0.47/0.66 (define @t18 () (not @t17)) % 0.47/0.66 (assume @p1 @t4) % 0.47/0.66 (assume @p2 true) % 0.47/0.66 (step @p3 (= tptp.refl @t9) :rule refl :args (@t9)) % 0.47/0.66 (step @p4 :rule bool-double-not-elim :args (@t12)) % 0.47/0.66 (step @p5 :rule exists-elim :args ((= (exists @t2 @t11) (not @t12)))) % 0.47/0.66 (step @p6 :rule beta-reduce :args ((= @t13 @t11))) % 0.47/0.66 (step @p7 :rule cong :premises (@p6) :args (@t14)) % 0.47/0.66 (step @p8 :rule trans :premises (@p7 @p5)) % 0.47/0.66 (step @p9 :rule cong :premises (@p8) :args ((not @t14))) % 0.47/0.66 (step @p10 :rule trans :premises (@p9 @p4)) % 0.47/0.66 (step @p11 :rule refl :args (@t1)) % 0.47/0.66 (step @p12 :rule refl :args (@t10)) % 0.47/0.66 (step @p13 :rule refl :args (@t6)) % 0.47/0.66 (step @p14 :rule cong :premises (@p13 @p12) :args ((= @t6 @t10))) % 0.47/0.66 (step @p15 :rule symm :premises (@p14)) % 0.47/0.66 (step @p16 :rule eq_resolve :premises (@p13 @p15)) % 0.47/0.66 (step @p17 :rule cong :premises (@p16) :args (@t8)) % 0.47/0.66 (step @p18 :rule cong :premises (@p17) :args (@t9)) % 0.47/0.66 (step @p19 :rule trans :premises (@p3 @p18)) % 0.47/0.66 (step @p20 :rule ho_cong :premises (@p19 @p11)) % 0.47/0.66 (step @p21 :rule cong :premises (@p20) :args (@t3)) % 0.47/0.66 (step @p22 :rule cong :premises (@p21) :args (@t4)) % 0.47/0.66 (step @p23 :rule trans :premises (@p22 @p10)) % 0.47/0.66 (step @p24 :rule eq_resolve :premises (@p1 @p23)) % 0.47/0.66 (step @p25 :rule bool-impl-false1 :args (@t12)) % 0.47/0.66 (step @p26 :rule evaluate :args ((not true))) % 0.47/0.66 (step @p27 :rule quant-unused-vars :args ((= (forall @t7 true) true))) % 0.47/0.66 (step @p28 :rule beta-reduce :args ((= @t16 true))) % 0.47/0.66 (step @p29 :rule cong :premises (@p28) :args (@t17)) % 0.47/0.66 (step @p30 :rule trans :premises (@p29 @p27)) % 0.47/0.66 (step @p31 :rule cong :premises (@p30) :args (@t18)) % 0.47/0.66 (step @p32 :rule trans :premises (@p31 @p26)) % 0.47/0.66 (step @p33 :rule refl :args (@t12)) % 0.47/0.66 (step @p34 :rule cong :premises (@p33 @p32) :args ((=> @t12 @t18))) % 0.47/0.66 (step @p35 :rule trans :premises (@p34 @p25)) % 0.47/0.66 (assume-push @p42 @t12) % 0.47/0.66 (step @p37 :rule instantiate :premises (@p24) :args ((@list @t15))) % 0.47/0.66 (step-pop @p43 :rule scope :premises (@p37)) % 0.47/0.66 (step @p38 :rule process_scope :premises (@p43) :args (@t18)) % 0.47/0.66 (step @p40 :rule eq_resolve :premises (@p38 @p35)) % 0.47/0.66 (step @p41 false :rule chain_m_resolution :premises (@p40 @p24) :args (false (@list false) (@list @t12))) % 0.47/0.66 ) % 0.47/0.66 % SZS output end Proof % 0.47/0.66 % cvc5 exiting %------------------------------------------------------------------------------