%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : SEU217+3 : TPTP v9.2.1. Released v3.2.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % Computer : n009.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:50:59 AM UTC 2026 % Result : Theorem 0.45s 0.64s % Output : Proof 0.45s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SEU217+3 : TPTP v9.2.1. Released v3.2.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 : n009.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 16:40:59 EDT 2026 % 0.16/0.35 % CPUTime : % 0.28/0.50 %----Proving TF0_NAR, FOF, or CNF % 0.45/0.64 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.45/0.64 % SZS status Theorem % 0.45/0.64 % SZS output start Proof % 0.45/0.64 ( % 0.45/0.64 (declare-sort $$unsorted 0) % 0.45/0.64 (declare-const tptp.apply (-> $$unsorted $$unsorted $$unsorted)) % 0.45/0.64 (declare-const tptp.relation_dom (-> $$unsorted $$unsorted)) % 0.45/0.64 (declare-const tptp.powerset (-> $$unsorted $$unsorted)) % 0.45/0.64 (declare-const tptp.element (-> $$unsorted $$unsorted Bool)) % 0.45/0.64 (declare-const tptp.relation_empty_yielding (-> $$unsorted Bool)) % 0.45/0.64 (declare-const tptp.empty (-> $$unsorted Bool)) % 0.45/0.64 (declare-const tptp.in (-> $$unsorted $$unsorted Bool)) % 0.45/0.64 (declare-const tptp.function (-> $$unsorted Bool)) % 0.45/0.64 (declare-const tptp.relation (-> $$unsorted Bool)) % 0.45/0.64 (declare-const tptp.identity_relation (-> $$unsorted $$unsorted)) % 0.45/0.64 (declare-const tptp.empty_set $$unsorted) % 0.45/0.64 (declare-const tptp.subset (-> $$unsorted $$unsorted Bool)) % 0.45/0.64 (define @t1 () (@var "A" $$unsorted)) % 0.45/0.64 (define @t2 () (@var "B" $$unsorted)) % 0.45/0.64 (define @t3 () (@list @t1 @t2)) % 0.45/0.64 (define @t4 () (tptp.relation tptp.empty_set)) % 0.45/0.64 (define @t5 () (tptp.empty tptp.empty_set)) % 0.45/0.64 (define @t6 () (@list @t2)) % 0.45/0.64 (define @t7 () (@list @t1)) % 0.45/0.64 (define @t8 () (tptp.function @t1)) % 0.45/0.64 (define @t9 () (tptp.empty @t1)) % 0.45/0.64 (define @t10 () (tptp.powerset @t1)) % 0.45/0.64 (define @t11 () (tptp.relation_dom @t1)) % 0.45/0.64 (define @t12 () (tptp.empty @t11)) % 0.45/0.64 (define @t13 () (tptp.relation @t1)) % 0.45/0.64 (define @t14 () (not @t9)) % 0.45/0.64 (define @t15 () (and @t14 @t13)) % 0.45/0.64 (define @t16 () (tptp.in @t1 @t2)) % 0.45/0.64 (define @t17 () (tptp.empty @t2)) % 0.45/0.64 (define @t18 () (tptp.element @t1 @t2)) % 0.45/0.64 (define @t19 () (@var "C" $$unsorted)) % 0.45/0.64 (define @t20 () (tptp.element @t2 (tptp.powerset @t19))) % 0.45/0.64 (define @t21 () (@list @t1 @t2 @t19)) % 0.45/0.64 (define @t22 () (tptp.in @t2 @t1)) % 0.45/0.64 (define @t23 () (not @t22)) % 0.45/0.64 (define @t24 () (tptp.identity_relation @t1)) % 0.45/0.64 (define @t25 () (tptp.relation @t24)) % 0.45/0.64 (define @t26 () (forall @t7 @t25)) % 0.45/0.64 (define @t27 () (tptp.function @t24)) % 0.45/0.64 (define @t28 () (forall @t7 (and @t25 @t27))) % 0.45/0.64 (define @t29 () (tptp.element @t2 @t10)) % 0.45/0.64 (define @t30 () (tptp.apply @t24 @t2)) % 0.45/0.64 (define @t31 () (=> @t22 (= @t30 @t2))) % 0.45/0.64 (define @t32 () (forall @t3 @t31)) % 0.45/0.64 (define @t33 () (not @t32)) % 0.45/0.64 (define @t34 () (tptp.apply @t2 @t19)) % 0.45/0.64 (define @t35 () (tptp.in @t19 @t1)) % 0.45/0.64 (define @t36 () (=> @t35 (= @t34 @t19))) % 0.45/0.64 (define @t37 () (@list @t19)) % 0.45/0.64 (define @t38 () (forall @t37 @t36)) % 0.45/0.64 (define @t39 () (tptp.relation_dom @t2)) % 0.45/0.64 (define @t40 () (and (= @t39 @t1) @t38)) % 0.45/0.64 (define @t41 () (= @t2 @t24)) % 0.45/0.64 (define @t42 () (= @t41 @t40)) % 0.45/0.64 (define @t43 () (tptp.function @t2)) % 0.45/0.64 (define @t44 () (tptp.relation @t2)) % 0.45/0.64 (define @t45 () (and @t44 @t43)) % 0.45/0.64 (define @t46 () (=> @t45 @t42)) % 0.45/0.64 (define @t47 () (forall @t3 @t46)) % 0.45/0.64 (define @t48 () (= @t2 @t30)) % 0.45/0.64 (define @t49 () (= @t19 @t34)) % 0.45/0.64 (define @t50 () (= @t41 (and (= @t1 @t39) (forall @t37 (or (not @t35) @t49))))) % 0.45/0.64 (define @t51 () (not @t43)) % 0.45/0.64 (define @t52 () (not @t44)) % 0.45/0.64 (define @t53 () (or @t52 @t51 @t50)) % 0.45/0.64 (define @t54 () (forall @t3 (or @t23 @t48))) % 0.45/0.64 (define @t55 () (@quantifiers_skolemize @t54 0)) % 0.45/0.64 (define @t56 () (tptp.identity_relation @t55)) % 0.45/0.64 (define @t57 () (forall @t37 (or (not (tptp.in @t19 @t55)) (= @t19 (tptp.apply @t56 @t19))))) % 0.45/0.64 (define @t58 () (and (= @t55 (tptp.relation_dom @t56)) @t57)) % 0.45/0.64 (define @t59 () (= (= @t56 @t56) @t58)) % 0.45/0.64 (define @t60 () (tptp.function @t56)) % 0.45/0.64 (define @t61 () (not @t60)) % 0.45/0.64 (define @t62 () (tptp.relation @t56)) % 0.45/0.64 (define @t63 () (not @t62)) % 0.45/0.64 (define @t64 () (or @t63 @t61 @t59)) % 0.45/0.64 (define @t65 () (forall @t3 @t53)) % 0.45/0.64 (define @t66 () (or @t63 @t61 @t58)) % 0.45/0.64 (define @t67 () (@list false)) % 0.45/0.64 (define @t68 () (forall @t7 @t27)) % 0.45/0.64 (define @t69 () (@list @t1)) % 0.45/0.64 (define @t70 () (and @t26 @t68)) % 0.45/0.64 (define @t71 () (@list @t55)) % 0.45/0.64 (define @t72 () (@quantifiers_skolemize @t54 1)) % 0.45/0.64 (define @t73 () (or (not (tptp.in @t72 @t55)) (= @t72 (tptp.apply @t56 @t72)))) % 0.45/0.64 (assume @p1 (forall @t3 (tptp.subset @t1 @t1))) % 0.45/0.64 (assume @p2 (and @t5 @t4)) % 0.45/0.64 (assume @p3 (and @t5 @t4 (tptp.relation_empty_yielding tptp.empty_set))) % 0.45/0.64 (assume @p4 @t5) % 0.45/0.64 (assume @p5 (forall @t7 (exists @t6 (tptp.element @t2 @t1)))) % 0.45/0.64 (assume @p6 (forall @t7 (=> @t9 @t8))) % 0.45/0.64 (assume @p7 (forall @t7 (not (tptp.empty @t10)))) % 0.45/0.64 (assume @p8 (forall @t7 (=> @t15 (not @t12)))) % 0.45/0.64 (assume @p9 (forall @t7 (=> @t9 (and @t12 (tptp.relation @t11))))) % 0.45/0.64 (assume @p10 (forall @t7 (=> @t9 @t13))) % 0.45/0.64 (assume @p11 (forall @t3 (=> @t18 (or @t17 @t16)))) % 0.45/0.64 (assume @p12 (forall @t3 (= (tptp.element @t1 (tptp.powerset @t2)) (tptp.subset @t1 @t2)))) % 0.45/0.64 (assume @p13 (forall @t21 (=> (and @t16 @t20) (tptp.element @t1 @t19)))) % 0.45/0.64 (assume @p14 (forall @t21 (not (and @t16 @t20 (tptp.empty @t19))))) % 0.45/0.64 (assume @p15 (forall @t7 (=> @t9 (= @t1 tptp.empty_set)))) % 0.45/0.64 (assume @p16 (forall @t3 (not (and @t9 (not (= @t1 @t2)) @t17)))) % 0.45/0.64 (assume @p17 (forall @t3 (=> @t16 @t23))) % 0.45/0.64 (assume @p18 @t26) % 0.45/0.64 (assume @p19 @t28) % 0.45/0.64 (assume @p20 (exists @t7 (and @t13 @t8))) % 0.45/0.64 (assume @p21 (forall @t7 (=> @t14 (exists @t6 (and @t29 (not @t17)))))) % 0.45/0.64 (assume @p22 (forall @t7 (exists @t6 (and @t29 @t17)))) % 0.45/0.64 (assume @p23 (exists @t7 (and @t9 @t13))) % 0.45/0.64 (assume @p24 (exists @t7 @t15)) % 0.45/0.64 (assume @p25 (exists @t7 (and @t13 (tptp.relation_empty_yielding @t1)))) % 0.45/0.64 (assume @p26 (exists @t7 @t9)) % 0.45/0.64 (assume @p27 (exists @t7 @t14)) % 0.45/0.64 (assume @p28 (forall @t3 (=> @t16 @t18))) % 0.45/0.64 (assume @p29 (forall @t3 (not (and @t16 @t17)))) % 0.45/0.64 (assume @p30 @t33) % 0.45/0.64 (assume @p31 @t47) % 0.45/0.64 (assume @p32 true) % 0.45/0.64 (step @p33 :rule bool-impl-elim :args (@t22 @t48)) % 0.45/0.64 (step @p34 :rule cong :premises (@p33) :args ((forall @t3 (=> @t22 @t48)))) % 0.45/0.64 (step @p35 :rule eq-symm :args (@t30 @t2)) % 0.45/0.64 (step @p36 :rule refl :args (@t22)) % 0.45/0.64 (step @p37 :rule cong :premises (@p36 @p35) :args (@t31)) % 0.45/0.64 (step @p38 :rule cong :premises (@p37) :args (@t32)) % 0.45/0.64 (step @p39 :rule trans :premises (@p38 @p34)) % 0.45/0.64 (step @p40 :rule cong :premises (@p39) :args (@t33)) % 0.45/0.64 (step @p41 :rule eq_resolve :premises (@p30 @p40)) % 0.45/0.64 (step @p42 :rule skolemize :premises (@p41)) % 0.45/0.64 (step @p43 :rule aci_norm :args ((= (or (or @t52 @t51) @t50) @t53))) % 0.45/0.64 (step @p44 :rule refl :args (@t50)) % 0.45/0.64 (step @p45 :rule bool-and-de-morgan :args (@t44 @t43 true)) % 0.45/0.64 (step @p46 :rule nary_cong :premises (@p45 @p44) :args ((or (not @t45) @t50))) % 0.45/0.64 (step @p47 :rule trans :premises (@p46 @p43)) % 0.45/0.64 (step @p48 :rule bool-impl-elim :args (@t45 @t50)) % 0.45/0.64 (step @p49 :rule trans :premises (@p48 @p47)) % 0.45/0.64 (step @p50 :rule cong :premises (@p49) :args ((forall @t3 (=> @t45 @t50)))) % 0.45/0.64 (step @p51 :rule bool-impl-elim :args (@t35 @t49)) % 0.45/0.64 (step @p52 :rule cong :premises (@p51) :args ((forall @t37 (=> @t35 @t49)))) % 0.45/0.64 (step @p53 :rule eq-symm :args (@t34 @t19)) % 0.45/0.64 (step @p54 :rule refl :args (@t35)) % 0.45/0.64 (step @p55 :rule cong :premises (@p54 @p53) :args (@t36)) % 0.45/0.64 (step @p56 :rule cong :premises (@p55) :args (@t38)) % 0.45/0.64 (step @p57 :rule trans :premises (@p56 @p52)) % 0.45/0.64 (step @p58 :rule eq-symm :args (@t39 @t1)) % 0.45/0.64 (step @p59 :rule nary_cong :premises (@p58 @p57) :args (@t40)) % 0.45/0.64 (step @p60 :rule refl :args (@t41)) % 0.45/0.64 (step @p61 :rule cong :premises (@p60 @p59) :args (@t42)) % 0.45/0.64 (step @p62 :rule refl :args (@t45)) % 0.45/0.64 (step @p63 :rule cong :premises (@p62 @p61) :args (@t46)) % 0.45/0.64 (step @p64 :rule cong :premises (@p63) :args (@t47)) % 0.45/0.64 (step @p65 :rule trans :premises (@p64 @p50)) % 0.45/0.64 (step @p66 :rule eq_resolve :premises (@p31 @p65)) % 0.45/0.64 (step @p67 :rule bool-eq-true :args (@t58)) % 0.45/0.64 (step @p68 :rule eq-symm :args (true @t58)) % 0.45/0.64 (step @p69 :rule trans :premises (@p68 @p67)) % 0.45/0.64 (step @p70 :rule refl :args (@t58)) % 0.45/0.64 (step @p71 :rule eq-refl :args (@t56)) % 0.45/0.64 (step @p72 :rule cong :premises (@p71 @p70) :args (@t59)) % 0.45/0.64 (step @p73 :rule trans :premises (@p72 @p69)) % 0.45/0.64 (step @p74 :rule refl :args (@t61)) % 0.45/0.64 (step @p75 :rule refl :args (@t63)) % 0.45/0.64 (step @p76 :rule nary_cong :premises (@p75 @p74 @p73) :args (@t64)) % 0.45/0.64 (step @p77 :rule refl :args (@t65)) % 0.45/0.64 (step @p78 :rule cong :premises (@p77 @p76) :args ((=> @t65 @t64))) % 0.45/0.64 (assume-push @p108 @t65) % 0.45/0.64 (step @p80 :rule instantiate :premises (@p66) :args ((@list @t55 @t56))) % 0.45/0.64 (step-pop @p109 :rule scope :premises (@p80)) % 0.45/0.64 (step @p81 :rule process_scope :premises (@p109) :args (@t64)) % 0.45/0.64 (step @p83 :rule eq_resolve :premises (@p81 @p78)) % 0.45/0.64 (step @p84 :rule implies_elim :premises (@p83)) % 0.45/0.64 (step @p85 :rule chain_m_resolution :premises (@p84 @p66) :args (@t66 @t67 (@list @t65))) % 0.45/0.64 (step @p86 :rule alpha_equiv :args (@t68 @t69 (@list (@var "BOUND_VARIABLE_7598" $$unsorted)))) % 0.45/0.64 (step @p87 :rule alpha_equiv :args (@t26 @t69 (@list (@var "BOUND_VARIABLE_7592" $$unsorted)))) % 0.45/0.64 (step @p88 :rule nary_cong :premises (@p87 @p86) :args (@t70)) % 0.45/0.64 (step @p89 :rule quant-miniscope-and :args ((= @t28 @t70))) % 0.45/0.65 (step @p90 :rule trans :premises (@p89 @p88)) % 0.45/0.65 (step @p91 :rule eq_resolve :premises (@p19 @p90)) % 0.45/0.65 (step @p92 :rule and_elim :premises (@p91) :args (1)) % 0.45/0.65 (step @p93 :rule instantiate :premises (@p92) :args (@t71)) % 0.45/0.65 (step @p94 :rule instantiate :premises (@p18) :args (@t71)) % 0.45/0.65 (step @p95 :rule cnf_or_pos :args (@t66)) % 0.45/0.65 (step @p96 :rule reordering :premises (@p95) :args ((or @t63 @t61 @t58 (not @t66)))) % 0.45/0.65 (step @p97 :rule chain_m_resolution :premises (@p96 @p94 @p93 @p85) :args (@t58 (@list false false false) (@list @t62 @t60 @t66))) % 0.45/0.65 (step @p98 :rule cnf_and_pos :args (@t58 1)) % 0.45/0.65 (step @p99 :rule reordering :premises (@p98) :args ((or @t57 (not @t58)))) % 0.45/0.65 (step @p100 :rule chain_m_resolution :premises (@p99 @p97) :args (@t57 @t67 (@list @t58))) % 0.45/0.65 (assume-push @p110 @t57) % 0.45/0.65 (step @p102 :rule instantiate :premises (@p100) :args ((@list @t72))) % 0.45/0.65 (step-pop @p111 :rule scope :premises (@p102)) % 0.45/0.65 (step @p103 :rule process_scope :premises (@p111) :args (@t73)) % 0.45/0.65 (step @p105 :rule implies_elim :premises (@p103)) % 0.45/0.65 (step @p106 :rule reordering :premises (@p105) :args ((or @t73 (not @t57)))) % 0.45/0.65 (step @p107 false :rule chain_m_resolution :premises (@p106 @p100 @p42) :args (false (@list false true) (@list @t57 @t73))) % 0.45/0.65 ) % 0.45/0.65 % SZS output end Proof % 0.45/0.65 % cvc5 exiting %------------------------------------------------------------------------------