↑ 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  : NLP132-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 : n006.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:09:01 PM UTC 2026

% Result   : Satisfiable 0.09s 0.45s
% Output   : Saturation 0.09s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(u64,negated_conjecture,
    ~ ssSkC0 ).

cnf(u71,negated_conjecture,
    ( ~ young(X0,skf21(X0,X5))
    | ~ actual_world(X0)
    | ~ ssSkP1(X6,X0)
    | ~ two(X0,X6)
    | ~ group(X0,X6)
    | ~ fellow(X0,skf21(X0,X5))
    | ~ event(X0,X1)
    | ~ placename(X0,X4)
    | ~ hollywood_placename(X0,X4)
    | ~ of(X0,X4,X3)
    | ~ city(X0,X3)
    | ~ street(X0,X3)
    | ~ lonely(X0,X3)
    | ~ down(X0,X1,X3)
    | ~ in(X0,X1,X3)
    | ~ chevy(X0,X2)
    | ~ white(X0,X2)
    | ~ dirty(X0,X2)
    | ~ old(X0,X2)
    | ~ agent(X0,X1,X2)
    | ~ barrel(X0,X1)
    | ~ present(X0,X1) ) ).

cnf(u79,negated_conjecture,
    ( ~ down(X0,X1,X3)
    | member(X0,skf21(X0,X5),X5)
    | ~ actual_world(X0)
    | ~ ssSkP1(X5,X0)
    | ~ two(X0,X5)
    | ~ group(X0,X5)
    | ~ placename(X0,X4)
    | ~ hollywood_placename(X0,X4)
    | ~ of(X0,X4,X3)
    | ~ city(X0,X3)
    | ~ street(X0,X3)
    | ~ lonely(X0,X3)
    | ~ event(X0,X1)
    | ~ in(X0,X1,X3)
    | ~ chevy(X0,X2)
    | ~ white(X0,X2)
    | ~ dirty(X0,X2)
    | ~ old(X0,X2)
    | ~ agent(X0,X1,X2)
    | ~ barrel(X0,X1)
    | ~ present(X0,X1) ) ).

cnf(u91,negated_conjecture,
    ( young(skc42,X0)
    | ~ member(skc42,X0,skc43) ) ).

cnf(u95,negated_conjecture,
    ( fellow(skc42,X0)
    | ~ member(skc42,X0,skc43) ) ).

cnf(u120,negated_conjecture,
    down(skc42,skc44,skc45) ).

cnf(u125,negated_conjecture,
    of(skc42,skc47,skc46) ).

cnf(u130,negated_conjecture,
    in(skc42,skc44,skc46) ).

cnf(u135,negated_conjecture,
    agent(skc42,skc44,skc46) ).

cnf(u215,negated_conjecture,
    ssSkP0(skc43,skc42) ).

cnf(u220,negated_conjecture,
    two(skc42,skc43) ).

cnf(u225,negated_conjecture,
    group(skc42,skc43) ).

cnf(u230,negated_conjecture,
    street(skc42,skc45) ).

cnf(u235,negated_conjecture,
    lonely(skc42,skc45) ).

cnf(u240,negated_conjecture,
    barrel(skc42,skc44) ).

cnf(u245,negated_conjecture,
    present(skc42,skc44) ).

cnf(u250,negated_conjecture,
    event(skc42,skc44) ).

cnf(u255,negated_conjecture,
    hollywood_placename(skc42,skc47) ).

cnf(u260,negated_conjecture,
    placename(skc42,skc47) ).

cnf(u265,negated_conjecture,
    old(skc42,skc46) ).

cnf(u270,negated_conjecture,
    dirty(skc42,skc46) ).

cnf(u275,negated_conjecture,
    white(skc42,skc46) ).

cnf(u280,negated_conjecture,
    chevy(skc42,skc46) ).

cnf(u285,negated_conjecture,
    city(skc42,skc46) ).

cnf(u302,negated_conjecture,
    ~ member(skc42,skf14(skc42,X1),skc43) ).

cnf(u326,negated_conjecture,
    ~ in(skc42,skc44,skc45) ).

cnf(u343,negated_conjecture,
    ~ member(skc42,skf21(skc42,X1),skc43) ).

cnf(u384,negated_conjecture,
    ( ~ member(skc42,X1,X2)
    | member(skc42,skf19(skc42,X2),X2) ) ).

cnf(u389,negated_conjecture,
    ( ~ in(X0,skf15(X0,skf14(X0,X1)),skf14(X0,X1))
    | in(X0,skf10(skf15(X0,X5),X0),skf15(X0,X5))
    | ~ member(X0,skf19(X0,X3),X4)
    | member(X0,skf19(X0,X4),X4)
    | ~ member(X0,skf14(X0,X1),X2)
    | ~ member(X0,skf15(X0,X5),X6)
    | ~ member(X0,X7,X8)
    | member(X0,skf19(X0,X8),X8) ) ).

