TSTP Solution File: NLP266_3 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---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_uns --cores 0 -t %d %s
% Computer : n021.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:54 EDT 2023
% Result : CounterSatisfiable 1.33s 0.53s
% Output : Saturation 1.33s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(u54,axiom,
'$ki_exists_in_world_$i'(X1,X0) ).
cnf(u42,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK2,X4)
| '$ki_exists_in_world_$i'(sK4(X1,X2,X3,X4),sK5(X1,X2,X3,X4))
| ~ '$ki_exists_in_world_$i'(sK2,X2)
| ~ '$ki_exists_in_world_$i'(sK2,X1)
| ~ '$ki_exists_in_world_$i'(sK2,X3)
| '$ki_accessible'(sK2,sK3(X1,X2)) ) ).
cnf(u94,negated_conjecture,
( userid(sK4(X0,X1,X2,X3),u,sK0(sK2))
| string(sK3(X0,X1),sK0(sK2)) ) ).
cnf(u96,negated_conjecture,
( userid(sK4(X0,X1,X2,X3),u,sK0(sK2))
| userid(sK3(X0,X1),u,sK0(sK2)) ) ).
cnf(u92,negated_conjecture,
( userid(sK3(X0,X1),u,sK0(sK2))
| string(sK4(X0,X1,X2,X3),sK0(sK2)) ) ).
cnf(u87,negated_conjecture,
( userid(sK3(X4,X5),u,sK0(sK2))
| do(sK4(X4,X5,X6,X7),X7,X6,sK5(X4,X5,X6,X7)) ) ).
cnf(u91,axiom,
userid(sK1(sK1('$ki_local_world')),u,sK0(sK1('$ki_local_world'))) ).
cnf(u89,negated_conjecture,
userid(sK1(sK2),u,sK0(sK2)) ).
cnf(u150,negated_conjecture,
( ~ userid(sK3(X0,sK6),u,X0)
| ~ string(sK2,X0)
| ~ entry_box(sK3(X0,sK6),sK6)
| string(sK3(X0,sK6),sK0(sK2))
| ~ number(sK3(X0,sK6),sK6,one) ) ).
cnf(u48,negated_conjecture,
( ~ userid(sK3(X1,X2),u,X1)
| ~ '$ki_exists_in_world_$i'(sK2,X3)
| ~ '$ki_exists_in_world_$i'(sK2,X2)
| ~ number(sK3(X1,X2),X2,one)
| ~ '$ki_exists_in_world_$i'(sK2,X4)
| '$ki_accessible'(sK2,sK4(X1,X2,X3,X4))
| ~ '$ki_exists_in_world_$i'(sK2,X1)
| ~ entry_box(sK3(X1,X2),X2) ) ).
cnf(u46,negated_conjecture,
( ~ userid(sK3(X1,X2),u,X1)
| ~ entry_box(sK3(X1,X2),X2)
| '$ki_exists_in_world_$i'(sK4(X1,X2,X3,X4),sK5(X1,X2,X3,X4))
| ~ number(sK3(X1,X2),X2,one)
| ~ '$ki_exists_in_world_$i'(sK2,X4)
| ~ '$ki_exists_in_world_$i'(sK2,X2)
| ~ '$ki_exists_in_world_$i'(sK2,X3)
| ~ '$ki_exists_in_world_$i'(sK2,X1) ) ).
cnf(u47,negated_conjecture,
( ~ userid(sK3(X1,X2),u,X1)
| ~ '$ki_exists_in_world_$i'(sK2,X2)
| do(sK4(X1,X2,X3,X4),X4,X3,sK5(X1,X2,X3,X4))
| ~ '$ki_exists_in_world_$i'(sK2,X1)
| ~ entry_box(sK3(X1,X2),X2)
| ~ number(sK3(X1,X2),X2,one)
| ~ '$ki_exists_in_world_$i'(sK2,X4)
| ~ '$ki_exists_in_world_$i'(sK2,X3) ) ).
cnf(u74,axiom,
entry_box(sK1('$ki_local_world'),sK6) ).
cnf(u73,negated_conjecture,
entry_box(sK2,sK6) ).
cnf(u142,negated_conjecture,
( ~ entry_box(sK2,X10)
| string(sK3(X12,X13),sK0(sK2))
| in(sK4(X12,X13,sK8(sK2,X14,X11,X10),X14),X11,X10,sK5(X12,X13,sK8(sK2,X14,X11,X10),X14))
| ~ string(sK2,X11) ) ).
cnf(u84,negated_conjecture,
( do(sK4(X0,X1,X2,X3),X3,X2,sK5(X0,X1,X2,X3))
| string(sK3(X0,X1),sK0(sK2)) ) ).
cnf(u72,axiom,
( ~ do(X5,X1,sK8(X0,X1,X2,X3),X6)
| ~ '$ki_accessible'('$ki_local_world',X0)
| ~ string(X0,X2)
| in(X5,X2,X3,X6)
| ~ entry_box(X0,X3)
| ~ '$ki_accessible'(X0,X5) ) ).
cnf(u149,negated_conjecture,
( in(sK4(X0,X1,sK8(sK2,X2,X3,sK6),X2),X3,sK6,sK5(X0,X1,sK8(sK2,X2,X3,sK6),X2))
| string(sK3(X0,X1),sK0(sK2))
| ~ string(sK2,X3) ) ).
cnf(u41,negated_conjecture,
( ~ in(sK4(X1,X2,X3,X4),X1,X2,sK5(X1,X2,X3,X4))
| ~ '$ki_exists_in_world_$i'(sK2,X3)
| ~ '$ki_exists_in_world_$i'(sK2,X4)
| '$ki_accessible'(sK2,sK3(X1,X2))
| ~ '$ki_exists_in_world_$i'(sK2,X2)
| ~ '$ki_exists_in_world_$i'(sK2,X1) ) ).
cnf(u60,negated_conjecture,
( ~ in(sK4(X1,X2,X3,X4),X1,X2,sK5(X1,X2,X3,X4))
| ~ number(sK3(X1,X2),X2,one)
| ~ userid(sK3(X1,X2),u,X1)
| ~ entry_box(sK3(X1,X2),X2) ) ).
cnf(u93,negated_conjecture,
( string(sK4(X4,X5,X6,X7),sK0(sK2))
| string(sK3(X4,X5),sK0(sK2)) ) ).
cnf(u90,axiom,
string(sK1(sK1('$ki_local_world')),sK0(sK1('$ki_local_world'))) ).
cnf(u81,negated_conjecture,
string(sK1(sK2),sK0(sK2)) ).
cnf(u156,negated_conjecture,
( ~ string(sK2,X1)
| string(sK3(X1,sK6),sK0(sK2)) ) ).
cnf(u76,axiom,
number(sK1('$ki_local_world'),sK6,one) ).
cnf(u75,negated_conjecture,
number(sK2,sK6,one) ).
cnf(u118,negated_conjecture,
( ~ number(sK3(sK0(sK2),X0),X0,one)
| do(sK4(sK0(sK2),X0,X1,X2),X2,X1,sK5(sK0(sK2),X0,X1,X2))
| ~ entry_box(sK3(sK0(sK2),X0),X0)
| do(sK4(sK0(sK2),X0,X3,X4),X4,X3,sK5(sK0(sK2),X0,X3,X4)) ) ).
cnf(u111,negated_conjecture,
( ~ number(sK3(sK0(sK2),X0),X0,one)
| ~ entry_box(sK3(sK0(sK2),X0),X0)
| string(sK4(sK0(sK2),X0,X1,X2),sK0(sK2))
| do(sK4(sK0(sK2),X0,X3,X4),X4,X3,sK5(sK0(sK2),X0,X3,X4)) ) ).
cnf(u133,negated_conjecture,
( ~ number(sK3(sK0(sK2),X0),X0,one)
| do(sK4(sK0(sK2),X0,X3,X4),X4,X3,sK5(sK0(sK2),X0,X3,X4))
| userid(sK4(sK0(sK2),X0,X1,X2),u,sK0(sK2))
| ~ entry_box(sK3(sK0(sK2),X0),X0) ) ).
cnf(u145,negated_conjecture,
( ~ number(sK3(sK0(sK2),X11),X11,one)
| string(sK4(sK0(sK2),X11,X14,X15),sK0(sK2))
| string(sK4(sK0(sK2),X11,X12,X13),sK0(sK2))
| ~ entry_box(sK3(sK0(sK2),X11),X11) ) ).
cnf(u144,negated_conjecture,
( ~ number(sK3(sK0(sK2),X6),X6,one)
| userid(sK4(sK0(sK2),X6,X9,X10),u,sK0(sK2))
| string(sK4(sK0(sK2),X6,X7,X8),sK0(sK2))
| ~ entry_box(sK3(sK0(sK2),X6),X6) ) ).
cnf(u147,negated_conjecture,
( ~ number(sK3(sK0(sK2),X6),X6,one)
| userid(sK4(sK0(sK2),X6,X7,X8),u,sK0(sK2))
| ~ entry_box(sK3(sK0(sK2),X6),X6)
| userid(sK4(sK0(sK2),X6,X9,X10),u,sK0(sK2)) ) ).
cnf(u64,negated_conjecture,
( '$ki_accessible'(sK2,sK4(X1,X2,X3,X4))
| '$ki_accessible'(sK2,sK3(X1,X2)) ) ).
cnf(u68,negated_conjecture,
( '$ki_accessible'(sK2,sK3(X1,X2))
| do(sK4(X1,X2,X3,X4),X4,X3,sK5(X1,X2,X3,X4)) ) ).
cnf(u82,negated_conjecture,
( '$ki_accessible'(sK2,sK3(X0,X1))
| string(sK4(X0,X1,X2,X3),sK0(sK2)) ) ).
cnf(u86,negated_conjecture,
( '$ki_accessible'(sK2,sK3(X0,X1))
| userid(sK4(X0,X1,X2,X3),u,sK0(sK2)) ) ).
cnf(u122,negated_conjecture,
( '$ki_accessible'(sK2,sK4(sK0(sK2),X10,X13,X14))
| ~ entry_box(sK3(sK0(sK2),X10),X10)
| do(sK4(sK0(sK2),X10,X11,X12),X12,X11,sK5(sK0(sK2),X10,X11,X12))
| ~ number(sK3(sK0(sK2),X10),X10,one) ) ).
cnf(u107,negated_conjecture,
( '$ki_accessible'(sK2,sK4(sK0(sK2),X10,X13,X14))
| ~ number(sK3(sK0(sK2),X10),X10,one)
| ~ entry_box(sK3(sK0(sK2),X10),X10)
| string(sK4(sK0(sK2),X10,X11,X12),sK0(sK2)) ) ).
cnf(u129,negated_conjecture,
( '$ki_accessible'(sK2,sK4(sK0(sK2),X10,X13,X14))
| ~ number(sK3(sK0(sK2),X10),X10,one)
| userid(sK4(sK0(sK2),X10,X11,X12),u,sK0(sK2))
| ~ entry_box(sK3(sK0(sK2),X10),X10) ) ).
cnf(u83,negated_conjecture,
( '$ki_accessible'(sK2,sK4(X0,X1,X2,X3))
| string(sK3(X0,X1),sK0(sK2)) ) ).
cnf(u88,negated_conjecture,
( '$ki_accessible'(sK2,sK4(X8,X9,X10,X11))
| userid(sK3(X8,X9),u,sK0(sK2)) ) ).
cnf(u40,axiom,
'$ki_accessible'(X0,sK1(X0)) ).
cnf(u49,negated_conjecture,
'$ki_accessible'('$ki_local_world',sK2) ).
cnf(u100,negated_conjecture,
( ~ '$ki_accessible'(X2,sK4(X0,X1,sK8(X2,X4,X3,X5),X4))
| ~ entry_box(X2,X5)
| ~ string(X2,X3)
| string(sK3(X0,X1),sK0(sK2))
| ~ '$ki_accessible'('$ki_local_world',X2)
| in(sK4(X0,X1,sK8(X2,X4,X3,X5),X4),X3,X5,sK5(X0,X1,sK8(X2,X4,X3,X5),X4)) ) ).
cnf(u78,axiom,
( ~ '$ki_accessible'(sK1('$ki_local_world'),X1)
| string(X1,sK0(sK1('$ki_local_world'))) ) ).
cnf(u80,axiom,
( ~ '$ki_accessible'(sK1('$ki_local_world'),X1)
| userid(X1,u,sK0(sK1('$ki_local_world'))) ) ).
cnf(u77,negated_conjecture,
( ~ '$ki_accessible'(sK2,X0)
| string(X0,sK0(sK2)) ) ).
cnf(u79,negated_conjecture,
( ~ '$ki_accessible'(sK2,X0)
| userid(X0,u,sK0(sK2)) ) ).
cnf(u52,axiom,
( ~ '$ki_accessible'('$ki_local_world',X1)
| entry_box(X1,sK6) ) ).
cnf(u51,axiom,
( ~ '$ki_accessible'('$ki_local_world',X1)
| number(X1,sK6,one) ) ).
cnf(u38,axiom,
( ~ '$ki_accessible'('$ki_local_world',X0)
| ~ '$ki_accessible'(X0,X2)
| string(X2,sK0(X0)) ) ).
cnf(u39,axiom,
( ~ '$ki_accessible'('$ki_local_world',X0)
| userid(X2,u,sK0(X0))
| ~ '$ki_accessible'(X0,X2) ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NLP266_3 : TPTP v8.2.0. Released v8.2.0.
% 0.07/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.35 % Computer : n021.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 : Mon May 22 12:09:00 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.51 % (23408)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 0.20/0.51 % (23390)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.20/0.51 % (23400)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.52 % (23389)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.20/0.52 % (23408)Refutation not found, incomplete strategy% (23408)------------------------------
% 0.20/0.52 % (23408)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52 % (23408)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52 % (23408)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.52
% 0.20/0.52 % (23408)Memory used [KB]: 1535
% 0.20/0.52 % (23408)Time elapsed: 0.072 s
% 0.20/0.52 % (23408)Instructions burned: 3 (million)
% 0.20/0.52 % (23408)------------------------------
% 0.20/0.52 % (23408)------------------------------
% 0.20/0.52 % (23390)Refutation not found, incomplete strategy% (23390)------------------------------
% 0.20/0.52 % (23390)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52 % (23392)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.20/0.52 % (23387)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.52 % (23409)dis+21_1:1_ep=RS:nwc=10.0:s2a=on:s2at=1.5:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.52 % (23400)First to succeed.
% 0.20/0.53 % (23387)Instruction limit reached!
% 0.20/0.53 % (23387)------------------------------
% 0.20/0.53 % (23387)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53 % (23413)dis+2_3:1_aac=none:abs=on:ep=R:lcm=reverse:nwc=10.0:sos=on:sp=const_frequency:spb=units:urr=ec_only:i=8:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/8Mi)
% 0.20/0.53 % (23387)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53 % (23387)Termination reason: Unknown
% 0.20/0.53 % (23387)Termination phase: Saturation
% 0.20/0.53
% 0.20/0.53 % (23387)Memory used [KB]: 5884
% 0.20/0.53 % (23387)Time elapsed: 0.006 s
% 0.20/0.53 % (23387)Instructions burned: 3 (million)
% 0.20/0.53 % (23387)------------------------------
% 0.20/0.53 % (23387)------------------------------
% 1.33/0.53 % SZS status CounterSatisfiable for theBenchmark
% 1.33/0.53 % (23400)# SZS output start Saturation.
% See solution above
% 1.33/0.53 % (23400)------------------------------
% 1.33/0.53 % (23400)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.33/0.53 % (23400)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.33/0.53 % (23400)Termination reason: Satisfiable
% 1.33/0.53
% 1.33/0.53 % (23400)Memory used [KB]: 6012
% 1.33/0.53 % (23400)Time elapsed: 0.079 s
% 1.33/0.53 % (23400)Instructions burned: 6 (million)
% 1.33/0.53 % (23400)------------------------------
% 1.33/0.53 % (23400)------------------------------
% 1.33/0.53 % (23384)Success in time 0.172 s
%------------------------------------------------------------------------------