%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : LCL580^1 : TPTP v9.3.1. Released v3.6.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % Computer : n026.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8046.5625MB % OS : Linux 6.8.0-71-generic % CPULimit : 300s % WCLimit : 300s % DateTime : Mon Sep 7 11:23:06 AM UTC 2026 % Result : Theorem 0.20s 0.51s % Output : Proof 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL580^1 : TPTP v9.3.1. Released v3.6.0. % 0.00/0.04 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.11/0.36 % Computer : n026.cluster.edu % 0.11/0.36 % Model : x86_64 x86_64 % 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.36 % Memory : 8046.5625MB % 0.11/0.36 % OS : Linux 6.8.0-71-generic % 0.11/0.36 % CPULimit : 300 % 0.11/0.36 % WCLimit : 300 % 0.11/0.37 % DateTime : Sun Sep 6 00:53:56 UTC 2026 % 0.11/0.37 % CPUTime : % 0.11/0.44 %----Proving TH0 % 0.20/0.51 --- 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.20/0.51 % SZS status Theorem % 0.20/0.51 % SZS output start Proof % 0.20/0.51 ( % 0.20/0.51 (declare-sort $$unsorted 0) % 0.20/0.51 (declare-sort tptp.individuals 0) % 0.20/0.51 (declare-const tptp.r (-> $$unsorted $$unsorted Bool)) % 0.20/0.51 (define tptp.mfalse () (lambda (@list (@var "X" $$unsorted)) false)) % 0.20/0.51 (define tptp.mtrue () (lambda (@list (@var "X" $$unsorted)) true)) % 0.20/0.51 (define tptp.mnot () (let ((_let_1 (@var "U" $$unsorted))) (let ((_let_2 (@var "X" (-> $$unsorted Bool)))) (lambda (@list _let_2 _let_1) (not (_ _let_2 _let_1)))))) % 0.20/0.51 (define tptp.mor () (let ((_let_1 (@var "U" $$unsorted))) (let ((_let_2 (@var "Y" (-> $$unsorted Bool)))) (let ((_let_3 (@var "X" (-> $$unsorted Bool)))) (lambda (@list _let_3 _let_2 _let_1) (or (_ _let_3 _let_1) (_ _let_2 _let_1))))))) % 0.20/0.51 (define tptp.mand () (let ((_let_1 (@var "U" $$unsorted))) (let ((_let_2 (@var "Y" (-> $$unsorted Bool)))) (let ((_let_3 (@var "X" (-> $$unsorted Bool)))) (lambda (@list _let_3 _let_2 _let_1) (and (_ _let_3 _let_1) (_ _let_2 _let_1))))))) % 0.20/0.51 (define tptp.mimpl () (let ((_let_1 (@var "__flatten_var_0" $$unsorted))) (let ((_let_2 (@var "V" (-> $$unsorted Bool)))) (let ((_let_3 (@var "U" (-> $$unsorted Bool)))) (lambda (@list _let_3 _let_2 _let_1) (_ (_ (_ tptp.mor (_ tptp.mnot _let_3)) _let_2) _let_1)))))) % 0.20/0.51 (define tptp.miff () (let ((_let_1 (@var "__flatten_var_0" $$unsorted))) (let ((_let_2 (@var "U" (-> $$unsorted Bool)))) (let ((_let_3 (@var "V" (-> $$unsorted Bool)))) (lambda (@list _let_2 _let_3 _let_1) (_ (_ (_ tptp.mand (_ (_ tptp.mimpl _let_2) _let_3)) (_ (_ tptp.mimpl _let_3) _let_2)) _let_1)))))) % 0.20/0.51 (define tptp.mbox () (let ((_let_1 (@var "Y" $$unsorted))) (let ((_let_2 (@var "P" (-> $$unsorted Bool)))) (let ((_let_3 (@var "X" $$unsorted))) (let ((_let_4 (@var "R" (-> $$unsorted $$unsorted Bool)))) (lambda (@list _let_4 _let_2 _let_3) (forall (@list _let_1) (=> (_ (_ _let_4 _let_3) _let_1) (_ _let_2 _let_1))))))))) % 0.20/0.51 (define tptp.mdia () (let ((_let_1 (@var "Y" $$unsorted))) (let ((_let_2 (@var "P" (-> $$unsorted Bool)))) (let ((_let_3 (@var "X" $$unsorted))) (let ((_let_4 (@var "R" (-> $$unsorted $$unsorted Bool)))) (lambda (@list _let_4 _let_2 _let_3) (exists (@list _let_1) (and (_ (_ _let_4 _let_3) _let_1) (_ _let_2 _let_1))))))))) % 0.20/0.51 (define tptp.mall () (let ((_let_1 (@var "W" $$unsorted))) (let ((_let_2 (@var "X" tptp.individuals))) (let ((_let_3 (@var "P" (-> tptp.individuals $$unsorted Bool)))) (lambda (@list _let_3 _let_1) (forall (@list _let_2) (_ (_ _let_3 _let_2) _let_1))))))) % 0.20/0.51 (define tptp.mexists () (let ((_let_1 (@var "W" $$unsorted))) (let ((_let_2 (@var "X" tptp.individuals))) (let ((_let_3 (@var "P" (-> tptp.individuals $$unsorted Bool)))) (lambda (@list _let_3 _let_1) (exists (@list _let_2) (_ (_ _let_3 _let_2) _let_1))))))) % 0.20/0.51 (define tptp.mvalid () (let ((_let_1 (@var "W" $$unsorted))) (let ((_let_2 (@var "P" (-> $$unsorted Bool)))) (lambda (@list _let_2) (forall (@list _let_1) (_ _let_2 _let_1)))))) % 0.20/0.51 (define tptp.msatisfiable () (let ((_let_1 (@var "W" $$unsorted))) (let ((_let_2 (@var "P" (-> $$unsorted Bool)))) (lambda (@list _let_2) (exists (@list _let_1) (_ _let_2 _let_1)))))) % 0.20/0.51 (define tptp.mcountersatisfiable () (let ((_let_1 (@var "W" $$unsorted))) (let ((_let_2 (@var "P" (-> $$unsorted Bool)))) (lambda (@list _let_2) (exists (@list _let_1) (not (_ _let_2 _let_1))))))) % 0.20/0.51 (define tptp.minvalid () (let ((_let_1 (@var "W" $$unsorted))) (let ((_let_2 (@var "P" (-> $$unsorted Bool)))) (lambda (@list _let_2) (forall (@list _let_1) (not (_ _let_2 _let_1))))))) % 0.20/0.51 (define @t1 () (not (_ tptp.mvalid (_ (_ tptp.mbox tptp.r) tptp.mtrue)))) % 0.20/0.51 (define @t2 () (@var "X" $$unsorted)) % 0.20/0.51 (define @t3 () (@list @t2)) % 0.20/0.51 (define @t4 () (lambda @t3 false)) % 0.20/0.51 (define @t5 () (lambda @t3 true)) % 0.20/0.51 (define @t6 () (@var "U" $$unsorted)) % 0.20/0.51 (define @t7 () (@var "X" (-> $$unsorted Bool))) % 0.20/0.51 (define @t8 () (_ @t7 @t6)) % 0.20/0.51 (define @t9 () (lambda (@list @t7 @t6) (not @t8))) % 0.20/0.51 (define @t10 () (@var "Y" (-> $$unsorted Bool))) % 0.20/0.51 (define @t11 () (_ @t10 @t6)) % 0.20/0.51 (define @t12 () (@list @t7 @t10 @t6)) % 0.20/0.51 (define @t13 () (lambda @t12 (or @t8 @t11))) % 0.20/0.51 (define @t14 () (lambda @t12 (and @t8 @t11))) % 0.20/0.51 (define @t15 () (@var "__flatten_var_0" $$unsorted)) % 0.20/0.51 (define @t16 () (@var "V" (-> $$unsorted Bool))) % 0.20/0.51 (define @t17 () (@var "U" (-> $$unsorted Bool))) % 0.20/0.51 (define @t18 () (@list @t17 @t16 @t15)) % 0.20/0.51 (define @t19 () (lambda @t18 (_ (_ (_ tptp.mor (_ tptp.mnot @t17)) @t16) @t15))) % 0.20/0.51 (define @t20 () (lambda @t18 (_ (_ (_ tptp.mand (_ (_ tptp.mimpl @t17) @t16)) (_ (_ tptp.mimpl @t16) @t17)) @t15))) % 0.20/0.51 (define @t21 () (@var "Y" $$unsorted)) % 0.20/0.51 (define @t22 () (@var "P" (-> $$unsorted Bool))) % 0.20/0.51 (define @t23 () (_ @t22 @t21)) % 0.20/0.51 (define @t24 () (@var "R" (-> $$unsorted $$unsorted Bool))) % 0.20/0.51 (define @t25 () (_ (_ @t24 @t2) @t21)) % 0.20/0.51 (define @t26 () (@list @t21)) % 0.20/0.51 (define @t27 () (forall @t26 (=> @t25 @t23))) % 0.20/0.51 (define @t28 () (@list @t24 @t22 @t2)) % 0.20/0.51 (define @t29 () (lambda @t28 @t27)) % 0.20/0.51 (define @t30 () (lambda @t28 (exists @t26 (and @t25 @t23)))) % 0.20/0.51 (define @t31 () (@var "W" $$unsorted)) % 0.20/0.51 (define @t32 () (@var "X" tptp.individuals)) % 0.20/0.51 (define @t33 () (@var "P" (-> tptp.individuals $$unsorted Bool))) % 0.20/0.51 (define @t34 () (_ (_ @t33 @t32) @t31)) % 0.20/0.51 (define @t35 () (@list @t32)) % 0.20/0.51 (define @t36 () (@list @t33 @t31)) % 0.20/0.51 (define @t37 () (lambda @t36 (forall @t35 @t34))) % 0.20/0.51 (define @t38 () (lambda @t36 (exists @t35 @t34))) % 0.20/0.51 (define @t39 () (_ @t22 @t31)) % 0.20/0.51 (define @t40 () (@list @t31)) % 0.20/0.51 (define @t41 () (forall @t40 @t39)) % 0.20/0.51 (define @t42 () (@list @t22)) % 0.20/0.51 (define @t43 () (lambda @t42 @t41)) % 0.20/0.51 (define @t44 () (lambda @t42 (exists @t40 @t39))) % 0.20/0.51 (define @t45 () (not @t39)) % 0.20/0.51 (define @t46 () (lambda @t42 (exists @t40 @t45))) % 0.20/0.51 (define @t47 () (lambda @t42 (forall @t40 @t45))) % 0.20/0.51 (define @t48 () (@var "BOUND_VARIABLE_7775" $$unsorted)) % 0.20/0.51 (define @t49 () (lambda (@list @t48) true)) % 0.20/0.51 (define @t50 () (_ @t49 @t31)) % 0.20/0.51 (define @t51 () (forall @t40 @t50)) % 0.20/0.51 (define @t52 () (_ @t22 @t31)) % 0.20/0.51 (define @t53 () (lambda @t42 (forall @t40 @t52))) % 0.20/0.51 (define @t54 () (not (tptp.r @t2 @t21))) % 0.20/0.51 (define @t55 () (_ @t49 @t21)) % 0.20/0.51 (define @t56 () (or @t54 @t55)) % 0.20/0.51 (define @t57 () (forall @t26 @t56)) % 0.20/0.51 (define @t58 () (lambda @t3 @t57)) % 0.20/0.51 (define @t59 () (_ @t22 @t21)) % 0.20/0.51 (define @t60 () (lambda (@list @t22 @t2) (forall @t26 (or @t54 @t59)))) % 0.20/0.51 (define @t61 () (_ @t24 @t2 @t21)) % 0.20/0.51 (define @t62 () (_ (lambda @t28 (forall @t26 (or (not @t61) @t59))) tptp.r)) % 0.20/0.51 (define @t63 () (not @t25)) % 0.20/0.51 (define @t64 () (or @t63 @t23)) % 0.20/0.51 (assume @p1 @t1) % 0.20/0.51 (assume @p2 true) % 0.20/0.51 (step @p3 (= tptp.mfalse @t4) :rule refl :args (@t4)) % 0.20/0.51 (step @p4 (= tptp.mtrue @t5) :rule refl :args (@t5)) % 0.20/0.51 (step @p5 (= tptp.mnot @t9) :rule refl :args (@t9)) % 0.20/0.51 (step @p6 (= tptp.mor @t13) :rule refl :args (@t13)) % 0.20/0.51 (step @p7 (= tptp.mand @t14) :rule refl :args (@t14)) % 0.20/0.51 (step @p8 (= tptp.mimpl @t19) :rule refl :args (@t19)) % 0.20/0.51 (step @p9 (= tptp.miff @t20) :rule refl :args (@t20)) % 0.20/0.51 (step @p10 (= tptp.mbox @t29) :rule refl :args (@t29)) % 0.20/0.51 (step @p11 (= tptp.mdia @t30) :rule refl :args (@t30)) % 0.20/0.51 (step @p12 (= tptp.mall @t37) :rule refl :args (@t37)) % 0.20/0.51 (step @p13 (= tptp.mexists @t38) :rule refl :args (@t38)) % 0.20/0.51 (step @p14 (= tptp.mvalid @t43) :rule refl :args (@t43)) % 0.20/0.51 (step @p15 (= tptp.msatisfiable @t44) :rule refl :args (@t44)) % 0.20/0.51 (step @p16 (= tptp.mcountersatisfiable @t46) :rule refl :args (@t46)) % 0.20/0.51 (step @p17 (= tptp.minvalid @t47) :rule refl :args (@t47)) % 0.20/0.51 (step @p18 :rule evaluate :args ((not true))) % 0.20/0.51 (step @p19 :rule quant-unused-vars :args ((= (forall @t40 true) true))) % 0.20/0.51 (step @p20 :rule beta-reduce :args ((= @t50 true))) % 0.20/0.51 (step @p21 :rule cong :premises (@p20) :args (@t51)) % 0.20/0.51 (step @p22 :rule trans :premises (@p21 @p19)) % 0.20/0.51 (step @p23 :rule beta-reduce :args ((= (_ @t53 @t49) @t51))) % 0.20/0.51 (step @p24 :rule trans :premises (@p23 @p22)) % 0.20/0.51 (step @p25 :rule refl :args (@t49)) % 0.20/0.51 (step @p26 :rule symm :premises (@p25)) % 0.20/0.51 (step @p27 :rule alpha_equiv :args (@t5 (@list @t2) (@list @t48))) % 0.20/0.51 (step @p28 :rule trans :premises (@p27 @p26)) % 0.20/0.51 (step @p29 :rule quant-unused-vars :args ((= (forall @t26 true) true))) % 0.20/0.51 (step @p30 :rule absorb :args ((= (or @t54 true) true))) % 0.20/0.51 (step @p31 :rule beta-reduce :args ((= @t55 true))) % 0.20/0.51 (step @p32 :rule refl :args (@t54)) % 0.20/0.51 (step @p33 :rule nary_cong :premises (@p32 @p31) :args (@t56)) % 0.20/0.51 (step @p34 :rule trans :premises (@p33 @p30)) % 0.20/0.51 (step @p35 :rule cong :premises (@p34) :args (@t57)) % 0.20/0.51 (step @p36 :rule trans :premises (@p35 @p29)) % 0.20/0.51 (step @p37 :rule cong :premises (@p36) :args (@t58)) % 0.20/0.51 (step @p38 :rule trans :premises (@p37 @p28)) % 0.20/0.51 (step @p39 :rule beta-reduce :args ((= (_ @t60 @t49) @t58))) % 0.20/0.51 (step @p40 :rule trans :premises (@p39 @p38)) % 0.20/0.51 (step @p41 :rule beta-reduce :args ((= @t62 @t60))) % 0.20/0.51 (step @p42 :rule ho_cong :premises (@p41 @p28)) % 0.20/0.51 (step @p43 :rule trans :premises (@p42 @p40)) % 0.20/0.51 (step @p44 :rule refl :args (@t53)) % 0.20/0.51 (step @p45 :rule ho_cong :premises (@p44 @p43)) % 0.20/0.51 (step @p46 :rule trans :premises (@p45 @p24)) % 0.20/0.51 (step @p47 :rule cong :premises (@p46) :args ((not (_ @t53 (_ @t62 @t5))))) % 0.20/0.51 (step @p48 :rule trans :premises (@p47 @p18)) % 0.20/0.51 (step @p49 :rule refl :args (tptp.r)) % 0.20/0.51 (step @p50 :rule refl :args (@t59)) % 0.20/0.51 (step @p51 :rule refl :args (@t23)) % 0.20/0.51 (step @p52 :rule cong :premises (@p51 @p50) :args ((= @t23 @t59))) % 0.20/0.51 (step @p53 :rule symm :premises (@p52)) % 0.20/0.51 (step @p54 :rule eq_resolve :premises (@p51 @p53)) % 0.20/0.51 (step @p55 :rule refl :args (@t61)) % 0.20/0.51 (step @p56 :rule refl :args (@t25)) % 0.20/0.51 (step @p57 :rule cong :premises (@p56 @p55) :args ((= @t25 @t61))) % 0.20/0.51 (step @p58 :rule symm :premises (@p57)) % 0.20/0.51 (step @p59 :rule eq_resolve :premises (@p56 @p58)) % 0.20/0.51 (step @p60 :rule cong :premises (@p59) :args (@t63)) % 0.20/0.51 (step @p61 :rule nary_cong :premises (@p60 @p54) :args (@t64)) % 0.20/0.51 (step @p62 :rule cong :premises (@p61) :args ((forall @t26 @t64))) % 0.20/0.51 (step @p63 :rule bool-impl-elim :args (@t25 @t23)) % 0.20/0.51 (step @p64 :rule cong :premises (@p63) :args (@t27)) % 0.20/0.51 (step @p65 :rule trans :premises (@p64 @p62)) % 0.20/0.51 (step @p66 :rule cong :premises (@p65) :args (@t29)) % 0.20/0.51 (step @p67 :rule trans :premises (@p10 @p66)) % 0.20/0.51 (step @p68 :rule ho_cong :premises (@p67 @p49)) % 0.20/0.51 (step @p69 :rule ho_cong :premises (@p68 @p4)) % 0.20/0.51 (step @p70 :rule refl :args (@t52)) % 0.20/0.51 (step @p71 :rule refl :args (@t39)) % 0.20/0.51 (step @p72 :rule cong :premises (@p71 @p70) :args ((= @t39 @t52))) % 0.20/0.51 (step @p73 :rule symm :premises (@p72)) % 0.20/0.51 (step @p74 :rule eq_resolve :premises (@p71 @p73)) % 0.20/0.51 (step @p75 :rule cong :premises (@p74) :args (@t41)) % 0.20/0.51 (step @p76 :rule cong :premises (@p75) :args (@t43)) % 0.20/0.51 (step @p77 :rule trans :premises (@p14 @p76)) % 0.20/0.51 (step @p78 :rule ho_cong :premises (@p77 @p69)) % 0.20/0.51 (step @p79 :rule cong :premises (@p78) :args (@t1)) % 0.20/0.51 (step @p80 :rule trans :premises (@p79 @p48)) % 0.20/0.51 (step @p81 false :rule eq_resolve :premises (@p1 @p80)) % 0.20/0.51 ) % 0.20/0.51 % SZS output end Proof % 0.20/0.51 % cvc5 exiting %------------------------------------------------------------------------------