↑ Up

Vampire---5.0.1.CSA-Sat.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : NLP266_3 : TPTP v9.3.1. Released v8.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n006.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue Sep 29 12:08:17 PM UTC 2026

% Result   : CounterSatisfiable 0.79s 1.69s
% Output   : Saturation 5.61s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(u49,negated_conjecture,
    ( ~ entry_box(sK6(sK2(X0),sK3),sK3)
    | ~ '$ki_accessible'('$ki_local_world',sK6(sK2(X0),sK3))
    | '$ki_accessible'(sK5,sK7(sK2(X0),sK3,X1,X2))
    | ~ '$ki_accessible'(X0,sK6(sK2(X0),sK3))
    | ~ '$ki_accessible'('$ki_local_world',X0)
    | ~ '$ki_exists_in_world_$i'(sK5,sK2(X0))
    | ~ '$ki_exists_in_world_$i'(sK5,X2)
    | ~ '$ki_exists_in_world_$i'(sK5,X1) ) ).

cnf(u71,negated_conjecture,
    ( ~ '$ki_accessible'(X1,sK7(sK2(X0),sK3,sK4(X1,X2,sK2(X0),sK3),X2))
    | ~ '$ki_accessible'('$ki_local_world',X0)
    | ~ '$ki_accessible'(X0,X1)
    | ~ '$ki_exists_in_world_$i'(sK5,sK2(X0))
    | '$ki_accessible'(sK5,sK6(sK2(X0),sK3))
    | ~ '$ki_exists_in_world_$i'(sK5,X2)
    | ~ '$ki_exists_in_world_$i'(sK5,sK4(X1,X2,sK2(X0),sK3))
    | ~ '$ki_accessible'('$ki_local_world',X1)
    | ~ '$ki_exists_in_world_$i'(X1,X2)
    | ~ '$ki_exists_in_world_$i'(X1,sK2(X0))
    | ~ '$ki_exists_in_world_$i'(X1,sK3)
    | ~ '$ki_exists_in_world_$i'(sK7(sK2(X0),sK3,sK4(X1,X2,sK2(X0),sK3),X2),sK8(sK2(X0),sK3,sK4(X1,X2,sK2(X0),sK3),X2)) ) ).

cnf(u82,negated_conjecture,
    ( '$ki_accessible'(sK5,sK6(sK2(X0),sK3))
    | ~ '$ki_exists_in_world_$i'(sK7(sK2(X0),sK3,sK4(sK5,X1,sK2(X0),sK3),X1),sK8(sK2(X0),sK3,sK4(sK5,X1,sK2(X0),sK3),X1))
    | ~ '$ki_exists_in_world_$i'(sK5,X1)
    | ~ '$ki_exists_in_world_$i'(sK5,sK4(sK5,X1,sK2(X0),sK3))
    | ~ '$ki_accessible'('$ki_local_world',X0)
    | ~ '$ki_exists_in_world_$i'(sK5,sK2(X0))
    | ~ '$ki_accessible'(X0,sK5) ) ).

cnf(u86,negated_conjecture,
    ( ~ '$ki_accessible'('$ki_local_world',X0)
    | ~ '$ki_accessible'(X0,sK6(sK2(X0),sK3))
    | ~ '$ki_accessible'('$ki_local_world',sK6(sK2(X0),sK3))
    | ~ '$ki_exists_in_world_$i'(sK7(sK2(X0),sK3,sK4(sK5,X1,sK2(X0),sK3),X1),sK8(sK2(X0),sK3,sK4(sK5,X1,sK2(X0),sK3),X1))
    | ~ '$ki_exists_in_world_$i'(sK5,X1)
    | ~ '$ki_exists_in_world_$i'(sK5,sK4(sK5,X1,sK2(X0),sK3))
    | '$ki_accessible'(sK5,sK6(sK2(X0),sK3))
    | ~ '$ki_exists_in_world_$i'(sK5,sK2(X0))
    | ~ '$ki_accessible'(X0,sK5) ) ).

