↑ Up

Vampire-SAT---5.0.1.CSA-Sat.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : PHI032+1 : TPTP v9.3.1. Released v7.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT

% Computer : n007.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue Sep 29 12:27:30 PM UTC 2026

% Result   : CounterSatisfiable 0.09s 0.44s
% Output   : Saturation 0.09s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(u105,axiom,
    ( isMethodExistence(X1)
    | isMethodAction(X1) ) ).

cnf(u109,axiom,
    ( ~ expressesInfiniteEssentiality(X1)
    | ~ expressesEternalEssentiality(X1) ) ).

cnf(u119,axiom,
    substance(X1) ).

cnf(u126,axiom,
    inItself(X0) ).

cnf(u66,axiom,
    ( existsIn(X0,X2)
    | modification(X0,X1)
    | ~ mode(X0) ) ).

cnf(u80,axiom,
    ( determinedByDefiniteMethod(X0,X1)
    | ~ necessary(X0) ) ).

cnf(u77,axiom,
    ( actionOf(X1,X0)
    | ~ existsOnlyByNecessityOfOwnNature(X0)
    | free(X0) ) ).

cnf(u71,axiom,
    ( ~ absolutelyInfinite(X0)
    | constInInfAttributes(X0) ) ).

cnf(u145,axiom,
    ( attributeOf(X1,X0)
    | ~ constInInfAttributes(X0)
    | absolutelyInfinite(X0) ) ).

cnf(u59,axiom,
    ( ~ sameKind(X0,X1)
    | ~ canBeLimitedBy(X0,X1)
    | finiteAfterItsKind(X0) ) ).

cnf(u129,axiom,
    essenceInvExistence(X0) ).

cnf(u139,axiom,
    ( ~ existsIn(X0,X0)
    | mode(X0) ) ).

cnf(u58,axiom,
    ( canBeLimitedBy(X0,X1)
    | ~ finiteAfterItsKind(X0) ) ).

cnf(u83,axiom,
    ( ~ determinedByDefiniteMethod(X0,X1)
    | ~ externalTo(X1,X0)
    | ~ determinedByFixedMethod(X0,X1)
    | necessary(X0)
    | ~ isMethodExistence(X1) ) ).

cnf(u133,axiom,
    exists(X0) ).

cnf(u128,axiom,
    selfCaused(X0) ).

cnf(u125,axiom,
    conceivedThruItself(X0) ).

cnf(u143,axiom,
    mode(X0) ).

cnf(u84,axiom,
    ( ~ determinedByDefiniteMethod(X0,X1)
    | ~ externalTo(X1,X0)
    | ~ determinedByFixedMethod(X0,X1)
    | necessary(X0)
    | ~ isMethodAction(X1) ) ).

cnf(u82,axiom,
    ( externalTo(X1,X0)
    | ~ necessary(X0) ) ).

cnf(u65,axiom,
    ( conceivedThru(X0,X2)
    | modification(X0,X1)
    | ~ mode(X0) ) ).

cnf(u76,axiom,
    ( ~ free(X0)
    | existsOnlyByNecessityOfOwnNature(X0) ) ).

cnf(u75,axiom,
    ( ~ actionOf(X1,X0)
    | determinedByItselfAlone(X1,X0)
    | ~ free(X0) ) ).

cnf(u57,axiom,
    ( sameKind(X0,X1)
    | ~ finiteAfterItsKind(X0) ) ).

cnf(u99,axiom,
    conceivedThru(X1,X1) ).

cnf(u93,negated_conjecture,
    essenceInvExistence(sK0) ).

cnf(u69,axiom,
    ( ~ attributeOf(X1,X0)
    | expressesInfiniteEssentiality(X1)
    | ~ absolutelyInfinite(X0) ) ).

cnf(u70,axiom,
    ( ~ attributeOf(X1,X0)
    | expressesEternalEssentiality(X1)
    | ~ absolutelyInfinite(X0) ) ).

cnf(u127,axiom,
    being(X0) ).

cnf(u88,axiom,
    ( ~ existsIn(X0,X0)
    | exists(X0) ) ).

cnf(u130,axiom,
    hasEssence(X0) ).

cnf(u56,axiom,
    ( ~ selfCaused(X0)
    | essenceInvExistence(X0) ) ).

cnf(u67,axiom,
    ( ~ conceivedThru(X0,X2)
    | ~ existsIn(X0,X2)
    | mode(X0) ) ).

cnf(u98,axiom,
    ( existsIn(X1,X1)
    | ~ exists(X1) ) ).

cnf(u81,axiom,
    ( determinedByFixedMethod(X0,X1)
    | ~ necessary(X0) ) ).

cnf(u92,axiom,
    ( effectNecessarilyFollowsFrom(X1,X0)
    | ~ definiteCause(X0) ) ).

