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

% Computer : n005.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:08:21 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(u142,axiom,
    ( object(sK0(X0,X1))
    | of(X1,X0) ) ).

cnf(u145,axiom,
    ( ~ location(sK0(X1,X0))
    | of(X0,X1) ) ).

cnf(u102,negated_conjecture,
    chevy(sK3) ).

cnf(u127,negated_conjecture,
    ~ street(sK4) ).

cnf(u121,axiom,
    ( ~ owner(X1)
    | of(X1,X2)
    | human(X1) ) ).

cnf(u123,axiom,
    ( ~ of(X1,X2)
    | ~ event(X0)
    | have(X0,X1,X2) ) ).

cnf(u113,axiom,
    ( ~ location(X0)
    | artifact(X0) ) ).

cnf(u115,axiom,
    ( hollywood(X0)
    | city(X0) ) ).

cnf(u149,axiom,
    ( ~ way(sK0(X1,X0))
    | of(X0,X1) ) ).

cnf(u125,axiom,
    ( ~ have(sK0(X0,X1),X0,X1)
    | of(X1,X0) ) ).

cnf(u76,axiom,
    ( ~ chevy(X0)
    | car(X0) ) ).

cnf(u117,axiom,
    ( ~ entity(X0)
    | object(X0) ) ).

cnf(u88,axiom,
    ( ~ city(X0)
    | location(X0) ) ).

cnf(u111,axiom,
    ( ~ artifact(X0)
    | ~ way(X0) ) ).

cnf(u143,negated_conjecture,
    ~ location(sK2) ).

cnf(u147,negated_conjecture,
    ~ way(sK2) ).

cnf(u119,axiom,
    ( ~ human(X1)
    | owner(X1)
    | have(X0,X1,X2) ) ).

cnf(u107,axiom,
    ( ~ transport(X0)
    | vehicle(X0) ) ).

cnf(u99,negated_conjecture,
    way(sK4) ).

cnf(u109,axiom,
    ( ~ artifact(X0)
    | ~ instrumentality(X0) ) ).

cnf(u101,negated_conjecture,
    car(sK3) ).

cnf(u137,axiom,
    ( eventuality(X0)
    | object(X0) ) ).

cnf(u144,negated_conjecture,
    artifact(sK2) ).

cnf(u139,axiom,
    ( ~ event(X0)
    | object(X0) ) ).

cnf(u129,negated_conjecture,
    ~ instrumentality(sK4) ).

cnf(u131,axiom,
    ( vehicle(X0)
    | instrumentality(X0) ) ).

cnf(u141,negated_conjecture,
    object(sK2) ).

cnf(u81,axiom,
    ( ~ way(X0)
    | ~ instrumentality(X0) ) ).

cnf(u133,negated_conjecture,
    artifact(sK1) ).

cnf(u120,axiom,
    ( ~ human(X1)
    | ~ of(X1,X2)
    | have(X0,X1,X2) ) ).

cnf(u135,negated_conjecture,
    ~ way(sK1) ).

cnf(u122,axiom,
    ( ~ owner(X1)
    | of(X1,X2)
    | ~ have(X0,X1,X2) ) ).

cnf(u146,axiom,
    ( artifact(sK0(X1,X0))
    | of(X0,X1) ) ).

cnf(u114,axiom,
    ( ~ eventuality(X0)
    | ~ event(X0) ) ).

cnf(u103,negated_conjecture,
    event(sK2) ).

cnf(u124,axiom,
    ( event(sK0(X0,X1))
    | of(X1,X0) ) ).

cnf(u150,axiom,
    ( ~ instrumentality(sK0(X1,X0))
    | of(X0,X1) ) ).

cnf(u126,negated_conjecture,
    ~ hollywood(sK1) ).

cnf(u118,axiom,
    ( entity(X0)
    | eventuality(X0) ) ).

cnf(u112,axiom,
    ( ~ object(X0)
    | artifact(X0) ) ).

cnf(u104,negated_conjecture,
    city(sK1) ).

cnf(u106,axiom,
    ( ~ vehicle(X0)
    | ~ car(X0) ) ).

cnf(u116,axiom,
    ( ~ object(X0)
    | ~ location(X0) ) ).

cnf(u148,negated_conjecture,
    ~ instrumentality(sK2) ).

cnf(u108,axiom,
    ( transport(X0)
    | instrumentality(X0) ) ).

cnf(u110,axiom,
    ( street(X0)
    | way(X0) ) ).

cnf(u136,negated_conjecture,
    ~ instrumentality(sK1) ).

cnf(u138,axiom,
    ( ~ car(X0)
    | instrumentality(X0) ) ).

cnf(u130,negated_conjecture,
    location(sK1) ).

