↑ 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  : NLP013+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:25 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(u168,negated_conjecture,
    ( ~ young(X37)
    | ~ seat(X35)
    | ~ furniture(X35)
    | ~ front(X35)
    | X36 = X37
    | fellow(X36)
    | man(X36)
    | ~ young(X36)
    | fellow(X37)
    | man(X37)
    | ~ in(X37,X35)
    | ~ in(X36,X35) ) ).

cnf(u172,negated_conjecture,
    ~ sP19(sK18,sK17,sK16,sK15,sK14,sK13,sK12,sK11,sK10) ).

cnf(u178,negated_conjecture,
    in(sK9,sK0) ).

cnf(u183,negated_conjecture,
    sK6 = sK9 ).

cnf(u188,negated_conjecture,
    in(sK8,sK7) ).

cnf(u193,negated_conjecture,
    sK5 = sK8 ).

cnf(u198,negated_conjecture,
    young(sK6) ).

cnf(u203,negated_conjecture,
    ~ man(sK6) ).

cnf(u208,negated_conjecture,
    ~ fellow(sK6) ).

cnf(u213,negated_conjecture,
    young(sK5) ).

cnf(u218,negated_conjecture,
    ~ man(sK5) ).

cnf(u223,negated_conjecture,
    ~ fellow(sK5) ).

cnf(u228,negated_conjecture,
    sK5 != sK6 ).

cnf(u233,negated_conjecture,
    front(sK7) ).

cnf(u238,negated_conjecture,
    furniture(sK7) ).

cnf(u243,negated_conjecture,
    seat(sK7) ).

cnf(u248,negated_conjecture,
    in(sK2,sK1) ).

cnf(u253,negated_conjecture,
    ~ down(sK2,sK3) ).

cnf(u258,negated_conjecture,
    ~ barrel(sK2,sK4) ).

cnf(u263,negated_conjecture,
    ~ old(sK4) ).

cnf(u268,negated_conjecture,
    ~ dirty(sK4) ).

cnf(u273,negated_conjecture,
    white(sK4) ).

cnf(u278,negated_conjecture,
    ~ car(sK4) ).

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

cnf(u288,negated_conjecture,
    ~ lonely(sK3) ).

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

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

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

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

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

cnf(u318,negated_conjecture,
    front(sK0) ).

cnf(u323,negated_conjecture,
    furniture(sK0) ).

cnf(u328,negated_conjecture,
    seat(sK0) ).

cnf(u400,negated_conjecture,
    ~ lonely(sK13) ).

cnf(u404,negated_conjecture,
    street(sK13) ).

cnf(u414,negated_conjecture,
    ~ old(sK12) ).

cnf(u418,negated_conjecture,
    ~ dirty(sK12) ).

cnf(u422,negated_conjecture,
    ~ car(sK12) ).

cnf(u426,negated_conjecture,
    chevy(sK12) ).

cnf(u430,negated_conjecture,
    ( ~ event(X1)
    | down(X1,sK3)
    | barrel(X1,sK12)
    | hollywood(X0)
    | ~ city(X0)
    | ~ in(X1,X0) ) ).

cnf(u437,negated_conjecture,
    down(sK11,sK3) ).

cnf(u441,negated_conjecture,
    barrel(sK11,sK4) ).

cnf(u473,negated_conjecture,
    ~ barrel(sK11,sK12) ).

cnf(u576,negated_conjecture,
    ~ down(sK11,sK13) ).

cnf(u632,negated_conjecture,
    barrel(sK2,sK12) ).

cnf(u724,negated_conjecture,
    ~ man(sK15) ).

cnf(u728,negated_conjecture,
    ~ fellow(sK15) ).

cnf(u741,negated_conjecture,
    ~ fellow(sK14) ).

cnf(u769,negated_conjecture,
    sK5 != sK15 ).

cnf(u774,negated_conjecture,
    sK5 != sK14 ).

cnf(u800,negated_conjecture,
    ~ in(sK6,sK16) ).

cnf(u864,negated_conjecture,
    sK14 != sK15 ).

cnf(u913,negated_conjecture,
    ~ in(sK5,sK16) ).

cnf(u1091,negated_conjecture,
    ( ~ young(X0)
    | ~ in(X0,sK7)
    | sK5 = X0
    | fellow(X0)
    | man(X0) ) ).

cnf(u1122,negated_conjecture,
    ( ~ young(X0)
    | ~ in(X0,sK0)
    | sK6 = X0
    | fellow(X0)
    | man(X0) ) ).

cnf(u476,negated_conjecture,
    ~ sP19(X0,X1,X2,X3,X4,X5,sK4,sK11,X6) ).

cnf(u153,negated_conjecture,
    ( ~ barrel(X1,X2)
    | ~ sP19(X8,X7,X6,X5,X4,X3,X2,X1,X0) ) ).

