TSTP Solution File: NLP266_3 by SnakeForV-SAT---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : NLP266_3 : TPTP v8.2.0. Released v8.2.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 : Mon May 22 15:39:55 EDT 2023

% Result   : CounterSatisfiable 0.20s 0.53s
% Output   : Saturation 0.20s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(u40,negated_conjecture,
    ( '$ki_exists_in_world_$i'(sK3(X1,X2,X3,X4),sK4(X1,X2,X3,X4))
    | ~ '$ki_exists_in_world_$i'(sK1,X4)
    | ~ '$ki_exists_in_world_$i'(sK1,X2)
    | ~ entry_box(sK2(X1,X2),X2)
    | ~ '$ki_exists_in_world_$i'(sK1,X1)
    | ~ number(sK2(X1,X2),X2,one)
    | ~ '$ki_exists_in_world_$i'(sK1,X3)
    | ~ userid(sK2(X1,X2),u,X1) ) ).

cnf(u38,axiom,
    '$ki_exists_in_world_$i'(X1,X0) ).

cnf(u45,negated_conjecture,
    ( ~ '$ki_exists_in_world_$i'(sK1,X4)
    | ~ '$ki_exists_in_world_$i'(sK1,X2)
    | ~ '$ki_exists_in_world_$i'(sK1,X1)
    | '$ki_accessible'(sK1,sK2(X1,X2))
    | ~ '$ki_exists_in_world_$i'(sK1,X3)
    | ~ in(sK3(X1,X2,X3,X4),X1,X2,sK4(X1,X2,X3,X4)) ) ).

cnf(u46,negated_conjecture,
    ( ~ '$ki_exists_in_world_$i'(sK1,X4)
    | do(sK3(X1,X2,X3,X4),X4,X3,sK4(X1,X2,X3,X4))
    | ~ '$ki_exists_in_world_$i'(sK1,X3)
    | ~ '$ki_exists_in_world_$i'(sK1,X2)
    | ~ '$ki_exists_in_world_$i'(sK1,X1)
    | '$ki_accessible'(sK1,sK2(X1,X2)) ) ).

cnf(u86,axiom,
    ( userid(X1,u,sK5(sK6('$ki_local_world')))
    | ~ '$ki_accessible'(sK6('$ki_local_world'),X1) ) ).

cnf(u85,negated_conjecture,
    ( userid(X0,u,sK5(sK1))
    | ~ '$ki_accessible'(sK1,X0) ) ).

cnf(u72,negated_conjecture,
    ( ~ userid(sK2(X1,X2),u,X1)
    | '$ki_accessible'(sK1,sK3(X1,X2,X3,X4))
    | ~ number(sK2(X1,X2),X2,one)
    | ~ entry_box(sK2(X1,X2),X2) ) ).

cnf(u64,negated_conjecture,
    ( ~ userid(sK2(X1,X2),u,X1)
    | ~ entry_box(sK2(X1,X2),X2)
    | ~ number(sK2(X1,X2),X2,one)
    | do(sK3(X1,X2,X3,X4),X4,X3,sK4(X1,X2,X3,X4)) ) ).

cnf(u68,negated_conjecture,
    ( ~ userid(sK2(X1,X2),u,X1)
    | ~ number(sK2(X1,X2),X2,one)
    | ~ entry_box(sK2(X1,X2),X2)
    | ~ in(sK3(X1,X2,X3,X4),X1,X2,sK4(X1,X2,X3,X4)) ) ).

cnf(u53,axiom,
    ( entry_box(X1,sK7)
    | ~ '$ki_accessible'('$ki_local_world',X1) ) ).

cnf(u96,axiom,
    ( ~ entry_box(sK6('$ki_local_world'),X7)
    | ~ string(sK6('$ki_local_world'),X5)
    | ~ do(X6,X9,sK8(sK6('$ki_local_world'),X9,X5,X7),X8)
    | ~ '$ki_accessible'(sK6('$ki_local_world'),X6)
    | in(X6,X5,X7,X8) ) ).

