TSTP Solution File: NLP116+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : NLP116+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 : n009.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:32 EDT 2022
% Result : CounterSatisfiable 1.32s 0.51s
% Output : Saturation 1.32s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(u61,negated_conjecture,
( sP2
| sP1(sK12) ) ).
cnf(u93,negated_conjecture,
( sP2
| ~ sP0(sK12) ) ).
cnf(u27,axiom,
( ~ sP2
| sP0(sK3) ) ).
cnf(u128,axiom,
( ~ sP2
| ~ sP1(sK3) ) ).
cnf(u63,negated_conjecture,
( sP1(sK12)
| sP0(sK3) ) ).
cnf(u130,negated_conjecture,
( sP1(sK12)
| ~ sP1(sK3) ) ).
cnf(u129,negated_conjecture,
( ~ sP1(sK3)
| ~ sP0(sK12) ) ).
cnf(u94,negated_conjecture,
( ~ sP0(sK12)
| sP0(sK3) ) ).
cnf(u45,axiom,
( in(X0,sK10(X0),sK9(X0))
| ~ sP0(X0) ) ).
cnf(u34,axiom,
( in(X0,sK6(X0),sK5(X0))
| ~ sP1(X0) ) ).
cnf(u62,negated_conjecture,
( ~ in(X0,X1,X3)
| ~ of(X0,X2,X3)
| ~ barrel(X0,X1)
| ~ old(X0,X4)
| ~ down(X0,X1,X3)
| ~ white(X0,X4)
| ~ agent(X0,X1,X4)
| ~ street(X0,X3)
| ~ hollywood_placename(X0,X2)
| ~ event(X0,X1)
| ~ actual_world(X0)
| ~ dirty(X0,X4)
| ~ lonely(X0,X3)
| ~ city(X0,X3)
| ~ chevy(X0,X4)
| sP2
| ~ present(X0,X1)
| ~ placename(X0,X2) ) ).
cnf(u25,axiom,
( ~ in(X1,X2,X4)
| ~ event(X1,X2)
| ~ dirty(X1,X4)
| ~ hollywood_placename(X1,X5)
| ~ actual_world(X1)
| ~ of(X1,X5,X4)
| ~ lonely(X1,X3)
| ~ white(X1,X4)
| ~ placename(X1,X5)
| ~ down(X1,X2,X3)
| ~ barrel(X1,X2)
| ~ old(X1,X4)
| ~ city(X1,X4)
| ~ present(X1,X2)
| ~ chevy(X1,X4)
| ~ sP2
| ~ agent(X1,X2,X4)
| ~ street(X1,X3) ) ).
cnf(u54,axiom,
( down(X0,sK10(X0),sK9(X0))
| ~ sP0(X0) ) ).
cnf(u30,axiom,
( down(X0,sK6(X0),sK7(X0))
| ~ sP1(X0) ) ).
cnf(u101,negated_conjecture,
( ~ down(X3,sK10(X3),X5)
| ~ agent(X3,sK10(X3),sK9(X3))
| ~ hollywood_placename(X3,X4)
| ~ actual_world(X3)
| ~ dirty(X3,sK9(X3))
| ~ chevy(X3,sK9(X3))
| ~ old(X3,sK9(X3))
| ~ white(X3,sK9(X3))
| ~ placename(X3,X4)
| ~ of(X3,X4,sK9(X3))
| ~ sP0(X3)
| ~ street(X3,X5)
| ~ lonely(X3,X5) ) ).
cnf(u75,negated_conjecture,
( ~ down(X0,sK10(X0),sK9(X0))
| ~ hollywood_placename(X0,X1)
| ~ of(X0,X1,sK9(X0))
| ~ agent(X0,sK10(X0),X2)
| ~ actual_world(X0)
| ~ white(X0,X2)
| ~ placename(X0,X1)
| sP2
| ~ old(X0,X2)
| ~ chevy(X0,X2)
| ~ dirty(X0,X2)
| ~ sP0(X0) ) ).
cnf(u110,axiom,
( ~ down(X0,sK6(X0),X2)
| ~ of(X0,X1,sK5(X0))
| ~ street(X0,X2)
| ~ placename(X0,X1)
| ~ lonely(X0,X2)
| ~ actual_world(X0)
| ~ sP2
| ~ hollywood_placename(X0,X1)
| ~ sP1(X0) ) ).
cnf(u68,negated_conjecture,
( ~ down(X0,sK6(X0),sK5(X0))
| ~ placename(X0,X1)
| ~ agent(X0,sK6(X0),X2)
| ~ actual_world(X0)
| ~ dirty(X0,X2)
| ~ white(X0,X2)
| ~ of(X0,X1,sK5(X0))
| ~ old(X0,X2)
| ~ lonely(X0,sK5(X0))
| ~ sP1(X0)
| sP2
| ~ street(X0,sK5(X0))
| ~ hollywood_placename(X0,X1)
| ~ chevy(X0,X2) ) ).
cnf(u49,axiom,
( barrel(X0,sK10(X0))
| ~ sP0(X0) ) ).
cnf(u29,axiom,
( barrel(X0,sK6(X0))
| ~ sP1(X0) ) ).
cnf(u52,axiom,
( present(X0,sK10(X0))
| ~ sP0(X0) ) ).
cnf(u43,axiom,
( present(X0,sK6(X0))
| ~ sP1(X0) ) ).
cnf(u58,axiom,
( agent(X0,sK10(X0),sK8(X0))
| ~ sP0(X0) ) ).
cnf(u33,axiom,
( agent(X0,sK6(X0),sK5(X0))
| ~ sP1(X0) ) ).
cnf(u114,negated_conjecture,
( ~ agent(X0,sK10(X0),sK9(X0))
| ~ of(X0,X1,sK9(X0))
| ~ old(X0,sK9(X0))
| ~ placename(X0,X1)
| ~ hollywood_placename(X0,X1)
| ~ chevy(X0,sK9(X0))
| ~ actual_world(X0)
| ~ white(X0,sK9(X0))
| ~ sP0(X0)
| ~ dirty(X0,sK9(X0)) ) ).
cnf(u77,negated_conjecture,
( ~ agent(X0,sK10(X0),X2)
| ~ of(X0,X1,sK9(X0))
| ~ chevy(X0,X2)
| ~ actual_world(X0)
| ~ old(X0,X2)
| sP2
| ~ placename(X0,X1)
| ~ white(X0,X2)
| ~ dirty(X0,X2)
| ~ sP0(X0)
| ~ hollywood_placename(X0,X1) ) ).
cnf(u47,axiom,
( event(X0,sK10(X0))
| ~ sP0(X0) ) ).
cnf(u32,axiom,
( event(X0,sK6(X0))
| ~ sP1(X0) ) ).
cnf(u51,axiom,
( old(X0,sK8(X0))
| ~ sP0(X0) ) ).
cnf(u37,axiom,
( old(X0,sK5(X0))
| ~ sP1(X0) ) ).
cnf(u50,axiom,
( dirty(X0,sK8(X0))
| ~ sP0(X0) ) ).
cnf(u36,axiom,
( dirty(X0,sK5(X0))
| ~ sP1(X0) ) ).
cnf(u53,axiom,
( white(X0,sK8(X0))
| ~ sP0(X0) ) ).
cnf(u40,axiom,
( white(X0,sK5(X0))
| ~ sP1(X0) ) ).
cnf(u57,axiom,
( chevy(X0,sK8(X0))
| ~ sP0(X0) ) ).
cnf(u28,axiom,
( chevy(X0,sK5(X0))
| ~ sP1(X0) ) ).
cnf(u46,axiom,
( placename(X0,sK11(X0))
| ~ sP0(X0) ) ).
cnf(u38,axiom,
( placename(X0,sK4(X0))
| ~ sP1(X0) ) ).
cnf(u83,negated_conjecture,
( ~ placename(X0,X1)
| ~ sP0(X0)
| ~ hollywood_placename(X0,X1)
| sP2
| ~ of(X0,X1,sK9(X0))
| ~ actual_world(X0) ) ).
cnf(u118,axiom,
( ~ placename(X0,X1)
| ~ sP1(X0)
| ~ actual_world(X0)
| ~ of(X0,X1,sK5(X0))
| ~ sP2
| ~ hollywood_placename(X0,X1) ) ).
cnf(u56,axiom,
( hollywood_placename(X0,sK11(X0))
| ~ sP0(X0) ) ).
cnf(u31,axiom,
( hollywood_placename(X0,sK4(X0))
| ~ sP1(X0) ) ).
cnf(u55,axiom,
( city(X0,sK9(X0))
| ~ sP0(X0) ) ).
cnf(u42,axiom,
( city(X0,sK5(X0))
| ~ sP1(X0) ) ).
cnf(u59,axiom,
( of(X0,sK11(X0),sK9(X0))
| ~ sP0(X0) ) ).
cnf(u41,axiom,
( of(X0,sK4(X0),sK5(X0))
| ~ sP1(X0) ) ).
cnf(u123,negated_conjecture,
( ~ of(X1,sK11(X1),sK5(X1))
| ~ sP1(X1)
| ~ actual_world(X1)
| ~ sP0(X1) ) ).
cnf(u88,negated_conjecture,
( ~ of(X0,sK4(X0),sK9(X0))
| sP2
| ~ sP1(X0)
| ~ actual_world(X0)
| ~ sP0(X0) ) ).
cnf(u87,negated_conjecture,
( ~ of(X1,sK11(X1),sK9(X1))
| ~ actual_world(X1)
| sP2
| ~ sP0(X1) ) ).
cnf(u44,axiom,
( lonely(X0,sK9(X0))
| ~ sP0(X0) ) ).
cnf(u35,axiom,
( lonely(X0,sK7(X0))
| ~ sP1(X0) ) ).
cnf(u48,axiom,
( street(X0,sK9(X0))
| ~ sP0(X0) ) ).
cnf(u39,axiom,
( street(X0,sK7(X0))
| ~ sP1(X0) ) ).
cnf(u26,axiom,
( actual_world(sK3)
| ~ sP2 ) ).
cnf(u60,negated_conjecture,
( actual_world(sK12)
| sP2 ) ).
cnf(u90,negated_conjecture,
( ~ actual_world(X0)
| ~ sP0(X0)
| sP2 ) ).
cnf(u125,axiom,
( ~ actual_world(X0)
| ~ sP2
| ~ sP1(X0) ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NLP116+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 : n009.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:50:20 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.50 % (11808)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.19/0.50 % (11800)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.19/0.51 % (11792)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.19/0.51 % (11808)First to succeed.
% 1.32/0.51 % (11807)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 1.32/0.51 TRYING [1]
% 1.32/0.51 % SZS status CounterSatisfiable for theBenchmark
% 1.32/0.51 % (11808)# SZS output start Saturation.
% See solution above
% 1.32/0.51 % (11808)------------------------------
% 1.32/0.51 % (11808)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.32/0.51 % (11808)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.32/0.51 % (11808)Termination reason: Satisfiable
% 1.32/0.51
% 1.32/0.51 % (11808)Memory used [KB]: 1023
% 1.32/0.51 % (11808)Time elapsed: 0.058 s
% 1.32/0.51 % (11808)Instructions burned: 5 (million)
% 1.32/0.51 % (11808)------------------------------
% 1.32/0.51 % (11808)------------------------------
% 1.32/0.51 % (11785)Success in time 0.17 s
%------------------------------------------------------------------------------