cnf(u1059,negated_conjecture,
    ( ~ in(sK6,X0)
    | ~ furniture(X0)
    | ~ front(X0)
    | sK6 = X1
    | fellow(X1)
    | man(X1)
    | ~ young(X1)
    | ~ seat(X0)
    | ~ in(X1,X0) ) ).

cnf(u7,negated_conjecture,
    ( ~ sP19(X8,X7,X6,X5,X4,X3,X2,X1,X0)
    | in(X7,X6) ) ).

cnf(u361,negated_conjecture,
    in(sK6,sK0) ).

cnf(u157,negated_conjecture,
    ( ~ fellow(X5)
    | ~ sP19(X8,X7,X6,X5,X4,X3,X2,X1,X0) ) ).

cnf(u148,negated_conjecture,
    ( ~ hollywood(X0)
    | ~ sP19(X8,X7,X6,X5,X4,X3,X2,X1,X0) ) ).

cnf(u29,negated_conjecture,
    ( ~ sP19(X8,X7,X6,X5,X4,X3,X2,X1,X0)
    | chevy(X2) ) ).

cnf(u616,negated_conjecture,
    ~ sP19(X0,X1,X2,X3,X4,sK3,X5,sK11,X6) ).

cnf(u159,negated_conjecture,
    ( sP20(X18,X17,X16,X18,X17,X13,X12,X11,X10,X9)
    | ~ in(X17,X16)
    | ~ young(X18)
    | man(X18)
    | fellow(X18)
    | ~ young(X17)
    | man(X17)
    | fellow(X17)
    | X17 = X18
    | ~ front(X16)
    | ~ furniture(X16)
    | ~ seat(X16)
    | ~ in(X11,X10)
    | down(X11,X12)
    | barrel(X11,X13)
    | old(X13)
    | dirty(X13)
    | ~ white(X13)
    | car(X13)
    | ~ chevy(X13)
    | lonely(X12)
    | ~ way(X12)
    | ~ street(X12)
    | ~ event(X11)
    | ~ city(X10)
    | hollywood(X10)
    | ~ front(X9)
    | ~ furniture(X9)
    | ~ seat(X9)
    | ~ in(X18,X9) ) ).

cnf(u5,negated_conjecture,
    ( ~ sP19(X8,X7,X6,X5,X4,X3,X2,X1,X0)
    | in(X8,X6) ) ).

cnf(u1098,negated_conjecture,
    ~ in(sK6,sK7) ).

cnf(u8,negated_conjecture,
    ( ~ sP19(X8,X7,X6,X5,X4,X3,X2,X1,X0)
    | X4 = X7 ) ).

cnf(u31,negated_conjecture,
    ( ~ sP19(X8,X7,X6,X5,X4,X3,X2,X1,X0)
    | city(X0) ) ).

cnf(u12,negated_conjecture,
    ( ~ sP19(X8,X7,X6,X5,X4,X3,X2,X1,X0)
    | young(X4) ) ).

cnf(u19,negated_conjecture,
    ( ~ sP19(X8,X7,X6,X5,X4,X3,X2,X1,X0)
    | in(X1,X0) ) ).

cnf(u151,negated_conjecture,
    ( ~ old(X2)
    | ~ sP19(X8,X7,X6,X5,X4,X3,X2,X1,X0) ) ).

cnf(u154,negated_conjecture,
    ( ~ down(X1,X3)
    | ~ sP19(X8,X7,X6,X5,X4,X3,X2,X1,X0) ) ).

cnf(u23,negated_conjecture,
    ( ~ sP19(X8,X7,X6,X5,X4,X3,X2,X1,X0)
    | way(X3) ) ).

cnf(u362,negated_conjecture,
    in(sK5,sK7) ).

cnf(u158,negated_conjecture,
    ( ~ man(X5)
    | ~ sP19(X8,X7,X6,X5,X4,X3,X2,X1,X0) ) ).

cnf(u101,negated_conjecture,
    ~ sP19(X8,X7,X6,X5,X5,X3,X2,X1,X0) ).

cnf(u30,negated_conjecture,
    ( ~ sP19(X8,X7,X6,X5,X4,X3,X2,X1,X0)
    | event(X1) ) ).

cnf(u17,negated_conjecture,
    ( ~ sP19(X8,X7,X6,X5,X4,X3,X2,X1,X0)
    | furniture(X6) ) ).

cnf(u1060,negated_conjecture,
    ( ~ in(sK5,X0)
    | ~ furniture(X0)
    | ~ front(X0)
    | sK5 = X1
    | fellow(X1)
    | man(X1)
    | ~ young(X1)
    | ~ seat(X0)
    | ~ in(X1,X0) ) ).

cnf(u149,negated_conjecture,
    ( ~ car(X2)
    | ~ sP19(X8,X7,X6,X5,X4,X3,X2,X1,X0) ) ).

cnf(u152,negated_conjecture,
    ( ~ lonely(X3)
    | ~ sP19(X8,X7,X6,X5,X4,X3,X2,X1,X0) ) ).

