TSTP Solution File: NLP151+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : NLP151+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 : n026.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:44 EDT 2022
% Result : CounterSatisfiable 0.20s 0.52s
% Output : Saturation 0.20s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(u303,negated_conjecture,
( member(sK2,sK1(sK2,X2),X2)
| member(sK2,sK0(sK2,X2),X2)
| ~ two(sK2,X2) ) ).
cnf(u194,negated_conjecture,
in(sK2,sK5,sK3) ).
cnf(u244,negated_conjecture,
( ~ in(X0,X4,X1)
| ~ barrel(X0,X4)
| ~ down(X0,X4,X1)
| ~ dirty(X0,X5)
| ~ agent(X0,X4,X5)
| ~ of(X0,X2,X1)
| ~ city(X0,X1)
| ~ lonely(X0,X1)
| ~ group(X0,X3)
| ~ old(X0,X5)
| ~ chevy(X0,X5)
| ~ hollywood_placename(X0,X2)
| member(X0,sK0(X0,X3),X3)
| ~ street(X0,X1)
| ~ white(X0,X5)
| ~ two(X0,X3)
| member(X0,sK1(X0,X3),X3)
| ~ actual_world(X0)
| ~ present(X0,X4) ) ).
cnf(u196,negated_conjecture,
down(sK2,sK5,sK3) ).
cnf(u202,negated_conjecture,
present(sK2,sK5) ).
cnf(u207,negated_conjecture,
agent(sK2,sK5,sK4) ).
cnf(u199,negated_conjecture,
lonely(sK2,sK3) ).
cnf(u203,negated_conjecture,
dirty(sK2,sK4) ).
cnf(u193,negated_conjecture,
white(sK2,sK4) ).
cnf(u191,negated_conjecture,
actual_world(sK2) ).
cnf(u237,axiom,
( member(X0,sK7(X0,X1,X2,X3),X1)
| two(X0,X1)
| ~ member(X0,X2,X1)
| ~ member(X0,X3,X1)
| X2 = X3 ) ).
cnf(u233,axiom,
~ member(X1,X0,X0) ).
cnf(u195,negated_conjecture,
of(sK2,sK6,sK3) ).
cnf(u290,negated_conjecture,
( ~ of(sK2,X0,sK3)
| ~ placename(sK2,X0)
| sK6 = X0 ) ).
cnf(u242,axiom,
( ~ of(X2,X3,X0)
| ~ placename(X2,X3)
| ~ of(X2,X1,X0)
| ~ placename(X2,X1)
| X1 = X3
| ~ entity(X2,X0) ) ).
cnf(u204,negated_conjecture,
old(sK2,sK4) ).
cnf(u251,negated_conjecture,
singleton(sK2,sK6) ).
cnf(u273,negated_conjecture,
singleton(sK2,sK5) ).
cnf(u263,negated_conjecture,
singleton(sK2,sK4) ).
cnf(u284,negated_conjecture,
singleton(sK2,sK3) ).
cnf(u188,axiom,
( ~ singleton(X0,X1)
| ~ multiple(X0,X1) ) ).
cnf(u282,negated_conjecture,
existent(sK2,sK3) ).
cnf(u262,negated_conjecture,
existent(sK2,sK4) ).
cnf(u235,axiom,
( ~ existent(X1,X0)
| ~ nonexistent(X1,X0) ) ).
cnf(u252,negated_conjecture,
~ multiple(sK2,sK6) ).
cnf(u274,negated_conjecture,
~ multiple(sK2,sK5) ).
cnf(u264,negated_conjecture,
~ multiple(sK2,sK4) ).
cnf(u286,negated_conjecture,
~ multiple(sK2,sK3) ).
cnf(u231,axiom,
( ~ set(X0,X1)
| multiple(X0,X1) ) ).
cnf(u228,axiom,
( ~ group(X0,X1)
| set(X0,X1) ) ).
cnf(u229,axiom,
( ~ two(X1,X0)
| group(X1,X0) ) ).
cnf(u280,negated_conjecture,
specific(sK2,sK3) ).
cnf(u269,negated_conjecture,
specific(sK2,sK5) ).
cnf(u265,negated_conjecture,
specific(sK2,sK4) ).
cnf(u224,axiom,
( ~ specific(X0,X1)
| ~ general(X0,X1) ) ).
cnf(u270,negated_conjecture,
nonexistent(sK2,sK5) ).
cnf(u285,negated_conjecture,
~ nonexistent(sK2,sK3) ).
cnf(u275,negated_conjecture,
~ nonexistent(sK2,sK4) ).
cnf(u268,negated_conjecture,
eventuality(sK2,sK5) ).
cnf(u212,axiom,
( ~ eventuality(X1,X0)
| thing(X1,X0) ) ).
cnf(u216,axiom,
( ~ eventuality(X0,X1)
| nonexistent(X0,X1) ) ).
cnf(u222,axiom,
( ~ eventuality(X0,X1)
| specific(X0,X1) ) ).
cnf(u192,negated_conjecture,
event(sK2,sK5) ).
cnf(u234,axiom,
( ~ event(X1,X0)
| eventuality(X1,X0) ) ).
cnf(u198,negated_conjecture,
barrel(sK2,sK5) ).
cnf(u211,axiom,
( ~ barrel(X1,X0)
| event(X1,X0) ) ).
cnf(u197,negated_conjecture,
chevy(sK2,sK4) ).
cnf(u215,axiom,
( ~ chevy(X1,X0)
| car(X1,X0) ) ).
cnf(u246,negated_conjecture,
car(sK2,sK4) ).
cnf(u223,axiom,
( ~ car(X1,X0)
| vehicle(X1,X0) ) ).
cnf(u254,negated_conjecture,
vehicle(sK2,sK4) ).
cnf(u213,axiom,
( ~ vehicle(X1,X0)
| transport(X1,X0) ) ).
cnf(u255,negated_conjecture,
transport(sK2,sK4) ).
cnf(u218,axiom,
( ~ transport(X0,X1)
| instrumentality(X0,X1) ) ).
cnf(u279,negated_conjecture,
entity(sK2,sK3) ).
cnf(u260,negated_conjecture,
entity(sK2,sK4) ).
cnf(u190,axiom,
( ~ entity(X1,X0)
| existent(X1,X0) ) ).
cnf(u209,axiom,
( ~ entity(X0,X1)
| thing(X0,X1) ) ).
cnf(u230,axiom,
( ~ entity(X0,X1)
| specific(X0,X1) ) ).
cnf(u200,negated_conjecture,
street(sK2,sK3) ).
cnf(u225,axiom,
( ~ street(X1,X0)
| way(X1,X0) ) ).
cnf(u277,negated_conjecture,
artifact(sK2,sK3) ).
cnf(u257,negated_conjecture,
artifact(sK2,sK4) ).
cnf(u226,axiom,
( ~ artifact(X0,X1)
| object(X0,X1) ) ).
cnf(u258,negated_conjecture,
way(sK2,sK3) ).
cnf(u240,axiom,
( ~ way(X0,X1)
| artifact(X0,X1) ) ).
cnf(u247,negated_conjecture,
relname(sK2,sK6) ).
cnf(u210,axiom,
( ~ relname(X1,X0)
| relation(X1,X0) ) ).
cnf(u248,negated_conjecture,
relation(sK2,sK6) ).
cnf(u189,axiom,
( ~ relation(X1,X0)
| abstraction(X1,X0) ) ).
cnf(u250,negated_conjecture,
thing(sK2,sK6) ).
cnf(u271,negated_conjecture,
thing(sK2,sK5) ).
cnf(u261,negated_conjecture,
thing(sK2,sK4) ).
cnf(u281,negated_conjecture,
thing(sK2,sK3) ).
cnf(u219,axiom,
( ~ thing(X0,X1)
| singleton(X0,X1) ) ).
cnf(u276,negated_conjecture,
general(sK2,sK6) ).
cnf(u283,negated_conjecture,
~ general(sK2,sK3) ).
cnf(u272,negated_conjecture,
~ general(sK2,sK5) ).
cnf(u266,negated_conjecture,
~ general(sK2,sK4) ).
cnf(u249,negated_conjecture,
abstraction(sK2,sK6) ).
cnf(u217,axiom,
( ~ abstraction(X0,X1)
| thing(X0,X1) ) ).
cnf(u239,axiom,
( ~ abstraction(X1,X0)
| general(X1,X0) ) ).
cnf(u205,negated_conjecture,
placename(sK2,sK6) ).
cnf(u220,axiom,
( ~ placename(X1,X0)
| relname(X1,X0) ) ).
cnf(u201,negated_conjecture,
hollywood_placename(sK2,sK6) ).
cnf(u232,axiom,
( ~ hollywood_placename(X1,X0)
| placename(X1,X0) ) ).
cnf(u206,negated_conjecture,
city(sK2,sK3) ).
cnf(u221,axiom,
( ~ city(X1,X0)
| location(X1,X0) ) ).
cnf(u278,negated_conjecture,
object(sK2,sK3) ).
cnf(u259,negated_conjecture,
object(sK2,sK4) ).
cnf(u227,axiom,
( ~ object(X0,X1)
| entity(X0,X1) ) ).
cnf(u253,negated_conjecture,
location(sK2,sK3) ).
cnf(u241,axiom,
( ~ location(X0,X1)
| object(X0,X1) ) ).
cnf(u256,negated_conjecture,
instrumentality(sK2,sK4) ).
cnf(u214,axiom,
( ~ instrumentality(X1,X0)
| artifact(X1,X0) ) ).
cnf(u238,axiom,
( sK7(X0,X1,X2,X3) != X2
| two(X0,X1)
| ~ member(X0,X3,X1)
| ~ member(X0,X2,X1)
| X2 = X3 ) ).
cnf(u236,axiom,
( sK7(X0,X1,X2,X3) != X3
| ~ member(X0,X2,X1)
| two(X0,X1)
| X2 = X3
| ~ member(X0,X3,X1) ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NLP151+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % 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.35 % Computer : n026.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 30 04:59:05 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.50 % (27700)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.20/0.50 % (27716)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.20/0.51 % (27708)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 0.20/0.51 % (27700)First to succeed.
% 0.20/0.52 % SZS status CounterSatisfiable for theBenchmark
% 0.20/0.52 % (27700)# SZS output start Saturation.
% See solution above
% 0.20/0.52 % (27700)------------------------------
% 0.20/0.52 % (27700)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52 % (27700)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52 % (27700)Termination reason: Satisfiable
% 0.20/0.52
% 0.20/0.52 % (27700)Memory used [KB]: 5756
% 0.20/0.52 % (27700)Time elapsed: 0.106 s
% 0.20/0.52 % (27700)Instructions burned: 6 (million)
% 0.20/0.52 % (27700)------------------------------
% 0.20/0.52 % (27700)------------------------------
% 0.20/0.52 % (27687)Success in time 0.161 s
%------------------------------------------------------------------------------