↑ 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  : PHI020+1 : TPTP v9.3.1. Released v7.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT

% Computer : n003.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:29 PM UTC 2026

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

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

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

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

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

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

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

cnf(u84,axiom,
    ( ~ existsIn(X0,X1)
    | exists(X0)
    | X0 = X1 ) ).

cnf(u128,axiom,
    ( ~ exists(X0)
    | mode(X0) ) ).

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : PHI020+1 : TPTP v9.3.1. Released v7.4.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.38  % Computer : n003.cluster.edu
% 0.12/0.38  % Model    : x86_64 x86_64
% 0.12/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38  % Memory   : 8046.5625MB
% 0.12/0.38  % OS       : Linux 6.8.0-71-generic
% 0.12/0.38  % CPULimit : 300
% 0.12/0.38  % WCLimit  : 300
% 0.12/0.39  % DateTime : Sun Sep 27 22:08:57 UTC 2026
% 0.12/0.39  % CPUTime  : 
% 0.12/0.39  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.42  Running first-order model finding
% 0.12/0.42  Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.45  % (961948)Will run a generic schedule for satisfiability detection.
% 0.12/0.45  % (961961)dis+10_1_sil=32000:sp=arity:random_seed=571098326:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.12/0.45  % (961961) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-961948-961961"...
% 0.12/0.45  % (961961)...printing done.
% 0.12/0.45  % SZS status CounterSatisfiable for theBenchmark
% 0.12/0.45  % SZS output start Saturation.
% See solution above
% 0.12/0.45  % SZS output start Definitions and Model Updates.
% 0.12/0.45  for all inputs,
% 0.12/0.45      define haveNothingInCommon(X0,X1) := $true
% 0.12/0.45  for all inputs,
% 0.12/0.45      define canBeUnderstoodInTermsOf(X0,X1) := $false
% 0.12/0.45  for all inputs,
% 0.12/0.45      define conceptionInvolves(X0,X1) := $false
% 0.12/0.45  for all inputs,
% 0.12/0.45      define trueIdea(X0) := $true
% 0.12/0.45  for all inputs,
% 0.12/0.45      define correspondWith(X0,X1) := $true
% 0.12/0.45  for all inputs,
% 0.12/0.45      define ideateOf(X0,X1) := $true
% 0.12/0.45  for all inputs,
% 0.12/0.45      define objectOf(X0,X1) := $true
% 0.12/0.45  for all inputs,
% 0.12/0.45      define selfCaused(X0) := $true
% 0.12/0.45  for all inputs,
% 0.12/0.45      define essenceInvExistence(X0) := $true
% 0.12/0.45  for all inputs,
% 0.12/0.45      define canBeConceivedAsNonExisting(X0) := $false
% 0.12/0.45  for all inputs,
% 0.12/0.45      define hasEssence(X0) := $false
% 0.12/0.45  for all inputs,
% 0.12/0.45      define being(X0) := $true
% 0.12/0.45  for all inputs,
% 0.12/0.45      define natureConcOnlyByExistence(X0) := $true
% 0.12/0.45  for all groundings,
% 0.12/0.45      whenever essenceInvExistence(X0) & natureConcOnlyByExistence(X0) is true, set selfCaused(X0) to true
% 0.12/0.45  for all inputs,
% 0.12/0.45      define attribute(X0) := intPercAsConstEssSub(X0)
% 0.12/0.45  for all inputs,
% 0.12/0.45      define god(X0) := being(X0) & absolutelyInfinite(X0)
% 0.12/0.45  for all inputs,
% 0.12/0.45      define eternity(X0) := existConcFollowFromDefEternal(X0)
% 0.12/0.45  for all inputs,
% 0.12/0.45      define knowledgeOfEffect(X0,X1) := knowledgeOfACause(X0)
% 0.12/0.45  % SZS output end Definitions and Model Updates.
% 0.12/0.45  % (961961)------------------------------
% 0.12/0.45  % (961961)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.12/0.45  % (961961)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.12/0.45  % (961961)CaDiCaL version: 2.1.3
% 0.12/0.45  % (961961)Termination reason: Satisfiable
% 0.12/0.45  % (961961)Time elapsed: 0.001 s
% 0.12/0.45  % (961961)Peak memory usage: 11 MB
% 0.12/0.45  % (961961)Instructions burned: 2 (million)
% 0.12/0.45  % (961948)Success in time 0.016 s
% 0.12/0.45  % Vampire exiting
%------------------------------------------------------------------------------