%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SEU995^5 : TPTP v9.2.1. Released 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 : n019.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:38 AM UTC 2026 % Result : Theorem 0.54s 0.71s % Output : Proof 0.54s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SEU995^5 : TPTP v9.2.1. Released v4.0.0. % 0.13/0.13 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.16/0.34 % Computer : n019.cluster.edu % 0.16/0.34 % Model : x86_64 x86_64 % 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.16/0.34 % Memory : 8042.1875MB % 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.16/0.34 % CPULimit : 300 % 0.16/0.34 % WCLimit : 300 % 0.16/0.34 % DateTime : Tue Jun 2 18:06:34 EDT 2026 % 0.16/0.35 % CPUTime : % 0.30/0.49 %----Proving TH0 % 0.54/0.71 --- 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.54/0.71 % SZS status Theorem % 0.54/0.71 % SZS output start Proof % 0.54/0.71 ( % 0.54/0.71 (declare-sort $$unsorted 0) % 0.54/0.71 (declare-const tptp.cU $$unsorted) % 0.54/0.71 (declare-const tptp.cV $$unsorted) % 0.54/0.71 (define @t1 () (@var "Xx" (-> $$unsorted $$unsorted))) % 0.54/0.71 (define @t2 () (@var "Xy" (-> $$unsorted $$unsorted))) % 0.54/0.71 (define @t3 () (@var "G" (-> (-> $$unsorted $$unsorted) (-> $$unsorted $$unsorted) $$unsorted $$unsorted))) % 0.54/0.71 (define @t4 () (= (_ (_ @t3 @t1) @t2) (_ (_ @t3 @t2) @t1))) % 0.54/0.71 (define @t5 () (forall (@list @t1 @t2) @t4)) % 0.54/0.71 (define @t6 () (not @t5)) % 0.54/0.71 (define @t7 () (@list @t3)) % 0.54/0.71 (define @t8 () (exists @t7 @t6)) % 0.54/0.71 (define @t9 () (= tptp.cU tptp.cV)) % 0.54/0.71 (define @t10 () (not @t9)) % 0.54/0.71 (define @t11 () (=> @t10 @t8)) % 0.54/0.71 (define @t12 () (not @t11)) % 0.54/0.71 (define @t13 () (forall (@list @t3 @t1 @t2) @t4)) % 0.54/0.71 (define @t14 () (forall @t7 (not @t6))) % 0.54/0.71 (define @t15 () (not @t14)) % 0.54/0.71 (define @t16 () (@var "BOUND_VARIABLE_15529" $$unsorted)) % 0.54/0.71 (define @t17 () (@list @t16)) % 0.54/0.71 (define @t18 () (lambda @t17 tptp.cU)) % 0.54/0.71 (define @t19 () (@purify @t18)) % 0.54/0.71 (define @t20 () (lambda @t17 @t16)) % 0.54/0.71 (define @t21 () (@purify @t20)) % 0.54/0.71 (define @t22 () (= @t20 @t18)) % 0.54/0.71 (define @t23 () (lambda (@list (@var "BOUND_VARIABLE_16810" $$unsorted)) tptp.cU)) % 0.54/0.71 (define @t24 () (@var "BOUND_VARIABLE_15528" (-> $$unsorted $$unsorted))) % 0.54/0.71 (define @t25 () (@list @t24 @t16)) % 0.54/0.71 (define @t26 () (@var "BOUND_VARIABLE_17967" $$unsorted)) % 0.54/0.71 (define @t27 () (lambda (@list @t26) @t26)) % 0.54/0.71 (define @t28 () (_ @t27 @t16)) % 0.54/0.71 (define @t29 () (lambda @t25 @t28)) % 0.54/0.71 (define @t30 () (@var "BOUND_VARIABLE_15527" (-> $$unsorted $$unsorted))) % 0.54/0.71 (define @t31 () (lambda (@list @t30 @t24 @t16) (_ @t30 @t16))) % 0.54/0.71 (define @t32 () (_ @t31 @t27)) % 0.54/0.71 (define @t33 () (_ @t23 @t16)) % 0.54/0.71 (define @t34 () (lambda @t25 @t33)) % 0.54/0.71 (define @t35 () (_ @t31 @t23)) % 0.54/0.71 (define @t36 () (= (_ @t35 @t27) (_ @t32 @t23))) % 0.54/0.71 (define @t37 () (= @t21 @t19)) % 0.54/0.71 (define @t38 () (@list false)) % 0.54/0.71 (define @t39 () (forall @t17 (= @t16 tptp.cU))) % 0.54/0.71 (define @t40 () (=> @t37 @t39)) % 0.54/0.71 (define @t41 () (forall @t17 (= tptp.cU @t16))) % 0.54/0.71 (define @t42 () (= tptp.cV tptp.cU)) % 0.54/0.71 (assume @p1 @t12) % 0.54/0.71 (assume @p2 true) % 0.54/0.71 (step @p3 :rule quant-merge-prenex :args ((= (forall @t7 @t5) @t13))) % 0.54/0.71 (step @p4 :rule bool-double-not-elim :args (@t5)) % 0.54/0.71 (step @p5 :rule cong :premises (@p4) :args (@t14)) % 0.54/0.71 (step @p6 :rule trans :premises (@p5 @p3)) % 0.54/0.71 (step @p7 :rule cong :premises (@p6) :args (@t15)) % 0.54/0.71 (step @p8 :rule exists-elim :args ((= @t8 @t15))) % 0.54/0.71 (step @p9 :rule trans :premises (@p8 @p7)) % 0.54/0.71 (step @p10 :rule eq-symm :args (tptp.cU tptp.cV)) % 0.54/0.71 (step @p11 :rule cong :premises (@p10) :args (@t10)) % 0.54/0.71 (step @p12 :rule cong :premises (@p11 @p9) :args (@t11)) % 0.54/0.71 (step @p13 :rule cong :premises (@p12) :args (@t12)) % 0.54/0.71 (step @p14 :rule eq_resolve :premises (@p1 @p13)) % 0.54/0.71 (step @p15 :rule not_implies_elim1 :premises (@p14)) % 0.54/0.71 (step @p16 :rule not_implies_elim2 :premises (@p14)) % 0.54/0.71 (step @p17 :rule not_not_elim :premises (@p16)) % 0.54/0.71 (step @p18 :rule eq-refl :args (@t18)) % 0.54/0.71 (step @p19 :rule skolem_intro :args (@t19)) % 0.54/0.71 (step @p20 :rule refl :args (@t18)) % 0.54/0.71 (step @p21 :rule cong :premises (@p20 @p19) :args ((= @t18 @t19))) % 0.54/0.71 (step @p22 :rule trans :premises (@p21 @p18)) % 0.54/0.71 (step @p23 :rule true_elim :premises (@p22)) % 0.54/0.71 (step @p24 :rule eq-refl :args (@t20)) % 0.54/0.71 (step @p25 :rule skolem_intro :args (@t21)) % 0.54/0.71 (step @p26 :rule refl :args (@t20)) % 0.54/0.71 (step @p27 :rule cong :premises (@p26 @p25) :args ((= @t20 @t21))) % 0.54/0.71 (step @p28 :rule trans :premises (@p27 @p24)) % 0.54/0.71 (step @p29 :rule true_elim :premises (@p28)) % 0.54/0.71 (step @p30 :rule cong :premises (@p29 @p23) :args (@t22)) % 0.54/0.71 (step @p31 :rule refl :args (@t13)) % 0.54/0.71 (step @p32 :rule cong :premises (@p31 @p30) :args ((=> @t13 @t22))) % 0.54/0.71 (step @p33 :rule eq-symm :args (@t18 @t20)) % 0.54/0.71 (step @p34 :rule beta-reduce :args ((= (_ (lambda @t25 @t16) @t23) @t20))) % 0.54/0.71 (step @p35 :rule refl :args (@t23)) % 0.54/0.71 (step @p36 :rule beta-reduce :args ((= @t28 @t16))) % 0.54/0.71 (step @p37 :rule cong :premises (@p36) :args (@t29)) % 0.54/0.71 (step @p38 :rule beta-reduce :args ((= @t32 @t29))) % 0.54/0.71 (step @p39 :rule trans :premises (@p38 @p37)) % 0.54/0.71 (step @p40 :rule ho_cong :premises (@p39 @p35)) % 0.54/0.71 (step @p41 :rule trans :premises (@p40 @p34)) % 0.54/0.71 (step @p42 :rule beta-reduce :args ((= (_ (lambda @t25 tptp.cU) @t27) @t18))) % 0.54/0.71 (step @p43 :rule refl :args (@t27)) % 0.54/0.71 (step @p44 :rule beta-reduce :args ((= @t33 tptp.cU))) % 0.54/0.71 (step @p45 :rule cong :premises (@p44) :args (@t34)) % 0.54/0.71 (step @p46 :rule beta-reduce :args ((= @t35 @t34))) % 0.54/0.71 (step @p47 :rule trans :premises (@p46 @p45)) % 0.54/0.71 (step @p48 :rule ho_cong :premises (@p47 @p43)) % 0.54/0.71 (step @p49 :rule trans :premises (@p48 @p42)) % 0.54/0.71 (step @p50 :rule cong :premises (@p49 @p41) :args (@t36)) % 0.54/0.71 (step @p51 :rule trans :premises (@p50 @p33)) % 0.54/0.71 (step @p52 :rule cong :premises (@p31 @p51) :args ((=> @t13 @t36))) % 0.54/0.71 (assume-push @p79 @t13) % 0.54/0.71 (step @p54 :rule instantiate :premises (@p17) :args ((@list @t31 @t23 @t27))) % 0.54/0.71 (step-pop @p80 :rule scope :premises (@p54)) % 0.54/0.71 (step @p55 :rule process_scope :premises (@p80) :args (@t36)) % 0.54/0.71 (step @p57 :rule eq_resolve :premises (@p55 @p52)) % 0.54/0.71 (step @p58 :rule eq_resolve :premises (@p57 @p32)) % 0.54/0.71 (step @p59 :rule implies_elim :premises (@p58)) % 0.54/0.71 (step @p60 :rule chain_m_resolution :premises (@p59 @p17) :args (@t37 @t38 (@list @t13))) % 0.54/0.71 (step @p61 :rule eq-symm :args (@t16 tptp.cU)) % 0.54/0.71 (step @p62 :rule cong :premises (@p61) :args (@t39)) % 0.54/0.71 (step @p63 :rule refl :args (@t37)) % 0.54/0.71 (step @p64 :rule cong :premises (@p63 @p62) :args (@t40)) % 0.54/0.71 ; WARNING: add trust step for TRUST % 0.54/0.71 ; trust TRUST THEORY_LEMMA % 0.54/0.71 (step @p65 :rule trust :premises () :args (@t40)) % 0.54/0.71 (step @p66 :rule eq_resolve :premises (@p65 @p64)) % 0.54/0.71 (step @p67 :rule implies_elim :premises (@p66)) % 0.54/0.71 (step @p68 :rule chain_m_resolution :premises (@p67 @p60) :args (@t41 @t38 (@list @t37))) % 0.54/0.71 (step @p69 :rule refl :args (@t41)) % 0.54/0.71 (step @p70 :rule cong :premises (@p69 @p10) :args ((=> @t41 @t9))) % 0.54/0.71 (assume-push @p81 @t41) % 0.54/0.71 (step @p72 :rule instantiate :premises (@p68) :args ((@list tptp.cV))) % 0.54/0.71 (step-pop @p82 :rule scope :premises (@p72)) % 0.54/0.71 (step @p73 :rule process_scope :premises (@p82) :args (@t9)) % 0.54/0.71 (step @p75 :rule eq_resolve :premises (@p73 @p70)) % 0.54/0.71 (step @p76 :rule implies_elim :premises (@p75)) % 0.54/0.71 (step @p77 :rule reordering :premises (@p76) :args ((or @t42 (not @t41)))) % 0.54/0.71 (step @p78 false :rule chain_m_resolution :premises (@p77 @p68 @p15) :args (false (@list false true) (@list @t41 @t42))) % 0.54/0.71 ) % 0.54/0.71 % SZS output end Proof % 0.54/0.71 % cvc5 exiting %------------------------------------------------------------------------------