cnf(u92,negated_conjecture,
    ( ~ entry_box(sK1,X2)
    | ~ string(sK1,X0)
    | ~ '$ki_accessible'(sK1,X1)
    | ~ do(X1,X4,sK8(sK1,X4,X0,X2),X3)
    | in(X1,X0,X2,X3) ) ).

cnf(u80,negated_conjecture,
    ( do(sK3(X0,X1,X2,X3),X3,X2,sK4(X0,X1,X2,X3))
    | '$ki_accessible'(sK1,sK2(X0,X1)) ) ).

cnf(u76,negated_conjecture,
    ( ~ in(sK3(X1,X0,X2,X3),X1,X0,sK4(X1,X0,X2,X3))
    | '$ki_accessible'(sK1,sK2(X1,X0)) ) ).

cnf(u84,axiom,
    ( string(X1,sK5(sK6('$ki_local_world')))
    | ~ '$ki_accessible'(sK6('$ki_local_world'),X1) ) ).

cnf(u83,negated_conjecture,
    ( string(X0,sK5(sK1))
    | ~ '$ki_accessible'(sK1,X0) ) ).

cnf(u111,axiom,
    ( ~ string(sK6('$ki_local_world'),X0)
    | in(X1,X0,sK7,X3)
    | ~ '$ki_accessible'(sK6('$ki_local_world'),X1)
    | ~ do(X1,X2,sK8(sK6('$ki_local_world'),X2,X0,sK7),X3) ) ).

cnf(u104,negated_conjecture,
    ( ~ string(sK1,X0)
    | ~ do(X1,X2,sK8(sK1,X2,X0,sK7),X3)
    | ~ '$ki_accessible'(sK1,X1)
    | in(X1,X0,sK7,X3) ) ).

cnf(u52,axiom,
    ( number(X1,sK7,one)
    | ~ '$ki_accessible'('$ki_local_world',X1) ) ).

cnf(u100,negated_conjecture,
    ( ~ number(sK2(sK5(sK1),X6),X6,one)
    | '$ki_accessible'(sK1,sK3(sK5(sK1),X6,X7,X8))
    | ~ entry_box(sK2(sK5(sK1),X6),X6) ) ).

cnf(u101,negated_conjecture,
    ( ~ number(sK2(sK5(sK1),X3),X3,one)
    | do(sK3(sK5(sK1),X3,X4,X5),X5,X4,sK4(sK5(sK1),X3,X4,X5))
    | ~ entry_box(sK2(sK5(sK1),X3),X3) ) ).

cnf(u102,negated_conjecture,
    ( ~ number(sK2(sK5(sK1),X0),X0,one)
    | ~ in(sK3(sK5(sK1),X0,X1,X2),sK5(sK1),X0,sK4(sK5(sK1),X0,X1,X2))
    | ~ entry_box(sK2(sK5(sK1),X0),X0) ) ).

cnf(u51,axiom,
    '$ki_accessible'(X0,sK6(X0)) ).

cnf(u60,negated_conjecture,
    ( '$ki_accessible'(sK1,sK3(X1,X2,X3,X4))
    | '$ki_accessible'(sK1,sK2(X1,X2)) ) ).

cnf(u39,negated_conjecture,
    '$ki_accessible'('$ki_local_world',sK1) ).

cnf(u119,axiom,
    ( ~ '$ki_accessible'(sK6('$ki_local_world'),sK6('$ki_local_world'))
    | ~ do(X3,X5,sK8(sK6('$ki_local_world'),X5,sK5(sK6('$ki_local_world')),sK7),X4)
    | in(X3,sK5(sK6('$ki_local_world')),sK7,X4)
    | ~ '$ki_accessible'(sK6('$ki_local_world'),X3) ) ).