cnf(u95,negated_conjecture,
    ( ~ entry_box(X0,sK3)
    | ~ entry_box(sK6(sK2(X1),sK3),sK3)
    | ~ '$ki_accessible'(X1,sK6(sK2(X1),sK3))
    | ~ '$ki_accessible'('$ki_local_world',X1)
    | ~ '$ki_accessible'(X1,X0)
    | ~ '$ki_exists_in_world_$i'(sK5,sK2(X1))
    | ~ '$ki_exists_in_world_$i'(sK7(sK2(X1),sK3,sK4(X0,X2,sK2(X1),sK3),X2),sK8(sK2(X1),sK3,sK4(X0,X2,sK2(X1),sK3),X2))
    | ~ '$ki_accessible'('$ki_local_world',sK6(sK2(X1),sK3))
    | ~ '$ki_accessible'(X0,sK7(sK2(X1),sK3,sK4(X0,X2,sK2(X1),sK3),X2))
    | ~ '$ki_exists_in_world_$i'(sK5,X2)
    | ~ '$ki_exists_in_world_$i'(sK5,sK4(X0,X2,sK2(X1),sK3))
    | ~ '$ki_accessible'('$ki_local_world',X0)
    | ~ '$ki_exists_in_world_$i'(X0,X2)
    | ~ '$ki_exists_in_world_$i'(X0,sK2(X1))
    | ~ '$ki_exists_in_world_$i'(X0,sK3) ) ).

cnf(u113,negated_conjecture,
    ( ~ '$ki_accessible'(X0,sK6(sK2(X0),sK3))
    | ~ '$ki_accessible'('$ki_local_world',sK6(sK2(X0),sK3))
    | ~ '$ki_exists_in_world_$i'(sK5,X1)
    | ~ '$ki_accessible'('$ki_local_world',X0)
    | ~ '$ki_exists_in_world_$i'(sK5,sK4(sK5,X1,sK2(X0),sK3))
    | ~ '$ki_exists_in_world_$i'(sK7(sK2(X0),sK3,sK4(sK5,X1,sK2(X0),sK3),X1),sK8(sK2(X0),sK3,sK4(sK5,X1,sK2(X0),sK3),X1))
    | ~ '$ki_exists_in_world_$i'(sK5,sK2(X0))
    | ~ '$ki_accessible'(X0,sK5) ) ).

cnf(u123,negated_conjecture,
    ~ '$ki_accessible'('$ki_local_world','$ki_local_world') ).

cnf(u59,negated_conjecture,
    ( ~ string(X2,X0)
    | ~ '$ki_accessible'(X2,sK7(X0,X1,sK4(X2,X3,X0,X1),X3))
    | ~ '$ki_exists_in_world_$i'(sK7(X0,X1,sK4(X2,X3,X0,X1),X3),sK8(X0,X1,sK4(X2,X3,X0,X1),X3))
    | ~ entry_box(X2,X1)
    | ~ '$ki_exists_in_world_$i'(X2,X1)
    | ~ '$ki_exists_in_world_$i'(X2,X0)
    | ~ '$ki_exists_in_world_$i'(X2,X3)
    | ~ '$ki_accessible'('$ki_local_world',X2)
    | ~ '$ki_exists_in_world_$i'(sK5,X1)
    | ~ '$ki_exists_in_world_$i'(sK5,sK4(X2,X3,X0,X1))
    | ~ '$ki_exists_in_world_$i'(sK5,X3)
    | '$ki_accessible'(sK5,sK6(X0,X1))
    | ~ '$ki_exists_in_world_$i'(sK5,X0) ) ).

cnf(u35,negated_conjecture,
    ( '$ki_accessible'(sK5,sK6(X1,X2))
    | ~ '$ki_exists_in_world_$i'(sK5,X2)
    | ~ '$ki_exists_in_world_$i'(sK5,X3)
    | ~ '$ki_exists_in_world_$i'(sK5,X4)
    | ~ '$ki_exists_in_world_$i'(sK5,X1)
    | '$ki_exists_in_world_$i'(sK7(X1,X2,X3,X4),sK8(X1,X2,X3,X4)) ) ).

cnf(u22,axiom,
    '$ki_accessible'(X0,sK0(X0)) ).

cnf(u29,axiom,
    ( entry_box(X1,sK3)
    | ~ '$ki_accessible'('$ki_local_world',X1) ) ).

