↑ Up

Vampire-SAT---5.0.1.SAT-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 : n018.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   : Satisfiable 0.11s 0.43s
% Output   : Saturation 0.11s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(u59,axiom,
    ( transport(X0)
    | ~ car(X0) ) ).

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

cnf(u66,axiom,
    ( of(X1,X0)
    | ~ of(X0,X1) ) ).

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

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

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

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

cnf(u72,negated_conjecture,
    ~ event(skc7) ).

cnf(clause40,negated_conjecture,
    city(skc7) ).

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

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

cnf(u70,negated_conjecture,
    ~ way(skc5) ).

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

cnf(u75,negated_conjecture,
    ~ event(skc5) ).

cnf(u62,negated_conjecture,
    ~ artifact(skc7) ).

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

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

cnf(clause39,negated_conjecture,
    hollywood(skc7) ).

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

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

cnf(clause49,negated_conjecture,
    street(skc4) ).

cnf(u57,negated_conjecture,
    artifact(skc4) ).

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

cnf(clause43,negated_conjecture,
    car(skc5) ).

cnf(clause42,negated_conjecture,
    chevy(skc5) ).

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

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

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

cnf(u54,negated_conjecture,
    location(skc7) ).

cnf(u61,axiom,
    ( ~ entity(X0)
    | ~ event(X0) ) ).

cnf(u71,negated_conjecture,
    artifact(skc5) ).

cnf(clause32,axiom,
    ( have(skf1(X0,X1),X1,X0)
    | ~ of(X0,X1) ) ).

cnf(u73,axiom,
    ( ~ artifact(X0)
    | ~ event(X0) ) ).

cnf(u74,negated_conjecture,
    ~ event(skc4) ).

cnf(u56,negated_conjecture,
    object(skc7) ).

cnf(u67,negated_conjecture,
    instrumentality(skc5) ).

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

cnf(clause41,negated_conjecture,
    event(skc6) ).

cnf(clause48,negated_conjecture,
    way(skc4) ).

cnf(clause1,axiom,
    event(skf1(X0,X1)) ).

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

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


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NLP003-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.36  % Computer : n018.cluster.edu
% 0.11/0.36  % Model    : x86_64 x86_64
% 0.11/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36  % Memory   : 8046.5625MB
% 0.11/0.36  % OS       : Linux 6.8.0-71-generic
% 0.11/0.36  % CPULimit : 300
% 0.11/0.36  % WCLimit  : 300
% 0.11/0.36  % DateTime : Sun Sep 27 17:48:39 UTC 2026
% 0.11/0.36  % CPUTime  : 
% 0.11/0.36  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.39  Running first-order model finding
% 0.11/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.11/0.43  % (2630786)Will run a generic schedule for satisfiability detection.
% 0.11/0.43  % (2630795)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=494429668:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.11/0.43  % (2630795) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2630786-2630795"...
% 0.11/0.43  % (2630795)...printing done.
% 0.11/0.43  % SZS status Satisfiable for theBenchmark
% 0.11/0.43  % SZS output start Saturation.
% See solution above
% 0.11/0.43  % SZS output start Definitions and Model Updates.
% 0.11/0.43  for all groundings,
% 0.11/0.43      whenever ~proposition(X0) | drs(X0) is false, set ~proposition(X0) to true
% 0.11/0.43  for all groundings,
% 0.11/0.43      whenever ~drs(X0) | proposition(X0) is false, set ~drs(X0) to true
% 0.11/0.43  for all groundings,
% 0.11/0.43      whenever ~human(X0) | ~have(X1,X0,X2) | of(X0,X2) is false, set ~human(X0) to true
% 0.11/0.43  for all groundings,
% 0.11/0.43      whenever ~owner(X0) | ~of(X0,X1) | human(X0) is false, set ~owner(X0) to true
% 0.11/0.43  for all groundings,
% 0.11/0.43      whenever ~owner(X0) | ~of(X0,X1) | have(X2,X0,X1) is false, set ~owner(X0) to true
% 0.11/0.43  for all groundings,
% 0.11/0.43      whenever ~human(X0) | ~have(X1,X0,X2) | owner(X0) is false, set ~human(X0) to true
% 0.11/0.43  for all inputs,
% 0.11/0.43      define partof(X0,X1) := $false
% 0.11/0.43  for all inputs,
% 0.11/0.43      define nonhuman(X0) := $false
% 0.11/0.43  for all inputs,
% 0.11/0.43      define female(X0) := $false
% 0.11/0.43  for all inputs,
% 0.11/0.43      define woman(X0) := $false
% 0.11/0.43  for all inputs,
% 0.11/0.43      define male(X0) := $false
% 0.11/0.43  for all inputs,
% 0.11/0.43      define man(X0) := $false
% 0.11/0.43  for all inputs,
% 0.11/0.43      define abstraction(X0) := $false
% 0.11/0.43  for all inputs,
% 0.11/0.43      define old(X0) := $true
% 0.11/0.43  for all inputs,
% 0.11/0.43      define new(X0) := $false
% 0.11/0.43  for all inputs,
% 0.11/0.43      define white(X0) := $true
% 0.11/0.43  for all inputs,
% 0.11/0.43      define dirty(X0) := $true
% 0.11/0.43  for all inputs,
% 0.11/0.43      define lonely(X0) := $true
% 0.11/0.43  for all inputs,
% 0.11/0.43      define in(X0,X1) := $true
% 0.11/0.43  for all inputs,
% 0.11/0.43      define down(X0,X1) := $true
% 0.11/0.43  for all inputs,
% 0.11/0.43      define barrel(X0,X1) := $true
% 0.11/0.43  % SZS output end Definitions and Model Updates.
% 0.11/0.43  % (2630795)------------------------------
% 0.11/0.43  % (2630795)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.43  % (2630795)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.43  % (2630795)CaDiCaL version: 2.1.3
% 0.11/0.43  % (2630795)Termination reason: Satisfiable
% 0.11/0.43  % (2630795)Time elapsed: 0.001 s
% 0.11/0.43  % (2630795)Peak memory usage: 11 MB
% 0.11/0.43  % (2630795)Instructions burned: 1 (million)
% 0.11/0.43  % (2630786)Success in time 0.026 s
% 0.11/0.43  % Vampire exiting
%------------------------------------------------------------------------------