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

% Computer : n015.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:56 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(u60,negated_conjecture,
    ~ sP2 ).

cnf(u65,negated_conjecture,
    sP1(sK13) ).

cnf(u70,negated_conjecture,
    actual_world(sK13) ).

cnf(u74,negated_conjecture,
    ( ~ actual_world(X0)
    | ~ in(X0,X4,X3)
    | ~ down(X0,X4,X1)
    | ~ barrel(X0,X4)
    | ~ present(X0,X4)
    | ~ agent(X0,X4,X3)
    | ~ event(X0,X4)
    | ~ old(X0,X3)
    | ~ dirty(X0,X3)
    | ~ white(X0,X3)
    | ~ chevy(X0,X3)
    | ~ placename(X0,X2)
    | ~ hollywood_placename(X0,X2)
    | ~ city(X0,X3)
    | ~ of(X0,X2,X3)
    | ~ lonely(X0,X1)
    | ~ street(X0,X1) ) ).

cnf(u78,axiom,
    ~ sP0(sK3) ).

cnf(u84,axiom,
    actual_world(sK3) ).

cnf(u95,negated_conjecture,
    event(sK13,sK8(sK13)) ).

cnf(u99,negated_conjecture,
    present(sK13,sK8(sK13)) ).

cnf(u103,negated_conjecture,
    ( ~ old(sK13,X1)
    | ~ city(sK13,X1)
    | ~ placename(sK13,X2)
    | ~ of(sK13,X2,X1)
    | ~ hollywood_placename(sK13,X2)
    | ~ chevy(sK13,X1)
    | ~ white(sK13,X1)
    | ~ dirty(sK13,X1)
    | ~ in(sK13,sK8(sK13),X1)
    | ~ agent(sK13,sK8(sK13),X1) ) ).

cnf(u128,negated_conjecture,
    agent(sK13,sK8(sK13),sK6(sK13)) ).

cnf(u140,negated_conjecture,
    ~ city(sK13,sK6(sK13)) ).

cnf(u171,negated_conjecture,
    ( ~ old(sK3,X1)
    | ~ city(sK3,X1)
    | ~ placename(sK3,X2)
    | ~ of(sK3,X2,X1)
    | ~ hollywood_placename(sK3,X2)
    | ~ chevy(sK3,X1)
    | ~ white(sK3,X1)
    | ~ dirty(sK3,X1)
    | ~ in(sK3,sK12(sK3),X1)
    | ~ agent(sK3,sK12(sK3),X1) ) ).

cnf(u37,axiom,
    ( ~ sP1(X0)
    | city(X0,sK4(X0)) ) ).

cnf(u47,axiom,
    ( ~ sP0(X0)
    | white(X0,sK11(X0)) ) ).

cnf(u279,negated_conjecture,
    hollywood_placename(sK13,sK5(sK13)) ).

cnf(u281,negated_conjecture,
    of(sK13,sK5(sK13),sK4(sK13)) ).

cnf(u27,axiom,
    ( ~ sP1(X0)
    | agent(X0,sK8(X0),sK6(X0)) ) ).

cnf(u42,axiom,
    ( ~ sP0(X0)
    | present(X0,sK12(X0)) ) ).

cnf(u45,axiom,
    ( ~ sP0(X0)
    | old(X0,sK11(X0)) ) ).

cnf(u24,axiom,
    ( ~ sP1(X0)
    | down(X0,sK8(X0),sK7(X0)) ) ).

cnf(u34,axiom,
    ( ~ sP1(X0)
    | chevy(X0,sK6(X0)) ) ).

cnf(u272,negated_conjecture,
    lonely(sK13,sK7(sK13)) ).

cnf(u30,axiom,
    ( ~ sP1(X0)
    | street(X0,sK7(X0)) ) ).

cnf(u32,axiom,
    ( ~ sP1(X0)
    | dirty(X0,sK6(X0)) ) ).

cnf(u276,negated_conjecture,
    white(sK13,sK6(sK13)) ).

cnf(u31,axiom,
    ( ~ sP1(X0)
    | old(X0,sK6(X0)) ) ).

cnf(u275,negated_conjecture,
    dirty(sK13,sK6(sK13)) ).

cnf(u29,axiom,
    ( ~ sP1(X0)
    | lonely(X0,sK7(X0)) ) ).

cnf(u39,axiom,
    ( ~ sP0(X0)
    | in(X0,sK12(X0),sK11(X0)) ) ).

cnf(u41,axiom,
    ( ~ sP0(X0)
    | barrel(X0,sK12(X0)) ) ).

cnf(u51,axiom,
    ( ~ sP0(X0)
    | city(X0,sK11(X0)) ) ).

cnf(u273,negated_conjecture,
    street(sK13,sK7(sK13)) ).

cnf(u280,negated_conjecture,
    city(sK13,sK4(sK13)) ).

cnf(u266,negated_conjecture,
    in(sK13,sK8(sK13),sK4(sK13)) ).

cnf(u53,axiom,
    ( ~ sP0(X0)
    | lonely(X0,sK9(X0)) ) ).

cnf(u49,axiom,
    ( ~ sP0(X0)
    | placename(X0,sK10(X0)) ) ).

cnf(u26,axiom,
    ( ~ sP1(X0)
    | present(X0,sK8(X0)) ) ).