cnf(u101,negated_conjecture,
    ( ~ entry_box(X1,sK3)
    | ~ '$ki_accessible'(X0,sK6(sK2(X0),sK3))
    | ~ '$ki_accessible'('$ki_local_world',X0)
    | ~ '$ki_accessible'(X0,X1)
    | ~ '$ki_exists_in_world_$i'(sK5,sK2(X0))
    | ~ '$ki_exists_in_world_$i'(sK7(sK2(X0),sK3,sK4(X1,X2,sK2(X0),sK3),X2),sK8(sK2(X0),sK3,sK4(X1,X2,sK2(X0),sK3),X2))
    | ~ '$ki_accessible'('$ki_local_world',sK6(sK2(X0),sK3))
    | ~ '$ki_accessible'(X1,sK7(sK2(X0),sK3,sK4(X1,X2,sK2(X0),sK3),X2))
    | ~ '$ki_exists_in_world_$i'(sK5,X2)
    | ~ '$ki_exists_in_world_$i'(sK5,sK4(X1,X2,sK2(X0),sK3))
    | ~ '$ki_accessible'('$ki_local_world',X1)
    | ~ '$ki_exists_in_world_$i'(X1,X2)
    | ~ '$ki_exists_in_world_$i'(X1,sK2(X0))
    | ~ '$ki_exists_in_world_$i'(X1,sK3) ) ).

cnf(u104,negated_conjecture,
    ( ~ '$ki_accessible'(X1,sK7(sK2(X0),sK3,sK4(X1,X2,sK2(X0),sK3),X2))
    | ~ '$ki_accessible'('$ki_local_world',X0)
    | ~ '$ki_accessible'(X0,X1)
    | ~ '$ki_exists_in_world_$i'(sK5,sK2(X0))
    | ~ '$ki_exists_in_world_$i'(sK7(sK2(X0),sK3,sK4(X1,X2,sK2(X0),sK3),X2),sK8(sK2(X0),sK3,sK4(X1,X2,sK2(X0),sK3),X2))
    | ~ '$ki_accessible'('$ki_local_world',sK6(sK2(X0),sK3))
    | ~ '$ki_accessible'(X0,sK6(sK2(X0),sK3))
    | ~ '$ki_exists_in_world_$i'(sK5,X2)
    | ~ '$ki_exists_in_world_$i'(sK5,sK4(X1,X2,sK2(X0),sK3))
    | ~ '$ki_accessible'('$ki_local_world',X1)
    | ~ '$ki_exists_in_world_$i'(X1,X2)
    | ~ '$ki_exists_in_world_$i'(X1,sK2(X0))
    | ~ '$ki_exists_in_world_$i'(X1,sK3) ) ).

cnf(u116,negated_conjecture,
    ( ~ '$ki_accessible'(sK6(sK2(X0),sK3),sK7(sK2(X0),sK3,sK4(sK6(sK2(X0),sK3),X1,sK2(X0),sK3),X1))
    | ~ '$ki_accessible'('$ki_local_world',X0)
    | ~ '$ki_exists_in_world_$i'(sK5,sK2(X0))
    | ~ '$ki_exists_in_world_$i'(sK7(sK2(X0),sK3,sK4(sK6(sK2(X0),sK3),X1,sK2(X0),sK3),X1),sK8(sK2(X0),sK3,sK4(sK6(sK2(X0),sK3),X1,sK2(X0),sK3),X1))
    | ~ '$ki_accessible'('$ki_local_world',sK6(sK2(X0),sK3))
    | ~ '$ki_accessible'(X0,sK6(sK2(X0),sK3))
    | ~ '$ki_exists_in_world_$i'(sK5,X1)
    | ~ '$ki_exists_in_world_$i'(sK5,sK4(sK6(sK2(X0),sK3),X1,sK2(X0),sK3))
    | ~ '$ki_exists_in_world_$i'(sK6(sK2(X0),sK3),X1)
    | ~ '$ki_exists_in_world_$i'(sK6(sK2(X0),sK3),sK2(X0))
    | ~ '$ki_exists_in_world_$i'(sK6(sK2(X0),sK3),sK3) ) ).

