%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SYN998^1 : TPTP v9.2.1. Released v3.7.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % Computer : n027.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.34s 0.57s % Output : Proof 0.34s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.13 % Problem : SYN998^1 : TPTP v9.2.1. Released v3.7.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 : n027.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:36 EDT 2026 % 0.18/0.35 % CPUTime : % 0.34/0.51 %----Proving TH0 % 0.34/0.57 --- 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.34/0.57 % SZS status Theorem % 0.34/0.57 % SZS output start Proof % 0.34/0.57 ( % 0.34/0.57 (declare-sort $$unsorted 0) % 0.34/0.57 (define tptp.leibeq () (let ((_let_1 (@var "Y" $$unsorted))) (let ((_let_2 (@var "P" (-> $$unsorted Bool)))) (let ((_let_3 (@var "X" $$unsorted))) (lambda (@list _let_3 _let_1) (forall (@list _let_2) (=> (_ _let_2 _let_3) (_ _let_2 _let_1)))))))) % 0.34/0.57 (define @t1 () (@var "X" $$unsorted)) % 0.34/0.57 (define @t2 () (@list @t1)) % 0.34/0.57 (define @t3 () (forall @t2 (_ (_ tptp.leibeq @t1) @t1))) % 0.34/0.57 (define @t4 () (not @t3)) % 0.34/0.57 (define @t5 () (@var "Y" $$unsorted)) % 0.34/0.57 (define @t6 () (@var "P" (-> $$unsorted Bool))) % 0.34/0.57 (define @t7 () (_ @t6 @t5)) % 0.34/0.57 (define @t8 () (_ @t6 @t1)) % 0.34/0.57 (define @t9 () (@list @t6)) % 0.34/0.57 (define @t10 () (forall @t9 (=> @t8 @t7))) % 0.34/0.57 (define @t11 () (@list @t1 @t5)) % 0.34/0.57 (define @t12 () (lambda @t11 @t10)) % 0.34/0.57 (define @t13 () (_ @t6 @t1)) % 0.34/0.57 (define @t14 () (not @t13)) % 0.34/0.57 (define @t15 () (forall @t9 (or @t14 @t13))) % 0.34/0.57 (define @t16 () (_ @t6 @t5)) % 0.34/0.57 (define @t17 () (forall @t9 (or @t14 @t16))) % 0.34/0.57 (define @t18 () (lambda (@list @t5) @t17)) % 0.34/0.57 (define @t19 () (_ (lambda @t11 @t17) @t1)) % 0.34/0.57 (define @t20 () (forall @t2 (_ @t19 @t1))) % 0.34/0.57 (define @t21 () (not @t8)) % 0.34/0.57 (define @t22 () (or @t21 @t7)) % 0.34/0.57 (assume @p1 @t4) % 0.34/0.57 (assume @p2 true) % 0.34/0.57 (step @p3 (= tptp.leibeq @t12) :rule refl :args (@t12)) % 0.34/0.57 (step @p4 :rule evaluate :args ((not true))) % 0.34/0.57 (step @p5 :rule quant-unused-vars :args ((= (forall @t2 true) true))) % 0.34/0.57 (step @p6 :rule quant-unused-vars :args ((= (forall @t9 true) true))) % 0.34/0.57 (step @p7 :rule bool-or-taut2 :args (false @t13 false false)) % 0.34/0.57 (step @p8 :rule cong :premises (@p7) :args (@t15)) % 0.34/0.57 (step @p9 :rule trans :premises (@p8 @p6)) % 0.34/0.57 (step @p10 :rule beta-reduce :args ((= (_ @t18 @t1) @t15))) % 0.34/0.57 (step @p11 :rule trans :premises (@p10 @p9)) % 0.34/0.57 (step @p12 :rule refl :args (@t1)) % 0.34/0.57 (step @p13 :rule beta-reduce :args ((= @t19 @t18))) % 0.34/0.57 (step @p14 :rule ho_cong :premises (@p13 @p12)) % 0.34/0.57 (step @p15 :rule trans :premises (@p14 @p11)) % 0.34/0.57 (step @p16 :rule cong :premises (@p15) :args (@t20)) % 0.34/0.57 (step @p17 :rule trans :premises (@p16 @p5)) % 0.34/0.57 (step @p18 :rule cong :premises (@p17) :args ((not @t20))) % 0.34/0.57 (step @p19 :rule trans :premises (@p18 @p4)) % 0.34/0.57 (step @p20 :rule refl :args (@t16)) % 0.34/0.57 (step @p21 :rule refl :args (@t7)) % 0.34/0.57 (step @p22 :rule cong :premises (@p21 @p20) :args ((= @t7 @t16))) % 0.34/0.57 (step @p23 :rule symm :premises (@p22)) % 0.34/0.57 (step @p24 :rule eq_resolve :premises (@p21 @p23)) % 0.34/0.57 (step @p25 :rule refl :args (@t13)) % 0.34/0.57 (step @p26 :rule refl :args (@t8)) % 0.34/0.57 (step @p27 :rule cong :premises (@p26 @p25) :args ((= @t8 @t13))) % 0.34/0.57 (step @p28 :rule symm :premises (@p27)) % 0.34/0.57 (step @p29 :rule eq_resolve :premises (@p26 @p28)) % 0.34/0.57 (step @p30 :rule cong :premises (@p29) :args (@t21)) % 0.34/0.57 (step @p31 :rule nary_cong :premises (@p30 @p24) :args (@t22)) % 0.34/0.57 (step @p32 :rule cong :premises (@p31) :args ((forall @t9 @t22))) % 0.34/0.57 (step @p33 :rule bool-impl-elim :args (@t8 @t7)) % 0.34/0.57 (step @p34 :rule cong :premises (@p33) :args (@t10)) % 0.34/0.57 (step @p35 :rule trans :premises (@p34 @p32)) % 0.34/0.57 (step @p36 :rule cong :premises (@p35) :args (@t12)) % 0.34/0.57 (step @p37 :rule trans :premises (@p3 @p36)) % 0.34/0.57 (step @p38 :rule ho_cong :premises (@p37 @p12)) % 0.34/0.57 (step @p39 :rule ho_cong :premises (@p38 @p12)) % 0.34/0.57 (step @p40 :rule cong :premises (@p39) :args (@t3)) % 0.34/0.57 (step @p41 :rule cong :premises (@p40) :args (@t4)) % 0.34/0.57 (step @p42 :rule trans :premises (@p41 @p19)) % 0.34/0.57 (step @p43 false :rule eq_resolve :premises (@p1 @p42)) % 0.34/0.57 ) % 0.34/0.57 % SZS output end Proof % 0.34/0.57 % cvc5 exiting %------------------------------------------------------------------------------