cnf(u140,negated_conjecture,
    instrumentality(sK3) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : NLP003+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.08  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.16/0.42  % Computer : n005.cluster.edu
% 0.16/0.42  % Model    : x86_64 x86_64
% 0.16/0.42  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.42  % Memory   : 8046.5625MB
% 0.16/0.42  % OS       : Linux 6.8.0-71-generic
% 0.16/0.42  % CPULimit : 300
% 0.16/0.42  % WCLimit  : 300
% 0.16/0.42  % DateTime : Sun Sep 27 17:46:17 UTC 2026
% 0.16/0.42  % CPUTime  : 
% 0.16/0.42  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.16/0.47  Running first-order model finding
% 0.16/0.47  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.21/0.51  % (50636)Will run a generic schedule for satisfiability detection.
% 0.21/0.51  % (50642)% WARNING: option uhcvi not known.
% 0.21/0.51  % (50642)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1371470381:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.21/0.51  % (50642) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-50636-50642"...
% 0.21/0.51  % (50641)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1100883916_2999 on theBenchmark for (2999ds/0Mi)
% 0.21/0.51  % (50642)...printing done.
% 0.21/0.51  % SZS status CounterSatisfiable for theBenchmark
% 0.21/0.51  % SZS output start Saturation.
% See solution above
% 0.21/0.51  % SZS output start Definitions and Model Updates.
% 0.21/0.51  globally flip the polarity of every occurrence of predicate "in"
% 0.21/0.51  globally flip the polarity of every occurrence of predicate "down"
% 0.21/0.51  globally flip the polarity of every occurrence of predicate "barrel"
% 0.21/0.51  globally flip the polarity of every occurrence of predicate "lonely"
% 0.21/0.51  globally flip the polarity of every occurrence of predicate "dirty"
% 0.21/0.51  globally flip the polarity of every occurrence of predicate "of"
% 0.21/0.51  globally flip the polarity of every occurrence of predicate "have"
% 0.21/0.51  globally flip the polarity of every occurrence of predicate "proposition"
% 0.21/0.51  globally flip the polarity of every occurrence of predicate "drs"
% 0.21/0.51  globally flip the polarity of every occurrence of predicate "woman"
% 0.21/0.51  globally flip the polarity of every occurrence of predicate "man"
% 0.21/0.51  globally flip the polarity of every occurrence of predicate "male"
% 0.21/0.51  globally flip the polarity of every occurrence of predicate "new"
% 0.21/0.51  globally flip the polarity of every occurrence of predicate "old"
% 0.21/0.51  globally flip the polarity of every occurrence of predicate "entity"
% 0.21/0.51  globally flip the polarity of every occurrence of predicate "hollywood"
% 0.21/0.51  globally flip the polarity of every occurrence of predicate "eventuality"
% 0.21/0.51  globally flip the polarity of every occurrence of predicate "object"
% 0.21/0.51  globally flip the polarity of every occurrence of predicate "street"
% 0.21/0.51  globally flip the polarity of every occurrence of predicate "artifact"
% 0.21/0.51  globally flip the polarity of every occurrence of predicate "transport"
% 0.21/0.51  globally flip the polarity of every occurrence of predicate "vehicle"
% 0.21/0.51  for all inputs,
% 0.21/0.51      define old(X0) := $true
% 0.21/0.51  for all inputs,
% 0.21/0.51      define new(X0) := $false
% 0.21/0.51  for all inputs,
% 0.21/0.51      define abstraction(X0) := $false
% 0.21/0.51  for all inputs,
% 0.21/0.51      define male(X0) := $false
% 0.21/0.51  for all inputs,
% 0.21/0.51      define man(X0) := $false
% 0.21/0.51  for all inputs,
% 0.21/0.51      define female(X0) := $false
% 0.21/0.51  for all inputs,
% 0.21/0.51      define woman(X0) := $false
% 0.21/0.51  for all inputs,
% 0.21/0.51      define partof(X0,X1) := $false
% 0.21/0.51  for all inputs,
% 0.21/0.51      define nonhuman(X0) := $false
% 0.21/0.51  for all inputs,
% 0.21/0.51      define white(X0) := $true
% 0.21/0.51  for all inputs,
% 0.21/0.51      define dirty(X0) := $true
% 0.21/0.51  for all inputs,
% 0.21/0.51      define lonely(X0) := $true
% 0.21/0.51  for all inputs,
% 0.21/0.51      define barrel(X0,X1) := $true
% 0.21/0.51  for all inputs,
% 0.21/0.51      define down(X0,X1) := $true
% 0.21/0.51  for all inputs,
% 0.21/0.51      define in(X0,X1) := $true
% 0.21/0.51  for all inputs,
% 0.21/0.51      define drs(X0) := proposition(X0)
% 0.21/0.51  % SZS output end Definitions and Model Updates.
% 0.21/0.51  % (50642)------------------------------
% 0.21/0.51  % (50642)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.51  % (50642)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.51  % (50642)CaDiCaL version: 2.1.3
% 0.21/0.51  % (50642)Termination reason: Satisfiable
% 0.21/0.51  % (50642)Time elapsed: 0.002 s
% 0.21/0.51  % (50642)Peak memory usage: 12 MB
% 0.21/0.51  % (50642)Instructions burned: 2 (million)
% 0.21/0.51  % (50636)Success in time 0.024 s
% 0.21/0.51  % Vampire exiting
%------------------------------------------------------------------------------