cnf(u34,negated_conjecture,
    ( '$ki_accessible'(sK5,sK7(X1,X2,X3,X4))
    | ~ '$ki_exists_in_world_$i'(sK5,X2)
    | ~ '$ki_exists_in_world_$i'(sK5,X3)
    | ~ '$ki_exists_in_world_$i'(sK5,X4)
    | '$ki_accessible'(sK5,sK6(X1,X2))
    | ~ '$ki_exists_in_world_$i'(sK5,X1) ) ).

cnf(u41,negated_conjecture,
    ( ~ in(sK7(X1,X2,X3,X4),X1,X2,sK8(X1,X2,X3,X4))
    | ~ '$ki_exists_in_world_$i'(sK5,X2)
    | ~ '$ki_exists_in_world_$i'(sK5,X3)
    | ~ '$ki_exists_in_world_$i'(sK5,X4)
    | ~ userid(sK6(X1,X2),u,X1)
    | ~ entry_box(sK6(X1,X2),X2)
    | ~ number(sK6(X1,X2),X2,one)
    | ~ '$ki_exists_in_world_$i'(sK5,X1) ) ).

cnf(u100,negated_conjecture,
    ( ~ entry_box(sK6(sK2(X0),sK3),sK3)
    | ~ '$ki_accessible'(X0,sK6(sK2(X0),sK3))
    | ~ '$ki_accessible'('$ki_local_world',X0)
    | ~ '$ki_exists_in_world_$i'(sK5,sK2(X0))
    | ~ '$ki_exists_in_world_$i'(sK7(sK2(X0),sK3,sK4(sK6(sK2(X0),sK3),X1,sK2(X0),sK3),X1),sK8(sK2(X0),sK3,sK4(sK6(sK2(X0),sK3),X1,sK2(X0),sK3),X1))
    | ~ '$ki_accessible'('$ki_local_world',sK6(sK2(X0),sK3))
    | ~ '$ki_accessible'(sK6(sK2(X0),sK3),sK7(sK2(X0),sK3,sK4(sK6(sK2(X0),sK3),X1,sK2(X0),sK3),X1))
    | ~ '$ki_exists_in_world_$i'(sK5,X1)
    | ~ '$ki_exists_in_world_$i'(sK5,sK4(sK6(sK2(X0),sK3),X1,sK2(X0),sK3))
    | ~ '$ki_exists_in_world_$i'(sK6(sK2(X0),sK3),X1)
    | ~ '$ki_exists_in_world_$i'(sK6(sK2(X0),sK3),sK2(X0))
    | ~ '$ki_exists_in_world_$i'(sK6(sK2(X0),sK3),sK3) ) ).

cnf(u28,axiom,
    ( number(X1,sK3,one)
    | ~ '$ki_accessible'('$ki_local_world',X1) ) ).

cnf(u102,negated_conjecture,
    ( ~ entry_box(sK6(sK2(X1),sK3),sK3)
    | ~ '$ki_accessible'(X1,sK6(sK2(X1),sK3))
    | ~ '$ki_accessible'('$ki_local_world',X1)
    | ~ '$ki_accessible'(X1,X0)
    | ~ '$ki_exists_in_world_$i'(sK5,sK2(X1))
    | ~ '$ki_exists_in_world_$i'(sK7(sK2(X1),sK3,sK4(X0,X2,sK2(X1),sK3),X2),sK8(sK2(X1),sK3,sK4(X0,X2,sK2(X1),sK3),X2))
    | ~ '$ki_accessible'('$ki_local_world',sK6(sK2(X1),sK3))
    | ~ '$ki_accessible'(X0,sK7(sK2(X1),sK3,sK4(X0,X2,sK2(X1),sK3),X2))
    | ~ '$ki_exists_in_world_$i'(sK5,X2)
    | ~ '$ki_exists_in_world_$i'(sK5,sK4(X0,X2,sK2(X1),sK3))
    | ~ '$ki_accessible'('$ki_local_world',X0)
    | ~ '$ki_exists_in_world_$i'(X0,X2)
    | ~ '$ki_exists_in_world_$i'(X0,sK2(X1))
    | ~ '$ki_exists_in_world_$i'(X0,sK3) ) ).