cnf(u6,negated_conjecture,
    ( ~ sP19(X8,X7,X6,X5,X4,X3,X2,X1,X0)
    | X5 = X8 ) ).

cnf(u24,negated_conjecture,
    ( ~ sP19(X8,X7,X6,X5,X4,X3,X2,X1,X0)
    | street(X3) ) ).

cnf(u156,negated_conjecture,
    ( ~ man(X4)
    | ~ sP19(X8,X7,X6,X5,X4,X3,X2,X1,X0) ) ).

cnf(u1134,negated_conjecture,
    ~ in(sK5,sK0) ).

cnf(u9,negated_conjecture,
    ( ~ sP19(X8,X7,X6,X5,X4,X3,X2,X1,X0)
    | young(X5) ) ).

cnf(u16,negated_conjecture,
    ( ~ sP19(X8,X7,X6,X5,X4,X3,X2,X1,X0)
    | front(X6) ) ).

cnf(u1054,negated_conjecture,
    ~ sP19(X0,X1,X2,X3,X4,X5,sK12,sK2,X6) ).

cnf(u155,negated_conjecture,
    ( ~ fellow(X4)
    | ~ sP19(X8,X7,X6,X5,X4,X3,X2,X1,X0) ) ).

cnf(u27,negated_conjecture,
    ( ~ sP19(X8,X7,X6,X5,X4,X3,X2,X1,X0)
    | white(X2) ) ).

cnf(u18,negated_conjecture,
    ( ~ sP19(X8,X7,X6,X5,X4,X3,X2,X1,X0)
    | seat(X6) ) ).

cnf(u150,negated_conjecture,
    ( ~ dirty(X2)
    | ~ sP19(X8,X7,X6,X5,X4,X3,X2,X1,X0) ) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NLP013+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.38  % Computer : n005.cluster.edu
% 0.11/0.38  % Model    : x86_64 x86_64
% 0.11/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38  % Memory   : 8046.5625MB
% 0.11/0.38  % OS       : Linux 6.8.0-71-generic
% 0.11/0.38  % CPULimit : 300
% 0.11/0.38  % WCLimit  : 300
% 0.11/0.38  % DateTime : Sun Sep 27 17:48:02 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41  Running first-order model finding
% 0.11/0.41  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.16/0.47  % (54569)Will run a generic schedule for satisfiability detection.
% 0.16/0.47  % (54575)% WARNING: option uhcvi not known.
% 0.16/0.47  % (54575)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=302574501:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.16/0.47  % (54574)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3718973203_2999 on theBenchmark for (2999ds/0Mi)
% 0.16/0.47  % (54576)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3941528672:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.16/0.47  % (54577)dis+10_1_sil=32000:sp=arity:random_seed=3522393902:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.16/0.47  % (54578)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4252728117:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.16/0.47  % (54575) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-54569-54575"...
% 0.16/0.47  % (54575)...printing done.
% 0.16/0.47  % Detected minimum model sizes of [1]
% 0.16/0.47  % Detected maximum model sizes of [19]
% 0.16/0.47  % TRYING [1]
% 0.16/0.47  % SZS status CounterSatisfiable for theBenchmark
% 0.16/0.47  % SZS output start Saturation.
% See solution above
% 0.16/0.47  % SZS output start Definitions and Model Updates.
% 0.16/0.47  globally flip the polarity of every occurrence of predicate "sP20"
% 0.16/0.47  globally flip the polarity of every occurrence of predicate "man"
% 0.16/0.47  globally flip the polarity of every occurrence of predicate "fellow"
% 0.16/0.47  globally flip the polarity of every occurrence of predicate "down"
% 0.16/0.47  globally flip the polarity of every occurrence of predicate "barrel"
% 0.16/0.47  globally flip the polarity of every occurrence of predicate "lonely"
% 0.16/0.47  globally flip the polarity of every occurrence of predicate "old"
% 0.16/0.47  globally flip the polarity of every occurrence of predicate "dirty"
% 0.16/0.47  globally flip the polarity of every occurrence of predicate "car"
% 0.16/0.47  globally flip the polarity of every occurrence of predicate "hollywood"
% 0.16/0.47  % SZS output end Definitions and Model Updates.
% 0.16/0.47  % (54575)------------------------------
% 0.16/0.47  % (54575)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.47  % (54575)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.47  % (54575)CaDiCaL version: 2.1.3
% 0.16/0.47  % (54575)Termination reason: Satisfiable
% 0.16/0.47  % (54575)Time elapsed: 0.014 s
% 0.16/0.47  % (54575)Peak memory usage: 12 MB
% 0.16/0.47  % (54575)Instructions burned: 35 (million)
% 0.16/0.47  % (54569)Success in time 0.049 s
% 0.16/0.47  % Vampire exiting
%------------------------------------------------------------------------------