cnf(u44,axiom,
    ( ~ sP0(X0)
    | event(X0,sK12(X0)) ) ).

cnf(u54,axiom,
    ( ~ sP0(X0)
    | street(X0,sK9(X0)) ) ).

cnf(u277,negated_conjecture,
    chevy(sK13,sK6(sK13)) ).

cnf(u52,axiom,
    ( ~ sP0(X0)
    | of(X0,sK10(X0),sK11(X0)) ) ).

cnf(u90,negated_conjecture,
    ( ~ barrel(sK13,X0)
    | ~ down(sK13,X0,X2)
    | ~ in(sK13,X0,X1)
    | ~ present(sK13,X0)
    | ~ agent(sK13,X0,X1)
    | ~ event(sK13,X0)
    | ~ old(sK13,X1)
    | ~ dirty(sK13,X1)
    | ~ white(sK13,X1)
    | ~ chevy(sK13,X1)
    | ~ placename(sK13,X3)
    | ~ hollywood_placename(sK13,X3)
    | ~ city(sK13,X1)
    | ~ of(sK13,X3,X1)
    | ~ lonely(sK13,X2)
    | ~ street(sK13,X2) ) ).

cnf(u23,axiom,
    ( ~ sP1(X0)
    | in(X0,sK8(X0),sK4(X0)) ) ).

cnf(u25,axiom,
    ( ~ sP1(X0)
    | barrel(X0,sK8(X0)) ) ).

cnf(u35,axiom,
    ( ~ sP1(X0)
    | placename(X0,sK5(X0)) ) ).

cnf(u267,negated_conjecture,
    down(sK13,sK8(sK13),sK7(sK13)) ).

cnf(u268,negated_conjecture,
    barrel(sK13,sK8(sK13)) ).

cnf(u278,negated_conjecture,
    placename(sK13,sK5(sK13)) ).

cnf(u33,axiom,
    ( ~ sP1(X0)
    | white(X0,sK6(X0)) ) ).

cnf(u43,axiom,
    ( ~ sP0(X0)
    | agent(X0,sK12(X0),sK11(X0)) ) ).

cnf(u28,axiom,
    ( ~ sP1(X0)
    | event(X0,sK8(X0)) ) ).

cnf(u38,axiom,
    ( ~ sP1(X0)
    | of(X0,sK5(X0),sK4(X0)) ) ).

cnf(u40,axiom,
    ( ~ sP0(X0)
    | down(X0,sK12(X0),sK9(X0)) ) ).

cnf(u50,axiom,
    ( ~ sP0(X0)
    | hollywood_placename(X0,sK10(X0)) ) ).

cnf(u274,negated_conjecture,
    old(sK13,sK6(sK13)) ).

cnf(u159,negated_conjecture,
    ( ~ barrel(sK3,X0)
    | ~ down(sK3,X0,X2)
    | ~ in(sK3,X0,X1)
    | ~ present(sK3,X0)
    | ~ agent(sK3,X0,X1)
    | ~ event(sK3,X0)
    | ~ old(sK3,X1)
    | ~ dirty(sK3,X1)
    | ~ white(sK3,X1)
    | ~ chevy(sK3,X1)
    | ~ placename(sK3,X3)
    | ~ hollywood_placename(sK3,X3)
    | ~ city(sK3,X1)
    | ~ of(sK3,X3,X1)
    | ~ lonely(sK3,X2)
    | ~ street(sK3,X2) ) ).

cnf(u36,axiom,
    ( ~ sP1(X0)
    | hollywood_placename(X0,sK5(X0)) ) ).

cnf(u46,axiom,
    ( ~ sP0(X0)
    | dirty(X0,sK11(X0)) ) ).

cnf(u48,axiom,
    ( ~ sP0(X0)
    | chevy(X0,sK11(X0)) ) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NLP119+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37  % Computer : n015.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Sun Sep 27 18:08:46 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.37  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41  Running first-order model finding
% 0.11/0.41  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.11/0.44  % (1918934)Will run a generic schedule for satisfiability detection.
% 0.11/0.44  % (1918944)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1465818943:i=131_3000 on theBenchmark for (3000ds/131Mi)
% 0.11/0.44  % (1918944) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1918934-1918944"...
% 0.11/0.44  % (1918940)% WARNING: option uhcvi not known.
% 0.11/0.44  % (1918944)...printing done.
% 0.11/0.44  % SZS status CounterSatisfiable for theBenchmark
% 0.11/0.44  % SZS output start Saturation.
% See solution above
% 0.11/0.44  % SZS output start Definitions and Model Updates.
% 0.11/0.44  % SZS output end Definitions and Model Updates.
% 0.11/0.44  % (1918944)------------------------------
% 0.11/0.44  % (1918944)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.44  % (1918944)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.44  % (1918944)CaDiCaL version: 2.1.3
% 0.11/0.44  % (1918944)Termination reason: Satisfiable
% 0.11/0.44  % (1918944)Time elapsed: 0.004 s
% 0.11/0.44  % (1918944)Peak memory usage: 11 MB
% 0.11/0.44  % (1918944)Instructions burned: 9 (million)
% 0.11/0.44  % (1918934)Success in time 0.019 s
% 0.11/0.44  % Vampire exiting
%------------------------------------------------------------------------------