↑ 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  : NLP002+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 : n016.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.23s 0.51s
% Output   : Saturation 0.23s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(u100,axiom,
    ( ~ event(X0)
    | of(X1,X2)
    | ~ have(X0,X1,X2) ) ).

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

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

cnf(u128,negated_conjecture,
    ~ eventuality(sK3) ).

cnf(u86,axiom,
    ( ~ street(X0)
    | way(X0) ) ).

cnf(u127,negated_conjecture,
    entity(sK1) ).

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

cnf(u123,negated_conjecture,
    object(sK1) ).

cnf(u113,negated_conjecture,
    instrumentality(sK4) ).

cnf(u115,negated_conjecture,
    ~ instrumentality(sK3) ).

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

cnf(u125,negated_conjecture,
    entity(sK3) ).

cnf(u117,negated_conjecture,
    artifact(sK3) ).

cnf(u119,negated_conjecture,
    object(sK3) ).

cnf(u111,negated_conjecture,
    vehicle(sK4) ).

cnf(u105,negated_conjecture,
    way(sK3) ).

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

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

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

cnf(u109,negated_conjecture,
    hollywood(sK1) ).

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

cnf(u103,negated_conjecture,
    car(sK4) ).

cnf(u129,negated_conjecture,
    ~ eventuality(sK1) ).

cnf(u131,negated_conjecture,
    ( ~ have(sK2,X0,X1)
    | of(X0,X1) ) ).

cnf(u95,axiom,
    ( ~ entity(X0)
    | ~ eventuality(X0) ) ).

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

cnf(u91,axiom,
    ( ~ hollywood(X0)
    | city(X0) ) ).

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

cnf(u83,axiom,
    ( ~ transport(X0)
    | instrumentality(X0) ) ).

cnf(u120,negated_conjecture,
    eventuality(sK2) ).

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

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

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

cnf(u114,negated_conjecture,
    artifact(sK4) ).

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

cnf(u124,negated_conjecture,
    ~ artifact(sK1) ).

cnf(u126,negated_conjecture,
    entity(sK4) ).

cnf(u118,negated_conjecture,
    object(sK4) ).

cnf(u112,negated_conjecture,
    transport(sK4) ).

cnf(u104,negated_conjecture,
    chevy(sK4) ).

cnf(u106,negated_conjecture,
    street(sK3) ).

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

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

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

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

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

cnf(u130,negated_conjecture,
    ~ eventuality(sK4) ).

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

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


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NLP002+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.07  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.16/0.41  % Computer : n016.cluster.edu
% 0.16/0.41  % Model    : x86_64 x86_64
% 0.16/0.41  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.41  % Memory   : 8046.5625MB
% 0.16/0.41  % OS       : Linux 6.8.0-71-generic
% 0.16/0.41  % CPULimit : 300
% 0.16/0.41  % WCLimit  : 300
% 0.16/0.41  % DateTime : Sun Sep 27 17:51:02 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.23/0.51  % (2882109)Will run a generic schedule for satisfiability detection.
% 0.23/0.51  % (2882119)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1844342894:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.23/0.51  % (2882119) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2882109-2882119"...
% 0.23/0.51  % (2882119)...printing done.
% 0.23/0.51  % SZS status CounterSatisfiable for theBenchmark
% 0.23/0.51  % SZS output start Saturation.
% See solution above
% 0.23/0.51  % SZS output start Definitions and Model Updates.
% 0.23/0.51  for all inputs,
% 0.23/0.51      define old(X0) := $true
% 0.23/0.51  for all inputs,
% 0.23/0.51      define new(X0) := $false
% 0.23/0.51  for all inputs,
% 0.23/0.51      define abstraction(X0) := $false
% 0.23/0.51  for all inputs,
% 0.23/0.51      define male(X0) := $false
% 0.23/0.51  for all inputs,
% 0.23/0.51      define man(X0) := $false
% 0.23/0.51  for all inputs,
% 0.23/0.51      define female(X0) := $false
% 0.23/0.51  for all inputs,
% 0.23/0.51      define woman(X0) := $false
% 0.23/0.51  for all inputs,
% 0.23/0.51      define partof(X0,X1) := $false
% 0.23/0.51  for all inputs,
% 0.23/0.51      define nonhuman(X0) := $false
% 0.23/0.51  for all inputs,
% 0.23/0.51      define lonely(X0) := $true
% 0.23/0.51  for all inputs,
% 0.23/0.51      define white(X0) := $true
% 0.23/0.51  for all inputs,
% 0.23/0.51      define dirty(X0) := $true
% 0.23/0.51  for all inputs,
% 0.23/0.51      define barrel(X0,X1) := $true
% 0.23/0.51  for all inputs,
% 0.23/0.51      define down(X0,X1) := $true
% 0.23/0.51  for all inputs,
% 0.23/0.51      define in(X0,X1) := $true
% 0.23/0.51  for all inputs,
% 0.23/0.51      define drs(X0) := proposition(X0)
% 0.23/0.51  % SZS output end Definitions and Model Updates.
% 0.23/0.51  % (2882119)------------------------------
% 0.23/0.51  % (2882119)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.23/0.51  % (2882119)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.23/0.51  % (2882119)CaDiCaL version: 2.1.3
% 0.23/0.51  % (2882119)Termination reason: Satisfiable
% 0.23/0.51  % (2882119)Time elapsed: 0.002 s
% 0.23/0.51  % (2882119)Peak memory usage: 11 MB
% 0.23/0.51  % (2882119)Instructions burned: 1 (million)
% 0.23/0.51  % (2882109)Success in time 0.027 s
% 0.23/0.51  % Vampire exiting
%------------------------------------------------------------------------------