cnf(u109,negated_conjecture,
    ( ~ '$ki_accessible'(sK6('$ki_local_world'),sK2(sK5(sK6('$ki_local_world')),X6))
    | ~ number(sK2(sK5(sK6('$ki_local_world')),X6),X6,one)
    | '$ki_accessible'(sK1,sK3(sK5(sK6('$ki_local_world')),X6,X7,X8))
    | ~ entry_box(sK2(sK5(sK6('$ki_local_world')),X6),X6) ) ).

cnf(u108,negated_conjecture,
    ( ~ '$ki_accessible'(sK6('$ki_local_world'),sK2(sK5(sK6('$ki_local_world')),X3))
    | ~ entry_box(sK2(sK5(sK6('$ki_local_world')),X3),X3)
    | ~ number(sK2(sK5(sK6('$ki_local_world')),X3),X3,one)
    | do(sK3(sK5(sK6('$ki_local_world')),X3,X4,X5),X5,X4,sK4(sK5(sK6('$ki_local_world')),X3,X4,X5)) ) ).

cnf(u107,negated_conjecture,
    ( ~ '$ki_accessible'(sK6('$ki_local_world'),sK2(sK5(sK6('$ki_local_world')),X0))
    | ~ in(sK3(sK5(sK6('$ki_local_world')),X0,X1,X2),sK5(sK6('$ki_local_world')),X0,sK4(sK5(sK6('$ki_local_world')),X0,X1,X2))
    | ~ number(sK2(sK5(sK6('$ki_local_world')),X0),X0,one)
    | ~ entry_box(sK2(sK5(sK6('$ki_local_world')),X0),X0) ) ).

cnf(u106,negated_conjecture,
    ( ~ '$ki_accessible'(sK6('$ki_local_world'),sK1)
    | ~ '$ki_accessible'(sK1,X3)
    | ~ do(X3,X4,sK8(sK1,X4,sK5(sK6('$ki_local_world')),sK7),X5)
    | in(X3,sK5(sK6('$ki_local_world')),sK7,X5) ) ).

cnf(u118,negated_conjecture,
    ( ~ '$ki_accessible'(sK1,sK6('$ki_local_world'))
    | ~ do(X0,X2,sK8(sK6('$ki_local_world'),X2,sK5(sK1),sK7),X1)
    | ~ '$ki_accessible'(sK6('$ki_local_world'),X0)
    | in(X0,sK5(sK1),sK7,X1) ) ).

cnf(u105,negated_conjecture,
    ( ~ '$ki_accessible'(sK1,sK1)
    | ~ do(X0,X1,sK8(sK1,X1,sK5(sK1),sK7),X2)
    | ~ '$ki_accessible'(sK1,X0)
    | in(X0,sK5(sK1),sK7,X2) ) ).

cnf(u113,negated_conjecture,
    ( ~ '$ki_accessible'('$ki_local_world',sK2(sK5(sK1),sK7))
    | '$ki_accessible'(sK1,sK3(sK5(sK1),sK7,X0,X1)) ) ).

cnf(u115,negated_conjecture,
    ( ~ '$ki_accessible'('$ki_local_world',sK2(sK5(sK1),sK7))
    | do(sK3(sK5(sK1),sK7,X0,X1),X1,X0,sK4(sK5(sK1),sK7,X0,X1)) ) ).

cnf(u117,negated_conjecture,
    ( ~ '$ki_accessible'('$ki_local_world',sK2(sK5(sK1),sK7))
    | ~ in(sK3(sK5(sK1),sK7,X0,X1),sK5(sK1),sK7,sK4(sK5(sK1),sK7,X0,X1)) ) ).

cnf(u50,axiom,
    ( ~ '$ki_accessible'('$ki_local_world',X0)
    | '$ki_exists_in_world_$i'(X0,sK5(X0)) ) ).

cnf(u49,axiom,
    ( ~ '$ki_accessible'('$ki_local_world',X0)
    | ~ '$ki_accessible'(X0,X2)
    | string(X2,sK5(X0)) ) ).

