TSTP Solution File: PHI025+1 by cvc5-SAT---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5-SAT---1.0.5
% Problem : PHI025+1 : TPTP v8.1.2. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n007.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 : Fri Nov 24 04:21:40 EST 2023
% Result : Satisfiable 0.20s 0.53s
% Output : FiniteModel 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : PHI025+1 : TPTP v8.1.2. Released v7.4.0.
% 0.12/0.13 % Command : do_cvc5 %s %d
% 0.13/0.35 % Computer : n007.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Wed Nov 22 13:39:51 EST 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.49 %----Disproving FOF, CNF
% 0.20/0.49 ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.LavNXZSXHS/cvc5---1.0.5_31906.p...
% 0.20/0.50 ------- get file name : TPTP file name is PHI025+1
% 0.20/0.50 ------- cvc5-fnt : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_31906.smt2...
% 0.20/0.51 --- Run --finite-model-find at 30...
% 0.20/0.53 % SZS status Satisfiable for PHI025+1
% 0.20/0.53 % SZS output start FiniteModel for PHI025+1
% 0.20/0.53 (
% 0.20/0.53 ; cardinality of $$unsorted is 1
% 0.20/0.53 ; rep: (as @$$unsorted_0 $$unsorted)
% 0.20/0.53 (define-fun tptp.selfCaused (($x1 $$unsorted)) Bool true)
% 0.20/0.53 (define-fun tptp.essenceInvExistence (($x1 $$unsorted)) Bool true)
% 0.20/0.53 (define-fun tptp.natureConcOnlyByExistence (($x1 $$unsorted)) Bool true)
% 0.20/0.53 (define-fun tptp.finiteAfterItsKind (($x1 $$unsorted)) Bool true)
% 0.20/0.53 (define-fun tptp.canBeLimitedBy (($x1 $$unsorted) ($x2 $$unsorted)) Bool true)
% 0.20/0.53 (define-fun tptp.sameKind (($x1 $$unsorted) ($x2 $$unsorted)) Bool true)
% 0.20/0.53 (define-fun tptp.substance (($x1 $$unsorted)) Bool true)
% 0.20/0.53 (define-fun tptp.inItself (($x1 $$unsorted)) Bool true)
% 0.20/0.53 (define-fun tptp.conceivedThruItself (($x1 $$unsorted)) Bool true)
% 0.20/0.53 (define-fun tptp.attribute (($x1 $$unsorted)) Bool true)
% 0.20/0.53 (define-fun tptp.intPercAsConstEssSub (($x1 $$unsorted)) Bool true)
% 0.20/0.53 (define-fun tptp.mode (($x1 $$unsorted)) Bool true)
% 0.20/0.53 (define-fun tptp.modification (($x1 $$unsorted) ($x2 $$unsorted)) Bool true)
% 0.20/0.53 (define-fun tptp.existsIn (($x1 $$unsorted) ($x2 $$unsorted)) Bool true)
% 0.20/0.53 (define-fun tptp.conceivedThru (($x1 $$unsorted) ($x2 $$unsorted)) Bool true)
% 0.20/0.53 (define-fun tptp.god (($x1 $$unsorted)) Bool true)
% 0.20/0.53 (define-fun tptp.being (($x1 $$unsorted)) Bool true)
% 0.20/0.53 (define-fun tptp.absolutelyInfinite (($x1 $$unsorted)) Bool true)
% 0.20/0.53 (define-fun tptp.constInInfAttributes (($x1 $$unsorted)) Bool true)
% 0.20/0.53 (define-fun tptp.attributeOf (($x1 $$unsorted) ($x2 $$unsorted)) Bool true)
% 0.20/0.53 (define-fun tptp.expressesEternalEssentiality (($x1 $$unsorted)) Bool true)
% 0.20/0.53 (define-fun tptp.expressesInfiniteEssentiality (($x1 $$unsorted)) Bool true)
% 0.20/0.53 (define-fun tptp.free (($x1 $$unsorted)) Bool true)
% 0.20/0.53 (define-fun tptp.existsOnlyByNecessityOfOwnNature (($x1 $$unsorted)) Bool true)
% 0.20/0.53 (define-fun tptp.actionOf (($x1 $$unsorted) ($x2 $$unsorted)) Bool true)
% 0.20/0.53 (define-fun tptp.determinedByItselfAlone (($x1 $$unsorted) ($x2 $$unsorted)) Bool true)
% 0.20/0.53 (define-fun tptp.necessary (($x1 $$unsorted)) Bool true)
% 0.20/0.53 (define-fun tptp.externalTo (($x1 $$unsorted) ($x2 $$unsorted)) Bool true)
% 0.20/0.53 (define-fun tptp.determinedByFixedMethod (($x1 $$unsorted) ($x2 $$unsorted)) Bool true)
% 0.20/0.53 (define-fun tptp.determinedByDefiniteMethod (($x1 $$unsorted) ($x2 $$unsorted)) Bool true)
% 0.20/0.53 (define-fun tptp.isMethodAction (($x1 $$unsorted)) Bool true)
% 0.20/0.53 (define-fun tptp.isMethodExistence (($x1 $$unsorted)) Bool true)
% 0.20/0.53 (define-fun tptp.eternity (($x1 $$unsorted)) Bool true)
% 0.20/0.53 (define-fun tptp.existConcFollowFromDefEternal (($x1 $$unsorted)) Bool true)
% 0.20/0.53 (define-fun tptp.exists (($x1 $$unsorted)) Bool true)
% 0.20/0.53 (define-fun tptp.definiteCause (($x1 $$unsorted)) Bool true)
% 0.20/0.53 (define-fun tptp.effectNecessarilyFollowsFrom (($x1 $$unsorted) ($x2 $$unsorted)) Bool true)
% 0.20/0.53 (define-fun tptp.knowledgeOfEffect (($x1 $$unsorted) ($x2 $$unsorted)) Bool true)
% 0.20/0.53 (define-fun tptp.knowledgeOfACause (($x1 $$unsorted)) Bool true)
% 0.20/0.53 (define-fun tptp.haveNothingInCommon (($x1 $$unsorted) ($x2 $$unsorted)) Bool false)
% 0.20/0.53 (define-fun tptp.canBeUnderstoodInTermsOf (($x1 $$unsorted) ($x2 $$unsorted)) Bool true)
% 0.20/0.53 (define-fun tptp.conceptionInvolves (($x1 $$unsorted) ($x2 $$unsorted)) Bool true)
% 0.20/0.53 (define-fun tptp.trueIdea (($x1 $$unsorted)) Bool true)
% 0.20/0.53 (define-fun tptp.correspondWith (($x1 $$unsorted) ($x2 $$unsorted)) Bool true)
% 0.20/0.53 (define-fun tptp.ideateOf (($x1 $$unsorted) ($x2 $$unsorted)) Bool true)
% 0.20/0.53 (define-fun tptp.objectOf (($x1 $$unsorted) ($x2 $$unsorted)) Bool true)
% 0.20/0.53 (define-fun tptp.canBeConceivedAsNonExisting (($x1 $$unsorted)) Bool false)
% 0.20/0.53 )
% 0.20/0.53 % SZS output end FiniteModel for PHI025+1
% 0.20/0.54 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------