↑ 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  : PHI016+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 : n017.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:28 PM UTC 2026

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

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

cnf(u113,axiom,
    ( constInInfAttributes(X0)
    | absolutelyInfinite(X0)
    | ~ substance(X0) ) ).

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

cnf(u102,axiom,
    ~ conceivedThru(X1,X1) ).

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

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

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

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

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

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

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

cnf(u69,negated_conjecture,
    god(sK0) ).

cnf(u133,axiom,
    ( constInInfAttributes(X0)
    | absolutelyInfinite(X0) ) ).

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

cnf(u136,negated_conjecture,
    ( existsIn(sK0,X0)
    | sK0 = X0 ) ).

cnf(u45,axiom,
    ( ~ god(X0)
    | absolutelyInfinite(X0) ) ).

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

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

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

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

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

cnf(u131,negated_conjecture,
    absolutelyInfinite(sK0) ).

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

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

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

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

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

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

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

cnf(u103,negated_conjecture,
    exists(sK0) ).

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

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

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

cnf(u92,axiom,
    ( determinedByFixedMethod(X0,X1)
    | necessary(X0) ) ).

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


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : PHI016+1 : TPTP v9.3.1. Released v7.4.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.37  % Computer : n017.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.38  % CPULimit : 300
% 0.10/0.38  % WCLimit  : 300
% 0.10/0.38  % DateTime : Sun Sep 27 22:02:20 UTC 2026
% 0.10/0.38  % CPUTime  : 
% 0.10/0.38  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.40  Running first-order model finding
% 0.10/0.40  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.10/0.44  % (2982938)Will run a generic schedule for satisfiability detection.
% 0.10/0.44  % (2982948)% WARNING: option uhcvi not known.
% 0.10/0.44  % (2982948)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3740524571:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.10/0.44  % (2982948) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2982938-2982948"...
% 0.10/0.44  % (2982948)...printing done.
% 0.10/0.44  % SZS status CounterSatisfiable for theBenchmark
% 0.10/0.44  % SZS output start Saturation.
% See solution above
% 0.10/0.44  % SZS output start Definitions and Model Updates.
% 0.10/0.44  globally flip the polarity of every occurrence of predicate "canBeConceivedAsNonExisting"
% 0.10/0.44  globally flip the polarity of every occurrence of predicate "correspondWith"
% 0.10/0.44  globally flip the polarity of every occurrence of predicate "trueIdea"
% 0.10/0.44  globally flip the polarity of every occurrence of predicate "haveNothingInCommon"
% 0.10/0.44  globally flip the polarity of every occurrence of predicate "exists"
% 0.10/0.44  globally flip the polarity of every occurrence of predicate "eternity"
% 0.10/0.44  globally flip the polarity of every occurrence of predicate "isMethodExistence"
% 0.10/0.44  globally flip the polarity of every occurrence of predicate "isMethodAction"
% 0.10/0.44  globally flip the polarity of every occurrence of predicate "determinedByDefiniteMethod"
% 0.10/0.44  globally flip the polarity of every occurrence of predicate "externalTo"
% 0.10/0.44  globally flip the polarity of every occurrence of predicate "necessary"
% 0.10/0.44  globally flip the polarity of every occurrence of predicate "determinedByItselfAlone"
% 0.10/0.44  globally flip the polarity of every occurrence of predicate "actionOf"
% 0.10/0.44  globally flip the polarity of every occurrence of predicate "existsOnlyByNecessityOfOwnNature"
% 0.10/0.44  globally flip the polarity of every occurrence of predicate "free"
% 0.10/0.44  globally flip the polarity of every occurrence of predicate "attributeOf"
% 0.10/0.44  globally flip the polarity of every occurrence of predicate "constInInfAttributes"
% 0.10/0.44  globally flip the polarity of every occurrence of predicate "conceivedThru"
% 0.10/0.44  globally flip the polarity of every occurrence of predicate "existsIn"
% 0.10/0.44  globally flip the polarity of every occurrence of predicate "modification"
% 0.10/0.44  globally flip the polarity of every occurrence of predicate "mode"
% 0.10/0.44  globally flip the polarity of every occurrence of predicate "sameKind"
% 0.10/0.44  globally flip the polarity of every occurrence of predicate "canBeLimitedBy"
% 0.10/0.44  globally flip the polarity of every occurrence of predicate "natureConcOnlyByExistence"
% 0.10/0.44  for all inputs,
% 0.10/0.44      define haveNothingInCommon(X0,X1) := $true
% 0.10/0.44  for all inputs,
% 0.10/0.44      define canBeUnderstoodInTermsOf(X0,X1) := $false
% 0.10/0.44  for all inputs,
% 0.10/0.44      define conceptionInvolves(X0,X1) := $false
% 0.10/0.44  for all inputs,
% 0.10/0.44      define trueIdea(X0) := $true
% 0.10/0.44  for all inputs,
% 0.10/0.44      define correspondWith(X0,X1) := $true
% 0.10/0.44  for all inputs,
% 0.10/0.44      define ideateOf(X0,X1) := $true
% 0.10/0.44  for all inputs,
% 0.10/0.44      define objectOf(X0,X1) := $true
% 0.10/0.44  for all inputs,
% 0.10/0.44      define canBeConceivedAsNonExisting(X0) := $true
% 0.10/0.44  for all inputs,
% 0.10/0.44      define being(X0) := $true
% 0.10/0.44  for all inputs,
% 0.10/0.44      define essenceInvExistence(X0) := $false
% 0.10/0.44  for all inputs,
% 0.10/0.44      define selfCaused(X0) := essenceInvExistence(X0) & natureConcOnlyByExistence(X0)
% 0.10/0.44  for all inputs,
% 0.10/0.44      define attribute(X0) := intPercAsConstEssSub(X0)
% 0.10/0.44  for all groundings,
% 0.10/0.44      whenever being(X0) & absolutelyInfinite(X0) is true, set god(X0) to true
% 0.10/0.44  for all inputs,
% 0.10/0.44      define eternity(X0) := existConcFollowFromDefEternal(X0)
% 0.10/0.44  for all inputs,
% 0.10/0.44      define knowledgeOfEffect(X0,X1) := knowledgeOfACause(X0)
% 0.10/0.44  % SZS output end Definitions and Model Updates.
% 0.10/0.44  % (2982948)------------------------------
% 0.10/0.44  % (2982948)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.44  % (2982948)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.44  % (2982948)CaDiCaL version: 2.1.3
% 0.10/0.44  % (2982948)Termination reason: Satisfiable
% 0.10/0.44  % (2982948)Time elapsed: 0.002 s
% 0.10/0.44  % (2982948)Peak memory usage: 11 MB
% 0.10/0.44  % (2982948)Instructions burned: 2 (million)
% 0.10/0.44  % (2982938)Success in time 0.033 s
% 0.10/0.44  % Vampire exiting
%------------------------------------------------------------------------------