cnf(u299,negated_conjecture,
    ( ssSkP0(X2,X1)
    | ~ member(X1,skf14(X1,X3),X0)
    | member(X1,skf14(X1,X0),X0) ) ).

cnf(clause42,negated_conjecture,
    ( ssSkP0(X0,X1)
    | member(X1,skf14(X1,X0),X0) ) ).

cnf(u309,negated_conjecture,
    ( ~ frontseat(X0,skf10(skf19(X0,X1),X0))
    | ~ in(X0,skf10(skf19(X0,X1),X0),skf10(skf19(X0,X1),X0))
    | ssSkP1(X2,X0)
    | ~ frontseat(X0,skf19(X0,X1))
    | ~ ssSkP0(X3,X0)
    | ~ member(X0,skf19(X0,X1),X3) ) ).

cnf(clause52,negated_conjecture,
    ( be(X0,skf16(X0,X1),X1,skf15(X0,X1))
    | ~ ssSkP1(X2,X0)
    | ~ member(X0,X1,X2) ) ).

cnf(clause53,negated_conjecture,
    ( ~ frontseat(X0,X1)
    | ~ member(X0,X1,X2)
    | ~ ssSkP0(X2,X0)
    | in(X0,skf10(X1,X0),X1) ) ).

cnf(clause54,negated_conjecture,
    ( be(X0,skf11(X0,X1),X1,skf10(X1,X0))
    | ~ frontseat(X0,X1)
    | ~ ssSkP0(X2,X0)
    | ~ member(X0,X1,X2) ) ).

cnf(u295,negated_conjecture,
    ( ssSkP0(X2,X0)
    | ~ ssSkP0(X3,X0)
    | ~ member(X0,skf14(X0,X1),X3) ) ).

cnf(u289,negated_conjecture,
    ( ~ ssSkP1(X3,X0)
    | ~ ssSkP0(X2,X0)
    | in(X0,skf10(skf15(X0,X1),X0),skf15(X0,X1))
    | ~ member(X0,skf15(X0,X1),X2)
    | ~ member(X0,X4,X3) ) ).

cnf(u367,negated_conjecture,
    ( ssSkP0(X0,X1)
    | ~ in(X1,skf15(X1,skf14(X1,X2)),skf14(X1,X2))
    | ~ member(X1,skf14(X1,X2),X3)
    | member(X1,skf19(X1,X3),X3) ) ).

cnf(u380,negated_conjecture,
    ( ~ ssSkP0(X5,X0)
    | ~ member(X0,skf15(X0,X1),X2)
    | ~ member(X0,X3,X4)
    | member(X0,skf19(X0,X4),X4)
    | in(X0,skf10(skf15(X0,X1),X0),skf15(X0,X1))
    | ~ member(X0,skf14(X0,X6),X5) ) ).

cnf(u287,negated_conjecture,
    ( in(X0,skf15(X0,X3),skf15(X0,X3))
    | ~ member(X0,X1,X2)
    | member(X0,skf19(X0,X2),X2) ) ).

cnf(u372,negated_conjecture,
    ( ~ ssSkP0(X0,X1)
    | in(X1,skf10(skf15(X1,X2),X1),skf15(X1,X2))
    | ~ member(X1,skf15(X1,X2),X0)
    | ~ member(X1,X3,X4)
    | member(X1,skf19(X1,X4),X4) ) ).

cnf(u366,negated_conjecture,
    ( ~ ssSkP1(X4,X1)
    | ~ in(X1,skf15(X1,skf14(X1,X2)),skf14(X1,X2))
    | ~ member(X1,skf14(X1,X2),X3)
    | ssSkP0(X0,X1)
    | ~ member(X1,skf19(X1,X5),X4) ) ).

cnf(clause51,negated_conjecture,
    ( state(X0,skf11(X0,X3))
    | ~ frontseat(X0,X1)
    | ~ ssSkP0(X2,X0)
    | ~ member(X0,X1,X2) ) ).

cnf(clause2,negated_conjecture,
    actual_world(skc12) ).

cnf(u312,negated_conjecture,
    ( ssSkP1(X2,X0)
    | ~ ssSkP1(X3,X0)
    | ~ member(X0,skf19(X0,X1),X3) ) ).

cnf(clause55,negated_conjecture,
    ( ~ be(X0,X3,skf14(X0,X2),X1)
    | ~ in(X0,X1,skf14(X0,X2))
    | ~ state(X0,X3)
    | ssSkP0(X4,X0) ) ).

cnf(clause49,negated_conjecture,
    ( frontseat(X0,skf15(X0,X3))
    | ~ ssSkP1(X2,X0)
    | ~ member(X0,X1,X2) ) ).

cnf(clause41,negated_conjecture,
    ( frontseat(X1,skf14(X1,X2))
    | ssSkP0(X0,X1) ) ).

cnf(u377,negated_conjecture,
    ( in(X0,skf10(skf15(X0,X1),X0),skf15(X0,X1))
    | ~ in(X0,skf15(X0,skf14(X0,X5)),skf14(X0,X5))
    | ~ member(X0,X3,X4)
    | member(X0,skf19(X0,X4),X4)
    | ~ member(X0,skf15(X0,X1),X2)
    | ~ member(X0,skf14(X0,X5),X6)
    | member(X0,skf19(X0,X6),X6) ) ).

