TSTP Solution File: NLP155-1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : NLP155-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 : n015.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:45 EDT 2022
% Result : Satisfiable 0.20s 0.52s
% Output : Saturation 0.20s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(u97,negated_conjecture,
( ~ ssSkP0(X5,skc6)
| ~ down(skc6,X0,X4)
| ~ barrel(skc6,X0)
| ~ street(skc6,X4)
| ~ lonely(skc6,X4)
| ~ two(skc6,X5)
| ~ city(skc6,X2)
| ~ agent(skc6,X0,X3)
| ~ hollywood_placename(skc6,X1)
| ~ old(skc6,X3)
| ~ present(skc6,X0)
| ~ dirty(skc6,X3)
| ~ in(skc6,X0,X2)
| ~ chevy(skc6,X3)
| ~ white(skc6,X3)
| ~ of(skc6,X1,X2)
| member(skc6,skf5(skc6,X5),X5) ) ).
cnf(clause84,negated_conjecture,
agent(skc6,skc7,skc11) ).
cnf(clause83,negated_conjecture,
down(skc6,skc7,skc8) ).
cnf(clause82,negated_conjecture,
in(skc6,skc7,skc10) ).
cnf(clause79,negated_conjecture,
dirty(skc6,skc11) ).
cnf(clause78,negated_conjecture,
white(skc6,skc11) ).
cnf(clause76,negated_conjecture,
present(skc6,skc7) ).
cnf(clause71,negated_conjecture,
lonely(skc6,skc8) ).
cnf(clause68,negated_conjecture,
actual_world(skc6) ).
cnf(clause87,negated_conjecture,
( ~ actual_world(X0)
| ~ event(X0,X1)
| ~ of(X0,X3,X4)
| ~ white(X0,X2)
| ~ hollywood_placename(X0,X3)
| ~ street(X0,X5)
| ~ in(X0,X1,X4)
| ~ chevy(X0,X2)
| ~ city(X0,X4)
| ~ agent(X0,X1,X2)
| ~ lonely(X0,X5)
| ~ barrel(X0,X1)
| ~ ssSkP0(X6,X0)
| ~ group(X0,X6)
| ~ down(X0,X1,X5)
| ~ dirty(X0,X2)
| ~ present(X0,X1)
| member(X0,skf5(X0,X6),X6)
| ~ old(X0,X2)
| ~ two(X0,X6)
| ~ placename(X0,X3) ) ).
cnf(clause81,negated_conjecture,
of(skc6,skc9,skc10) ).
cnf(u121,negated_conjecture,
( ~ of(skc6,X0,skc10)
| skc9 = X0
| ~ placename(skc6,X0) ) ).
cnf(u108,negated_conjecture,
( ~ of(skc6,skc9,X0)
| ~ of(skc6,X1,X0)
| ~ entity(skc6,X0)
| ~ placename(skc6,X1)
| skc9 = X1 ) ).
cnf(clause80,negated_conjecture,
old(skc6,skc11) ).
cnf(clause46,axiom,
( location(X0,X1)
| ~ city(X0,X1) ) ).
cnf(clause47,axiom,
( ~ location(X0,X1)
| object(X0,X1) ) ).
cnf(clause70,negated_conjecture,
city(skc6,skc10) ).
cnf(u117,axiom,
( ~ city(X0,X1)
| object(X0,X1) ) ).
cnf(clause74,negated_conjecture,
hollywood_placename(skc6,skc9) ).
cnf(clause45,axiom,
( ~ hollywood_placename(X0,X1)
| placename(X0,X1) ) ).
cnf(clause43,axiom,
( general(X0,X1)
| ~ abstraction(X0,X1) ) ).
cnf(clause53,axiom,
( ~ general(X0,X1)
| ~ specific(X0,X1) ) ).
cnf(u98,axiom,
( abstraction(X0,X1)
| ~ placename(X0,X1) ) ).
cnf(clause41,axiom,
( ~ abstraction(X0,X1)
| thing(X0,X1) ) ).
cnf(u90,axiom,
( ~ abstraction(X0,X1)
| ~ specific(X0,X1) ) ).
cnf(clause39,axiom,
( relation(X0,X1)
| ~ relname(X0,X1) ) ).
cnf(clause40,axiom,
( ~ relation(X0,X1)
| abstraction(X0,X1) ) ).
cnf(clause38,axiom,
( relname(X0,X1)
| ~ placename(X0,X1) ) ).
cnf(u92,axiom,
( ~ relname(X0,X1)
| abstraction(X0,X1) ) ).
cnf(clause73,negated_conjecture,
placename(skc6,skc9) ).
cnf(u103,axiom,
( ~ placename(X0,X1)
| ~ specific(X0,X1) ) ).
cnf(u104,axiom,
( ~ placename(X2,X3)
| thing(X2,X3) ) ).
cnf(clause67,axiom,
( ~ placename(X0,X2)
| ~ of(X0,X2,X3)
| ~ placename(X0,X1)
| X1 = X2
| ~ entity(X0,X3)
| ~ of(X0,X1,X3) ) ).
cnf(clause36,axiom,
( way(X0,X1)
| ~ street(X0,X1) ) ).
cnf(clause37,axiom,
( ~ way(X0,X1)
| artifact(X0,X1) ) ).
cnf(clause72,negated_conjecture,
street(skc6,skc8) ).
cnf(u116,axiom,
( ~ street(X0,X1)
| artifact(X0,X1) ) ).
cnf(u119,negated_conjecture,
object(skc6,skc10) ).
cnf(clause31,axiom,
( object(X0,X1)
| ~ artifact(X0,X1) ) ).
cnf(clause32,axiom,
( ~ object(X0,X1)
| entity(X0,X1) ) ).
cnf(u125,axiom,
( artifact(X0,X1)
| ~ chevy(X0,X1) ) ).
cnf(u118,negated_conjecture,
artifact(skc6,skc8) ).
cnf(u115,axiom,
( ~ artifact(X0,X1)
| entity(X0,X1) ) ).
cnf(clause29,axiom,
( instrumentality(X0,X1)
| ~ transport(X0,X1) ) ).
cnf(clause30,axiom,
( ~ instrumentality(X0,X1)
| artifact(X0,X1) ) ).
cnf(clause28,axiom,
( transport(X0,X1)
| ~ vehicle(X0,X1) ) ).
cnf(u89,axiom,
( ~ transport(X0,X1)
| artifact(X0,X1) ) ).
cnf(clause27,axiom,
( vehicle(X0,X1)
| ~ car(X0,X1) ) ).
cnf(u91,axiom,
( ~ vehicle(X0,X1)
| artifact(X0,X1) ) ).
cnf(clause26,axiom,
( car(X0,X1)
| ~ chevy(X0,X1) ) ).
cnf(u114,axiom,
( ~ car(X0,X1)
| artifact(X0,X1) ) ).
cnf(clause69,negated_conjecture,
chevy(skc6,skc11) ).
cnf(u126,axiom,
( ~ chevy(X0,X1)
| entity(X0,X1) ) ).
cnf(clause77,negated_conjecture,
barrel(skc6,skc7) ).
cnf(clause25,axiom,
( ~ barrel(X0,X1)
| event(X0,X1) ) ).
cnf(clause75,negated_conjecture,
event(skc6,skc7) ).
cnf(clause24,axiom,
( ~ event(X0,X1)
| eventuality(X0,X1) ) ).
cnf(clause21,axiom,
( nonexistent(X0,X1)
| ~ eventuality(X0,X1) ) ).
cnf(clause57,axiom,
( ~ nonexistent(X0,X1)
| ~ existent(X0,X1) ) ).
cnf(u99,negated_conjecture,
eventuality(skc6,skc7) ).
cnf(u93,axiom,
( ~ eventuality(X0,X1)
| ~ existent(X0,X1) ) ).
cnf(clause19,axiom,
( ~ eventuality(X0,X1)
| thing(X0,X1) ) ).
cnf(clause20,axiom,
( ~ eventuality(X0,X1)
| specific(X0,X1) ) ).
cnf(clause17,axiom,
( ~ two(X0,X1)
| group(X0,X1) ) ).
cnf(clause60,axiom,
( ~ two(X0,X1)
| member(X0,skf12(X1,X0),X1) ) ).
cnf(clause61,axiom,
( ~ two(X0,X1)
| member(X0,skf10(X1,X0),X1) ) ).
cnf(clause63,axiom,
( ~ two(X0,X2)
| skf10(X2,X0) = X1
| skf12(X2,X0) = X1
| ~ member(X0,X1,X2) ) ).
cnf(clause16,axiom,
( multiple(X0,X1)
| ~ set(X0,X1) ) ).
cnf(clause54,axiom,
( ~ multiple(X0,X1)
| ~ singleton(X0,X1) ) ).
cnf(clause15,axiom,
( set(X0,X1)
| ~ group(X0,X1) ) ).
cnf(u111,axiom,
( ~ set(X0,X1)
| ~ singleton(X0,X1) ) ).
cnf(u123,axiom,
( ~ group(X0,X1)
| ~ singleton(X0,X1) ) ).
cnf(clause9,axiom,
( existent(X0,X1)
| ~ entity(X0,X1) ) ).
cnf(u100,negated_conjecture,
~ existent(skc6,skc7) ).
cnf(u113,negated_conjecture,
specific(skc6,skc7) ).
cnf(clause8,axiom,
( specific(X0,X1)
| ~ entity(X0,X1) ) ).
cnf(u106,negated_conjecture,
~ specific(skc6,skc9) ).
cnf(clause7,axiom,
( singleton(X0,X1)
| ~ thing(X0,X1) ) ).
cnf(clause6,axiom,
( thing(X0,X1)
| ~ entity(X0,X1) ) ).
cnf(u112,negated_conjecture,
thing(skc6,skc7) ).
cnf(u107,negated_conjecture,
thing(skc6,skc9) ).
cnf(u127,negated_conjecture,
entity(skc6,skc11) ).
cnf(u124,negated_conjecture,
entity(skc6,skc8) ).
cnf(u120,negated_conjecture,
entity(skc6,skc10) ).
cnf(u109,negated_conjecture,
( ~ entity(skc6,skc10)
| skc9 = X0
| ~ of(skc6,X0,skc10)
| ~ placename(skc6,X0) ) ).
cnf(u110,negated_conjecture,
~ entity(skc6,skc9) ).
cnf(u102,negated_conjecture,
~ entity(skc6,skc7) ).
cnf(clause66,axiom,
( member(X0,skf13(X1,X3,X2,X0),X2)
| two(X0,X2)
| ~ member(X0,X1,X2)
| X1 = X3
| ~ member(X0,X3,X2) ) ).
cnf(clause85,negated_conjecture,
( member(X1,skf8(X1,X0),X0)
| ssSkP0(X0,X1) ) ).
cnf(clause1,axiom,
~ member(X0,X1,X1) ).
cnf(clause65,axiom,
( skf13(X0,X1,X2,X3) != X0
| two(X4,X5)
| ~ member(X4,X6,X5)
| ~ member(X4,X0,X5)
| X0 = X6 ) ).
cnf(clause64,axiom,
( skf13(X0,X1,X2,X3) != X1
| ~ member(X4,X1,X5)
| X0 = X1
| ~ member(X4,X0,X5)
| two(X4,X5) ) ).
cnf(clause62,axiom,
( skf12(X0,X1) != skf10(X0,X1)
| ~ two(X1,X0) ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NLP155-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.33 % Computer : n015.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:35 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.49 % (21244)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.20/0.50 % (21252)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.20/0.50 % (21246)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.50 % (21256)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.20/0.51 % (21253)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.20/0.51 % (21245)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.51 % (21241)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.51 % (21259)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 TRYING [1]
% 0.20/0.51 TRYING [2]
% 0.20/0.51 TRYING [3]
% 0.20/0.51 Finite Model Found!
% 0.20/0.51 % (21261)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.20/0.51 % (21238)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 0.20/0.51 % (21240)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.20/0.51 % (21267)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.52 % (21239)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.52 % (21240)First to succeed.
% 0.20/0.52 % (21266)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=177:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/177Mi)
% 0.20/0.52 % (21267)Also succeeded, but the first one will report.
% 0.20/0.52 % SZS status Satisfiable for theBenchmark
% 0.20/0.52 % SZS status Satisfiable for theBenchmark
% 0.20/0.52 % (21240)# SZS output start Saturation.
% See solution above
% 0.20/0.52 % (21240)------------------------------
% 0.20/0.52 % (21240)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52 % (21240)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52 % (21240)Termination reason: Satisfiable
% 0.20/0.52
% 0.20/0.52 % (21240)Memory used [KB]: 1023
% 0.20/0.52 % (21240)Time elapsed: 0.113 s
% 0.20/0.52 % (21240)Instructions burned: 5 (million)
% 0.20/0.52 % (21240)------------------------------
% 0.20/0.52 % (21240)------------------------------
% 0.20/0.52 % (21236)Success in time 0.176 s
%------------------------------------------------------------------------------