cnf(u38,negated_conjecture,
    ( ~ userid(sK6(X1,X2),u,X1)
    | ~ '$ki_exists_in_world_$i'(sK5,X2)
    | ~ '$ki_exists_in_world_$i'(sK5,X3)
    | ~ '$ki_exists_in_world_$i'(sK5,X4)
    | ~ '$ki_exists_in_world_$i'(sK5,X1)
    | ~ entry_box(sK6(X1,X2),X2)
    | ~ number(sK6(X1,X2),X2,one)
    | '$ki_accessible'(sK5,sK7(X1,X2,X3,X4)) ) ).

cnf(u65,negated_conjecture,
    ( ~ string(X2,X0)
    | ~ '$ki_accessible'(X2,sK7(X0,X1,sK4(X2,X3,X0,X1),X3))
    | ~ '$ki_exists_in_world_$i'(sK7(X0,X1,sK4(X2,X3,X0,X1),X3),sK8(X0,X1,sK4(X2,X3,X0,X1),X3))
    | ~ entry_box(X2,X1)
    | ~ '$ki_exists_in_world_$i'(X2,X1)
    | ~ '$ki_exists_in_world_$i'(X2,X0)
    | ~ '$ki_exists_in_world_$i'(X2,X3)
    | ~ '$ki_accessible'('$ki_local_world',X2)
    | ~ '$ki_exists_in_world_$i'(sK5,X1)
    | ~ '$ki_exists_in_world_$i'(sK5,sK4(X2,X3,X0,X1))
    | ~ '$ki_exists_in_world_$i'(sK5,X3)
    | ~ userid(sK6(X0,X1),u,X0)
    | ~ entry_box(sK6(X0,X1),X1)
    | ~ number(sK6(X0,X1),X1,one)
    | ~ '$ki_exists_in_world_$i'(sK5,X0) ) ).

cnf(u91,negated_conjecture,
    ( ~ number(sK6(sK2(X0),X1),X1,one)
    | ~ entry_box(X2,X1)
    | ~ '$ki_exists_in_world_$i'(X2,X1)
    | ~ '$ki_exists_in_world_$i'(X2,sK2(X0))
    | ~ '$ki_exists_in_world_$i'(X2,X3)
    | ~ '$ki_accessible'('$ki_local_world',X2)
    | ~ '$ki_exists_in_world_$i'(sK5,X1)
    | ~ '$ki_exists_in_world_$i'(sK5,sK4(X2,X3,sK2(X0),X1))
    | ~ '$ki_exists_in_world_$i'(sK5,X3)
    | ~ '$ki_accessible'(X2,sK7(sK2(X0),X1,sK4(X2,X3,sK2(X0),X1),X3))
    | ~ entry_box(sK6(sK2(X0),X1),X1)
    | ~ '$ki_exists_in_world_$i'(sK7(sK2(X0),X1,sK4(X2,X3,sK2(X0),X1),X3),sK8(sK2(X0),X1,sK4(X2,X3,sK2(X0),X1),X3))
    | ~ '$ki_exists_in_world_$i'(sK5,sK2(X0))
    | ~ '$ki_accessible'(X0,X2)
    | ~ '$ki_accessible'('$ki_local_world',X0)
    | ~ '$ki_accessible'(X0,sK6(sK2(X0),X1)) ) ).

cnf(u40,negated_conjecture,
    ( do(sK7(X1,X2,X3,X4),X4,X3,sK8(X1,X2,X3,X4))
    | ~ '$ki_exists_in_world_$i'(sK5,X2)
    | ~ '$ki_exists_in_world_$i'(sK5,X3)
    | ~ '$ki_exists_in_world_$i'(sK5,X4)
    | ~ userid(sK6(X1,X2),u,X1)
    | ~ entry_box(sK6(X1,X2),X2)
    | ~ number(sK6(X1,X2),X2,one)
    | ~ '$ki_exists_in_world_$i'(sK5,X1) ) ).

