%------------------------------------------------------------------------------ % File : cvc5-SAT---1.3.4 % Problem : PHI024+1 : TPTP v9.2.1. Released v7.4.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT % Computer : n014.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:19 AM UTC 2026 % Result : CounterSatisfiable 0.48s 0.66s % Output : Model 0.48s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : PHI024+1 : TPTP v9.2.1. Released v7.4.0. % 0.12/0.13 % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT % 0.16/0.34 % Computer : n014.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 12:54:13 EDT 2026 % 0.16/0.34 % CPUTime : % 0.30/0.49 %----Disproving FOF, CNF % 0.48/0.66 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 12... % 0.48/0.66 --- Run --no-e-matching --full-saturate-quant at 12... % 0.48/0.66 --- Run --no-e-matching --enum-inst-sum --full-saturate-quant at 12... % 0.48/0.66 --- Run --finite-model-find --uf-ss=no-minimal at 54... % 0.48/0.66 % SZS status CounterSatisfiable % 0.48/0.66 % SZS output start Model % 0.48/0.66 ( % 0.48/0.66 ; cardinality of $$unsorted is 1 % 0.48/0.66 ; rep: (as @$$unsorted_0 $$unsorted) % 0.48/0.66 (define-fun tptp.selfCaused (($x1 $$unsorted)) Bool true) % 0.48/0.66 (define-fun tptp.essenceInvExistence (($x1 $$unsorted)) Bool true) % 0.48/0.66 (define-fun tptp.natureConcOnlyByExistence (($x1 $$unsorted)) Bool true) % 0.48/0.66 (define-fun tptp.finiteAfterItsKind (($x1 $$unsorted)) Bool true) % 0.48/0.66 (define-fun tptp.canBeLimitedBy (($x1 $$unsorted) ($x2 $$unsorted)) Bool true) % 0.48/0.66 (define-fun tptp.sameKind (($x1 $$unsorted) ($x2 $$unsorted)) Bool true) % 0.48/0.66 (define-fun tptp.substance (($x1 $$unsorted)) Bool true) % 0.48/0.66 (define-fun tptp.inItself (($x1 $$unsorted)) Bool true) % 0.48/0.66 (define-fun tptp.conceivedThruItself (($x1 $$unsorted)) Bool true) % 0.48/0.66 (define-fun tptp.attribute (($x1 $$unsorted)) Bool true) % 0.48/0.66 (define-fun tptp.intPercAsConstEssSub (($x1 $$unsorted)) Bool true) % 0.48/0.66 (define-fun tptp.mode (($x1 $$unsorted)) Bool true) % 0.48/0.66 (define-fun tptp.modification (($x1 $$unsorted) ($x2 $$unsorted)) Bool true) % 0.48/0.66 (define-fun tptp.existsIn (($x1 $$unsorted) ($x2 $$unsorted)) Bool false) % 0.48/0.66 (define-fun tptp.conceivedThru (($x1 $$unsorted) ($x2 $$unsorted)) Bool true) % 0.48/0.66 (define-fun tptp.god (($x1 $$unsorted)) Bool false) % 0.48/0.66 (define-fun tptp.being (($x1 $$unsorted)) Bool false) % 0.48/0.66 (define-fun tptp.absolutelyInfinite (($x1 $$unsorted)) Bool true) % 0.48/0.66 (define-fun tptp.constInInfAttributes (($x1 $$unsorted)) Bool true) % 0.48/0.66 (define-fun tptp.attributeOf (($x1 $$unsorted) ($x2 $$unsorted)) Bool true) % 0.48/0.66 (define-fun tptp.expressesEternalEssentiality (($x1 $$unsorted)) Bool true) % 0.48/0.66 (define-fun tptp.expressesInfiniteEssentiality (($x1 $$unsorted)) Bool true) % 0.48/0.66 (define-fun tptp.free (($x1 $$unsorted)) Bool true) % 0.48/0.66 (define-fun tptp.existsOnlyByNecessityOfOwnNature (($x1 $$unsorted)) Bool true) % 0.48/0.66 (define-fun tptp.actionOf (($x1 $$unsorted) ($x2 $$unsorted)) Bool true) % 0.48/0.66 (define-fun tptp.determinedByItselfAlone (($x1 $$unsorted) ($x2 $$unsorted)) Bool true) % 0.48/0.66 (define-fun tptp.necessary (($x1 $$unsorted)) Bool true) % 0.48/0.66 (define-fun tptp.externalTo (($x1 $$unsorted) ($x2 $$unsorted)) Bool true) % 0.48/0.66 (define-fun tptp.determinedByFixedMethod (($x1 $$unsorted) ($x2 $$unsorted)) Bool true) % 0.48/0.66 (define-fun tptp.determinedByDefiniteMethod (($x1 $$unsorted) ($x2 $$unsorted)) Bool true) % 0.48/0.66 (define-fun tptp.isMethodAction (($x1 $$unsorted)) Bool true) % 0.48/0.66 (define-fun tptp.isMethodExistence (($x1 $$unsorted)) Bool true) % 0.48/0.66 (define-fun tptp.eternity (($x1 $$unsorted)) Bool true) % 0.48/0.66 (define-fun tptp.existConcFollowFromDefEternal (($x1 $$unsorted)) Bool true) % 0.48/0.66 (define-fun tptp.exists (($x1 $$unsorted)) Bool false) % 0.48/0.66 (define-fun tptp.definiteCause (($x1 $$unsorted)) Bool true) % 0.48/0.66 (define-fun tptp.effectNecessarilyFollowsFrom (($x1 $$unsorted) ($x2 $$unsorted)) Bool true) % 0.48/0.66 (define-fun tptp.knowledgeOfEffect (($x1 $$unsorted) ($x2 $$unsorted)) Bool true) % 0.48/0.66 (define-fun tptp.knowledgeOfACause (($x1 $$unsorted)) Bool true) % 0.48/0.66 (define-fun tptp.haveNothingInCommon (($x1 $$unsorted) ($x2 $$unsorted)) Bool false) % 0.48/0.66 (define-fun tptp.canBeUnderstoodInTermsOf (($x1 $$unsorted) ($x2 $$unsorted)) Bool true) % 0.48/0.66 (define-fun tptp.conceptionInvolves (($x1 $$unsorted) ($x2 $$unsorted)) Bool true) % 0.48/0.66 (define-fun tptp.trueIdea (($x1 $$unsorted)) Bool true) % 0.48/0.66 (define-fun tptp.correspondWith (($x1 $$unsorted) ($x2 $$unsorted)) Bool true) % 0.48/0.66 (define-fun tptp.ideateOf (($x1 $$unsorted) ($x2 $$unsorted)) Bool true) % 0.48/0.66 (define-fun tptp.objectOf (($x1 $$unsorted) ($x2 $$unsorted)) Bool true) % 0.48/0.66 (define-fun tptp.canBeConceivedAsNonExisting (($x1 $$unsorted)) Bool false) % 0.48/0.66 (define-fun tptp.hasEssence (($x1 $$unsorted)) Bool false) % 0.48/0.66 ) % 0.48/0.66 % SZS output end Model % 0.48/0.66 % cvc5 exiting %------------------------------------------------------------------------------