%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : PHI022+1 : TPTP v9.2.1. Released v7.4.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % Computer : n016.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:43:13 AM UTC 2026 % Result : Theorem 0.40s 0.56s % Output : Proof 0.40s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : PHI022+1 : TPTP v9.2.1. Released v7.4.0. % 0.12/0.13 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.17/0.34 % Computer : n016.cluster.edu % 0.17/0.34 % Model : x86_64 x86_64 % 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.17/0.34 % Memory : 8042.1875MB % 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.17/0.34 % CPULimit : 300 % 0.17/0.34 % WCLimit : 300 % 0.17/0.34 % DateTime : Tue Jun 2 12:54:24 EDT 2026 % 0.17/0.34 % CPUTime : % 0.32/0.49 %----Proving TF0_NAR, FOF, or CNF % 0.40/0.56 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15... % 0.40/0.56 % SZS status Theorem % 0.40/0.56 % SZS output start Proof % 0.40/0.56 ( % 0.40/0.56 (declare-sort $$unsorted 0) % 0.40/0.56 (declare-const tptp.hasEssence (-> $$unsorted Bool)) % 0.40/0.56 (declare-const tptp.objectOf (-> $$unsorted $$unsorted Bool)) % 0.40/0.56 (declare-const tptp.conceptionInvolves (-> $$unsorted $$unsorted Bool)) % 0.40/0.56 (declare-const tptp.definiteCause (-> $$unsorted Bool)) % 0.40/0.56 (declare-const tptp.effectNecessarilyFollowsFrom (-> $$unsorted $$unsorted Bool)) % 0.40/0.56 (declare-const tptp.canBeConceivedAsNonExisting (-> $$unsorted Bool)) % 0.40/0.56 (declare-const tptp.exists (-> $$unsorted Bool)) % 0.40/0.56 (declare-const tptp.eternity (-> $$unsorted Bool)) % 0.40/0.56 (declare-const tptp.existConcFollowFromDefEternal (-> $$unsorted Bool)) % 0.40/0.56 (declare-const tptp.necessary (-> $$unsorted Bool)) % 0.40/0.56 (declare-const tptp.externalTo (-> $$unsorted $$unsorted Bool)) % 0.40/0.56 (declare-const tptp.determinedByFixedMethod (-> $$unsorted $$unsorted Bool)) % 0.40/0.56 (declare-const tptp.substance (-> $$unsorted Bool)) % 0.40/0.56 (declare-const tptp.canBeUnderstoodInTermsOf (-> $$unsorted $$unsorted Bool)) % 0.40/0.56 (declare-const tptp.conceivedThruItself (-> $$unsorted Bool)) % 0.40/0.56 (declare-const tptp.god (-> $$unsorted Bool)) % 0.40/0.56 (declare-const tptp.haveNothingInCommon (-> $$unsorted $$unsorted Bool)) % 0.40/0.56 (declare-const tptp.inItself (-> $$unsorted Bool)) % 0.40/0.56 (declare-const tptp.finiteAfterItsKind (-> $$unsorted Bool)) % 0.40/0.56 (declare-const tptp.canBeLimitedBy (-> $$unsorted $$unsorted Bool)) % 0.40/0.56 (declare-const tptp.sameKind (-> $$unsorted $$unsorted Bool)) % 0.40/0.56 (declare-const tptp.attributeOf (-> $$unsorted $$unsorted Bool)) % 0.40/0.56 (declare-const tptp.isMethodExistence (-> $$unsorted Bool)) % 0.40/0.56 (declare-const tptp.correspondWith (-> $$unsorted $$unsorted Bool)) % 0.40/0.56 (declare-const tptp.existsIn (-> $$unsorted $$unsorted Bool)) % 0.40/0.56 (declare-const tptp.essenceInvExistence (-> $$unsorted Bool)) % 0.40/0.56 (declare-const tptp.expressesEternalEssentiality (-> $$unsorted Bool)) % 0.40/0.56 (declare-const tptp.attribute (-> $$unsorted Bool)) % 0.40/0.56 (declare-const tptp.determinedByDefiniteMethod (-> $$unsorted $$unsorted Bool)) % 0.40/0.56 (declare-const tptp.ideateOf (-> $$unsorted $$unsorted Bool)) % 0.40/0.56 (declare-const tptp.conceivedThru (-> $$unsorted $$unsorted Bool)) % 0.40/0.56 (declare-const tptp.natureConcOnlyByExistence (-> $$unsorted Bool)) % 0.40/0.56 (declare-const tptp.expressesInfiniteEssentiality (-> $$unsorted Bool)) % 0.40/0.56 (declare-const tptp.trueIdea (-> $$unsorted Bool)) % 0.40/0.56 (declare-const tptp.selfCaused (-> $$unsorted Bool)) % 0.40/0.56 (declare-const tptp.modification (-> $$unsorted $$unsorted Bool)) % 0.40/0.56 (declare-const tptp.mode (-> $$unsorted Bool)) % 0.40/0.56 (declare-const tptp.absolutelyInfinite (-> $$unsorted Bool)) % 0.40/0.56 (declare-const tptp.being (-> $$unsorted Bool)) % 0.40/0.56 (declare-const tptp.constInInfAttributes (-> $$unsorted Bool)) % 0.40/0.56 (declare-const tptp.intPercAsConstEssSub (-> $$unsorted Bool)) % 0.40/0.56 (declare-const tptp.isMethodAction (-> $$unsorted Bool)) % 0.40/0.56 (declare-const tptp.determinedByItselfAlone (-> $$unsorted $$unsorted Bool)) % 0.40/0.56 (declare-const tptp.knowledgeOfACause (-> $$unsorted Bool)) % 0.40/0.56 (declare-const tptp.actionOf (-> $$unsorted $$unsorted Bool)) % 0.40/0.56 (declare-const tptp.knowledgeOfEffect (-> $$unsorted $$unsorted Bool)) % 0.40/0.56 (declare-const tptp.existsOnlyByNecessityOfOwnNature (-> $$unsorted Bool)) % 0.40/0.56 (declare-const tptp.free (-> $$unsorted Bool)) % 0.40/0.56 (define @t1 () (@var "X" $$unsorted)) % 0.40/0.56 (define @t2 () (tptp.essenceInvExistence @t1)) % 0.40/0.56 (define @t3 () (tptp.selfCaused @t1)) % 0.40/0.56 (define @t4 () (@list @t1)) % 0.40/0.56 (define @t5 () (@var "Y" $$unsorted)) % 0.40/0.56 (define @t6 () (@list @t1 @t5)) % 0.40/0.56 (define @t7 () (tptp.inItself @t1)) % 0.40/0.56 (define @t8 () (tptp.substance @t1)) % 0.40/0.56 (define @t9 () (@var "Z" $$unsorted)) % 0.40/0.56 (define @t10 () (tptp.absolutelyInfinite @t1)) % 0.40/0.56 (define @t11 () (tptp.being @t1)) % 0.40/0.56 (define @t12 () (not (= @t1 @t5))) % 0.40/0.56 (define @t13 () (tptp.exists @t1)) % 0.40/0.56 (define @t14 () (tptp.effectNecessarilyFollowsFrom @t5 @t1)) % 0.40/0.56 (define @t15 () (tptp.definiteCause @t1)) % 0.40/0.56 (define @t16 () (not @t2)) % 0.40/0.56 (define @t17 () (forall @t4 (=> @t8 @t11))) % 0.40/0.56 (define @t18 () (forall @t4 (=> @t7 @t3))) % 0.40/0.56 (define @t19 () (tptp.hasEssence @t1)) % 0.40/0.56 (define @t20 () (forall @t4 (=> @t11 @t19))) % 0.40/0.56 (define @t21 () (and @t2 @t19)) % 0.40/0.56 (define @t22 () (forall @t4 (=> @t21 @t13))) % 0.40/0.56 (define @t23 () (forall @t4 (=> @t8 @t13))) % 0.40/0.56 (define @t24 () (not @t23)) % 0.40/0.56 (define @t25 () (@quantifiers_skolemize (forall @t4 (or (not @t8) @t13)) 0)) % 0.40/0.56 (define @t26 () (@list @t25)) % 0.40/0.56 (define @t27 () (tptp.substance @t25)) % 0.40/0.56 (define @t28 () (tptp.exists @t25)) % 0.40/0.56 (define @t29 () (not @t27)) % 0.40/0.56 (define @t30 () (or @t29 @t28)) % 0.40/0.56 (define @t31 () (@list true)) % 0.40/0.56 (define @t32 () (@list @t30)) % 0.40/0.56 (define @t33 () (tptp.inItself @t25)) % 0.40/0.56 (define @t34 () (and @t33 (tptp.conceivedThruItself @t25))) % 0.40/0.56 (define @t35 () (= @t27 @t34)) % 0.40/0.56 (define @t36 () (@list false false)) % 0.40/0.56 (define @t37 () (tptp.selfCaused @t25)) % 0.40/0.56 (define @t38 () (not @t33)) % 0.40/0.56 (define @t39 () (or @t38 @t37)) % 0.40/0.56 (define @t40 () (tptp.essenceInvExistence @t25)) % 0.40/0.56 (define @t41 () (and @t40 (tptp.natureConcOnlyByExistence @t25))) % 0.40/0.56 (define @t42 () (= @t37 @t41)) % 0.40/0.56 (define @t43 () (not @t19)) % 0.40/0.56 (define @t44 () (tptp.being @t25)) % 0.40/0.56 (define @t45 () (or @t29 @t44)) % 0.40/0.56 (define @t46 () (tptp.hasEssence @t25)) % 0.40/0.56 (define @t47 () (not @t44)) % 0.40/0.56 (define @t48 () (or @t47 @t46)) % 0.40/0.56 (define @t49 () (not @t46)) % 0.40/0.56 (define @t50 () (not @t40)) % 0.40/0.56 (define @t51 () (or @t50 @t49 @t28)) % 0.40/0.56 (assume @p1 (forall @t4 (= @t3 (and @t2 (tptp.natureConcOnlyByExistence @t1))))) % 0.40/0.56 (assume @p2 (forall @t6 (= (tptp.finiteAfterItsKind @t1) (and (tptp.canBeLimitedBy @t1 @t5) (tptp.sameKind @t1 @t5))))) % 0.40/0.56 (assume @p3 (forall @t4 (= @t8 (and @t7 (tptp.conceivedThruItself @t1))))) % 0.40/0.56 (assume @p4 (forall @t4 (= (tptp.attribute @t1) (tptp.intPercAsConstEssSub @t1)))) % 0.40/0.56 (assume @p5 (forall (@list @t1 @t5 @t9) (= (tptp.mode @t1) (or (and (tptp.modification @t1 @t5) (tptp.substance @t5)) (and (tptp.existsIn @t1 @t9) (tptp.conceivedThru @t1 @t9)))))) % 0.40/0.56 (assume @p6 (forall @t4 (= (tptp.god @t1) (and @t11 @t10)))) % 0.40/0.56 (assume @p7 (forall @t6 (= @t10 (and @t8 (tptp.constInInfAttributes @t1) (=> (tptp.attributeOf @t5 @t1) (and (tptp.expressesEternalEssentiality @t5) (tptp.expressesInfiniteEssentiality @t5))))))) % 0.40/0.56 (assume @p8 (forall @t6 (= (tptp.free @t1) (and (tptp.existsOnlyByNecessityOfOwnNature @t1) (=> (tptp.actionOf @t5 @t1) (tptp.determinedByItselfAlone @t5 @t1)))))) % 0.40/0.56 (assume @p9 (forall @t6 (= (tptp.necessary @t1) (and (tptp.externalTo @t5 @t1) (tptp.determinedByFixedMethod @t1 @t5) (tptp.determinedByDefiniteMethod @t1 @t5) (or (tptp.isMethodAction @t5) (tptp.isMethodExistence @t5)))))) % 0.40/0.56 (assume @p10 (forall @t4 (= (tptp.eternity @t1) (tptp.existConcFollowFromDefEternal @t1)))) % 0.40/0.56 (assume @p11 (forall @t6 (= @t13 (or (tptp.existsIn @t1 @t1) (and (tptp.existsIn @t1 @t5) @t12))))) % 0.40/0.56 (assume @p12 (forall @t6 (=> (not (tptp.conceivedThru @t1 @t1)) (and (tptp.conceivedThru @t1 @t5) @t12)))) % 0.40/0.56 (assume @p13 (forall @t6 (=> @t15 (and @t14 (=> (not @t15) (not @t14)))))) % 0.40/0.56 (assume @p14 (forall @t6 (= (tptp.knowledgeOfEffect @t1 @t5) (tptp.knowledgeOfACause @t1)))) % 0.40/0.56 (assume @p15 (forall @t6 (=> (tptp.haveNothingInCommon @t1 @t5) (and (not (tptp.canBeUnderstoodInTermsOf @t1 @t5)) (not (tptp.canBeUnderstoodInTermsOf @t5 @t1)) (not (tptp.conceptionInvolves @t1 @t5)) (not (tptp.conceptionInvolves @t5 @t1)))))) % 0.40/0.56 (assume @p16 (forall @t6 (=> (tptp.trueIdea @t1) (and (tptp.correspondWith @t1 @t5) (or (tptp.ideateOf @t5 @t1) (tptp.objectOf @t5 @t1)))))) % 0.40/0.56 (assume @p17 (forall @t4 (=> (tptp.canBeConceivedAsNonExisting @t1) @t16))) % 0.40/0.56 (assume @p18 @t17) % 0.40/0.56 (assume @p19 @t18) % 0.40/0.56 (assume @p20 @t20) % 0.40/0.56 (assume @p21 @t22) % 0.40/0.56 (assume @p22 @t24) % 0.40/0.56 (assume @p23 true) % 0.40/0.56 (step @p24 :rule instantiate :premises (@p1) :args (@t26)) % 0.40/0.56 (step @p25 :rule bool-impl-elim :args (@t7 @t3)) % 0.40/0.56 (step @p26 :rule cong :premises (@p25) :args (@t18)) % 0.40/0.56 (step @p27 :rule eq_resolve :premises (@p19 @p26)) % 0.40/0.56 (step @p28 :rule instantiate :premises (@p27) :args (@t26)) % 0.40/0.56 (step @p29 :rule instantiate :premises (@p3) :args (@t26)) % 0.40/0.56 (step @p30 :rule bool-impl-elim :args (@t8 @t13)) % 0.40/0.56 (step @p31 :rule cong :premises (@p30) :args (@t23)) % 0.40/0.56 (step @p32 :rule cong :premises (@p31) :args (@t24)) % 0.40/0.56 (step @p33 :rule eq_resolve :premises (@p22 @p32)) % 0.40/0.56 (step @p34 :rule skolemize :premises (@p33)) % 0.40/0.56 (step @p35 :rule bool-double-not-elim :args (@t27)) % 0.40/0.56 (step @p36 :rule refl :args (@t30)) % 0.40/0.56 (step @p37 :rule nary_cong :premises (@p36 @p35) :args ((or @t30 (not @t29)))) % 0.40/0.56 (step @p38 :rule cnf_or_neg :args (@t30 0)) % 0.40/0.56 (step @p39 :rule eq_resolve :premises (@p38 @p37)) % 0.40/0.57 (step @p40 :rule reordering :premises (@p39) :args ((or @t27 @t30))) % 0.40/0.57 (step @p41 :rule chain_m_resolution :premises (@p40 @p34) :args (@t27 @t31 @t32)) % 0.40/0.57 (step @p42 :rule cnf_equiv_pos1 :args (@t35)) % 0.40/0.57 (step @p43 :rule reordering :premises (@p42) :args ((or @t29 @t34 (not @t35)))) % 0.40/0.57 (step @p44 :rule chain_m_resolution :premises (@p43 @p41 @p29) :args (@t34 @t36 (@list @t27 @t35))) % 0.40/0.57 (step @p45 :rule cnf_and_pos :args (@t34 0)) % 0.40/0.57 (step @p46 :rule reordering :premises (@p45) :args ((or @t33 (not @t34)))) % 0.40/0.57 (step @p47 :rule chain_m_resolution :premises (@p46 @p44) :args (@t33 (@list false) (@list @t34))) % 0.40/0.57 (step @p48 :rule cnf_or_pos :args (@t39)) % 0.40/0.57 (step @p49 :rule reordering :premises (@p48) :args ((or @t38 @t37 (not @t39)))) % 0.40/0.57 (step @p50 :rule chain_m_resolution :premises (@p49 @p47 @p28) :args (@t37 @t36 (@list @t33 @t39))) % 0.40/0.57 (step @p51 :rule cnf_equiv_pos1 :args (@t42)) % 0.40/0.57 (step @p52 :rule reordering :premises (@p51) :args ((or @t41 (not @t37) (not @t42)))) % 0.40/0.57 (step @p53 :rule chain_m_resolution :premises (@p52 @p50 @p24) :args (@t41 @t36 (@list @t37 @t42))) % 0.40/0.57 (step @p54 :rule aci_norm :args ((= (or (or @t16 @t43) @t13) (or @t16 @t43 @t13)))) % 0.40/0.57 (step @p55 :rule refl :args (@t13)) % 0.40/0.57 (step @p56 :rule bool-and-de-morgan :args (@t2 @t19 true)) % 0.40/0.57 (step @p57 :rule nary_cong :premises (@p56 @p55) :args ((or (not @t21) @t13))) % 0.40/0.57 (step @p58 :rule trans :premises (@p57 @p54)) % 0.40/0.57 (step @p59 :rule bool-impl-elim :args (@t21 @t13)) % 0.40/0.57 (step @p60 :rule trans :premises (@p59 @p58)) % 0.40/0.57 (step @p61 :rule cong :premises (@p60) :args (@t22)) % 0.40/0.57 (step @p62 :rule eq_resolve :premises (@p21 @p61)) % 0.40/0.57 (step @p63 :rule instantiate :premises (@p62) :args (@t26)) % 0.40/0.57 (step @p64 :rule bool-impl-elim :args (@t11 @t19)) % 0.40/0.57 (step @p65 :rule cong :premises (@p64) :args (@t20)) % 0.40/0.57 (step @p66 :rule eq_resolve :premises (@p20 @p65)) % 0.40/0.57 (step @p67 :rule instantiate :premises (@p66) :args (@t26)) % 0.40/0.57 (step @p68 :rule bool-impl-elim :args (@t8 @t11)) % 0.40/0.57 (step @p69 :rule cong :premises (@p68) :args (@t17)) % 0.40/0.57 (step @p70 :rule eq_resolve :premises (@p18 @p69)) % 0.40/0.57 (step @p71 :rule instantiate :premises (@p70) :args (@t26)) % 0.40/0.57 (step @p72 :rule cnf_or_pos :args (@t45)) % 0.40/0.57 (step @p73 :rule reordering :premises (@p72) :args ((or @t29 @t44 (not @t45)))) % 0.40/0.57 (step @p74 :rule chain_m_resolution :premises (@p73 @p41 @p71) :args (@t44 @t36 (@list @t27 @t45))) % 0.40/0.57 (step @p75 :rule cnf_or_pos :args (@t48)) % 0.40/0.57 (step @p76 :rule reordering :premises (@p75) :args ((or @t46 @t47 (not @t48)))) % 0.40/0.57 (step @p77 :rule chain_m_resolution :premises (@p76 @p74 @p67) :args (@t46 @t36 (@list @t44 @t48))) % 0.40/0.57 (step @p78 :rule cnf_or_neg :args (@t30 1)) % 0.40/0.57 (step @p79 :rule chain_m_resolution :premises (@p78 @p34) :args ((not @t28) @t31 @t32)) % 0.40/0.57 (step @p80 :rule cnf_or_pos :args (@t51)) % 0.40/0.57 (step @p81 :rule reordering :premises (@p80) :args ((or @t28 @t50 @t49 (not @t51)))) % 0.40/0.57 (step @p82 :rule chain_m_resolution :premises (@p81 @p79 @p77 @p63) :args (@t50 (@list true false false) (@list @t28 @t46 @t51))) % 0.40/0.57 (step @p83 :rule cnf_and_pos :args (@t41 0)) % 0.40/0.57 (step @p84 :rule reordering :premises (@p83) :args ((or @t40 (not @t41)))) % 0.40/0.57 (step @p85 false :rule chain_m_resolution :premises (@p84 @p82 @p53) :args (false (@list true false) (@list @t40 @t41))) % 0.40/0.57 ) % 0.40/0.57 % SZS output end Proof % 0.40/0.57 % cvc5 exiting %------------------------------------------------------------------------------