cnf(u55,negated_conjecture,
    ( in(sK7(X0,X1,sK4(X2,X3,X4,X5),X3),X4,X5,sK8(X0,X1,sK4(X2,X3,X4,X5),X3))
    | ~ '$ki_exists_in_world_$i'(sK7(X0,X1,sK4(X2,X3,X4,X5),X3),sK8(X0,X1,sK4(X2,X3,X4,X5),X3))
    | ~ '$ki_accessible'(X2,sK7(X0,X1,sK4(X2,X3,X4,X5),X3))
    | ~ string(X2,X4)
    | ~ entry_box(X2,X5)
    | ~ '$ki_exists_in_world_$i'(X2,X5)
    | ~ '$ki_exists_in_world_$i'(X2,X4)
    | ~ '$ki_exists_in_world_$i'(X2,X3)
    | ~ '$ki_accessible'('$ki_local_world',X2)
    | ~ '$ki_exists_in_world_$i'(sK5,X1)
    | ~ '$ki_exists_in_world_$i'(sK5,sK4(X2,X3,X4,X5))
    | ~ '$ki_exists_in_world_$i'(sK5,X3)
    | ~ userid(sK6(X0,X1),u,X0)
    | ~ entry_box(sK6(X0,X1),X1)
    | ~ number(sK6(X0,X1),X1,one)
    | ~ '$ki_exists_in_world_$i'(sK5,X0) ) ).

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

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

cnf(u33,negated_conjecture,
    '$ki_accessible'('$ki_local_world',sK5) ).

cnf(u54,negated_conjecture,
    ( '$ki_accessible'(sK5,sK7(sK2(X0),sK3,X1,X2))
    | ~ '$ki_accessible'('$ki_local_world',sK6(sK2(X0),sK3))
    | ~ '$ki_accessible'(X0,sK6(sK2(X0),sK3))
    | ~ '$ki_accessible'('$ki_local_world',X0)
    | ~ '$ki_exists_in_world_$i'(sK5,sK2(X0))
    | ~ '$ki_exists_in_world_$i'(sK5,X2)
    | ~ '$ki_exists_in_world_$i'(sK5,X1) ) ).

cnf(u61,negated_conjecture,
    ( ~ entry_box(X0,X2)
    | ~ '$ki_exists_in_world_$i'(sK7(sK2(X1),X2,sK4(X0,X3,sK2(X1),X2),X3),sK8(sK2(X1),X2,sK4(X0,X3,sK2(X1),X2),X3))
    | ~ '$ki_accessible'(X0,sK7(sK2(X1),X2,sK4(X0,X3,sK2(X1),X2),X3))
    | ~ '$ki_exists_in_world_$i'(X0,X2)
    | ~ '$ki_exists_in_world_$i'(X0,sK2(X1))
    | ~ '$ki_exists_in_world_$i'(X0,X3)
    | ~ '$ki_accessible'('$ki_local_world',X0)
    | ~ '$ki_exists_in_world_$i'(sK5,X2)
    | ~ '$ki_exists_in_world_$i'(sK5,sK4(X0,X3,sK2(X1),X2))
    | ~ '$ki_exists_in_world_$i'(sK5,X3)
    | '$ki_accessible'(sK5,sK6(sK2(X1),X2))
    | ~ '$ki_exists_in_world_$i'(sK5,sK2(X1))
    | ~ '$ki_accessible'(X1,X0)
    | ~ '$ki_accessible'('$ki_local_world',X1) ) ).

cnf(u37,negated_conjecture,
    ( ~ in(sK7(X1,X2,X3,X4),X1,X2,sK8(X1,X2,X3,X4))
    | ~ '$ki_exists_in_world_$i'(sK5,X2)
    | ~ '$ki_exists_in_world_$i'(sK5,X3)
    | ~ '$ki_exists_in_world_$i'(sK5,X4)
    | '$ki_accessible'(sK5,sK6(X1,X2))
    | ~ '$ki_exists_in_world_$i'(sK5,X1) ) ).

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