cnf(clause43,negated_conjecture,
    ( ssSkP1(X0,X1)
    | member(X1,skf19(X1,X0),X0) ) ).

cnf(u354,negated_conjecture,
    ( ssSkP1(X2,X1)
    | ~ member(X1,skf19(X1,X3),X0)
    | member(X1,skf19(X1,X0),X0) ) ).

cnf(u379,negated_conjecture,
    ( in(X0,skf10(skf15(X0,X1),X0),skf15(X0,X1))
    | ~ member(X0,skf15(X0,X1),X2)
    | ~ member(X0,X3,X4)
    | member(X0,skf19(X0,X4),X4)
    | ~ member(X0,skf14(X0,X5),X6)
    | member(X0,skf14(X0,X6),X6) ) ).

cnf(u381,negated_conjecture,
    ( in(X0,skf10(skf15(X0,X1),X0),skf15(X0,X1))
    | ~ member(X0,skf15(X0,X1),X2)
    | ~ member(X0,X3,X4)
    | member(X0,skf19(X0,X4),X4)
    | member(X0,skf14(X0,X2),X2) ) ).

cnf(u288,negated_conjecture,
    ( ~ ssSkP0(X2,X0)
    | ssSkP0(X3,X0)
    | in(X0,skf10(skf14(X0,X1),X0),skf14(X0,X1))
    | ~ member(X0,skf14(X0,X1),X2) ) ).

cnf(u293,negated_conjecture,
    ( ~ ssSkP1(X3,X0)
    | ssSkP0(X2,X0)
    | ~ in(X0,skf15(X0,skf14(X0,X1)),skf14(X0,X1))
    | ~ member(X0,skf14(X0,X1),X3) ) ).

cnf(clause56,negated_conjecture,
    ( ~ be(X0,X2,skf19(X0,X3),X1)
    | ~ in(X0,X1,X1)
    | ~ frontseat(X0,X1)
    | ~ state(X0,X2)
    | ssSkP1(X4,X0) ) ).

cnf(clause50,negated_conjecture,
    ( ~ ssSkP1(X2,X0)
    | ~ member(X0,X1,X2)
    | in(X0,skf15(X0,X3),skf15(X0,X3)) ) ).

cnf(u365,negated_conjecture,
    ( ssSkP0(X0,X1)
    | ~ in(X1,skf15(X1,skf14(X1,X2)),skf14(X1,X2))
    | ~ member(X1,skf14(X1,X2),X3)
    | ~ member(X1,skf19(X1,X4),X5)
    | member(X1,skf19(X1,X5),X5) ) ).

cnf(clause1,negated_conjecture,
    actual_world(skc42) ).

cnf(clause48,negated_conjecture,
    ( state(X0,skf16(X0,X3))
    | ~ ssSkP1(X2,X0)
    | ~ member(X0,X1,X2) ) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : NLP132-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.09/0.37  % Computer : n006.cluster.edu
% 0.09/0.37  % Model    : x86_64 x86_64
% 0.09/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37  % Memory   : 8046.5625MB
% 0.09/0.37  % OS       : Linux 6.8.0-71-generic
% 0.09/0.37  % CPULimit : 300
% 0.09/0.37  % WCLimit  : 300
% 0.09/0.37  % DateTime : Sun Sep 27 18:07:40 UTC 2026
% 0.09/0.38  % CPUTime  : 
% 0.09/0.38  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.41  Running first-order model finding
% 0.09/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.09/0.45  % (3226944)Will run a generic schedule for satisfiability detection.
% 0.09/0.45  % (3226953)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=992325335:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.09/0.45  % (3226950)% WARNING: option uhcvi not known.
% 0.09/0.45  % (3226953) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3226944-3226953"...
% 0.09/0.45  % (3226953)...printing done.
% 0.09/0.45  % (3226952)dis+10_1_sil=32000:sp=arity:random_seed=847033697:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.09/0.45  % SZS status Satisfiable for theBenchmark
% 0.09/0.45  % SZS output start Saturation.
% See solution above
% 0.09/0.45  % SZS output start Definitions and Model Updates.
% 0.09/0.45  % SZS output end Definitions and Model Updates.
% 0.09/0.45  % (3226953)------------------------------
% 0.09/0.45  % (3226953)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.45  % (3226953)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.45  % (3226953)CaDiCaL version: 2.1.3
% 0.09/0.45  % (3226953)Termination reason: Satisfiable
% 0.09/0.45  % (3226953)Time elapsed: 0.005 s
% 0.09/0.45  % (3226953)Peak memory usage: 11 MB
% 0.09/0.45  % (3226953)Instructions burned: 16 (million)
% 0.09/0.45  % (3226944)Success in time 0.034 s
% 0.09/0.45  % Vampire exiting
%------------------------------------------------------------------------------