cnf(u48,axiom,
    ( ~ '$ki_accessible'('$ki_local_world',X0)
    | userid(X2,u,sK5(X0))
    | ~ '$ki_accessible'(X0,X2) ) ).

cnf(u55,axiom,
    ( ~ '$ki_accessible'('$ki_local_world',X0)
    | ~ string(X0,X2)
    | in(X5,X2,X3,X6)
    | ~ '$ki_exists_in_world_$i'(X0,X3)
    | ~ '$ki_accessible'(X0,X5)
    | ~ do(X5,X1,sK8(X0,X1,X2,X3),X6)
    | ~ entry_box(X0,X3)
    | ~ '$ki_exists_in_world_$i'(X5,X6)
    | ~ '$ki_exists_in_world_$i'(X0,X2)
    | ~ '$ki_exists_in_world_$i'(X0,X1) ) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : NLP266_3 : TPTP v8.2.0. Released v8.2.0.
% 0.03/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.12/0.34  % Computer : n026.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit   : 300
% 0.12/0.34  % WCLimit    : 300
% 0.12/0.34  % DateTime   : Mon May 22 12:25:53 EDT 2023
% 0.12/0.34  % CPUTime    : 
% 0.20/0.51  % (2982)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.51  % (2983)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  % (2970)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  % (2975)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.52  % (2971)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.52  % (2974)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.52  % (2993)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.20/0.52  % (2970)Refutation not found, incomplete strategy% (2970)------------------------------
% 0.20/0.52  % (2970)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52  % (2970)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52  % (2970)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.52  
% 0.20/0.52  % (2970)Memory used [KB]: 5373
% 0.20/0.52  % (2970)Time elapsed: 0.119 s
% 0.20/0.52  % (2970)Instructions burned: 3 (million)
% 0.20/0.52  % (2970)------------------------------
% 0.20/0.52  % (2970)------------------------------
% 0.20/0.52  % (2971)First to succeed.
% 0.20/0.53  % (2992)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.20/0.53  % (2972)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.53  % (2973)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.53  % (2988)ott+4_1:1_av=off:bd=off:nwc=5.0:rp=on:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.20/0.53  % (2978)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.53  % (2980)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.20/0.53  TRYING [1]
% 0.20/0.53  % (2981)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.53  TRYING [2]
% 0.20/0.53  % (2998)ott+10_7:2_awrs=decay:awrsf=8:bd=preordered:drc=off:fd=preordered:fde=unused:fsr=off:slsq=on:slsqc=2:slsqr=5,8:sp=const_min:spb=units:to=lpo:i=355:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/355Mi)
% 0.20/0.53  % (2994)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 0.20/0.53  % (2969)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.53  Finite Model Found!
% 0.20/0.53  % SZS status CounterSatisfiable for theBenchmark
% 0.20/0.53  % (2996)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.53  % (2984)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.20/0.53  % (2990)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.20/0.54  TRYING [1]
% 0.20/0.54  % (2997)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.54  TRYING [2]
% 0.20/0.54  % (2976)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.54  % (2991)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.54  Finite Model Found!
% 0.20/0.54  % SZS status CounterSatisfiable for theBenchmark
% 0.20/0.54  % (2995)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.54  % (2987)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.20/0.54  % (2989)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.54  % SZS status CounterSatisfiable for theBenchmark
% 0.20/0.54  % (2971)# SZS output start Saturation.
% See solution above
% 0.20/0.54  % (2971)------------------------------
% 0.20/0.54  % (2971)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.54  % (2971)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.54  % (2971)Termination reason: Satisfiable
% 0.20/0.54  
% 0.20/0.54  % (2971)Memory used [KB]: 1023
% 0.20/0.54  % (2971)Time elapsed: 0.134 s
% 0.20/0.54  % (2971)Instructions burned: 3 (million)
% 0.20/0.54  % (2971)------------------------------
% 0.20/0.54  % (2971)------------------------------
% 0.20/0.54  % (2968)Success in time 0.189 s
%------------------------------------------------------------------------------