cnf(u56,negated_conjecture,
    ( in(sK7(X0,X1,sK4(X2,X3,X4,X5),X3),X4,X5,sK8(X0,X1,sK4(X2,X3,X4,X5),X3))
    | ~ '$ki_exists_in_world_$i'(sK7(X0,X1,sK4(X2,X3,X4,X5),X3),sK8(X0,X1,sK4(X2,X3,X4,X5),X3))
    | ~ '$ki_accessible'(X2,sK7(X0,X1,sK4(X2,X3,X4,X5),X3))
    | ~ string(X2,X4)
    | ~ entry_box(X2,X5)
    | ~ '$ki_exists_in_world_$i'(X2,X5)
    | ~ '$ki_exists_in_world_$i'(X2,X4)
    | ~ '$ki_exists_in_world_$i'(X2,X3)
    | ~ '$ki_accessible'('$ki_local_world',X2)
    | ~ '$ki_exists_in_world_$i'(sK5,X1)
    | ~ '$ki_exists_in_world_$i'(sK5,sK4(X2,X3,X4,X5))
    | ~ '$ki_exists_in_world_$i'(sK5,X3)
    | '$ki_accessible'(sK5,sK6(X0,X1))
    | ~ '$ki_exists_in_world_$i'(sK5,X0) ) ).

cnf(u66,negated_conjecture,
    ( ~ userid(sK6(sK2(X1),X2),u,sK2(X1))
    | ~ '$ki_exists_in_world_$i'(sK7(sK2(X1),X2,sK4(X0,X3,sK2(X1),X2),X3),sK8(sK2(X1),X2,sK4(X0,X3,sK2(X1),X2),X3))
    | ~ entry_box(X0,X2)
    | ~ '$ki_exists_in_world_$i'(X0,X2)
    | ~ '$ki_exists_in_world_$i'(X0,sK2(X1))
    | ~ '$ki_exists_in_world_$i'(X0,X3)
    | ~ '$ki_accessible'('$ki_local_world',X0)
    | ~ '$ki_exists_in_world_$i'(sK5,X2)
    | ~ '$ki_exists_in_world_$i'(sK5,sK4(X0,X3,sK2(X1),X2))
    | ~ '$ki_exists_in_world_$i'(sK5,X3)
    | ~ '$ki_accessible'(X0,sK7(sK2(X1),X2,sK4(X0,X3,sK2(X1),X2),X3))
    | ~ entry_box(sK6(sK2(X1),X2),X2)
    | ~ number(sK6(sK2(X1),X2),X2,one)
    | ~ '$ki_exists_in_world_$i'(sK5,sK2(X1))
    | ~ '$ki_accessible'(X1,X0)
    | ~ '$ki_accessible'('$ki_local_world',X1) ) ).

cnf(u42,negated_conjecture,
    ( ~ number(sK6(sK2(X0),X1),X1,one)
    | ~ '$ki_accessible'('$ki_local_world',X0)
    | ~ '$ki_exists_in_world_$i'(sK5,X1)
    | ~ '$ki_exists_in_world_$i'(sK5,X2)
    | ~ '$ki_exists_in_world_$i'(sK5,X3)
    | ~ '$ki_exists_in_world_$i'(sK5,sK2(X0))
    | ~ entry_box(sK6(sK2(X0),X1),X1)
    | ~ '$ki_accessible'(X0,sK6(sK2(X0),X1))
    | '$ki_accessible'(sK5,sK7(sK2(X0),X1,X2,X3)) ) ).

cnf(u25,axiom,
    ( string(X2,sK2(X0))
    | ~ '$ki_accessible'(X0,X2)
    | ~ '$ki_accessible'('$ki_local_world',X0) ) ).