cnf(u134,axiom,
    ( ~ modification(X0,X1)
    | mode(X0) ) ).

cnf(u78,axiom,
    ( ~ determinedByItselfAlone(X1,X0)
    | ~ existsOnlyByNecessityOfOwnNature(X0)
    | free(X0) ) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : PHI032+1 : TPTP v9.3.1. Released v7.4.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.36  % Computer : n007.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Sun Sep 27 22:05:40 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.39  Running first-order model finding
% 0.09/0.39  Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.44  % (1825017)Will run a generic schedule for satisfiability detection.
% 0.09/0.44  % (1825023)% WARNING: option uhcvi not known.
% 0.09/0.44  % (1825025)dis+10_1_sil=32000:sp=arity:random_seed=194246837:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.09/0.44  % (1825024)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3141710221:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.09/0.44  % (1825023)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1530261226:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.09/0.44  % (1825026)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1977451904:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.09/0.44  % (1825027)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3806865738:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.09/0.44  % (1825028)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4215980438:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.09/0.44  % (1825025) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1825017-1825025"...
% 0.09/0.44  % (1825026) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1825017-1825026"...
% 0.09/0.44  % (1825023) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1825017-1825023"...
% 0.09/0.44  % (1825027) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1825017-1825027"...
% 0.09/0.44  % (1825024) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1825017-1825024"...
% 0.09/0.44  % (1825028) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1825017-1825028"...
% 0.09/0.44  % (1825022)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2807749633_2999 on theBenchmark for (2999ds/0Mi)
% 0.09/0.44  % (1825025)...printing done.
% 0.09/0.44  % (1825023)...printing done.
% 0.09/0.44  % (1825026)...printing done.
% 0.09/0.44  % Detected minimum model sizes of [1]
% 0.09/0.44  % Detected maximum model sizes of [1]
% 0.09/0.44  % (1825027)...printing done.
% 0.09/0.44  % TRYING [1]
% 0.09/0.44  % (1825024)...printing done.
% 0.09/0.44  % Finite Model Found!
% 0.09/0.44  % SZS status CounterSatisfiable for theBenchmark
% 0.09/0.44  % (1825022) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1825017-1825022"...
% 0.09/0.44  % SZS status CounterSatisfiable for theBenchmark
% 0.09/0.44  % SZS output start Saturation.
% See solution above
% 0.09/0.44  % SZS output start Definitions and Model Updates.
% 0.09/0.44  for all inputs,
% 0.09/0.44      define haveNothingInCommon(X0,X1) := $true
% 0.09/0.44  for all inputs,
% 0.09/0.44      define canBeUnderstoodInTermsOf(X0,X1) := $false
% 0.09/0.44  for all inputs,
% 0.09/0.44      define conceptionInvolves(X0,X1) := $false
% 0.09/0.44  for all inputs,
% 0.09/0.44      define trueIdea(X0) := $true
% 0.09/0.44  for all inputs,
% 0.09/0.44      define correspondWith(X0,X1) := $true
% 0.09/0.44  for all inputs,
% 0.09/0.44      define ideateOf(X0,X1) := $true
% 0.09/0.44  for all inputs,
% 0.09/0.44      define objectOf(X0,X1) := $true
% 0.09/0.44  for all inputs,
% 0.09/0.44      define canBeConceivedAsNonExisting(X0) := $true
% 0.09/0.44  for all inputs,
% 0.09/0.44      define natureConcOnlyByExistence(X0) := $true
% 0.09/0.44  for all groundings,
% 0.09/0.44      whenever essenceInvExistence(X0) & natureConcOnlyByExistence(X0) is true, set selfCaused(X0) to true
% 0.09/0.44  for all inputs,
% 0.09/0.44      define attribute(X0) := intPercAsConstEssSub(X0)
% 0.09/0.44  for all inputs,
% 0.09/0.44      define god(X0) := being(X0) & absolutelyInfinite(X0)
% 0.09/0.44  for all inputs,
% 0.09/0.44      define eternity(X0) := existConcFollowFromDefEternal(X0)
% 0.09/0.44  for all inputs,
% 0.09/0.44      define knowledgeOfEffect(X0,X1) := knowledgeOfACause(X0)
% 0.09/0.44  % SZS output end Definitions and Model Updates.
% 0.09/0.44  % (1825025)------------------------------
% 0.09/0.44  % (1825025)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.44  % (1825025)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.44  % (1825025)CaDiCaL version: 2.1.3
% 0.09/0.44  % (1825025)Termination reason: Satisfiable
% 0.09/0.44  % (1825025)Time elapsed: 0.003 s
% 0.09/0.44  % (1825025)Peak memory usage: 11 MB
% 0.09/0.44  % (1825025)Instructions burned: 2 (million)
% 0.09/0.44  % (1825017)Success in time 0.042 s
% 0.09/0.44  % Vampire exiting
%------------------------------------------------------------------------------