TSTP Solution File: NLP137-1 by SnakeForV-SAT---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : NLP137-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s

% Computer : n023.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed Aug 31 17:55:39 EDT 2022

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

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

cnf(u68,negated_conjecture,
    chevy(skc43,skc49) ).

cnf(u73,negated_conjecture,
    agent(skc43,skc45,skc49) ).

cnf(u77,negated_conjecture,
    ( ~ member(skc43,X0,skc44)
    | fellow(skc43,X0) ) ).

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

cnf(u100,negated_conjecture,
    ( ~ member(skc43,X0,skc44)
    | young(skc43,X0) ) ).

cnf(u105,negated_conjecture,
    old(skc43,skc49) ).

cnf(u114,negated_conjecture,
    city(skc43,skc48) ).

cnf(u133,negated_conjecture,
    two(skc43,skc44) ).

cnf(u138,negated_conjecture,
    lonely(skc43,skc46) ).

cnf(u148,negated_conjecture,
    dirty(skc43,skc49) ).

cnf(u153,negated_conjecture,
    in(skc43,skc45,skc48) ).

cnf(u158,negated_conjecture,
    white(skc43,skc49) ).

cnf(u178,negated_conjecture,
    group(skc43,skc44) ).

cnf(u193,negated_conjecture,
    ssSkP0(skc44,skc43) ).

cnf(u198,negated_conjecture,
    placename(skc43,skc47) ).

cnf(u203,negated_conjecture,
    present(skc43,skc45) ).

cnf(u208,negated_conjecture,
    street(skc43,skc46) ).

cnf(u213,negated_conjecture,
    event(skc43,skc45) ).

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

cnf(u237,negated_conjecture,
    of(skc43,skc47,skc48) ).

cnf(u246,negated_conjecture,
    barrel(skc43,skc45) ).

cnf(u251,negated_conjecture,
    hollywood_placename(skc43,skc47) ).

cnf(u276,negated_conjecture,
    down(skc43,skc45,skc46) ).

cnf(u298,negated_conjecture,
    ssSkP1(skc44,skc43) ).

cnf(u332,negated_conjecture,
    ~ in(skc43,skc45,skc46) ).

cnf(u321,negated_conjecture,
    ( be(X3,skf11(X3,skf19(X3,X2)),skf19(X3,X2),skf10(skf19(X3,X2),X3))
    | ~ frontseat(X3,skf19(X3,X2))
    | ssSkP1(X2,X3)
    | ~ ssSkP0(X2,X3) ) ).

cnf(u316,negated_conjecture,
    ( be(X0,skf16(X0,skf14(X0,X1)),skf14(X0,X1),skf15(X0,skf14(X0,X1)))
    | ssSkP0(X1,X0)
    | ~ ssSkP1(X1,X0) ) ).

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

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

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

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

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

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

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

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

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

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

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

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

cnf(u314,negated_conjecture,
    ( ~ frontseat(X4,skf19(X4,X3))
    | ssSkP1(X3,X4)
    | state(X4,skf11(X4,X5))
    | ~ ssSkP0(X3,X4) ) ).

cnf(u319,negated_conjecture,
    ( in(X2,skf10(skf19(X2,X3),X2),skf19(X2,X3))
    | ~ frontseat(X2,skf19(X2,X3))
    | ssSkP1(X3,X2)
    | ~ ssSkP0(X3,X2) ) ).

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

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

cnf(u305,negated_conjecture,
    ( ~ ssSkP1(X2,X0)
    | ssSkP0(X2,X0)
    | state(X0,skf16(X0,X1)) ) ).

cnf(u307,negated_conjecture,
    ( ~ ssSkP1(X2,X0)
    | frontseat(X0,skf15(X0,X1))
    | ssSkP0(X2,X0) ) ).

cnf(u311,negated_conjecture,
    ( ~ ssSkP1(X0,X1)
    | in(X1,skf15(X1,X2),skf15(X1,X2))
    | ssSkP0(X0,X1) ) ).

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

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


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : NLP137-1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.12  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.33  % Computer : n023.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit   : 300
% 0.13/0.33  % WCLimit    : 300
% 0.13/0.33  % DateTime   : Tue Aug 30 04:58:50 EDT 2022
% 0.13/0.33  % CPUTime    : 
% 0.19/0.46  % (27860)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.46  % (27860)First to succeed.
% 0.19/0.46  % (27876)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.19/0.47  % SZS status Satisfiable for theBenchmark
% 0.19/0.47  % (27860)# SZS output start Saturation.
% See solution above
% 0.19/0.47  % (27860)------------------------------
% 0.19/0.47  % (27860)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.47  % (27860)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.47  % (27860)Termination reason: Satisfiable
% 0.19/0.47  
% 0.19/0.47  % (27860)Memory used [KB]: 5628
% 0.19/0.47  % (27860)Time elapsed: 0.064 s
% 0.19/0.47  % (27860)Instructions burned: 4 (million)
% 0.19/0.47  % (27860)------------------------------
% 0.19/0.47  % (27860)------------------------------
% 0.19/0.47  % (27852)Success in time 0.126 s
%------------------------------------------------------------------------------