cnf(u36,negated_conjecture,
    ( do(sK7(X1,X2,X3,X4),X4,X3,sK8(X1,X2,X3,X4))
    | ~ '$ki_exists_in_world_$i'(sK5,X2)
    | ~ '$ki_exists_in_world_$i'(sK5,X3)
    | ~ '$ki_exists_in_world_$i'(sK5,X4)
    | '$ki_accessible'(sK5,sK6(X1,X2))
    | ~ '$ki_exists_in_world_$i'(sK5,X1) ) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NLP266_3 : TPTP v9.3.1. Released v8.2.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.40  % Computer : n006.cluster.edu
% 0.14/0.40  % Model    : x86_64 x86_64
% 0.14/0.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.40  % Memory   : 8046.5625MB
% 0.14/0.40  % OS       : Linux 6.8.0-71-generic
% 0.14/0.40  % CPULimit : 300
% 0.14/0.40  % WCLimit  : 300
% 0.14/0.40  % DateTime : Sun Sep 27 18:38:25 UTC 2026
% 0.14/0.40  % CPUTime  : 
% 0.14/0.40  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.44  Running first-order theorem proving
% 0.14/0.44  Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.79/1.69  % (3247128)Detected formulas, will run a generic FOF schedule.
% 0.79/1.69  % (3247141)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=1583672089:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 0.79/1.69  % (3247145)dis-21_1_sil=8000:lcm=predicate:random_seed=651142424:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 0.79/1.69  % (3247143)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3384593242:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 0.79/1.69  % (3247139)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=227582208:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 0.79/1.69  % (3247144)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=286396648:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 0.79/1.69  % (3247140)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=2829907840:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 0.79/1.69  % (3247142)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1375612891:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 0.79/1.69  % (3247144)Refutation not found, incomplete strategy
% 0.79/1.69  % (3247144)------------------------------
% 0.79/1.69  % (3247144)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.79/1.69  % (3247144)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.79/1.69  % (3247143)Refutation not found, incomplete strategy
% 0.79/1.69  % (3247143)------------------------------
% 0.79/1.69  % (3247143)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.79/1.69  % (3247144)CaDiCaL version: 2.1.3
% 0.79/1.69  % (3247144)Termination reason: Refutation not found, incomplete strategy
% 0.79/1.69  % (3247144)Time elapsed: 0.004 s
% 0.79/1.69  % (3247144)Peak memory usage: 88 MB
% 0.79/1.69  % (3247143)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.79/1.69  % (3247144)Instructions burned: 2 (million)
% 0.79/1.69  % (3247143)CaDiCaL version: 2.1.3
% 0.79/1.69  % (3247143)Termination reason: Refutation not found, incomplete strategy
% 0.79/1.69  % (3247143)Time elapsed: 0.004 s
% 0.79/1.69  % (3247143)Peak memory usage: 88 MB
% 0.79/1.69  % (3247143)Instructions burned: 3 (million)
% 0.79/1.69  % (3247142)Refutation not found, incomplete strategy
% 0.79/1.69  % (3247142)------------------------------
% 0.79/1.69  % (3247142)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.79/1.69  % (3247142)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.79/1.69  % (3247142)CaDiCaL version: 2.1.3
% 0.79/1.69  % (3247142)Termination reason: Refutation not found, incomplete strategy
% 0.79/1.69  % (3247142)Time elapsed: 0.006 s
% 0.79/1.69  % (3247142)Peak memory usage: 88 MB
% 0.79/1.69  % (3247142)Instructions burned: 5 (million)
% 0.79/1.69  % (3247145)First to succeed.
% 0.79/1.69  % (3247145)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3247128"
% 0.79/1.69  % (3247144)------------------------------
% 0.79/1.69  % (3247144)------------------------------
% 0.79/1.69  % (3247142)------------------------------
% 0.79/1.69  % (3247142)------------------------------
% 0.79/1.69  % (3247143)------------------------------
% 0.79/1.69  % (3247143)------------------------------
% 0.79/1.69  % SZS status CounterSatisfiable for theBenchmark
% 0.79/1.69  % SZS output start Saturation.
% See solution above
% 5.61/1.89  % SZS output start Definitions and Model Updates.
% 5.61/1.89  % SZS output end Definitions and Model Updates.
% 5.61/1.89  % (3247145)------------------------------
% 5.61/1.89  % (3247145)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.61/1.89  % (3247145)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.61/1.89  % (3247145)CaDiCaL version: 2.1.3
% 5.61/1.89  % (3247145)Termination reason: Satisfiable
% 5.61/1.89  % (3247145)Time elapsed: 0.011 s
% 5.61/1.89  % (3247145)Peak memory usage: 88 MB
% 5.61/1.89  % (3247145)Instructions burned: 9 (million)
% 5.61/1.89  % (3247145)------------------------------
% 5.61/1.89  % (3247145)------------------------------
% 5.61/1.89  % (3247128)Success in time 0.68 s
% 5.61/1.89  % Vampire exiting
%------------------------------------------------------------------------------