%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SEU918^5 : TPTP v9.2.1. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/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 : 8042.1875MB % OS : Linux 3.10.0-693.el7.x86_64 % CPULimit : 300s % WCLimit : 300s % DateTime : Wed Jun 3 08:53:31 AM UTC 2026 % Result : Theorem 0.44s 0.64s % Output : Proof 0.44s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SEU918^5 : TPTP v9.2.1. Released v4.0.0. % 0.12/0.13 % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % 0.16/0.35 % Computer : n026.cluster.edu % 0.16/0.35 % Model : x86_64 x86_64 % 0.16/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.16/0.35 % Memory : 8042.1875MB % 0.16/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.16/0.35 % CPULimit : 300 % 0.16/0.35 % WCLimit : 300 % 0.16/0.35 % DateTime : Tue Jun 2 18:00:25 EDT 2026 % 0.16/0.35 % CPUTime : % 0.28/0.50 %----Proving TH0 % 0.44/0.64 --- 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.44/0.64 % SZS status Theorem % 0.44/0.64 % SZS output start Proof % 0.44/0.64 ( % 0.44/0.64 (declare-sort $$unsorted 0) % 0.44/0.64 (declare-const tptp.a $$unsorted) % 0.44/0.64 (declare-const tptp.b $$unsorted) % 0.44/0.64 (define @t1 () (@var "Xx" $$unsorted)) % 0.44/0.64 (define @t2 () (@var "Xf" (-> $$unsorted $$unsorted))) % 0.44/0.64 (define @t3 () (_ @t2 @t1)) % 0.44/0.64 (define @t4 () (@var "Xg" (-> $$unsorted $$unsorted))) % 0.44/0.64 (define @t5 () (_ @t4 @t3)) % 0.44/0.64 (define @t6 () (@list @t1)) % 0.44/0.64 (define @t7 () (lambda @t6 @t5)) % 0.44/0.64 (define @t8 () (_ @t4 @t1)) % 0.44/0.64 (define @t9 () (_ @t2 @t8)) % 0.44/0.64 (define @t10 () (lambda @t6 @t9)) % 0.44/0.64 (define @t11 () (= @t10 @t7)) % 0.44/0.64 (define @t12 () (@list @t2 @t4)) % 0.44/0.64 (define @t13 () (forall @t12 @t11)) % 0.44/0.64 (define @t14 () (not @t13)) % 0.44/0.64 (define @t15 () (= tptp.a tptp.b)) % 0.44/0.64 (define @t16 () (not @t15)) % 0.44/0.64 (define @t17 () (=> @t16 @t14)) % 0.44/0.64 (define @t18 () (not @t17)) % 0.44/0.64 (define @t19 () (_ @t2 @t1)) % 0.44/0.64 (define @t20 () (_ @t4 @t19)) % 0.44/0.64 (define @t21 () (_ @t4 @t1)) % 0.44/0.64 (define @t22 () (_ @t2 @t21)) % 0.44/0.64 (define @t23 () (lambda @t6 tptp.b)) % 0.44/0.64 (define @t24 () (@purify @t23)) % 0.44/0.64 (define @t25 () (lambda @t6 tptp.a)) % 0.44/0.64 (define @t26 () (@purify @t25)) % 0.44/0.64 (define @t27 () (= @t23 @t25)) % 0.44/0.64 (define @t28 () (forall @t12 (= (lambda @t6 @t22) (lambda @t6 @t20)))) % 0.44/0.64 (define @t29 () (lambda (@list (@var "BOUND_VARIABLE_15395" $$unsorted)) tptp.a)) % 0.44/0.64 (define @t30 () (lambda (@list (@var "BOUND_VARIABLE_14607" $$unsorted)) tptp.b)) % 0.44/0.64 (define @t31 () (_ @t30 @t1)) % 0.44/0.64 (define @t32 () (_ @t29 @t31)) % 0.44/0.64 (define @t33 () (lambda @t6 @t32)) % 0.44/0.64 (define @t34 () (_ @t29 @t1)) % 0.44/0.64 (define @t35 () (_ @t30 @t34)) % 0.44/0.64 (define @t36 () (lambda @t6 @t35)) % 0.44/0.64 (define @t37 () (= @t36 @t33)) % 0.44/0.64 (define @t38 () (= @t26 @t24)) % 0.44/0.64 (define @t39 () (= tptp.b tptp.a)) % 0.44/0.64 (define @t40 () (forall @t6 @t15)) % 0.44/0.64 (define @t41 () (=> @t38 @t40)) % 0.44/0.64 (assume @p1 @t18) % 0.44/0.64 (assume @p2 true) % 0.44/0.64 (step @p3 :rule refl :args ((_ @t4 @t3))) % 0.44/0.64 (step @p4 :rule refl :args (@t19)) % 0.44/0.64 (step @p5 :rule cong :premises (@p4) :args (@t20)) % 0.44/0.64 (step @p6 :rule trans :premises (@p5 @p3)) % 0.44/0.64 (step @p7 :rule refl :args (@t4)) % 0.44/0.64 (step @p8 :rule ho_cong :premises (@p7 @p4)) % 0.44/0.64 (step @p9 :rule cong :premises (@p8 @p6) :args ((= (_ @t4 @t19) @t20))) % 0.44/0.64 (step @p10 :rule symm :premises (@p9)) % 0.44/0.64 (step @p11 :rule refl :args (@t5)) % 0.44/0.64 (step @p12 :rule eq_resolve :premises (@p11 @p10)) % 0.44/0.64 (step @p13 :rule refl :args (@t3)) % 0.44/0.64 (step @p14 :rule cong :premises (@p13 @p4) :args ((= @t3 @t19))) % 0.44/0.64 (step @p15 :rule symm :premises (@p14)) % 0.44/0.64 (step @p16 :rule eq_resolve :premises (@p13 @p15)) % 0.44/0.64 (step @p17 :rule ho_cong :premises (@p7 @p16)) % 0.44/0.64 (step @p18 :rule trans :premises (@p17 @p12)) % 0.44/0.64 (step @p19 :rule cong :premises (@p18) :args (@t7)) % 0.44/0.64 (step @p20 :rule refl :args ((_ @t2 @t8))) % 0.44/0.64 (step @p21 :rule refl :args (@t21)) % 0.44/0.64 (step @p22 :rule cong :premises (@p21) :args (@t22)) % 0.44/0.64 (step @p23 :rule trans :premises (@p22 @p20)) % 0.44/0.64 (step @p24 :rule refl :args (@t2)) % 0.44/0.64 (step @p25 :rule ho_cong :premises (@p24 @p21)) % 0.44/0.64 (step @p26 :rule cong :premises (@p25 @p23) :args ((= (_ @t2 @t21) @t22))) % 0.44/0.64 (step @p27 :rule symm :premises (@p26)) % 0.44/0.64 (step @p28 :rule refl :args (@t9)) % 0.44/0.64 (step @p29 :rule eq_resolve :premises (@p28 @p27)) % 0.44/0.64 (step @p30 :rule refl :args (@t8)) % 0.44/0.64 (step @p31 :rule cong :premises (@p30 @p21) :args ((= @t8 @t21))) % 0.44/0.64 (step @p32 :rule symm :premises (@p31)) % 0.44/0.64 (step @p33 :rule eq_resolve :premises (@p30 @p32)) % 0.44/0.64 (step @p34 :rule ho_cong :premises (@p24 @p33)) % 0.44/0.64 (step @p35 :rule trans :premises (@p34 @p29)) % 0.44/0.64 (step @p36 :rule cong :premises (@p35) :args (@t10)) % 0.44/0.64 (step @p37 :rule cong :premises (@p36 @p19) :args (@t11)) % 0.44/0.64 (step @p38 :rule cong :premises (@p37) :args (@t13)) % 0.44/0.64 (step @p39 :rule cong :premises (@p38) :args (@t14)) % 0.44/0.64 (step @p40 :rule eq-symm :args (tptp.a tptp.b)) % 0.44/0.64 (step @p41 :rule cong :premises (@p40) :args (@t16)) % 0.44/0.64 (step @p42 :rule cong :premises (@p41 @p39) :args (@t17)) % 0.44/0.64 (step @p43 :rule cong :premises (@p42) :args (@t18)) % 0.44/0.64 (step @p44 :rule eq_resolve :premises (@p1 @p43)) % 0.44/0.64 (step @p45 :rule not_implies_elim1 :premises (@p44)) % 0.44/0.64 (step @p46 :rule not_implies_elim2 :premises (@p44)) % 0.44/0.64 (step @p47 :rule not_not_elim :premises (@p46)) % 0.44/0.64 (step @p48 :rule eq-symm :args (@t24 @t26)) % 0.44/0.64 (step @p49 :rule eq-refl :args (@t25)) % 0.44/0.64 (step @p50 :rule skolem_intro :args (@t26)) % 0.44/0.64 (step @p51 :rule refl :args (@t25)) % 0.44/0.64 (step @p52 :rule cong :premises (@p51 @p50) :args ((= @t25 @t26))) % 0.44/0.64 (step @p53 :rule trans :premises (@p52 @p49)) % 0.44/0.64 (step @p54 :rule true_elim :premises (@p53)) % 0.44/0.64 (step @p55 :rule eq-refl :args (@t23)) % 0.44/0.64 (step @p56 :rule skolem_intro :args (@t24)) % 0.44/0.64 (step @p57 :rule refl :args (@t23)) % 0.44/0.64 (step @p58 :rule cong :premises (@p57 @p56) :args ((= @t23 @t24))) % 0.44/0.64 (step @p59 :rule trans :premises (@p58 @p55)) % 0.44/0.64 (step @p60 :rule true_elim :premises (@p59)) % 0.44/0.64 (step @p61 :rule cong :premises (@p60 @p54) :args (@t27)) % 0.44/0.64 (step @p62 :rule trans :premises (@p61 @p48)) % 0.44/0.64 (step @p63 :rule refl :args (@t28)) % 0.44/0.64 (step @p64 :rule cong :premises (@p63 @p62) :args ((=> @t28 @t27))) % 0.44/0.64 (step @p65 :rule beta-reduce :args ((= (_ @t29 tptp.b) tptp.a))) % 0.44/0.64 (step @p66 :rule beta-reduce :args ((= @t31 tptp.b))) % 0.44/0.64 (step @p67 :rule cong :premises (@p66) :args (@t32)) % 0.44/0.64 (step @p68 :rule trans :premises (@p67 @p65)) % 0.44/0.64 (step @p69 :rule cong :premises (@p68) :args (@t33)) % 0.44/0.64 (step @p70 :rule beta-reduce :args ((= (_ @t30 tptp.a) tptp.b))) % 0.44/0.64 (step @p71 :rule beta-reduce :args ((= @t34 tptp.a))) % 0.44/0.64 (step @p72 :rule cong :premises (@p71) :args (@t35)) % 0.44/0.64 (step @p73 :rule trans :premises (@p72 @p70)) % 0.44/0.64 (step @p74 :rule cong :premises (@p73) :args (@t36)) % 0.44/0.64 (step @p75 :rule cong :premises (@p74 @p69) :args (@t37)) % 0.44/0.64 (step @p76 :rule cong :premises (@p63 @p75) :args ((=> @t28 @t37))) % 0.44/0.64 (assume-push @p95 @t28) % 0.44/0.64 (step @p78 :rule instantiate :premises (@p47) :args ((@list @t30 @t29))) % 0.44/0.64 (step-pop @p96 :rule scope :premises (@p78)) % 0.44/0.64 (step @p79 :rule process_scope :premises (@p96) :args (@t37)) % 0.44/0.64 (step @p81 :rule eq_resolve :premises (@p79 @p76)) % 0.44/0.64 (step @p82 :rule eq_resolve :premises (@p81 @p64)) % 0.44/0.64 (step @p83 :rule implies_elim :premises (@p82)) % 0.44/0.64 (step @p84 :rule chain_m_resolution :premises (@p83 @p47) :args (@t38 (@list false) (@list @t28))) % 0.44/0.64 (step @p85 :rule quant-unused-vars :args ((= (forall @t6 @t39) @t39))) % 0.44/0.64 (step @p86 :rule cong :premises (@p40) :args (@t40)) % 0.44/0.64 (step @p87 :rule trans :premises (@p86 @p85)) % 0.44/0.64 (step @p88 :rule refl :args (@t38)) % 0.44/0.64 (step @p89 :rule cong :premises (@p88 @p87) :args (@t41)) % 0.44/0.64 ; WARNING: add trust step for TRUST % 0.44/0.64 ; trust TRUST THEORY_LEMMA % 0.44/0.64 (step @p90 :rule trust :premises () :args (@t41)) % 0.44/0.64 (step @p91 :rule eq_resolve :premises (@p90 @p89)) % 0.44/0.64 (step @p92 :rule implies_elim :premises (@p91)) % 0.44/0.64 (step @p93 :rule reordering :premises (@p92) :args ((or @t39 (not @t38)))) % 0.44/0.64 (step @p94 false :rule chain_m_resolution :premises (@p93 @p84 @p45) :args (false (@list false true) (@list @t38 @t39))) % 0.44/0.64 ) % 0.44/0.64 % SZS output end Proof % 0.44/0.64 % cvc5 exiting %------------------------------------------------------------------------------