TSTP Solution File: LCL966_9 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL966_9 : 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 file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n003.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 : Tue May 21 00:24:17 EDT 2024
% Result : CounterSatisfiable 12.63s 2.38s
% Output : Saturation 12.63s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(u221,negated_conjecture,
( qmltpeq(X1,set_intersection2(sK27,sK27),sK27)
| ~ '$ki_accessible'(sK28,X1) ) ).
cnf(u228,negated_conjecture,
( qmltpeq(X1,set_intersection2(sK27,sK27),sK27)
| ~ '$ki_accessible'(sK24(sK26),X1) ) ).
cnf(u235,negated_conjecture,
( qmltpeq(X1,set_intersection2(sK27,sK27),sK27)
| ~ '$ki_accessible'(sK0(sK26),X1) ) ).
cnf(u247,negated_conjecture,
( qmltpeq(X1,set_intersection2(sK1(sK26),sK1(sK26)),sK1(sK26))
| ~ '$ki_accessible'(sK28,X1) ) ).
cnf(u251,negated_conjecture,
( qmltpeq(X1,set_intersection2(sK1(sK26),sK1(sK26)),sK1(sK26))
| ~ '$ki_accessible'(sK24(sK26),X1) ) ).
cnf(u255,negated_conjecture,
( qmltpeq(X1,set_intersection2(sK1(sK26),sK1(sK26)),sK1(sK26))
| ~ '$ki_accessible'(sK0(sK26),X1) ) ).
cnf(u321,negated_conjecture,
( qmltpeq(X0,sK29,sK27)
| ~ '$ki_accessible'(sK31,X0) ) ).
cnf(u329,negated_conjecture,
( qmltpeq(X0,sK29,sK27)
| ~ '$ki_accessible'(sK30,X0) ) ).
cnf(u337,negated_conjecture,
( qmltpeq(X0,sK29,sK27)
| ~ '$ki_accessible'(sK0(sK28),X0) ) ).
cnf(u352,negated_conjecture,
( qmltpeq(X0,sK1(sK28),sK27)
| ~ '$ki_accessible'(sK31,X0) ) ).
cnf(u360,negated_conjecture,
( qmltpeq(X0,sK1(sK28),sK27)
| ~ '$ki_accessible'(sK30,X0) ) ).
cnf(u368,negated_conjecture,
( qmltpeq(X0,sK1(sK28),sK27)
| ~ '$ki_accessible'(sK0(sK28),X0) ) ).
cnf(u394,negated_conjecture,
( qmltpeq(X0,sK1(sK24(sK26)),sK27)
| ~ '$ki_accessible'(sK0(sK24(sK26)),X0) ) ).
cnf(u404,negated_conjecture,
( qmltpeq(X0,sK1(sK0(sK26)),sK27)
| ~ '$ki_accessible'(sK0(sK0(sK26)),X0) ) ).
cnf(u429,negated_conjecture,
( qmltpeq(X0,sK29,sK1(sK26))
| ~ '$ki_accessible'(sK31,X0) ) ).
cnf(u437,negated_conjecture,
( qmltpeq(X0,sK29,sK1(sK26))
| ~ '$ki_accessible'(sK30,X0) ) ).
cnf(u445,negated_conjecture,
( qmltpeq(X0,sK29,sK1(sK26))
| ~ '$ki_accessible'(sK0(sK28),X0) ) ).
cnf(u461,negated_conjecture,
( qmltpeq(X0,sK1(sK28),sK1(sK26))
| ~ '$ki_accessible'(sK31,X0) ) ).
cnf(u469,negated_conjecture,
( qmltpeq(X0,sK1(sK28),sK1(sK26))
| ~ '$ki_accessible'(sK30,X0) ) ).
cnf(u477,negated_conjecture,
( qmltpeq(X0,sK1(sK28),sK1(sK26))
| ~ '$ki_accessible'(sK0(sK28),X0) ) ).
cnf(u502,negated_conjecture,
( qmltpeq(X0,sK1(sK24(sK26)),sK1(sK26))
| ~ '$ki_accessible'(sK0(sK24(sK26)),X0) ) ).
cnf(u513,negated_conjecture,
( qmltpeq(X0,sK1(sK0(sK26)),sK1(sK26))
| ~ '$ki_accessible'(sK0(sK0(sK26)),X0) ) ).
cnf(u538,negated_conjecture,
( disjoint(X0,sK29,sK27)
| ~ '$ki_accessible'(sK31,X0) ) ).
cnf(u546,negated_conjecture,
( disjoint(X0,sK29,sK27)
| ~ '$ki_accessible'(sK30,X0) ) ).
cnf(u554,negated_conjecture,
( disjoint(X0,sK29,sK27)
| ~ '$ki_accessible'(sK0(sK28),X0) ) ).
cnf(u569,negated_conjecture,
( disjoint(X0,sK1(sK28),sK27)
| ~ '$ki_accessible'(sK31,X0) ) ).
cnf(u577,negated_conjecture,
( disjoint(X0,sK1(sK28),sK27)
| ~ '$ki_accessible'(sK30,X0) ) ).
cnf(u585,negated_conjecture,
( disjoint(X0,sK1(sK28),sK27)
| ~ '$ki_accessible'(sK0(sK28),X0) ) ).
cnf(u603,negated_conjecture,
( disjoint(X0,sK1(sK24(sK26)),sK27)
| ~ '$ki_accessible'(sK0(sK24(sK26)),X0) ) ).
cnf(u614,negated_conjecture,
( disjoint(X0,sK1(sK0(sK26)),sK27)
| ~ '$ki_accessible'(sK0(sK0(sK26)),X0) ) ).
cnf(u641,negated_conjecture,
( disjoint(X0,sK29,sK1(sK26))
| ~ '$ki_accessible'(sK31,X0) ) ).
cnf(u649,negated_conjecture,
( disjoint(X0,sK29,sK1(sK26))
| ~ '$ki_accessible'(sK30,X0) ) ).
cnf(u657,negated_conjecture,
( disjoint(X0,sK29,sK1(sK26))
| ~ '$ki_accessible'(sK0(sK28),X0) ) ).
cnf(u668,negated_conjecture,
( disjoint(X0,sK1(sK28),sK1(sK26))
| ~ '$ki_accessible'(sK31,X0) ) ).
cnf(u676,negated_conjecture,
( disjoint(X0,sK1(sK28),sK1(sK26))
| ~ '$ki_accessible'(sK30,X0) ) ).
cnf(u684,negated_conjecture,
( disjoint(X0,sK1(sK28),sK1(sK26))
| ~ '$ki_accessible'(sK0(sK28),X0) ) ).
cnf(u704,negated_conjecture,
( disjoint(X0,sK1(sK24(sK26)),sK1(sK26))
| ~ '$ki_accessible'(sK0(sK24(sK26)),X0) ) ).
cnf(u713,negated_conjecture,
( disjoint(X0,sK1(sK0(sK26)),sK1(sK26))
| ~ '$ki_accessible'(sK0(sK0(sK26)),X0) ) ).
cnf(u746,negated_conjecture,
( disjoint(X0,singleton(sK27),sK29)
| ~ '$ki_accessible'(sK31,X0) ) ).
cnf(u754,negated_conjecture,
( disjoint(X0,singleton(sK27),sK29)
| ~ '$ki_accessible'(sK30,X0) ) ).
cnf(u762,negated_conjecture,
( disjoint(X0,singleton(sK27),sK29)
| ~ '$ki_accessible'(sK0(sK28),X0) ) ).
cnf(u778,negated_conjecture,
( disjoint(X0,singleton(sK27),sK1(sK28))
| ~ '$ki_accessible'(sK31,X0) ) ).
cnf(u786,negated_conjecture,
( disjoint(X0,singleton(sK27),sK1(sK28))
| ~ '$ki_accessible'(sK30,X0) ) ).
cnf(u794,negated_conjecture,
( disjoint(X0,singleton(sK27),sK1(sK28))
| ~ '$ki_accessible'(sK0(sK28),X0) ) ).
cnf(u809,negated_conjecture,
( disjoint(X0,singleton(sK27),sK1(sK24(sK26)))
| ~ '$ki_accessible'(sK0(sK24(sK26)),X0) ) ).
cnf(u820,negated_conjecture,
( disjoint(X0,singleton(sK27),sK1(sK0(sK26)))
| ~ '$ki_accessible'(sK0(sK0(sK26)),X0) ) ).
cnf(u843,negated_conjecture,
( disjoint(X0,singleton(sK1(sK26)),sK29)
| ~ '$ki_accessible'(sK31,X0) ) ).
cnf(u851,negated_conjecture,
( disjoint(X0,singleton(sK1(sK26)),sK29)
| ~ '$ki_accessible'(sK30,X0) ) ).
cnf(u859,negated_conjecture,
( disjoint(X0,singleton(sK1(sK26)),sK29)
| ~ '$ki_accessible'(sK0(sK28),X0) ) ).
cnf(u874,negated_conjecture,
( disjoint(X0,singleton(sK1(sK26)),sK1(sK28))
| ~ '$ki_accessible'(sK31,X0) ) ).
cnf(u882,negated_conjecture,
( disjoint(X0,singleton(sK1(sK26)),sK1(sK28))
| ~ '$ki_accessible'(sK30,X0) ) ).
cnf(u890,negated_conjecture,
( disjoint(X0,singleton(sK1(sK26)),sK1(sK28))
| ~ '$ki_accessible'(sK0(sK28),X0) ) ).
cnf(u908,negated_conjecture,
( disjoint(X0,singleton(sK1(sK26)),sK1(sK24(sK26)))
| ~ '$ki_accessible'(sK0(sK24(sK26)),X0) ) ).
cnf(u917,negated_conjecture,
( disjoint(X0,singleton(sK1(sK26)),sK1(sK0(sK26)))
| ~ '$ki_accessible'(sK0(sK0(sK26)),X0) ) ).
cnf(u947,negated_conjecture,
( qmltpeq(X0,singleton(sK27),singleton(sK29))
| ~ '$ki_accessible'(sK31,X0) ) ).
cnf(u955,negated_conjecture,
( qmltpeq(X0,singleton(sK27),singleton(sK29))
| ~ '$ki_accessible'(sK30,X0) ) ).
cnf(u963,negated_conjecture,
( qmltpeq(X0,singleton(sK27),singleton(sK29))
| ~ '$ki_accessible'(sK0(sK28),X0) ) ).
cnf(u977,negated_conjecture,
( qmltpeq(X0,singleton(sK27),singleton(sK1(sK28)))
| ~ '$ki_accessible'(sK31,X0) ) ).
cnf(u985,negated_conjecture,
( qmltpeq(X0,singleton(sK27),singleton(sK1(sK28)))
| ~ '$ki_accessible'(sK30,X0) ) ).
cnf(u993,negated_conjecture,
( qmltpeq(X0,singleton(sK27),singleton(sK1(sK28)))
| ~ '$ki_accessible'(sK0(sK28),X0) ) ).
cnf(u1009,negated_conjecture,
( qmltpeq(X0,singleton(sK27),singleton(sK1(sK24(sK26))))
| ~ '$ki_accessible'(sK0(sK24(sK26)),X0) ) ).
cnf(u1024,negated_conjecture,
( qmltpeq(X0,singleton(sK27),singleton(sK1(sK0(sK26))))
| ~ '$ki_accessible'(sK0(sK0(sK26)),X0) ) ).
cnf(u1047,negated_conjecture,
( qmltpeq(X0,singleton(sK1(sK26)),singleton(sK29))
| ~ '$ki_accessible'(sK31,X0) ) ).
cnf(u1055,negated_conjecture,
( qmltpeq(X0,singleton(sK1(sK26)),singleton(sK29))
| ~ '$ki_accessible'(sK30,X0) ) ).
cnf(u1063,negated_conjecture,
( qmltpeq(X0,singleton(sK1(sK26)),singleton(sK29))
| ~ '$ki_accessible'(sK0(sK28),X0) ) ).
cnf(u1076,negated_conjecture,
( qmltpeq(X0,singleton(sK1(sK26)),singleton(sK1(sK28)))
| ~ '$ki_accessible'(sK31,X0) ) ).
cnf(u1084,negated_conjecture,
( qmltpeq(X0,singleton(sK1(sK26)),singleton(sK1(sK28)))
| ~ '$ki_accessible'(sK30,X0) ) ).
cnf(u1092,negated_conjecture,
( qmltpeq(X0,singleton(sK1(sK26)),singleton(sK1(sK28)))
| ~ '$ki_accessible'(sK0(sK28),X0) ) ).
cnf(u1110,negated_conjecture,
( qmltpeq(X0,singleton(sK1(sK26)),singleton(sK1(sK24(sK26))))
| ~ '$ki_accessible'(sK0(sK24(sK26)),X0) ) ).
cnf(u1121,negated_conjecture,
( qmltpeq(X0,singleton(sK1(sK26)),singleton(sK1(sK0(sK26))))
| ~ '$ki_accessible'(sK0(sK0(sK26)),X0) ) ).
cnf(u1147,negated_conjecture,
( ~ '$ki_accessible'(sK31,X0)
| '$ki_accessible'(X0,sK18(sK27,sK29,X0)) ) ).
cnf(u1155,negated_conjecture,
( ~ '$ki_accessible'(sK30,X0)
| '$ki_accessible'(X0,sK18(sK27,sK29,X0)) ) ).
cnf(u1163,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK28),X0)
| '$ki_accessible'(X0,sK18(sK27,sK29,X0)) ) ).
cnf(u1180,negated_conjecture,
( ~ '$ki_accessible'(sK31,X0)
| '$ki_accessible'(X0,sK18(sK27,sK1(sK28),X0)) ) ).
cnf(u1188,negated_conjecture,
( ~ '$ki_accessible'(sK30,X0)
| '$ki_accessible'(X0,sK18(sK27,sK1(sK28),X0)) ) ).
cnf(u1196,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK28),X0)
| '$ki_accessible'(X0,sK18(sK27,sK1(sK28),X0)) ) ).
cnf(u1216,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK24(sK26)),X0)
| '$ki_accessible'(X0,sK18(sK27,sK1(sK24(sK26)),X0)) ) ).
cnf(u1226,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK0(sK26)),X0)
| '$ki_accessible'(X0,sK18(sK27,sK1(sK0(sK26)),X0)) ) ).
cnf(u1250,negated_conjecture,
( ~ '$ki_accessible'(sK31,X0)
| '$ki_accessible'(X0,sK18(sK1(sK26),sK29,X0)) ) ).
cnf(u1258,negated_conjecture,
( ~ '$ki_accessible'(sK30,X0)
| '$ki_accessible'(X0,sK18(sK1(sK26),sK29,X0)) ) ).
cnf(u1266,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK28),X0)
| '$ki_accessible'(X0,sK18(sK1(sK26),sK29,X0)) ) ).
cnf(u1284,negated_conjecture,
( ~ '$ki_accessible'(sK31,X0)
| '$ki_accessible'(X0,sK18(sK1(sK26),sK1(sK28),X0)) ) ).
cnf(u1292,negated_conjecture,
( ~ '$ki_accessible'(sK30,X0)
| '$ki_accessible'(X0,sK18(sK1(sK26),sK1(sK28),X0)) ) ).
cnf(u1300,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK28),X0)
| '$ki_accessible'(X0,sK18(sK1(sK26),sK1(sK28),X0)) ) ).
cnf(u1326,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK24(sK26)),X0)
| '$ki_accessible'(X0,sK18(sK1(sK26),sK1(sK24(sK26)),X0)) ) ).
cnf(u1336,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK0(sK26)),X0)
| '$ki_accessible'(X0,sK18(sK1(sK26),sK1(sK0(sK26)),X0)) ) ).
cnf(u1363,negated_conjecture,
( empty(X0,sK29)
| ~ '$ki_accessible'(sK31,X0) ) ).
cnf(u1367,negated_conjecture,
'$ki_accessible'(sK31,sK12(sK27,sK31)) ).
cnf(u1375,negated_conjecture,
( empty(X0,sK29)
| ~ '$ki_accessible'(sK30,X0) ) ).
cnf(u1379,negated_conjecture,
'$ki_accessible'(sK30,sK12(sK27,sK30)) ).
cnf(u1387,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK28),X0)
| empty(X0,sK29) ) ).
cnf(u1391,negated_conjecture,
'$ki_accessible'(sK0(sK28),sK12(sK27,sK0(sK28))) ).
cnf(u1408,negated_conjecture,
( empty(X0,sK1(sK28))
| ~ '$ki_accessible'(sK31,X0) ) ).
cnf(u1416,negated_conjecture,
( empty(X0,sK1(sK28))
| ~ '$ki_accessible'(sK30,X0) ) ).
cnf(u1424,negated_conjecture,
( empty(X0,sK1(sK28))
| ~ '$ki_accessible'(sK0(sK28),X0) ) ).
cnf(u1458,negated_conjecture,
( empty(X0,sK1(sK24(sK26)))
| ~ '$ki_accessible'(sK0(sK24(sK26)),X0) ) ).
cnf(u1472,negated_conjecture,
( empty(X0,sK1(sK0(sK26)))
| ~ '$ki_accessible'(sK0(sK0(sK26)),X0) ) ).
cnf(u1563,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK29,singleton(sK27)),singleton(sK27))
| ~ '$ki_accessible'(sK31,X0) ) ).
cnf(u1571,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK29,singleton(sK27)),singleton(sK27))
| ~ '$ki_accessible'(sK30,X0) ) ).
cnf(u1579,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK29,singleton(sK27)),singleton(sK27))
| ~ '$ki_accessible'(sK0(sK28),X0) ) ).
cnf(u1593,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK1(sK28),singleton(sK27)),singleton(sK27))
| ~ '$ki_accessible'(sK31,X0) ) ).
cnf(u1601,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK1(sK28),singleton(sK27)),singleton(sK27))
| ~ '$ki_accessible'(sK30,X0) ) ).
cnf(u1609,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK1(sK28),singleton(sK27)),singleton(sK27))
| ~ '$ki_accessible'(sK0(sK28),X0) ) ).
cnf(u1627,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK1(sK24(sK26)),singleton(sK27)),singleton(sK27))
| ~ '$ki_accessible'(sK0(sK24(sK26)),X0) ) ).
cnf(u1639,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK1(sK0(sK26)),singleton(sK27)),singleton(sK27))
| ~ '$ki_accessible'(sK0(sK0(sK26)),X0) ) ).
cnf(u1663,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK29,singleton(sK1(sK26))),singleton(sK1(sK26)))
| ~ '$ki_accessible'(sK31,X0) ) ).
cnf(u1671,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK29,singleton(sK1(sK26))),singleton(sK1(sK26)))
| ~ '$ki_accessible'(sK30,X0) ) ).
cnf(u1679,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK29,singleton(sK1(sK26))),singleton(sK1(sK26)))
| ~ '$ki_accessible'(sK0(sK28),X0) ) ).
cnf(u1692,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK1(sK28),singleton(sK1(sK26))),singleton(sK1(sK26)))
| ~ '$ki_accessible'(sK31,X0) ) ).
cnf(u1700,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK1(sK28),singleton(sK1(sK26))),singleton(sK1(sK26)))
| ~ '$ki_accessible'(sK30,X0) ) ).
cnf(u1708,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK1(sK28),singleton(sK1(sK26))),singleton(sK1(sK26)))
| ~ '$ki_accessible'(sK0(sK28),X0) ) ).
cnf(u1718,axiom,
( qmltpeq(X1,set_intersection2(sK1(sK0('$ki_local_world')),sK1(sK0('$ki_local_world'))),sK1(sK0('$ki_local_world')))
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X1) ) ).
cnf(u1725,axiom,
( qmltpeq(X1,set_intersection2(sK1(sK0('$ki_local_world')),sK1(sK0('$ki_local_world'))),sK1(sK0('$ki_local_world')))
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X1) ) ).
cnf(u1737,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK1(sK24(sK26)),singleton(sK1(sK26))),singleton(sK1(sK26)))
| ~ '$ki_accessible'(sK0(sK24(sK26)),X0) ) ).
cnf(u1748,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK1(sK0(sK26)),singleton(sK1(sK26))),singleton(sK1(sK26)))
| ~ '$ki_accessible'(sK0(sK0(sK26)),X0) ) ).
cnf(u1885,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK27,sK1(sK31)),set_intersection2(sK29,sK1(sK31)))
| ~ '$ki_accessible'(sK12(sK27,sK31),X0) ) ).
cnf(u1893,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK27,sK1(sK31)),set_intersection2(sK29,sK1(sK31)))
| ~ '$ki_accessible'(sK0(sK31),X0) ) ).
cnf(u1904,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK27,sK1(sK30)),set_intersection2(sK29,sK1(sK30)))
| ~ '$ki_accessible'(sK12(sK27,sK30),X0) ) ).
cnf(u1912,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK27,sK1(sK30)),set_intersection2(sK29,sK1(sK30)))
| ~ '$ki_accessible'(sK0(sK30),X0) ) ).
cnf(u1925,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK27,sK1(sK0(sK28))),set_intersection2(sK29,sK1(sK0(sK28))))
| ~ '$ki_accessible'(sK12(sK27,sK0(sK28)),X0) ) ).
cnf(u1933,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK27,sK1(sK0(sK28))),set_intersection2(sK29,sK1(sK0(sK28))))
| ~ '$ki_accessible'(sK0(sK0(sK28)),X0) ) ).
cnf(u1947,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK27,sK1(sK31)),set_intersection2(sK1(sK28),sK1(sK31)))
| ~ '$ki_accessible'(sK12(sK27,sK31),X0) ) ).
cnf(u1955,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK27,sK1(sK31)),set_intersection2(sK1(sK28),sK1(sK31)))
| ~ '$ki_accessible'(sK0(sK31),X0) ) ).
cnf(u1966,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK27,sK1(sK30)),set_intersection2(sK1(sK28),sK1(sK30)))
| ~ '$ki_accessible'(sK12(sK27,sK30),X0) ) ).
cnf(u1974,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK27,sK1(sK30)),set_intersection2(sK1(sK28),sK1(sK30)))
| ~ '$ki_accessible'(sK0(sK30),X0) ) ).
cnf(u1987,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK27,sK1(sK0(sK28))),set_intersection2(sK1(sK28),sK1(sK0(sK28))))
| ~ '$ki_accessible'(sK12(sK27,sK0(sK28)),X0) ) ).
cnf(u1995,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK27,sK1(sK0(sK28))),set_intersection2(sK1(sK28),sK1(sK0(sK28))))
| ~ '$ki_accessible'(sK0(sK0(sK28)),X0) ) ).
cnf(u2022,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK1(sK31),sK27),set_intersection2(sK1(sK31),sK29))
| ~ '$ki_accessible'(sK12(sK27,sK31),X0) ) ).
cnf(u2030,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK1(sK31),sK27),set_intersection2(sK1(sK31),sK29))
| ~ '$ki_accessible'(sK0(sK31),X0) ) ).
cnf(u2041,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK1(sK30),sK27),set_intersection2(sK1(sK30),sK29))
| ~ '$ki_accessible'(sK12(sK27,sK30),X0) ) ).
cnf(u2049,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK1(sK30),sK27),set_intersection2(sK1(sK30),sK29))
| ~ '$ki_accessible'(sK0(sK30),X0) ) ).
cnf(u2062,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK1(sK0(sK28)),sK27),set_intersection2(sK1(sK0(sK28)),sK29))
| ~ '$ki_accessible'(sK12(sK27,sK0(sK28)),X0) ) ).
cnf(u2070,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK1(sK0(sK28)),sK27),set_intersection2(sK1(sK0(sK28)),sK29))
| ~ '$ki_accessible'(sK0(sK0(sK28)),X0) ) ).
cnf(u2084,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK1(sK31),sK27),set_intersection2(sK1(sK31),sK1(sK28)))
| ~ '$ki_accessible'(sK12(sK27,sK31),X0) ) ).
cnf(u2092,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK1(sK31),sK27),set_intersection2(sK1(sK31),sK1(sK28)))
| ~ '$ki_accessible'(sK0(sK31),X0) ) ).
cnf(u2103,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK1(sK30),sK27),set_intersection2(sK1(sK30),sK1(sK28)))
| ~ '$ki_accessible'(sK12(sK27,sK30),X0) ) ).
cnf(u2111,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK1(sK30),sK27),set_intersection2(sK1(sK30),sK1(sK28)))
| ~ '$ki_accessible'(sK0(sK30),X0) ) ).
cnf(u2124,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK1(sK0(sK28)),sK27),set_intersection2(sK1(sK0(sK28)),sK1(sK28)))
| ~ '$ki_accessible'(sK12(sK27,sK0(sK28)),X0) ) ).
cnf(u2132,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK1(sK0(sK28)),sK27),set_intersection2(sK1(sK0(sK28)),sK1(sK28)))
| ~ '$ki_accessible'(sK0(sK0(sK28)),X0) ) ).
cnf(u2149,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK27,sK1(sK0(sK24(sK26)))),set_intersection2(sK1(sK24(sK26)),sK1(sK0(sK24(sK26)))))
| ~ '$ki_accessible'(sK0(sK0(sK24(sK26))),X0) ) ).
cnf(u2158,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK27,sK1(sK0(sK0(sK26)))),set_intersection2(sK1(sK0(sK26)),sK1(sK0(sK0(sK26)))))
| ~ '$ki_accessible'(sK0(sK0(sK0(sK26))),X0) ) ).
cnf(u2167,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK1(sK0(sK24(sK26))),sK27),set_intersection2(sK1(sK0(sK24(sK26))),sK1(sK24(sK26))))
| ~ '$ki_accessible'(sK0(sK0(sK24(sK26))),X0) ) ).
cnf(u2176,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK1(sK0(sK0(sK26))),sK27),set_intersection2(sK1(sK0(sK0(sK26))),sK1(sK0(sK26))))
| ~ '$ki_accessible'(sK0(sK0(sK0(sK26))),X0) ) ).
cnf(u2197,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK1(sK26),sK1(sK31)),set_intersection2(sK29,sK1(sK31)))
| ~ '$ki_accessible'(sK12(sK27,sK31),X0) ) ).
cnf(u2205,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK1(sK26),sK1(sK31)),set_intersection2(sK29,sK1(sK31)))
| ~ '$ki_accessible'(sK0(sK31),X0) ) ).
cnf(u2216,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK1(sK26),sK1(sK30)),set_intersection2(sK29,sK1(sK30)))
| ~ '$ki_accessible'(sK12(sK27,sK30),X0) ) ).
cnf(u2224,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK1(sK26),sK1(sK30)),set_intersection2(sK29,sK1(sK30)))
| ~ '$ki_accessible'(sK0(sK30),X0) ) ).
cnf(u2235,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK1(sK26),sK1(sK0(sK28))),set_intersection2(sK29,sK1(sK0(sK28))))
| ~ '$ki_accessible'(sK12(sK27,sK0(sK28)),X0) ) ).
cnf(u2243,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK1(sK26),sK1(sK0(sK28))),set_intersection2(sK29,sK1(sK0(sK28))))
| ~ '$ki_accessible'(sK0(sK0(sK28)),X0) ) ).
cnf(u2259,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK1(sK26),sK1(sK31)),set_intersection2(sK1(sK28),sK1(sK31)))
| ~ '$ki_accessible'(sK12(sK27,sK31),X0) ) ).
cnf(u2267,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK1(sK26),sK1(sK31)),set_intersection2(sK1(sK28),sK1(sK31)))
| ~ '$ki_accessible'(sK0(sK31),X0) ) ).
cnf(u2278,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK1(sK26),sK1(sK30)),set_intersection2(sK1(sK28),sK1(sK30)))
| ~ '$ki_accessible'(sK12(sK27,sK30),X0) ) ).
cnf(u2286,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK1(sK26),sK1(sK30)),set_intersection2(sK1(sK28),sK1(sK30)))
| ~ '$ki_accessible'(sK0(sK30),X0) ) ).
cnf(u2299,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK1(sK26),sK1(sK0(sK28))),set_intersection2(sK1(sK28),sK1(sK0(sK28))))
| ~ '$ki_accessible'(sK12(sK27,sK0(sK28)),X0) ) ).
cnf(u2307,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK1(sK26),sK1(sK0(sK28))),set_intersection2(sK1(sK28),sK1(sK0(sK28))))
| ~ '$ki_accessible'(sK0(sK0(sK28)),X0) ) ).
cnf(u2334,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK1(sK31),sK1(sK26)),set_intersection2(sK1(sK31),sK29))
| ~ '$ki_accessible'(sK12(sK27,sK31),X0) ) ).
cnf(u2342,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK1(sK31),sK1(sK26)),set_intersection2(sK1(sK31),sK29))
| ~ '$ki_accessible'(sK0(sK31),X0) ) ).
cnf(u2353,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK1(sK30),sK1(sK26)),set_intersection2(sK1(sK30),sK29))
| ~ '$ki_accessible'(sK12(sK27,sK30),X0) ) ).
cnf(u2361,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK1(sK30),sK1(sK26)),set_intersection2(sK1(sK30),sK29))
| ~ '$ki_accessible'(sK0(sK30),X0) ) ).
cnf(u2374,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK1(sK0(sK28)),sK1(sK26)),set_intersection2(sK1(sK0(sK28)),sK29))
| ~ '$ki_accessible'(sK12(sK27,sK0(sK28)),X0) ) ).
cnf(u2382,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK1(sK0(sK28)),sK1(sK26)),set_intersection2(sK1(sK0(sK28)),sK29))
| ~ '$ki_accessible'(sK0(sK0(sK28)),X0) ) ).
cnf(u2396,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK1(sK31),sK1(sK26)),set_intersection2(sK1(sK31),sK1(sK28)))
| ~ '$ki_accessible'(sK12(sK27,sK31),X0) ) ).
cnf(u2404,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK1(sK31),sK1(sK26)),set_intersection2(sK1(sK31),sK1(sK28)))
| ~ '$ki_accessible'(sK0(sK31),X0) ) ).
cnf(u2415,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK1(sK30),sK1(sK26)),set_intersection2(sK1(sK30),sK1(sK28)))
| ~ '$ki_accessible'(sK12(sK27,sK30),X0) ) ).
cnf(u2423,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK1(sK30),sK1(sK26)),set_intersection2(sK1(sK30),sK1(sK28)))
| ~ '$ki_accessible'(sK0(sK30),X0) ) ).
cnf(u2436,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK1(sK0(sK28)),sK1(sK26)),set_intersection2(sK1(sK0(sK28)),sK1(sK28)))
| ~ '$ki_accessible'(sK12(sK27,sK0(sK28)),X0) ) ).
cnf(u2444,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK1(sK0(sK28)),sK1(sK26)),set_intersection2(sK1(sK0(sK28)),sK1(sK28)))
| ~ '$ki_accessible'(sK0(sK0(sK28)),X0) ) ).
cnf(u2471,negated_conjecture,
( qmltpeq(X0,sK27,sK1(sK31))
| ~ '$ki_accessible'(sK12(sK27,sK31),X0) ) ).
cnf(u2475,negated_conjecture,
'$ki_accessible'(sK12(sK27,sK31),sK3(sK29,sK1(sK31),sK12(sK27,sK31))) ).
cnf(u2483,negated_conjecture,
( qmltpeq(X0,sK27,sK1(sK31))
| ~ '$ki_accessible'(sK0(sK31),X0) ) ).
cnf(u2487,negated_conjecture,
'$ki_accessible'(sK0(sK31),sK3(sK29,sK1(sK31),sK0(sK31))) ).
cnf(u2500,negated_conjecture,
( qmltpeq(X0,sK27,sK1(sK30))
| ~ '$ki_accessible'(sK12(sK27,sK30),X0) ) ).
cnf(u2504,negated_conjecture,
'$ki_accessible'(sK12(sK27,sK30),sK3(sK29,sK1(sK30),sK12(sK27,sK30))) ).
cnf(u2512,negated_conjecture,
( qmltpeq(X0,sK27,sK1(sK30))
| ~ '$ki_accessible'(sK0(sK30),X0) ) ).
cnf(u2516,negated_conjecture,
'$ki_accessible'(sK0(sK30),sK3(sK29,sK1(sK30),sK0(sK30))) ).
cnf(u2527,negated_conjecture,
( qmltpeq(X0,sK27,sK1(sK0(sK28)))
| ~ '$ki_accessible'(sK12(sK27,sK0(sK28)),X0) ) ).
cnf(u2531,negated_conjecture,
'$ki_accessible'(sK12(sK27,sK0(sK28)),sK3(sK29,sK1(sK0(sK28)),sK12(sK27,sK0(sK28)))) ).
cnf(u2539,negated_conjecture,
( qmltpeq(X0,sK27,sK1(sK0(sK28)))
| ~ '$ki_accessible'(sK0(sK0(sK28)),X0) ) ).
cnf(u2543,negated_conjecture,
'$ki_accessible'(sK0(sK0(sK28)),sK3(sK29,sK1(sK0(sK28)),sK0(sK0(sK28)))) ).
cnf(u2584,negated_conjecture,
( disjoint(X0,sK29,sK1(sK31))
| ~ '$ki_accessible'(sK12(sK27,sK31),X0) ) ).
cnf(u2588,negated_conjecture,
'$ki_accessible'(sK12(sK27,sK31),sK8(sK27,sK1(sK31),sK12(sK27,sK31))) ).
cnf(u2596,negated_conjecture,
( disjoint(X0,sK29,sK1(sK31))
| ~ '$ki_accessible'(sK0(sK31),X0) ) ).
cnf(u2600,negated_conjecture,
'$ki_accessible'(sK0(sK31),sK8(sK27,sK1(sK31),sK0(sK31))) ).
cnf(u2612,negated_conjecture,
( disjoint(X0,sK29,sK1(sK30))
| ~ '$ki_accessible'(sK12(sK27,sK30),X0) ) ).
cnf(u2616,negated_conjecture,
'$ki_accessible'(sK12(sK27,sK30),sK8(sK27,sK1(sK30),sK12(sK27,sK30))) ).
cnf(u2624,negated_conjecture,
( disjoint(X0,sK29,sK1(sK30))
| ~ '$ki_accessible'(sK0(sK30),X0) ) ).
cnf(u2628,negated_conjecture,
'$ki_accessible'(sK0(sK30),sK8(sK27,sK1(sK30),sK0(sK30))) ).
cnf(u2639,negated_conjecture,
( disjoint(X0,sK29,sK1(sK0(sK28)))
| ~ '$ki_accessible'(sK12(sK27,sK0(sK28)),X0) ) ).
cnf(u2643,negated_conjecture,
'$ki_accessible'(sK12(sK27,sK0(sK28)),sK8(sK27,sK1(sK0(sK28)),sK12(sK27,sK0(sK28)))) ).
cnf(u2651,negated_conjecture,
( disjoint(X0,sK29,sK1(sK0(sK28)))
| ~ '$ki_accessible'(sK0(sK0(sK28)),X0) ) ).
cnf(u2655,negated_conjecture,
'$ki_accessible'(sK0(sK0(sK28)),sK8(sK27,sK1(sK0(sK28)),sK0(sK0(sK28)))) ).
cnf(u2669,negated_conjecture,
( disjoint(X0,sK1(sK28),sK1(sK31))
| ~ '$ki_accessible'(sK12(sK27,sK31),X0) ) ).
cnf(u2677,negated_conjecture,
( disjoint(X0,sK1(sK28),sK1(sK31))
| ~ '$ki_accessible'(sK0(sK31),X0) ) ).
cnf(u2689,negated_conjecture,
( disjoint(X0,sK1(sK28),sK1(sK30))
| ~ '$ki_accessible'(sK12(sK27,sK30),X0) ) ).
cnf(u2697,negated_conjecture,
( disjoint(X0,sK1(sK28),sK1(sK30))
| ~ '$ki_accessible'(sK0(sK30),X0) ) ).
cnf(u2708,negated_conjecture,
( disjoint(X0,sK1(sK28),sK1(sK0(sK28)))
| ~ '$ki_accessible'(sK12(sK27,sK0(sK28)),X0) ) ).
cnf(u2716,negated_conjecture,
( disjoint(X0,sK1(sK28),sK1(sK0(sK28)))
| ~ '$ki_accessible'(sK0(sK0(sK28)),X0) ) ).
cnf(u2742,negated_conjecture,
( disjoint(X0,sK1(sK31),sK29)
| ~ '$ki_accessible'(sK12(sK27,sK31),X0) ) ).
cnf(u2746,negated_conjecture,
'$ki_accessible'(sK12(sK27,sK31),sK10(sK27,sK1(sK31),sK12(sK27,sK31))) ).
cnf(u2754,negated_conjecture,
( disjoint(X0,sK1(sK31),sK29)
| ~ '$ki_accessible'(sK0(sK31),X0) ) ).
cnf(u2758,negated_conjecture,
'$ki_accessible'(sK0(sK31),sK10(sK27,sK1(sK31),sK0(sK31))) ).
cnf(u2770,negated_conjecture,
( disjoint(X0,sK1(sK30),sK29)
| ~ '$ki_accessible'(sK12(sK27,sK30),X0) ) ).
cnf(u2774,negated_conjecture,
'$ki_accessible'(sK12(sK27,sK30),sK10(sK27,sK1(sK30),sK12(sK27,sK30))) ).
cnf(u2782,negated_conjecture,
( disjoint(X0,sK1(sK30),sK29)
| ~ '$ki_accessible'(sK0(sK30),X0) ) ).
cnf(u2786,negated_conjecture,
'$ki_accessible'(sK0(sK30),sK10(sK27,sK1(sK30),sK0(sK30))) ).
cnf(u2797,negated_conjecture,
( disjoint(X0,sK1(sK0(sK28)),sK29)
| ~ '$ki_accessible'(sK12(sK27,sK0(sK28)),X0) ) ).
cnf(u2801,negated_conjecture,
'$ki_accessible'(sK12(sK27,sK0(sK28)),sK10(sK27,sK1(sK0(sK28)),sK12(sK27,sK0(sK28)))) ).
cnf(u2809,negated_conjecture,
( disjoint(X0,sK1(sK0(sK28)),sK29)
| ~ '$ki_accessible'(sK0(sK0(sK28)),X0) ) ).
cnf(u2813,negated_conjecture,
'$ki_accessible'(sK0(sK0(sK28)),sK10(sK27,sK1(sK0(sK28)),sK0(sK0(sK28)))) ).
cnf(u2827,negated_conjecture,
( disjoint(X0,sK1(sK31),sK1(sK28))
| ~ '$ki_accessible'(sK12(sK27,sK31),X0) ) ).
cnf(u2835,negated_conjecture,
( disjoint(X0,sK1(sK31),sK1(sK28))
| ~ '$ki_accessible'(sK0(sK31),X0) ) ).
cnf(u2847,negated_conjecture,
( disjoint(X0,sK1(sK30),sK1(sK28))
| ~ '$ki_accessible'(sK12(sK27,sK30),X0) ) ).
cnf(u2855,negated_conjecture,
( disjoint(X0,sK1(sK30),sK1(sK28))
| ~ '$ki_accessible'(sK0(sK30),X0) ) ).
cnf(u2866,negated_conjecture,
( disjoint(X0,sK1(sK0(sK28)),sK1(sK28))
| ~ '$ki_accessible'(sK12(sK27,sK0(sK28)),X0) ) ).
cnf(u2874,negated_conjecture,
( disjoint(X0,sK1(sK0(sK28)),sK1(sK28))
| ~ '$ki_accessible'(sK0(sK0(sK28)),X0) ) ).
cnf(u2901,negated_conjecture,
( in(X0,sK29,sK1(sK31))
| ~ '$ki_accessible'(sK12(sK27,sK31),X0) ) ).
cnf(u2905,negated_conjecture,
'$ki_accessible'(sK12(sK27,sK31),sK14(sK27,sK1(sK31),sK12(sK27,sK31))) ).
cnf(u2913,negated_conjecture,
( in(X0,sK29,sK1(sK31))
| ~ '$ki_accessible'(sK0(sK31),X0) ) ).
cnf(u2917,negated_conjecture,
'$ki_accessible'(sK0(sK31),sK14(sK27,sK1(sK31),sK0(sK31))) ).
cnf(u2928,negated_conjecture,
( in(X0,sK29,sK1(sK30))
| ~ '$ki_accessible'(sK12(sK27,sK30),X0) ) ).
cnf(u2932,negated_conjecture,
'$ki_accessible'(sK12(sK27,sK30),sK14(sK27,sK1(sK30),sK12(sK27,sK30))) ).
cnf(u2940,negated_conjecture,
( in(X0,sK29,sK1(sK30))
| ~ '$ki_accessible'(sK0(sK30),X0) ) ).
cnf(u2944,negated_conjecture,
'$ki_accessible'(sK0(sK30),sK14(sK27,sK1(sK30),sK0(sK30))) ).
cnf(u2955,negated_conjecture,
( in(X0,sK29,sK1(sK0(sK28)))
| ~ '$ki_accessible'(sK12(sK27,sK0(sK28)),X0) ) ).
cnf(u2959,negated_conjecture,
'$ki_accessible'(sK12(sK27,sK0(sK28)),sK14(sK27,sK1(sK0(sK28)),sK12(sK27,sK0(sK28)))) ).
cnf(u2967,negated_conjecture,
( in(X0,sK29,sK1(sK0(sK28)))
| ~ '$ki_accessible'(sK0(sK0(sK28)),X0) ) ).
cnf(u2971,negated_conjecture,
'$ki_accessible'(sK0(sK0(sK28)),sK14(sK27,sK1(sK0(sK28)),sK0(sK0(sK28)))) ).
cnf(u2986,negated_conjecture,
( in(X0,sK1(sK28),sK1(sK31))
| ~ '$ki_accessible'(sK12(sK27,sK31),X0) ) ).
cnf(u2994,negated_conjecture,
( in(X0,sK1(sK28),sK1(sK31))
| ~ '$ki_accessible'(sK0(sK31),X0) ) ).
cnf(u3005,negated_conjecture,
( in(X0,sK1(sK28),sK1(sK30))
| ~ '$ki_accessible'(sK12(sK27,sK30),X0) ) ).
cnf(u3013,negated_conjecture,
( in(X0,sK1(sK28),sK1(sK30))
| ~ '$ki_accessible'(sK0(sK30),X0) ) ).
cnf(u3024,negated_conjecture,
( in(X0,sK1(sK28),sK1(sK0(sK28)))
| ~ '$ki_accessible'(sK12(sK27,sK0(sK28)),X0) ) ).
cnf(u3032,negated_conjecture,
( in(X0,sK1(sK28),sK1(sK0(sK28)))
| ~ '$ki_accessible'(sK0(sK0(sK28)),X0) ) ).
cnf(u3059,negated_conjecture,
( in(X0,sK1(sK31),sK29)
| ~ '$ki_accessible'(sK12(sK27,sK31),X0) ) ).
cnf(u3063,negated_conjecture,
'$ki_accessible'(sK12(sK27,sK31),sK16(sK27,sK1(sK31),sK12(sK27,sK31))) ).
cnf(u3071,negated_conjecture,
( in(X0,sK1(sK31),sK29)
| ~ '$ki_accessible'(sK0(sK31),X0) ) ).
cnf(u3075,negated_conjecture,
'$ki_accessible'(sK0(sK31),sK16(sK27,sK1(sK31),sK0(sK31))) ).
cnf(u3086,negated_conjecture,
( in(X0,sK1(sK30),sK29)
| ~ '$ki_accessible'(sK12(sK27,sK30),X0) ) ).
cnf(u3090,negated_conjecture,
'$ki_accessible'(sK12(sK27,sK30),sK16(sK27,sK1(sK30),sK12(sK27,sK30))) ).
cnf(u3098,negated_conjecture,
( in(X0,sK1(sK30),sK29)
| ~ '$ki_accessible'(sK0(sK30),X0) ) ).
cnf(u3102,negated_conjecture,
'$ki_accessible'(sK0(sK30),sK16(sK27,sK1(sK30),sK0(sK30))) ).
cnf(u3113,negated_conjecture,
( in(X0,sK1(sK0(sK28)),sK29)
| ~ '$ki_accessible'(sK12(sK27,sK0(sK28)),X0) ) ).
cnf(u3117,negated_conjecture,
'$ki_accessible'(sK12(sK27,sK0(sK28)),sK16(sK27,sK1(sK0(sK28)),sK12(sK27,sK0(sK28)))) ).
cnf(u3125,negated_conjecture,
( in(X0,sK1(sK0(sK28)),sK29)
| ~ '$ki_accessible'(sK0(sK0(sK28)),X0) ) ).
cnf(u3129,negated_conjecture,
'$ki_accessible'(sK0(sK0(sK28)),sK16(sK27,sK1(sK0(sK28)),sK0(sK0(sK28)))) ).
cnf(u3144,negated_conjecture,
( in(X0,sK1(sK31),sK1(sK28))
| ~ '$ki_accessible'(sK12(sK27,sK31),X0) ) ).
cnf(u3152,negated_conjecture,
( in(X0,sK1(sK31),sK1(sK28))
| ~ '$ki_accessible'(sK0(sK31),X0) ) ).
cnf(u3163,negated_conjecture,
( in(X0,sK1(sK30),sK1(sK28))
| ~ '$ki_accessible'(sK12(sK27,sK30),X0) ) ).
cnf(u3171,negated_conjecture,
( in(X0,sK1(sK30),sK1(sK28))
| ~ '$ki_accessible'(sK0(sK30),X0) ) ).
cnf(u3182,negated_conjecture,
( in(X0,sK1(sK0(sK28)),sK1(sK28))
| ~ '$ki_accessible'(sK12(sK27,sK0(sK28)),X0) ) ).
cnf(u3190,negated_conjecture,
( in(X0,sK1(sK0(sK28)),sK1(sK28))
| ~ '$ki_accessible'(sK0(sK0(sK28)),X0) ) ).
cnf(u3206,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK1(sK26),sK1(sK0(sK24(sK26)))),set_intersection2(sK1(sK24(sK26)),sK1(sK0(sK24(sK26)))))
| ~ '$ki_accessible'(sK0(sK0(sK24(sK26))),X0) ) ).
cnf(u3216,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK1(sK26),sK1(sK0(sK0(sK26)))),set_intersection2(sK1(sK0(sK26)),sK1(sK0(sK0(sK26)))))
| ~ '$ki_accessible'(sK0(sK0(sK0(sK26))),X0) ) ).
cnf(u3225,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK1(sK0(sK24(sK26))),sK1(sK26)),set_intersection2(sK1(sK0(sK24(sK26))),sK1(sK24(sK26))))
| ~ '$ki_accessible'(sK0(sK0(sK24(sK26))),X0) ) ).
cnf(u3234,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK1(sK0(sK0(sK26))),sK1(sK26)),set_intersection2(sK1(sK0(sK0(sK26))),sK1(sK0(sK26))))
| ~ '$ki_accessible'(sK0(sK0(sK0(sK26))),X0) ) ).
cnf(u3243,negated_conjecture,
( qmltpeq(X0,sK27,sK1(sK0(sK24(sK26))))
| ~ '$ki_accessible'(sK0(sK0(sK24(sK26))),X0) ) ).
cnf(u3247,negated_conjecture,
'$ki_accessible'(sK0(sK0(sK24(sK26))),sK3(sK1(sK24(sK26)),sK1(sK0(sK24(sK26))),sK0(sK0(sK24(sK26))))) ).
cnf(u3256,negated_conjecture,
( qmltpeq(X0,sK27,sK1(sK0(sK0(sK26))))
| ~ '$ki_accessible'(sK0(sK0(sK0(sK26))),X0) ) ).
cnf(u3260,negated_conjecture,
'$ki_accessible'(sK0(sK0(sK0(sK26))),sK3(sK1(sK0(sK26)),sK1(sK0(sK0(sK26))),sK0(sK0(sK0(sK26))))) ).
cnf(u3269,negated_conjecture,
( disjoint(X0,sK1(sK24(sK26)),sK1(sK0(sK24(sK26))))
| ~ '$ki_accessible'(sK0(sK0(sK24(sK26))),X0) ) ).
cnf(u3283,negated_conjecture,
( disjoint(X0,sK1(sK0(sK26)),sK1(sK0(sK0(sK26))))
| ~ '$ki_accessible'(sK0(sK0(sK0(sK26))),X0) ) ).
cnf(u3296,negated_conjecture,
( disjoint(X0,sK1(sK0(sK24(sK26))),sK1(sK24(sK26)))
| ~ '$ki_accessible'(sK0(sK0(sK24(sK26))),X0) ) ).
cnf(u3309,negated_conjecture,
( disjoint(X0,sK1(sK0(sK0(sK26))),sK1(sK0(sK26)))
| ~ '$ki_accessible'(sK0(sK0(sK0(sK26))),X0) ) ).
cnf(u3322,negated_conjecture,
( in(X0,sK1(sK24(sK26)),sK1(sK0(sK24(sK26))))
| ~ '$ki_accessible'(sK0(sK0(sK24(sK26))),X0) ) ).
cnf(u3335,negated_conjecture,
( in(X0,sK1(sK0(sK26)),sK1(sK0(sK0(sK26))))
| ~ '$ki_accessible'(sK0(sK0(sK0(sK26))),X0) ) ).
cnf(u3348,negated_conjecture,
( in(X0,sK1(sK0(sK24(sK26))),sK1(sK24(sK26)))
| ~ '$ki_accessible'(sK0(sK0(sK24(sK26))),X0) ) ).
cnf(u3362,negated_conjecture,
( in(X0,sK1(sK0(sK0(sK26))),sK1(sK0(sK26)))
| ~ '$ki_accessible'(sK0(sK0(sK0(sK26))),X0) ) ).
cnf(u3538,negated_conjecture,
( qmltpeq(X0,sK1(sK26),sK1(sK31))
| ~ '$ki_accessible'(sK12(sK27,sK31),X0) ) ).
cnf(u3546,negated_conjecture,
( qmltpeq(X0,sK1(sK26),sK1(sK31))
| ~ '$ki_accessible'(sK0(sK31),X0) ) ).
cnf(u3557,negated_conjecture,
( qmltpeq(X0,sK1(sK26),sK1(sK30))
| ~ '$ki_accessible'(sK12(sK27,sK30),X0) ) ).
cnf(u3565,negated_conjecture,
( qmltpeq(X0,sK1(sK26),sK1(sK30))
| ~ '$ki_accessible'(sK0(sK30),X0) ) ).
cnf(u3579,negated_conjecture,
( qmltpeq(X0,sK1(sK26),sK1(sK0(sK28)))
| ~ '$ki_accessible'(sK12(sK27,sK0(sK28)),X0) ) ).
cnf(u3587,negated_conjecture,
( qmltpeq(X0,sK1(sK26),sK1(sK0(sK28)))
| ~ '$ki_accessible'(sK0(sK0(sK28)),X0) ) ).
cnf(u4262,axiom,
( qmltpeq(X0,sK1(sK24(sK0('$ki_local_world'))),sK1(sK0('$ki_local_world')))
| ~ '$ki_accessible'(sK0(sK24(sK0('$ki_local_world'))),X0) ) ).
cnf(u4271,axiom,
( qmltpeq(X0,sK1(sK0(sK0('$ki_local_world'))),sK1(sK0('$ki_local_world')))
| ~ '$ki_accessible'(sK0(sK0(sK0('$ki_local_world'))),X0) ) ).
cnf(u4280,axiom,
( disjoint(X0,sK1(sK24(sK0('$ki_local_world'))),sK1(sK0('$ki_local_world')))
| ~ '$ki_accessible'(sK0(sK24(sK0('$ki_local_world'))),X0) ) ).
cnf(u4291,axiom,
( disjoint(X0,sK1(sK0(sK0('$ki_local_world'))),sK1(sK0('$ki_local_world')))
| ~ '$ki_accessible'(sK0(sK0(sK0('$ki_local_world'))),X0) ) ).
cnf(u4304,axiom,
( disjoint(X0,singleton(sK1(sK0('$ki_local_world'))),sK1(sK24(sK0('$ki_local_world'))))
| ~ '$ki_accessible'(sK0(sK24(sK0('$ki_local_world'))),X0) ) ).
cnf(u4313,axiom,
( disjoint(X0,singleton(sK1(sK0('$ki_local_world'))),sK1(sK0(sK0('$ki_local_world'))))
| ~ '$ki_accessible'(sK0(sK0(sK0('$ki_local_world'))),X0) ) ).
cnf(u4322,axiom,
( qmltpeq(X0,singleton(sK1(sK0('$ki_local_world'))),singleton(sK1(sK24(sK0('$ki_local_world')))))
| ~ '$ki_accessible'(sK0(sK24(sK0('$ki_local_world'))),X0) ) ).
cnf(u4332,axiom,
( qmltpeq(X0,singleton(sK1(sK0('$ki_local_world'))),singleton(sK1(sK0(sK0('$ki_local_world')))))
| ~ '$ki_accessible'(sK0(sK0(sK0('$ki_local_world'))),X0) ) ).
cnf(u4341,axiom,
( ~ '$ki_accessible'(sK0(sK24(sK0('$ki_local_world'))),X0)
| '$ki_accessible'(X0,sK18(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X0)) ) ).
cnf(u4351,axiom,
( ~ '$ki_accessible'(sK0(sK0(sK0('$ki_local_world'))),X0)
| '$ki_accessible'(X0,sK18(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X0)) ) ).
cnf(u4362,axiom,
( empty(X0,sK1(sK24(sK0('$ki_local_world'))))
| ~ '$ki_accessible'(sK0(sK24(sK0('$ki_local_world'))),X0) ) ).
cnf(u4376,axiom,
( empty(X0,sK1(sK0(sK0('$ki_local_world'))))
| ~ '$ki_accessible'(sK0(sK0(sK0('$ki_local_world'))),X0) ) ).
cnf(u4394,axiom,
( qmltpeq(X0,set_intersection2(sK1(sK24(sK0('$ki_local_world'))),singleton(sK1(sK0('$ki_local_world')))),singleton(sK1(sK0('$ki_local_world'))))
| ~ '$ki_accessible'(sK0(sK24(sK0('$ki_local_world'))),X0) ) ).
cnf(u4404,axiom,
( qmltpeq(X0,set_intersection2(sK1(sK0(sK0('$ki_local_world'))),singleton(sK1(sK0('$ki_local_world')))),singleton(sK1(sK0('$ki_local_world'))))
| ~ '$ki_accessible'(sK0(sK0(sK0('$ki_local_world'))),X0) ) ).
cnf(u4460,axiom,
( qmltpeq(X0,set_intersection2(sK1(sK0('$ki_local_world')),sK1(sK0(sK24(sK0('$ki_local_world'))))),set_intersection2(sK1(sK24(sK0('$ki_local_world'))),sK1(sK0(sK24(sK0('$ki_local_world'))))))
| ~ '$ki_accessible'(sK0(sK0(sK24(sK0('$ki_local_world')))),X0) ) ).
cnf(u4469,axiom,
( qmltpeq(X0,set_intersection2(sK1(sK0('$ki_local_world')),sK1(sK0(sK0(sK0('$ki_local_world'))))),set_intersection2(sK1(sK0(sK0('$ki_local_world'))),sK1(sK0(sK0(sK0('$ki_local_world'))))))
| ~ '$ki_accessible'(sK0(sK0(sK0(sK0('$ki_local_world')))),X0) ) ).
cnf(u4479,axiom,
( qmltpeq(X0,set_intersection2(sK1(sK0(sK24(sK0('$ki_local_world')))),sK1(sK0('$ki_local_world'))),set_intersection2(sK1(sK0(sK24(sK0('$ki_local_world')))),sK1(sK24(sK0('$ki_local_world')))))
| ~ '$ki_accessible'(sK0(sK0(sK24(sK0('$ki_local_world')))),X0) ) ).
cnf(u4488,axiom,
( qmltpeq(X0,set_intersection2(sK1(sK0(sK0(sK0('$ki_local_world')))),sK1(sK0('$ki_local_world'))),set_intersection2(sK1(sK0(sK0(sK0('$ki_local_world')))),sK1(sK0(sK0('$ki_local_world')))))
| ~ '$ki_accessible'(sK0(sK0(sK0(sK0('$ki_local_world')))),X0) ) ).
cnf(u4521,axiom,
( qmltpeq(X0,sK1(sK0('$ki_local_world')),sK1(sK0(sK24(sK0('$ki_local_world')))))
| ~ '$ki_accessible'(sK0(sK0(sK24(sK0('$ki_local_world')))),X0) ) ).
cnf(u4534,axiom,
( qmltpeq(X0,sK1(sK0('$ki_local_world')),sK1(sK0(sK0(sK0('$ki_local_world')))))
| ~ '$ki_accessible'(sK0(sK0(sK0(sK0('$ki_local_world')))),X0) ) ).
cnf(u4547,axiom,
( disjoint(X0,sK1(sK24(sK0('$ki_local_world'))),sK1(sK0(sK24(sK0('$ki_local_world')))))
| ~ '$ki_accessible'(sK0(sK0(sK24(sK0('$ki_local_world')))),X0) ) ).
cnf(u4560,axiom,
( disjoint(X0,sK1(sK0(sK0('$ki_local_world'))),sK1(sK0(sK0(sK0('$ki_local_world')))))
| ~ '$ki_accessible'(sK0(sK0(sK0(sK0('$ki_local_world')))),X0) ) ).
cnf(u4573,axiom,
( disjoint(X0,sK1(sK0(sK24(sK0('$ki_local_world')))),sK1(sK24(sK0('$ki_local_world'))))
| ~ '$ki_accessible'(sK0(sK0(sK24(sK0('$ki_local_world')))),X0) ) ).
cnf(u4586,axiom,
( disjoint(X0,sK1(sK0(sK0(sK0('$ki_local_world')))),sK1(sK0(sK0('$ki_local_world'))))
| ~ '$ki_accessible'(sK0(sK0(sK0(sK0('$ki_local_world')))),X0) ) ).
cnf(u4600,axiom,
( in(X0,sK1(sK24(sK0('$ki_local_world'))),sK1(sK0(sK24(sK0('$ki_local_world')))))
| ~ '$ki_accessible'(sK0(sK0(sK24(sK0('$ki_local_world')))),X0) ) ).
cnf(u4613,axiom,
( in(X0,sK1(sK0(sK0('$ki_local_world'))),sK1(sK0(sK0(sK0('$ki_local_world')))))
| ~ '$ki_accessible'(sK0(sK0(sK0(sK0('$ki_local_world')))),X0) ) ).
cnf(u4626,axiom,
( in(X0,sK1(sK0(sK24(sK0('$ki_local_world')))),sK1(sK24(sK0('$ki_local_world'))))
| ~ '$ki_accessible'(sK0(sK0(sK24(sK0('$ki_local_world')))),X0) ) ).
cnf(u4639,axiom,
( in(X0,sK1(sK0(sK0(sK0('$ki_local_world')))),sK1(sK0(sK0('$ki_local_world'))))
| ~ '$ki_accessible'(sK0(sK0(sK0(sK0('$ki_local_world')))),X0) ) ).
cnf(u2728,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK0(sK26)),X0)
| '$ki_accessible'(X0,sK9(sK27,sK1(sK0(sK26)),X0))
| '$ki_accessible'(X0,sK8(sK27,sK1(sK0(sK0(sK26))),X0))
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK0(sK26)),sK1(sK0(sK0(sK26)))) ) ).
cnf(u4508,axiom,
( ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK17(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X1))
| ~ in(sK16(sK1(sK0('$ki_local_world')),X2,X1),X2,sK1(sK0('$ki_local_world')))
| ~ '$ki_accessible'(X1,X3)
| in(X3,X2,sK1(sK0(sK0('$ki_local_world')))) ) ).
cnf(u1765,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK26,X2)
| ~ disjoint(sK10(X2,X3,X0),X3,X2)
| '$ki_accessible'(X0,sK11(X2,X4,X0))
| ~ '$ki_accessible'(X5,X0)
| ~ '$ki_exists_in_world_$i'(X5,X3)
| ~ '$ki_accessible'(X6,X5)
| ~ '$ki_exists_in_world_$i'(X6,X4)
| ~ '$ki_accessible'(sK26,X6)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,X3,X4) ) ).
cnf(u2892,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK31,X0)
| ~ '$ki_accessible'(sK31,X1)
| '$ki_accessible'(X1,sK15(sK27,sK29,X1))
| '$ki_accessible'(X1,sK14(sK27,X0,X1))
| ~ '$ki_accessible'(X1,X2)
| in(X2,sK29,X0) ) ).
cnf(u3748,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK11(sK1(sK26),sK29,X1))
| '$ki_accessible'(X1,sK10(sK1(sK26),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,X2,sK29) ) ).
cnf(u4507,axiom,
( ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK17(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X1))
| ~ in(sK16(sK1(sK0('$ki_local_world')),X2,X1),X2,sK1(sK0('$ki_local_world')))
| ~ '$ki_accessible'(X1,X3)
| in(X3,X2,sK1(sK24(sK0('$ki_local_world')))) ) ).
cnf(u4416,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK24(sK0('$ki_local_world'))),X0)
| ~ '$ki_accessible'(sK0(sK24(sK0('$ki_local_world'))),X1)
| '$ki_accessible'(X1,sK5(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X1))
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,set_intersection2(sK1(sK0('$ki_local_world')),X0),set_intersection2(sK1(sK24(sK0('$ki_local_world'))),X0)) ) ).
cnf(u3930,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK0(sK26),X2)
| '$ki_accessible'(X0,sK11(sK1(sK26),X1,X0))
| ~ disjoint(sK10(sK1(sK26),X3,X0),X3,sK1(sK26))
| ~ '$ki_accessible'(X0,X4)
| disjoint(X4,X3,X1) ) ).
cnf(u3525,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK4(sK1(sK26),sK29,X1))
| '$ki_accessible'(X1,sK3(sK29,X2,X1))
| ~ '$ki_accessible'(X1,X3)
| qmltpeq(X3,sK1(sK26),X2) ) ).
cnf(u4238,negated_conjecture,
( ~ in(sK16(sK1(sK26),sK1(sK0(sK0(sK26))),X0),sK1(sK0(sK0(sK26))),sK1(sK26))
| '$ki_accessible'(X0,sK17(sK1(sK26),sK1(sK0(sK26)),X0))
| ~ '$ki_accessible'(sK0(sK0(sK26)),X0)
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK1(sK0(sK0(sK26))),sK1(sK0(sK26))) ) ).
cnf(u2891,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK15(sK27,sK1(sK28),X1))
| '$ki_accessible'(X1,sK14(sK27,X2,X1))
| ~ '$ki_accessible'(X1,X3)
| in(X3,sK1(sK28),X2) ) ).
cnf(u4194,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X2)
| '$ki_accessible'(X0,sK17(sK1(sK0('$ki_local_world')),X1,X0))
| '$ki_accessible'(X0,sK16(sK1(sK0('$ki_local_world')),X3,X0))
| ~ '$ki_accessible'(X0,X4)
| in(X4,X3,X1) ) ).
cnf(u4431,axiom,
( ~ '$ki_accessible'(sK0(sK24(sK0('$ki_local_world'))),X0)
| '$ki_accessible'(X0,sK6(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(sK1(sK0(sK24(sK0('$ki_local_world')))),sK1(sK0('$ki_local_world'))),set_intersection2(sK1(sK0(sK24(sK0('$ki_local_world')))),sK1(sK24(sK0('$ki_local_world'))))) ) ).
cnf(u3937,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK31,X0)
| ~ '$ki_accessible'(sK31,X1)
| '$ki_accessible'(X1,sK17(sK1(sK26),sK1(sK28),X1))
| '$ki_accessible'(X1,sK16(sK1(sK26),X0,X1))
| ~ '$ki_accessible'(X1,X2)
| in(X2,X0,sK1(sK28)) ) ).
cnf(u3839,negated_conjecture,
( ~ '$ki_accessible'(sK31,X0)
| '$ki_accessible'(X0,sK15(sK1(sK26),sK29,X0))
| '$ki_accessible'(X0,sK14(sK1(sK26),sK1(sK31),X0))
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK29,sK1(sK31)) ) ).
cnf(u4216,negated_conjecture,
( ~ qmltpeq(sK17(sK1(sK26),sK1(sK0(sK26)),X1),sK1(sK26),sK1(sK0(sK26)))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK16(sK1(sK26),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| in(X3,X2,sK1(sK0(sK26))) ) ).
cnf(u4036,negated_conjecture,
( ~ in(sK16(sK27,sK1(sK0(sK0(sK26))),X0),sK1(sK0(sK0(sK26))),sK27)
| '$ki_accessible'(X0,sK17(sK27,sK1(sK0(sK26)),X0))
| ~ '$ki_accessible'(sK0(sK0(sK26)),X0)
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK1(sK0(sK0(sK26))),sK1(sK0(sK26))) ) ).
cnf(u3758,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK24(sK26),X2)
| ~ qmltpeq(sK4(sK1(sK26),X0,X1),sK1(sK26),X0)
| '$ki_accessible'(X1,sK3(X0,X3,X1))
| ~ '$ki_accessible'(X1,X4)
| qmltpeq(X4,sK1(sK26),X3) ) ).
cnf(u4225,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK24(sK26)),X0)
| ~ '$ki_accessible'(sK0(sK24(sK26)),X1)
| '$ki_accessible'(X1,sK15(sK1(sK26),sK1(sK24(sK26)),X1))
| ~ in(sK14(sK1(sK26),X0,X1),sK1(sK26),X0)
| ~ '$ki_accessible'(X1,X2)
| in(X2,sK1(sK24(sK26)),X0) ) ).
cnf(u4118,negated_conjecture,
( ~ in(sK16(sK1(sK26),sK1(sK31),X0),sK1(sK31),sK1(sK26))
| '$ki_accessible'(X0,sK17(sK1(sK26),sK29,X0))
| ~ '$ki_accessible'(sK31,X0)
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK1(sK31),sK29) ) ).
cnf(u3402,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK24(sK26),X2)
| ~ qmltpeq(sK9(sK27,X0,X1),sK27,X0)
| '$ki_accessible'(X1,sK8(sK27,X3,X1))
| ~ '$ki_accessible'(X1,X4)
| disjoint(X4,X0,X3) ) ).
cnf(u4255,axiom,
( ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X0)
| '$ki_accessible'(X0,sK25(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X0))
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK24(sK0('$ki_local_world'))),sK1(sK0('$ki_local_world'))) ) ).
cnf(u4140,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK0('$ki_local_world')),X3)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK5(sK1(sK0('$ki_local_world')),X3,X1))
| ~ '$ki_accessible'(X1,X4)
| qmltpeq(X4,set_intersection2(sK1(sK0('$ki_local_world')),X2),set_intersection2(X3,X2)) ) ).
cnf(u4596,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK0(sK0('$ki_local_world'))),X0)
| ~ '$ki_accessible'(sK0(sK0(sK0('$ki_local_world'))),X1)
| '$ki_accessible'(X1,sK4(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X1))
| ~ qmltpeq(sK3(sK1(sK0(sK0('$ki_local_world'))),X0,X1),sK1(sK0(sK0('$ki_local_world'))),X0)
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,sK1(sK0('$ki_local_world')),X0) ) ).
cnf(u3424,negated_conjecture,
( ~ disjoint(sK8(sK27,sK1(sK31),X0),sK27,sK1(sK31))
| '$ki_accessible'(X0,sK9(sK27,sK1(sK28),X0))
| ~ '$ki_accessible'(sK31,X0)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK28),sK1(sK31)) ) ).
cnf(u3845,negated_conjecture,
( ~ '$ki_accessible'(sK30,X0)
| '$ki_accessible'(X0,sK15(sK1(sK26),sK29,X0))
| '$ki_accessible'(X0,sK14(sK1(sK26),sK1(sK30),X0))
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK29,sK1(sK30)) ) ).
cnf(u4154,axiom,
( ~ '$ki_exists_in_world_$i'(sK24(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X2)
| '$ki_accessible'(X0,sK4(sK1(sK0('$ki_local_world')),X1,X0))
| '$ki_accessible'(X0,sK3(X1,X3,X0))
| ~ '$ki_accessible'(X0,X4)
| qmltpeq(X4,sK1(sK0('$ki_local_world')),X3) ) ).
cnf(u4035,negated_conjecture,
( ~ in(sK16(sK27,sK1(sK0(sK24(sK26))),X0),sK1(sK0(sK24(sK26))),sK27)
| '$ki_accessible'(X0,sK17(sK27,sK1(sK24(sK26)),X0))
| ~ '$ki_accessible'(sK0(sK24(sK26)),X0)
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK1(sK0(sK24(sK26))),sK1(sK24(sK26))) ) ).
cnf(u2730,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK24(sK26),X2)
| '$ki_accessible'(X0,sK11(sK27,X1,X0))
| '$ki_accessible'(X0,sK10(sK27,X3,X0))
| ~ '$ki_accessible'(X0,X4)
| disjoint(X4,X3,X1) ) ).
cnf(u3409,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK24(sK26),X2)
| '$ki_accessible'(X0,sK9(sK27,X1,X0))
| ~ disjoint(sK8(sK27,X3,X0),sK27,X3)
| ~ '$ki_accessible'(X0,X4)
| disjoint(X4,X1,X3) ) ).
cnf(u1808,negated_conjecture,
( ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_accessible'(sK20(sK27,sK1(sK24(sK26)),X0),X1)
| in(X1,sK27,sK1(sK24(sK26)))
| ~ '$ki_accessible'(X0,X2)
| disjoint(X2,singleton(sK27),sK1(sK24(sK26))) ) ).
cnf(u4504,axiom,
( ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK15(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X1))
| ~ in(sK14(sK1(sK0('$ki_local_world')),X2,X1),sK1(sK0('$ki_local_world')),X2)
| ~ '$ki_accessible'(X1,X3)
| in(X3,sK1(sK0(sK0('$ki_local_world'))),X2) ) ).
cnf(u3439,axiom,
( ~ '$ki_accessible'(sK0('$ki_local_world'),X4)
| ~ qmltpeq(sK11(sK1(sK0('$ki_local_world')),X2,X0),sK1(sK0('$ki_local_world')),X2)
| ~ '$ki_accessible'(X3,X0)
| ~ '$ki_exists_in_world_$i'(X3,X1)
| ~ '$ki_accessible'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X4,X2)
| '$ki_accessible'(X0,sK10(sK1(sK0('$ki_local_world')),X1,X0))
| ~ '$ki_accessible'(X0,X5)
| disjoint(X5,X1,X2) ) ).
cnf(u2294,negated_conjecture,
( ~ '$ki_accessible'(sK26,X4)
| ~ qmltpeq(sK9(sK1(sK26),X2,X0),sK1(sK26),X2)
| ~ '$ki_accessible'(X3,X0)
| ~ '$ki_exists_in_world_$i'(X3,X1)
| ~ '$ki_accessible'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X4,X2)
| '$ki_accessible'(X0,sK8(sK1(sK26),X1,X0))
| ~ '$ki_accessible'(X0,X5)
| disjoint(X5,X2,X1) ) ).
cnf(u4046,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK15(sK1(sK26),sK1(sK0(sK26)),X1))
| '$ki_accessible'(X1,sK14(sK1(sK26),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| in(X3,sK1(sK0(sK26)),X2) ) ).
cnf(u1823,axiom,
( ~ '$ki_exists_in_world_$i'(sK24(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X2)
| ~ qmltpeq(sK4(sK1(sK0('$ki_local_world')),X0,X1),sK1(sK0('$ki_local_world')),X0)
| ~ qmltpeq(sK3(X0,X3,X1),X0,X3)
| ~ '$ki_accessible'(X1,X4)
| qmltpeq(X4,sK1(sK0('$ki_local_world')),X3) ) ).
cnf(u2188,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK30,X0)
| ~ '$ki_accessible'(sK30,X1)
| '$ki_accessible'(X1,sK5(sK1(sK26),sK29,X1))
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,set_intersection2(sK1(sK26),X0),set_intersection2(sK29,X0)) ) ).
cnf(u2077,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK30,X0)
| ~ '$ki_accessible'(sK30,X1)
| '$ki_accessible'(X1,sK6(sK27,sK1(sK28),X1))
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,set_intersection2(X0,sK27),set_intersection2(X0,sK1(sK28))) ) ).
cnf(u1767,axiom,
( ~ '$ki_exists_in_world_$i'(sK24(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X0)
| ~ disjoint(sK25(sK1(sK0('$ki_local_world')),X1,X0),sK1(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(X0,X2)
| disjoint(X2,X1,sK1(sK0('$ki_local_world'))) ) ).
cnf(u4428,axiom,
( ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK17(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X1))
| '$ki_accessible'(X1,sK16(sK1(sK0('$ki_local_world')),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| in(X3,X2,sK1(sK0(sK0('$ki_local_world')))) ) ).
cnf(u1103,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK26),X0)
| '$ki_accessible'(X0,sK7(sK1(sK26),sK1(sK0(sK26)),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,singleton(sK1(sK26)),singleton(sK1(sK0(sK26)))) ) ).
cnf(u2410,negated_conjecture,
( ~ '$ki_accessible'(sK30,X0)
| '$ki_accessible'(X0,sK6(sK1(sK26),sK1(sK28),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(sK1(sK30),sK1(sK26)),set_intersection2(sK1(sK30),sK1(sK28))) ) ).
cnf(u3749,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK11(sK1(sK26),sK1(sK28),X1))
| '$ki_accessible'(X1,sK10(sK1(sK26),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,X2,sK1(sK28)) ) ).
cnf(u4053,negated_conjecture,
( ~ qmltpeq(sK9(sK1(sK26),sK29,X1),sK1(sK26),sK29)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK8(sK1(sK26),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,sK29,X2) ) ).
cnf(u4442,axiom,
( ~ qmltpeq(sK4(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X1),sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK3(sK1(sK24(sK0('$ki_local_world'))),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| qmltpeq(X3,sK1(sK0('$ki_local_world')),X2) ) ).
cnf(u1818,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X0)
| ~ '$ki_accessible'(sK0(sK26),X1)
| ~ qmltpeq(sK13(sK1(sK26),X0,X1),sK1(sK26),X0)
| '$ki_accessible'(X1,sK12(sK1(sK26),X1))
| ~ '$ki_accessible'(X1,X2)
| empty(X2,X0) ) ).
cnf(u4427,axiom,
( ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK17(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X1))
| '$ki_accessible'(X1,sK16(sK1(sK0('$ki_local_world')),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| in(X3,X2,sK1(sK24(sK0('$ki_local_world')))) ) ).
cnf(u2016,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK28),X0)
| ~ '$ki_accessible'(sK0(sK28),X1)
| '$ki_accessible'(X1,sK6(sK27,sK29,X1))
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,set_intersection2(X0,sK27),set_intersection2(X0,sK29)) ) ).
cnf(u1352,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK24(sK26),X2)
| ~ qmltpeq(sK15(sK27,X0,X1),sK27,X0)
| ~ in(sK14(sK27,X3,X1),sK27,X3)
| ~ '$ki_accessible'(X1,X4)
| in(X4,X0,X3) ) ).
cnf(u816,negated_conjecture,
( ~ '$ki_accessible'(sK26,X2)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X0)
| ~ in(sK21(sK1(sK26),X0,X1),sK1(sK26),X0)
| ~ '$ki_accessible'(X1,X3)
| qmltpeq(X3,set_intersection2(X0,singleton(sK1(sK26))),singleton(sK1(sK26))) ) ).
cnf(u1272,negated_conjecture,
'$ki_accessible'(sK0(sK31),sK18(sK1(sK26),sK29,sK0(sK31))) ).
cnf(u1033,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X1)
| ~ '$ki_accessible'(sK28,X0)
| '$ki_accessible'(X0,sK7(sK1(sK26),X1,X0))
| ~ '$ki_accessible'(X0,X2)
| qmltpeq(X2,singleton(sK1(sK26)),singleton(X1)) ) ).
cnf(u723,negated_conjecture,
( ~ in(sK18(sK1(sK26),sK1(sK24(sK26)),X1),sK1(sK24(sK26)),sK1(sK26))
| '$ki_accessible'(X0,sK19(sK1(sK26),sK1(sK24(sK26)),X0))
| ~ '$ki_accessible'(X0,X1)
| ~ '$ki_accessible'(sK24(sK26),X0) ) ).
cnf(u4449,axiom,
( ~ '$ki_accessible'(sK0(sK0(sK0('$ki_local_world'))),X0)
| '$ki_accessible'(X0,sK9(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X0))
| '$ki_accessible'(X0,sK8(sK1(sK0('$ki_local_world')),sK1(sK0(sK0(sK0('$ki_local_world')))),X0))
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK0(sK0('$ki_local_world'))),sK1(sK0(sK0(sK0('$ki_local_world'))))) ) ).
cnf(u2319,negated_conjecture,
( ~ '$ki_accessible'(sK26,X4)
| '$ki_accessible'(X1,sK9(sK27,X2,X1))
| ~ '$ki_accessible'(X3,X1)
| ~ '$ki_exists_in_world_$i'(X3,X0)
| ~ '$ki_accessible'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X4,X2)
| ~ disjoint(sK8(sK27,X0,X1),sK27,X0)
| ~ '$ki_accessible'(X1,X5)
| disjoint(X5,X2,X0) ) ).
cnf(u3430,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK24(sK26)),X0)
| ~ '$ki_accessible'(sK0(sK24(sK26)),X1)
| '$ki_accessible'(X1,sK9(sK27,sK1(sK24(sK26)),X1))
| ~ disjoint(sK8(sK27,X0,X1),sK27,X0)
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,sK1(sK24(sK26)),X0) ) ).
cnf(u4286,axiom,
( ~ '$ki_exists_in_world_$i'(sK24(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X2)
| '$ki_accessible'(X0,sK17(sK1(sK0('$ki_local_world')),X1,X0))
| ~ in(sK16(sK1(sK0('$ki_local_world')),X3,X0),X3,sK1(sK0('$ki_local_world')))
| ~ '$ki_accessible'(X0,X4)
| in(X4,X3,X1) ) ).
cnf(u400,negated_conjecture,
( ~ disjoint(sK25(sK1(sK26),sK1(sK0(sK26)),X0),sK1(sK26),sK1(sK0(sK26)))
| ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK0(sK26)),sK1(sK26)) ) ).
cnf(u1825,axiom,
( ~ qmltpeq(sK5(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X2),sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))))
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ '$ki_accessible'(X2,X3)
| qmltpeq(X3,set_intersection2(sK1(sK0('$ki_local_world')),X1),set_intersection2(sK1(sK24(sK0('$ki_local_world'))),X1)) ) ).
cnf(u1769,axiom,
( ~ qmltpeq(sK2(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X0),sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))))
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,sK1(sK24(sK0('$ki_local_world'))),sK1(sK0('$ki_local_world'))) ) ).
cnf(u3452,axiom,
( ~ '$ki_accessible'(sK0('$ki_local_world'),X4)
| '$ki_accessible'(X1,sK11(sK1(sK0('$ki_local_world')),X2,X1))
| ~ '$ki_accessible'(X3,X1)
| ~ '$ki_exists_in_world_$i'(X3,X0)
| ~ '$ki_accessible'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X4,X2)
| ~ disjoint(sK10(sK1(sK0('$ki_local_world')),X0,X1),X0,sK1(sK0('$ki_local_world')))
| ~ '$ki_accessible'(X1,X5)
| disjoint(X5,X0,X2) ) ).
cnf(u4038,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK4(sK1(sK26),sK1(sK0(sK26)),X1))
| '$ki_accessible'(X1,sK3(sK1(sK0(sK26)),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| qmltpeq(X3,sK1(sK26),X2) ) ).
cnf(u831,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X1)
| ~ '$ki_accessible'(sK28,X0)
| '$ki_accessible'(X0,sK20(sK1(sK26),X1,X0))
| ~ '$ki_accessible'(X0,X2)
| disjoint(X2,singleton(sK1(sK26)),X1) ) ).
cnf(u532,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| '$ki_accessible'(X0,sK25(sK27,sK1(sK28),X0))
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK28),sK27) ) ).
cnf(u3437,negated_conjecture,
( ~ qmltpeq(sK11(sK27,sK29,X1),sK27,sK29)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK10(sK27,X2,X1))
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,X2,sK29) ) ).
cnf(u1836,axiom,
( ~ qmltpeq(sK4(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X1),sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X0,X1)
| ~ qmltpeq(sK3(sK1(sK0(sK0('$ki_local_world'))),X2,X1),sK1(sK0(sK0('$ki_local_world'))),X2)
| ~ '$ki_accessible'(X1,X3)
| qmltpeq(X3,sK1(sK0('$ki_local_world')),X2) ) ).
cnf(u1210,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK28,X2)
| ~ qmltpeq(sK4(sK27,X0,X1),sK27,X0)
| ~ qmltpeq(sK3(X0,X3,X1),X0,X3)
| ~ '$ki_accessible'(X1,X4)
| qmltpeq(X4,sK27,X3) ) ).
cnf(u4045,negated_conjecture,
( ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK15(sK1(sK26),sK1(sK24(sK26)),X1))
| '$ki_accessible'(X1,sK14(sK1(sK26),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| in(X3,sK1(sK24(sK26)),X2) ) ).
cnf(u1312,axiom,
( ~ '$ki_accessible'(sK0('$ki_local_world'),X2)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X0)
| ~ in(sK19(sK1(sK0('$ki_local_world')),X0,X1),sK1(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X1,X3)
| '$ki_accessible'(X3,sK18(sK1(sK0('$ki_local_world')),X0,X3)) ) ).
cnf(u3451,negated_conjecture,
( ~ disjoint(sK10(sK27,sK1(sK30),X0),sK1(sK30),sK27)
| '$ki_accessible'(X0,sK11(sK27,sK29,X0))
| ~ '$ki_accessible'(sK30,X0)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK30),sK29) ) ).
cnf(u1768,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X0)
| ~ disjoint(sK25(sK1(sK0('$ki_local_world')),X1,X0),sK1(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(X0,X2)
| disjoint(X2,X1,sK1(sK0('$ki_local_world'))) ) ).
cnf(u826,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X1)
| ~ '$ki_accessible'(sK28,X0)
| ~ in(sK21(sK27,X1,X0),sK27,X1)
| ~ '$ki_accessible'(X0,X2)
| qmltpeq(X2,set_intersection2(X1,singleton(sK27)),singleton(sK27)) ) ).
cnf(u1104,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X3)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| ~ qmltpeq(sK5(sK1(sK26),X3,X1),sK1(sK26),X3)
| ~ '$ki_accessible'(X1,X4)
| qmltpeq(X4,set_intersection2(sK1(sK26),X2),set_intersection2(X3,X2)) ) ).
cnf(u896,negated_conjecture,
( ~ '$ki_accessible'(sK24(sK26),X0)
| '$ki_accessible'(X0,sK20(sK1(sK26),sK1(sK24(sK26)),X0))
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,singleton(sK1(sK26)),sK1(sK24(sK26))) ) ).
cnf(u1241,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| '$ki_accessible'(X0,sK19(sK1(sK26),sK29,X0))
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK18(sK1(sK26),sK29,X1)) ) ).
cnf(u1835,axiom,
( ~ qmltpeq(sK4(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X1),sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X0,X1)
| ~ qmltpeq(sK3(sK1(sK24(sK0('$ki_local_world'))),X2,X1),sK1(sK24(sK0('$ki_local_world'))),X2)
| ~ '$ki_accessible'(X1,X3)
| qmltpeq(X3,sK1(sK0('$ki_local_world')),X2) ) ).
cnf(u152,axiom,
( ~ '$ki_accessible'('$ki_local_world',X0)
| ~ '$ki_accessible'(X6,X7)
| ~ qmltpeq(sK3(X3,X5,X6),X3,X5)
| '$ki_accessible'(X6,sK4(X1,X3,X6))
| ~ '$ki_accessible'(X4,X6)
| ~ '$ki_exists_in_world_$i'(X4,X5)
| ~ '$ki_accessible'(X2,X4)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| qmltpeq(X7,X1,X5) ) ).
cnf(u1863,axiom,
( ~ qmltpeq(sK15(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X1),sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X0,X1)
| ~ in(sK14(sK1(sK0('$ki_local_world')),X2,X1),sK1(sK0('$ki_local_world')),X2)
| ~ '$ki_accessible'(X1,X3)
| in(X3,sK1(sK0(sK0('$ki_local_world'))),X2) ) ).
cnf(u4040,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK9(sK1(sK26),sK1(sK0(sK26)),X1))
| '$ki_accessible'(X1,sK8(sK1(sK26),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,sK1(sK0(sK26)),X2) ) ).
cnf(u345,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK26,X2)
| '$ki_accessible'(X0,sK20(X2,X3,X0))
| ~ '$ki_accessible'(X4,X0)
| ~ '$ki_exists_in_world_$i'(X4,X3)
| ~ '$ki_accessible'(sK26,X4)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,singleton(X2),X3) ) ).
cnf(u3532,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK28),X0)
| ~ '$ki_accessible'(sK0(sK28),X1)
| '$ki_accessible'(X1,sK4(sK1(sK26),sK29,X1))
| '$ki_accessible'(X1,sK3(sK29,X0,X1))
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,sK1(sK26),X0) ) ).
cnf(u182,axiom,
( ~ '$ki_accessible'('$ki_local_world',X0)
| ~ '$ki_accessible'(X4,X5)
| '$ki_accessible'(X4,sK19(X1,X3,X4))
| ~ '$ki_accessible'(X2,X4)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ in(sK18(X1,X3,X5),X3,X1) ) ).
cnf(u284,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK1(sK26),sK1(sK0(sK26))),set_intersection2(sK1(sK0(sK26)),sK1(sK26)))
| ~ '$ki_accessible'(sK0(sK26),X0) ) ).
cnf(u375,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X1)
| ~ '$ki_accessible'(sK24(sK26),X0)
| ~ qmltpeq(sK2(sK1(sK26),X1,X0),sK1(sK26),X1)
| ~ '$ki_accessible'(X0,X2)
| qmltpeq(X2,X1,sK1(sK26)) ) ).
cnf(u740,axiom,
( ~ '$ki_exists_in_world_$i'(sK0('$ki_local_world'),X2)
| ~ in(sK16(X2,X3,X0),X3,X2)
| ~ qmltpeq(sK17(X2,X4,X0),X2,X4)
| ~ '$ki_accessible'(X5,X0)
| ~ '$ki_exists_in_world_$i'(X5,X3)
| ~ '$ki_accessible'(X6,X5)
| ~ '$ki_exists_in_world_$i'(X6,X4)
| ~ '$ki_accessible'(sK0('$ki_local_world'),X6)
| ~ '$ki_accessible'(X0,X1)
| in(X1,X3,X4) ) ).
cnf(u1846,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X2)
| ~ qmltpeq(sK11(sK1(sK0('$ki_local_world')),X0,X1),sK1(sK0('$ki_local_world')),X0)
| ~ disjoint(sK10(sK1(sK0('$ki_local_world')),X3,X1),X3,sK1(sK0('$ki_local_world')))
| ~ '$ki_accessible'(X1,X4)
| disjoint(X4,X3,X0) ) ).
cnf(u3751,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK30,X0)
| ~ '$ki_accessible'(sK30,X1)
| '$ki_accessible'(X1,sK11(sK1(sK26),sK29,X1))
| '$ki_accessible'(X1,sK10(sK1(sK26),X0,X1))
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,X0,sK29) ) ).
cnf(u1858,axiom,
( ~ qmltpeq(sK11(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X1),sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X0,X1)
| ~ disjoint(sK10(sK1(sK0('$ki_local_world')),X2,X1),X2,sK1(sK0('$ki_local_world')))
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,X2,sK1(sK24(sK0('$ki_local_world')))) ) ).
cnf(u4055,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK9(sK1(sK26),sK29,X1))
| ~ disjoint(sK8(sK1(sK26),X2,X1),sK1(sK26),X2)
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,sK29,X2) ) ).
cnf(u298,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK26,X2)
| ~ qmltpeq(sK7(X2,X3,X0),X2,X3)
| ~ '$ki_accessible'(X4,X0)
| ~ '$ki_exists_in_world_$i'(X4,X3)
| ~ '$ki_accessible'(sK26,X4)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,singleton(X2),singleton(X3)) ) ).
cnf(u269,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X0)
| ~ '$ki_accessible'(sK28,X1)
| qmltpeq(X1,set_intersection2(sK27,X0),set_intersection2(X0,sK27)) ) ).
cnf(u1778,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X0)
| ~ in(sK19(sK1(sK0('$ki_local_world')),X1,X0),sK1(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(X0,X2)
| '$ki_accessible'(X2,sK18(sK1(sK0('$ki_local_world')),X1,X2)) ) ).
cnf(u213,axiom,
( ~ '$ki_exists_in_world_$i'(sK0('$ki_local_world'),X3)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK0('$ki_local_world'),X0)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(X3,X3),X3) ) ).
cnf(u3531,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK30,X0)
| ~ '$ki_accessible'(sK30,X1)
| '$ki_accessible'(X1,sK4(sK1(sK26),sK29,X1))
| '$ki_accessible'(X1,sK3(sK29,X0,X1))
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,sK1(sK26),X0) ) ).
cnf(u1172,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK26,X2)
| '$ki_accessible'(X0,sK8(X2,X3,X0))
| '$ki_accessible'(X0,sK9(X2,X4,X0))
| ~ '$ki_accessible'(X5,X0)
| ~ '$ki_exists_in_world_$i'(X5,X3)
| ~ '$ki_accessible'(X6,X5)
| ~ '$ki_exists_in_world_$i'(X6,X4)
| ~ '$ki_accessible'(sK26,X6)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,X4,X3) ) ).
cnf(u1005,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK26),X0)
| '$ki_accessible'(X0,sK7(sK27,sK1(sK0(sK26)),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,singleton(sK27),singleton(sK1(sK0(sK26)))) ) ).
cnf(u283,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK1(sK26),sK1(sK24(sK26))),set_intersection2(sK1(sK24(sK26)),sK1(sK26)))
| ~ '$ki_accessible'(sK24(sK26),X0) ) ).
cnf(u3442,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK28,X2)
| '$ki_accessible'(X0,sK11(sK27,X1,X0))
| ~ disjoint(sK10(sK27,X3,X0),X3,sK27)
| ~ '$ki_accessible'(X0,X4)
| disjoint(X4,X3,X1) ) ).
cnf(u1853,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X2)
| ~ qmltpeq(sK17(sK1(sK0('$ki_local_world')),X0,X1),sK1(sK0('$ki_local_world')),X0)
| ~ in(sK16(sK1(sK0('$ki_local_world')),X3,X1),X3,sK1(sK0('$ki_local_world')))
| ~ '$ki_accessible'(X1,X4)
| in(X4,X3,X0) ) ).
cnf(u1865,axiom,
( ~ qmltpeq(sK17(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X1),sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X0,X1)
| ~ in(sK16(sK1(sK0('$ki_local_world')),X2,X1),X2,sK1(sK0('$ki_local_world')))
| ~ '$ki_accessible'(X1,X3)
| in(X3,X2,sK1(sK0(sK0('$ki_local_world')))) ) ).
cnf(u305,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X1)
| ~ '$ki_accessible'(sK24(sK26),X0)
| ~ disjoint(sK25(sK27,X1,X0),sK27,X1)
| ~ '$ki_accessible'(X0,X2)
| disjoint(X2,X1,sK27) ) ).
cnf(u3750,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK31,X0)
| ~ '$ki_accessible'(sK31,X1)
| '$ki_accessible'(X1,sK11(sK1(sK26),sK29,X1))
| '$ki_accessible'(X1,sK10(sK1(sK26),X0,X1))
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,X0,sK29) ) ).
cnf(u609,negated_conjecture,
( ~ qmltpeq(sK7(sK1(sK26),sK29,X0),sK1(sK26),sK29)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,singleton(sK1(sK26)),singleton(sK29)) ) ).
cnf(u1535,negated_conjecture,
( ~ empty(sK12(sK1(sK26),X0),sK1(sK26))
| '$ki_accessible'(X0,sK13(sK1(sK26),X1,X0))
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X1)
| ~ '$ki_accessible'(sK26,X2)
| ~ '$ki_accessible'(X0,X3)
| empty(X3,X1) ) ).
cnf(u3449,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK28),X0)
| ~ '$ki_accessible'(sK0(sK28),X1)
| '$ki_accessible'(X1,sK11(sK27,sK29,X1))
| ~ disjoint(sK10(sK27,X0,X1),X0,sK27)
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,X0,sK29) ) ).
cnf(u3048,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK17(sK27,sK29,X1))
| '$ki_accessible'(X1,sK16(sK27,X2,X1))
| ~ '$ki_accessible'(X1,X3)
| in(X3,X2,sK29) ) ).
cnf(u1318,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK28,X2)
| ~ qmltpeq(sK11(sK27,X0,X1),sK27,X0)
| ~ disjoint(sK10(sK27,X3,X1),X3,sK27)
| ~ '$ki_accessible'(X1,X4)
| disjoint(X4,X3,X0) ) ).
cnf(u700,negated_conjecture,
( ~ in(sK18(sK1(sK26),sK1(sK28),X1),sK1(sK28),sK1(sK26))
| '$ki_accessible'(X0,sK19(sK1(sK26),sK1(sK28),X0))
| ~ '$ki_accessible'(X0,X1)
| ~ '$ki_accessible'(sK28,X0) ) ).
cnf(u151,axiom,
( ~ '$ki_accessible'('$ki_local_world',X0)
| ~ '$ki_accessible'(X6,X7)
| '$ki_accessible'(X6,sK3(X3,X5,X6))
| ~ qmltpeq(sK4(X1,X3,X6),X1,X3)
| ~ '$ki_accessible'(X4,X6)
| ~ '$ki_exists_in_world_$i'(X4,X5)
| ~ '$ki_accessible'(X2,X4)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| qmltpeq(X7,X1,X5) ) ).
cnf(u3753,negated_conjecture,
( ~ '$ki_accessible'(sK31,X0)
| '$ki_accessible'(X0,sK11(sK1(sK26),sK29,X0))
| '$ki_accessible'(X0,sK10(sK1(sK26),sK1(sK31),X0))
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK31),sK29) ) ).
cnf(u492,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X1)
| ~ '$ki_accessible'(sK24(sK26),X0)
| ~ in(sK19(sK27,X1,X0),sK27,X1)
| ~ '$ki_accessible'(X0,X2)
| '$ki_accessible'(X2,sK18(sK27,X1,X2)) ) ).
cnf(u455,negated_conjecture,
( ~ qmltpeq(sK7(sK27,sK1(sK24(sK26)),X0),sK27,sK1(sK24(sK26)))
| ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,singleton(sK27),singleton(sK1(sK24(sK26)))) ) ).
cnf(u1876,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ '$ki_accessible'(X0,X2)
| '$ki_accessible'(X2,sK5(sK27,sK1(sK28),X2))
| ~ '$ki_accessible'(X2,X3)
| qmltpeq(X3,set_intersection2(sK27,X1),set_intersection2(sK1(sK28),X1)) ) ).
cnf(u173,axiom,
( ~ '$ki_accessible'('$ki_local_world',X0)
| ~ '$ki_accessible'(X6,X7)
| '$ki_accessible'(X6,sK14(X1,X5,X6))
| ~ qmltpeq(sK15(X1,X3,X6),X1,X3)
| ~ '$ki_accessible'(X4,X6)
| ~ '$ki_exists_in_world_$i'(X4,X5)
| ~ '$ki_accessible'(X2,X4)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| in(X7,X3,X5) ) ).
cnf(u1132,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X1)
| ~ '$ki_accessible'(sK0(sK26),X0)
| '$ki_accessible'(X0,sK19(sK27,X1,X0))
| ~ '$ki_accessible'(X0,X2)
| '$ki_accessible'(X2,sK18(sK27,X1,X2)) ) ).
cnf(u866,negated_conjecture,
( ~ '$ki_accessible'(sK26,X4)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(X4,X2)
| ~ '$ki_exists_in_world_$i'(X4,X0)
| ~ qmltpeq(sK5(sK1(sK26),X0,X1),sK1(sK26),X0)
| ~ '$ki_accessible'(X1,X5)
| qmltpeq(X5,set_intersection2(sK1(sK26),X3),set_intersection2(X0,X3)) ) ).
cnf(u837,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| '$ki_accessible'(X0,sK20(sK1(sK26),sK1(sK28),X0))
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,singleton(sK1(sK26)),sK1(sK28)) ) ).
cnf(u187,axiom,
( ~ '$ki_accessible'('$ki_local_world',X0)
| ~ '$ki_accessible'(X4,X5)
| in(X7,X1,X3)
| ~ '$ki_accessible'(sK20(X1,X3,X4),X7)
| ~ '$ki_accessible'(X2,X4)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| disjoint(X5,singleton(X1),X3) ) ).
cnf(u3752,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK28),X0)
| ~ '$ki_accessible'(sK0(sK28),X1)
| '$ki_accessible'(X1,sK11(sK1(sK26),sK29,X1))
| '$ki_accessible'(X1,sK10(sK1(sK26),X0,X1))
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,X0,sK29) ) ).
cnf(u491,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X1)
| ~ '$ki_accessible'(sK28,X0)
| ~ in(sK19(sK27,X1,X0),sK27,X1)
| ~ '$ki_accessible'(X0,X2)
| '$ki_accessible'(X2,sK18(sK27,X1,X2)) ) ).
cnf(u3522,negated_conjecture,
( ~ in(sK16(sK27,sK1(sK31),X0),sK1(sK31),sK27)
| '$ki_accessible'(X0,sK17(sK27,sK1(sK28),X0))
| ~ '$ki_accessible'(sK31,X0)
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK1(sK31),sK1(sK28)) ) ).
cnf(u1875,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ '$ki_accessible'(X0,X2)
| '$ki_accessible'(X2,sK5(sK27,sK29,X2))
| ~ '$ki_accessible'(X2,X3)
| qmltpeq(X3,set_intersection2(sK27,X1),set_intersection2(sK29,X1)) ) ).
cnf(u192,axiom,
'$ki_exists_in_world_$i'('$ki_local_world',sK23) ).
cnf(u2322,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X3)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK6(sK1(sK26),X3,X1))
| ~ '$ki_accessible'(X1,X4)
| qmltpeq(X4,set_intersection2(X2,sK1(sK26)),set_intersection2(X2,X3)) ) ).
cnf(u385,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X1)
| ~ '$ki_accessible'(sK28,X0)
| ~ disjoint(sK25(sK1(sK26),X1,X0),sK1(sK26),X1)
| ~ '$ki_accessible'(X0,X2)
| disjoint(X2,X1,sK1(sK26)) ) ).
cnf(u4200,negated_conjecture,
( ~ qmltpeq(sK9(sK1(sK26),sK1(sK0(sK26)),X1),sK1(sK26),sK1(sK0(sK26)))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK8(sK1(sK26),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,sK1(sK0(sK26)),X2) ) ).
cnf(u4655,axiom,
( ~ in(sK16(sK1(sK0('$ki_local_world')),sK1(sK0(sK24(sK0('$ki_local_world')))),X0),sK1(sK0(sK24(sK0('$ki_local_world')))),sK1(sK0('$ki_local_world')))
| '$ki_accessible'(X0,sK17(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X0))
| ~ '$ki_accessible'(sK0(sK24(sK0('$ki_local_world'))),X0)
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK1(sK0(sK24(sK0('$ki_local_world')))),sK1(sK24(sK0('$ki_local_world')))) ) ).
cnf(u1070,negated_conjecture,
( ~ qmltpeq(sK6(sK27,sK1(sK0(sK26)),X2),sK27,sK1(sK0(sK26)))
| ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ '$ki_accessible'(X2,X3)
| qmltpeq(X3,set_intersection2(X1,sK27),set_intersection2(X1,sK1(sK0(sK26)))) ) ).
cnf(u4102,negated_conjecture,
( ~ in(sK14(sK1(sK26),sK1(sK0(sK28)),X0),sK1(sK26),sK1(sK0(sK28)))
| '$ki_accessible'(X0,sK15(sK1(sK26),sK29,X0))
| ~ '$ki_accessible'(sK0(sK28),X0)
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK29,sK1(sK0(sK28))) ) ).
cnf(u415,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X1)
| ~ '$ki_accessible'(sK24(sK26),X0)
| '$ki_accessible'(X0,sK2(sK1(sK26),X1,X0))
| ~ '$ki_accessible'(X0,X2)
| qmltpeq(X2,X1,sK1(sK26)) ) ).
cnf(u1526,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK28,X2)
| ~ qmltpeq(sK4(sK1(sK26),X0,X1),sK1(sK26),X0)
| ~ qmltpeq(sK3(X0,X3,X1),X0,X3)
| ~ '$ki_accessible'(X1,X4)
| qmltpeq(X4,sK1(sK26),X3) ) ).
cnf(u3529,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK0(sK26),X2)
| '$ki_accessible'(X0,sK9(sK1(sK26),X1,X0))
| '$ki_accessible'(X0,sK8(sK1(sK26),X3,X0))
| ~ '$ki_accessible'(X0,X4)
| disjoint(X4,X1,X3) ) ).
cnf(u2329,negated_conjecture,
( ~ '$ki_accessible'(sK31,X0)
| '$ki_accessible'(X0,sK6(sK1(sK26),sK29,X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(sK1(sK31),sK1(sK26)),set_intersection2(sK1(sK31),sK29)) ) ).
cnf(u4239,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK24(sK26)),X0)
| ~ '$ki_accessible'(sK0(sK24(sK26)),X1)
| '$ki_accessible'(X1,sK4(sK1(sK26),sK1(sK24(sK26)),X1))
| ~ qmltpeq(sK3(sK1(sK24(sK26)),X0,X1),sK1(sK24(sK26)),X0)
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,sK1(sK26),X0) ) ).
cnf(u4124,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK30,X0)
| ~ '$ki_accessible'(sK30,X1)
| '$ki_accessible'(X1,sK17(sK1(sK26),sK1(sK28),X1))
| ~ in(sK16(sK1(sK26),X0,X1),X0,sK1(sK26))
| ~ '$ki_accessible'(X1,X2)
| in(X2,X0,sK1(sK28)) ) ).
cnf(u1101,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK26,X4)
| '$ki_accessible'(X0,sK3(X2,X3,X0))
| '$ki_accessible'(X0,sK4(X4,X2,X0))
| ~ '$ki_accessible'(X5,X0)
| ~ '$ki_exists_in_world_$i'(X5,X3)
| ~ '$ki_accessible'(X6,X5)
| ~ '$ki_exists_in_world_$i'(X6,X2)
| ~ '$ki_accessible'(sK26,X6)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,X4,X3) ) ).
cnf(u2724,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK24(sK26)),X0)
| ~ '$ki_accessible'(sK0(sK24(sK26)),X1)
| '$ki_accessible'(X1,sK9(sK27,sK1(sK24(sK26)),X1))
| '$ki_accessible'(X1,sK8(sK27,X0,X1))
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,sK1(sK24(sK26)),X0) ) ).
cnf(u4138,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK0(sK26)),X0)
| ~ '$ki_accessible'(sK0(sK0(sK26)),X1)
| '$ki_accessible'(X1,sK15(sK1(sK26),sK1(sK0(sK26)),X1))
| '$ki_accessible'(X1,sK14(sK1(sK26),X0,X1))
| ~ '$ki_accessible'(X1,X2)
| in(X2,sK1(sK0(sK26)),X0) ) ).
cnf(u3842,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK28,X2)
| '$ki_accessible'(X0,sK9(sK1(sK26),X1,X0))
| ~ disjoint(sK8(sK1(sK26),X3,X0),sK1(sK26),X3)
| ~ '$ki_accessible'(X0,X4)
| disjoint(X4,X1,X3) ) ).
cnf(u1779,axiom,
( ~ '$ki_exists_in_world_$i'(sK24(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X0)
| '$ki_accessible'(X0,sK19(sK1(sK0('$ki_local_world')),X1,X0))
| ~ '$ki_accessible'(X0,X2)
| ~ in(sK18(sK1(sK0('$ki_local_world')),X1,X2),X1,sK1(sK0('$ki_local_world'))) ) ).
cnf(u3762,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK28),X0)
| '$ki_accessible'(X0,sK11(sK1(sK26),sK29,X0))
| '$ki_accessible'(X0,sK10(sK1(sK26),sK1(sK0(sK28)),X0))
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK0(sK28)),sK29) ) ).
cnf(u2211,negated_conjecture,
( ~ '$ki_accessible'(sK30,X0)
| '$ki_accessible'(X0,sK5(sK1(sK26),sK29,X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(sK1(sK26),sK1(sK30)),set_intersection2(sK29,sK1(sK30))) ) ).
cnf(u4657,axiom,
( ~ qmltpeq(sK3(sK1(sK24(sK0('$ki_local_world'))),sK1(sK0(sK24(sK0('$ki_local_world')))),X0),sK1(sK24(sK0('$ki_local_world'))),sK1(sK0(sK24(sK0('$ki_local_world')))))
| '$ki_accessible'(X0,sK4(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X0))
| ~ '$ki_accessible'(sK0(sK24(sK0('$ki_local_world'))),X0)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,sK1(sK0('$ki_local_world')),sK1(sK0(sK24(sK0('$ki_local_world'))))) ) ).
cnf(u2552,negated_conjecture,
( ~ '$ki_accessible'(sK31,X0)
| '$ki_accessible'(X0,sK4(sK27,sK1(sK28),X0))
| '$ki_accessible'(X0,sK3(sK1(sK28),sK1(sK31),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,sK27,sK1(sK31)) ) ).
cnf(u1278,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK0(sK26),X2)
| ~ qmltpeq(sK9(sK27,X0,X1),sK27,X0)
| ~ disjoint(sK8(sK27,X3,X1),sK27,X3)
| ~ '$ki_accessible'(X1,X4)
| disjoint(X4,X0,X3) ) ).
cnf(u4503,axiom,
( ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK15(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X1))
| ~ in(sK14(sK1(sK0('$ki_local_world')),X2,X1),sK1(sK0('$ki_local_world')),X2)
| ~ '$ki_accessible'(X1,X3)
| in(X3,sK1(sK24(sK0('$ki_local_world'))),X2) ) ).
cnf(u2734,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK31,X0)
| ~ '$ki_accessible'(sK31,X1)
| '$ki_accessible'(X1,sK11(sK27,sK29,X1))
| '$ki_accessible'(X1,sK10(sK27,X0,X1))
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,X0,sK29) ) ).
cnf(u4426,axiom,
( ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK15(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X1))
| '$ki_accessible'(X1,sK14(sK1(sK0('$ki_local_world')),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| in(X3,sK1(sK0(sK0('$ki_local_world'))),X2) ) ).
cnf(u4050,negated_conjecture,
( ~ qmltpeq(sK4(sK1(sK26),sK1(sK28),X1),sK1(sK26),sK1(sK28))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK3(sK1(sK28),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| qmltpeq(X3,sK1(sK26),X2) ) ).
cnf(u4448,axiom,
( ~ '$ki_accessible'(sK0(sK24(sK0('$ki_local_world'))),X0)
| '$ki_accessible'(X0,sK9(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X0))
| '$ki_accessible'(X0,sK8(sK1(sK0('$ki_local_world')),sK1(sK0(sK24(sK0('$ki_local_world')))),X0))
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK24(sK0('$ki_local_world'))),sK1(sK0(sK24(sK0('$ki_local_world'))))) ) ).
cnf(u3572,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK28,X2)
| '$ki_accessible'(X0,sK11(sK1(sK26),X1,X0))
| '$ki_accessible'(X0,sK10(sK1(sK26),X3,X0))
| ~ '$ki_accessible'(X0,X4)
| disjoint(X4,X3,X1) ) ).
cnf(u2821,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK28),X0)
| ~ '$ki_accessible'(sK0(sK28),X1)
| '$ki_accessible'(X1,sK11(sK27,sK1(sK28),X1))
| '$ki_accessible'(X1,sK10(sK27,X0,X1))
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,X0,sK1(sK28)) ) ).
cnf(u3962,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK24(sK26),X2)
| ~ qmltpeq(sK15(sK1(sK26),X0,X1),sK1(sK26),X0)
| '$ki_accessible'(X1,sK14(sK1(sK26),X3,X1))
| ~ '$ki_accessible'(X1,X4)
| in(X4,X0,X3) ) ).
cnf(u4433,axiom,
( ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK4(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X1))
| ~ qmltpeq(sK3(sK1(sK24(sK0('$ki_local_world'))),X2,X1),sK1(sK24(sK0('$ki_local_world'))),X2)
| ~ '$ki_accessible'(X1,X3)
| qmltpeq(X3,sK1(sK0('$ki_local_world')),X2) ) ).
cnf(u4212,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK15(sK1(sK26),sK1(sK0(sK26)),X1))
| ~ in(sK14(sK1(sK26),X2,X1),sK1(sK26),X2)
| ~ '$ki_accessible'(X1,X3)
| in(X3,sK1(sK0(sK26)),X2) ) ).
cnf(u4032,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK0(sK26),X2)
| '$ki_accessible'(X0,sK17(sK1(sK26),X1,X0))
| ~ in(sK16(sK1(sK26),X3,X0),X3,sK1(sK26))
| ~ '$ki_accessible'(X0,X4)
| in(X4,X3,X1) ) ).
cnf(u4651,axiom,
( ~ disjoint(sK10(sK1(sK0('$ki_local_world')),sK1(sK0(sK24(sK0('$ki_local_world')))),X0),sK1(sK0(sK24(sK0('$ki_local_world')))),sK1(sK0('$ki_local_world')))
| '$ki_accessible'(X0,sK11(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X0))
| ~ '$ki_accessible'(sK0(sK24(sK0('$ki_local_world'))),X0)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK0(sK24(sK0('$ki_local_world')))),sK1(sK24(sK0('$ki_local_world')))) ) ).
cnf(u2923,negated_conjecture,
( ~ '$ki_accessible'(sK30,X0)
| '$ki_accessible'(X0,sK15(sK27,sK29,X0))
| '$ki_accessible'(X0,sK14(sK27,sK1(sK30),X0))
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK29,sK1(sK30)) ) ).
cnf(u3139,negated_conjecture,
( ~ '$ki_accessible'(sK31,X0)
| '$ki_accessible'(X0,sK17(sK27,sK1(sK28),X0))
| '$ki_accessible'(X0,sK16(sK27,sK1(sK31),X0))
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK1(sK31),sK1(sK28)) ) ).
cnf(u4057,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK31,X0)
| ~ '$ki_accessible'(sK31,X1)
| '$ki_accessible'(X1,sK9(sK1(sK26),sK29,X1))
| ~ disjoint(sK8(sK1(sK26),X0,X1),sK1(sK26),X0)
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,sK29,X0) ) ).
cnf(u4098,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK30,X0)
| ~ '$ki_accessible'(sK30,X1)
| '$ki_accessible'(X1,sK15(sK1(sK26),sK29,X1))
| ~ in(sK14(sK1(sK26),X0,X1),sK1(sK26),X0)
| ~ '$ki_accessible'(X1,X2)
| in(X2,sK29,X0) ) ).
cnf(u3571,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK28),X0)
| '$ki_accessible'(X0,sK4(sK1(sK26),sK29,X0))
| '$ki_accessible'(X0,sK3(sK29,sK1(sK0(sK28)),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,sK1(sK26),sK1(sK0(sK28))) ) ).
cnf(u4164,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X2)
| '$ki_accessible'(X0,sK11(sK1(sK0('$ki_local_world')),X1,X0))
| '$ki_accessible'(X0,sK10(sK1(sK0('$ki_local_world')),X3,X0))
| ~ '$ki_accessible'(X0,X4)
| disjoint(X4,X3,X1) ) ).
cnf(u4235,negated_conjecture,
( ~ in(sK14(sK1(sK26),sK1(sK0(sK24(sK26))),X0),sK1(sK26),sK1(sK0(sK24(sK26))))
| '$ki_accessible'(X0,sK15(sK1(sK26),sK1(sK24(sK26)),X0))
| ~ '$ki_accessible'(sK0(sK24(sK26)),X0)
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK1(sK24(sK26)),sK1(sK0(sK24(sK26)))) ) ).
cnf(u4120,axiom,
( ~ '$ki_exists_in_world_$i'(sK24(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X1)
| ~ qmltpeq(sK13(sK1(sK0('$ki_local_world')),X0,X1),sK1(sK0('$ki_local_world')),X0)
| '$ki_accessible'(X1,sK12(sK1(sK0('$ki_local_world')),X1))
| ~ '$ki_accessible'(X1,X2)
| empty(X2,X0) ) ).
cnf(u4047,negated_conjecture,
( ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK17(sK1(sK26),sK1(sK24(sK26)),X1))
| '$ki_accessible'(X1,sK16(sK1(sK26),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| in(X3,X2,sK1(sK24(sK26))) ) ).
cnf(u4257,axiom,
( ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X0)
| '$ki_accessible'(X0,sK20(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X0))
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,singleton(sK1(sK0('$ki_local_world'))),sK1(sK24(sK0('$ki_local_world')))) ) ).
cnf(u3662,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK9(sK1(sK26),sK29,X1))
| '$ki_accessible'(X1,sK8(sK1(sK26),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,sK29,X2) ) ).
cnf(u4068,negated_conjecture,
( ~ disjoint(sK8(sK1(sK26),sK1(sK31),X0),sK1(sK26),sK1(sK31))
| '$ki_accessible'(X0,sK9(sK1(sK26),sK1(sK28),X0))
| ~ '$ki_accessible'(sK31,X0)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK28),sK1(sK31)) ) ).
cnf(u4150,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK0(sK26)),X0)
| '$ki_accessible'(X0,sK11(sK1(sK26),sK1(sK0(sK26)),X0))
| '$ki_accessible'(X0,sK10(sK1(sK26),sK1(sK0(sK0(sK26))),X0))
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK0(sK0(sK26))),sK1(sK0(sK26))) ) ).
cnf(u3434,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK28,X2)
| ~ qmltpeq(sK11(sK27,X0,X1),sK27,X0)
| '$ki_accessible'(X1,sK10(sK27,X3,X1))
| ~ '$ki_accessible'(X1,X4)
| disjoint(X4,X3,X0) ) ).
cnf(u2725,axiom,
( ~ '$ki_accessible'(sK0('$ki_local_world'),X2)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X1)
| '$ki_accessible'(X0,sK20(sK1(sK0('$ki_local_world')),X1,X0))
| ~ '$ki_accessible'(X0,X3)
| disjoint(X3,singleton(sK1(sK0('$ki_local_world'))),X1) ) ).
cnf(u3852,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK30,X0)
| ~ '$ki_accessible'(sK30,X1)
| '$ki_accessible'(X1,sK15(sK1(sK26),sK1(sK28),X1))
| '$ki_accessible'(X1,sK14(sK1(sK26),X0,X1))
| ~ '$ki_accessible'(X1,X2)
| in(X2,sK1(sK28),X0) ) ).
cnf(u4287,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X2)
| '$ki_accessible'(X0,sK17(sK1(sK0('$ki_local_world')),X1,X0))
| ~ in(sK16(sK1(sK0('$ki_local_world')),X3,X0),X3,sK1(sK0('$ki_local_world')))
| ~ '$ki_accessible'(X0,X4)
| in(X4,X3,X1) ) ).
cnf(u4500,axiom,
( ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK11(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X1))
| ~ disjoint(sK10(sK1(sK0('$ki_local_world')),X2,X1),X2,sK1(sK0('$ki_local_world')))
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,X2,sK1(sK0(sK0('$ki_local_world')))) ) ).
cnf(u4042,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X0)
| '$ki_accessible'(X0,sK2(sK1(sK0('$ki_local_world')),X1,X0))
| ~ '$ki_accessible'(X0,X2)
| qmltpeq(X2,X1,sK1(sK0('$ki_local_world'))) ) ).
cnf(u3877,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK24(sK26),X2)
| ~ qmltpeq(sK11(sK1(sK26),X0,X1),sK1(sK26),X0)
| '$ki_accessible'(X1,sK10(sK1(sK26),X3,X1))
| ~ '$ki_accessible'(X1,X4)
| disjoint(X4,X3,X0) ) ).
cnf(u2842,negated_conjecture,
( ~ '$ki_accessible'(sK30,X0)
| '$ki_accessible'(X0,sK11(sK27,sK1(sK28),X0))
| '$ki_accessible'(X0,sK10(sK27,sK1(sK30),X0))
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK30),sK1(sK28)) ) ).
cnf(u4067,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK28),X0)
| ~ '$ki_accessible'(sK0(sK28),X1)
| '$ki_accessible'(X1,sK9(sK1(sK26),sK1(sK28),X1))
| ~ disjoint(sK8(sK1(sK26),X0,X1),sK1(sK26),X0)
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,sK1(sK28),X0) ) ).
cnf(u4514,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK0(sK0('$ki_local_world'))),X0)
| ~ '$ki_accessible'(sK0(sK0(sK0('$ki_local_world'))),X1)
| '$ki_accessible'(X1,sK15(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X1))
| ~ in(sK14(sK1(sK0('$ki_local_world')),X0,X1),sK1(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X1,X2)
| in(X2,sK1(sK0(sK0('$ki_local_world'))),X0) ) ).
cnf(u2634,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK28),X0)
| '$ki_accessible'(X0,sK9(sK27,sK29,X0))
| '$ki_accessible'(X0,sK8(sK27,sK1(sK0(sK28)),X0))
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK29,sK1(sK0(sK28))) ) ).
cnf(u3040,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK15(sK27,sK1(sK0(sK26)),X1))
| '$ki_accessible'(X1,sK14(sK27,X2,X1))
| ~ '$ki_accessible'(X1,X3)
| in(X3,sK1(sK0(sK26)),X2) ) ).
cnf(u3441,negated_conjecture,
( ~ qmltpeq(sK11(sK27,sK1(sK0(sK26)),X1),sK27,sK1(sK0(sK26)))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK10(sK27,X2,X1))
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,X2,sK1(sK0(sK26))) ) ).
cnf(u1840,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(sK20(sK1(sK26),sK29,X0),X1)
| in(X1,sK1(sK26),sK29)
| ~ '$ki_accessible'(X0,X2)
| disjoint(X2,singleton(sK1(sK26)),sK29) ) ).
cnf(u3851,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK31,X0)
| ~ '$ki_accessible'(sK31,X1)
| '$ki_accessible'(X1,sK15(sK1(sK26),sK1(sK28),X1))
| '$ki_accessible'(X1,sK14(sK1(sK26),X0,X1))
| ~ '$ki_accessible'(X1,X2)
| in(X2,sK1(sK28),X0) ) ).
cnf(u4499,axiom,
( ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK11(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X1))
| ~ disjoint(sK10(sK1(sK0('$ki_local_world')),X2,X1),X2,sK1(sK0('$ki_local_world')))
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,X2,sK1(sK24(sK0('$ki_local_world')))) ) ).
cnf(u4049,negated_conjecture,
( ~ qmltpeq(sK4(sK1(sK26),sK29,X1),sK1(sK26),sK29)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK3(sK29,X2,X1))
| ~ '$ki_accessible'(X1,X3)
| qmltpeq(X3,sK1(sK26),X2) ) ).
cnf(u4078,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK30,X0)
| ~ '$ki_accessible'(sK30,X1)
| '$ki_accessible'(X1,sK11(sK1(sK26),sK29,X1))
| ~ disjoint(sK10(sK1(sK26),X0,X1),X0,sK1(sK26))
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,X0,sK29) ) ).
cnf(u4438,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK0(sK0('$ki_local_world'))),X0)
| ~ '$ki_accessible'(sK0(sK0(sK0('$ki_local_world'))),X1)
| '$ki_accessible'(X1,sK9(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X1))
| '$ki_accessible'(X1,sK8(sK1(sK0('$ki_local_world')),X0,X1))
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,sK1(sK0(sK0('$ki_local_world'))),X0) ) ).
cnf(u1105,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X3)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| ~ qmltpeq(sK5(sK1(sK26),X3,X1),sK1(sK26),X3)
| ~ '$ki_accessible'(X1,X4)
| qmltpeq(X4,set_intersection2(sK1(sK26),X2),set_intersection2(X3,X2)) ) ).
cnf(u1855,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK26,X2)
| '$ki_accessible'(X0,sK16(X2,X3,X0))
| ~ qmltpeq(sK17(X2,X4,X0),X2,X4)
| ~ '$ki_accessible'(X5,X0)
| ~ '$ki_exists_in_world_$i'(X5,X3)
| ~ '$ki_accessible'(X6,X5)
| ~ '$ki_exists_in_world_$i'(X6,X4)
| ~ '$ki_accessible'(sK26,X6)
| ~ '$ki_accessible'(X0,X1)
| in(X1,X3,X4) ) ).
cnf(u4423,axiom,
( ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK11(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X1))
| '$ki_accessible'(X1,sK10(sK1(sK0('$ki_local_world')),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,X2,sK1(sK24(sK0('$ki_local_world')))) ) ).
cnf(u1135,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| '$ki_accessible'(X0,sK19(sK27,sK29,X0))
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK18(sK27,sK29,X1)) ) ).
cnf(u4060,negated_conjecture,
( ~ disjoint(sK8(sK1(sK26),sK1(sK31),X0),sK1(sK26),sK1(sK31))
| '$ki_accessible'(X0,sK9(sK1(sK26),sK29,X0))
| ~ '$ki_accessible'(sK31,X0)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK29,sK1(sK31)) ) ).
cnf(u2314,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ '$ki_accessible'(X0,X2)
| '$ki_accessible'(X2,sK5(sK1(sK26),sK1(sK0(sK26)),X2))
| ~ '$ki_accessible'(X2,X3)
| qmltpeq(X3,set_intersection2(sK1(sK26),X1),set_intersection2(sK1(sK0(sK26)),X1)) ) ).
cnf(u4085,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK31,X0)
| ~ '$ki_accessible'(sK31,X1)
| '$ki_accessible'(X1,sK11(sK1(sK26),sK1(sK28),X1))
| ~ disjoint(sK10(sK1(sK26),X0,X1),X0,sK1(sK26))
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,X0,sK1(sK28)) ) ).
cnf(u4445,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK0(sK0('$ki_local_world'))),X0)
| ~ '$ki_accessible'(sK0(sK0(sK0('$ki_local_world'))),X1)
| '$ki_accessible'(X1,sK17(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X1))
| '$ki_accessible'(X1,sK16(sK1(sK0('$ki_local_world')),X0,X1))
| ~ '$ki_accessible'(X1,X2)
| in(X2,X0,sK1(sK0(sK0('$ki_local_world')))) ) ).
cnf(u3050,axiom,
( ~ '$ki_accessible'(sK0('$ki_local_world'),X3)
| ~ '$ki_accessible'(sK20(sK1(sK0('$ki_local_world')),X1,X2),X0)
| ~ '$ki_accessible'(X3,X2)
| ~ '$ki_exists_in_world_$i'(X3,X1)
| in(X0,sK1(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(X2,X4)
| disjoint(X4,singleton(sK1(sK0('$ki_local_world'))),X1) ) ).
cnf(u3521,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK28),X0)
| ~ '$ki_accessible'(sK0(sK28),X1)
| '$ki_accessible'(X1,sK17(sK27,sK1(sK28),X1))
| ~ in(sK16(sK27,X0,X1),X0,sK27)
| ~ '$ki_accessible'(X1,X2)
| in(X2,X0,sK1(sK28)) ) ).
cnf(u4059,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK28),X0)
| ~ '$ki_accessible'(sK0(sK28),X1)
| '$ki_accessible'(X1,sK9(sK1(sK26),sK29,X1))
| ~ disjoint(sK8(sK1(sK26),X0,X1),sK1(sK26),X0)
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,sK29,X0) ) ).
cnf(u1920,negated_conjecture,
( ~ '$ki_accessible'(sK26,X4)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(X4,X2)
| ~ '$ki_exists_in_world_$i'(X4,X1)
| '$ki_accessible'(X0,sK6(sK1(sK26),X1,X0))
| ~ '$ki_accessible'(X0,X5)
| qmltpeq(X5,set_intersection2(X3,sK1(sK26)),set_intersection2(X3,X1)) ) ).
cnf(u2321,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X3)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK6(sK1(sK26),X3,X1))
| ~ '$ki_accessible'(X1,X4)
| qmltpeq(X4,set_intersection2(X2,sK1(sK26)),set_intersection2(X2,X3)) ) ).
cnf(u4297,axiom,
( ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X0)
| '$ki_accessible'(X0,sK7(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,singleton(sK1(sK0('$ki_local_world'))),singleton(sK1(sK24(sK0('$ki_local_world'))))) ) ).
cnf(u4070,negated_conjecture,
( ~ disjoint(sK8(sK1(sK26),sK1(sK0(sK28)),X0),sK1(sK26),sK1(sK0(sK28)))
| '$ki_accessible'(X0,sK9(sK1(sK26),sK1(sK28),X0))
| ~ '$ki_accessible'(sK0(sK28),X0)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK28),sK1(sK0(sK28))) ) ).
cnf(u1399,axiom,
( ~ '$ki_exists_in_world_$i'(sK0('$ki_local_world'),X2)
| '$ki_accessible'(X0,sK16(X2,X3,X0))
| '$ki_accessible'(X0,sK17(X2,X4,X0))
| ~ '$ki_accessible'(X5,X0)
| ~ '$ki_exists_in_world_$i'(X5,X3)
| ~ '$ki_accessible'(X6,X5)
| ~ '$ki_exists_in_world_$i'(X6,X4)
| ~ '$ki_accessible'(sK0('$ki_local_world'),X6)
| ~ '$ki_accessible'(X0,X1)
| in(X1,X3,X4) ) ).
cnf(u2189,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK28),X0)
| ~ '$ki_accessible'(sK0(sK28),X1)
| '$ki_accessible'(X1,sK5(sK1(sK26),sK29,X1))
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,set_intersection2(sK1(sK26),X0),set_intersection2(sK29,X0)) ) ).
cnf(u2522,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK28),X0)
| '$ki_accessible'(X0,sK4(sK27,sK29,X0))
| '$ki_accessible'(X0,sK3(sK29,sK1(sK0(sK28)),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,sK27,sK1(sK0(sK28))) ) ).
cnf(u1322,negated_conjecture,
( ~ qmltpeq(sK11(sK27,sK1(sK28),X1),sK27,sK1(sK28))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| ~ disjoint(sK10(sK27,X2,X1),X2,sK27)
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,X2,sK1(sK28)) ) ).
cnf(u1020,negated_conjecture,
( ~ qmltpeq(sK5(sK27,sK1(sK0(sK26)),X2),sK27,sK1(sK0(sK26)))
| ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ '$ki_accessible'(X2,X3)
| qmltpeq(X3,set_intersection2(sK27,X1),set_intersection2(sK1(sK0(sK26)),X1)) ) ).
cnf(u148,axiom,
( ~ '$ki_accessible'('$ki_local_world',X0)
| ~ '$ki_accessible'(X4,X5)
| '$ki_accessible'(X4,sK2(X1,X3,X4))
| ~ '$ki_accessible'(X2,X4)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| qmltpeq(X5,X3,X1) ) ).
cnf(u1880,negated_conjecture,
( ~ '$ki_accessible'(sK31,X0)
| '$ki_accessible'(X0,sK5(sK27,sK29,X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(sK27,sK1(sK31)),set_intersection2(sK29,sK1(sK31))) ) ).
cnf(u4077,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK31,X0)
| ~ '$ki_accessible'(sK31,X1)
| '$ki_accessible'(X1,sK11(sK1(sK26),sK29,X1))
| ~ disjoint(sK10(sK1(sK26),X0,X1),X0,sK1(sK26))
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,X0,sK29) ) ).
cnf(u1136,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| '$ki_accessible'(X0,sK19(sK27,sK1(sK28),X0))
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK18(sK27,sK1(sK28),X1)) ) ).
cnf(u162,axiom,
( ~ '$ki_accessible'('$ki_local_world',X0)
| ~ '$ki_accessible'(X6,X7)
| ~ disjoint(sK8(X1,X5,X6),X1,X5)
| '$ki_accessible'(X6,sK9(X1,X3,X6))
| ~ '$ki_accessible'(X4,X6)
| ~ '$ki_exists_in_world_$i'(X4,X5)
| ~ '$ki_accessible'(X2,X4)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| disjoint(X7,X3,X5) ) ).
cnf(u522,negated_conjecture,
( ~ '$ki_accessible'(sK26,X2)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X1)
| '$ki_accessible'(X0,sK19(sK1(sK26),X1,X0))
| ~ '$ki_accessible'(X0,X3)
| ~ in(sK18(sK1(sK26),X1,X3),X1,sK1(sK26)) ) ).
cnf(u928,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X1)
| ~ '$ki_accessible'(sK24(sK26),X0)
| '$ki_accessible'(X0,sK7(sK27,X1,X0))
| ~ '$ki_accessible'(X0,X2)
| qmltpeq(X2,singleton(sK27),singleton(X1)) ) ).
cnf(u1019,negated_conjecture,
( ~ qmltpeq(sK5(sK27,sK1(sK24(sK26)),X2),sK27,sK1(sK24(sK26)))
| ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ '$ki_accessible'(X2,X3)
| qmltpeq(X3,set_intersection2(sK27,X1),set_intersection2(sK1(sK24(sK26)),X1)) ) ).
cnf(u2726,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK0(sK26)),X0)
| ~ '$ki_accessible'(sK0(sK0(sK26)),X1)
| '$ki_accessible'(X1,sK9(sK27,sK1(sK0(sK26)),X1))
| '$ki_accessible'(X1,sK8(sK27,X0,X1))
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,sK1(sK0(sK26)),X0) ) ).
cnf(u1273,negated_conjecture,
'$ki_accessible'(sK0(sK30),sK18(sK1(sK26),sK29,sK0(sK30))) ).
cnf(u720,axiom,
( ~ '$ki_exists_in_world_$i'(sK0('$ki_local_world'),X2)
| ~ in(sK14(X2,X3,X0),X2,X3)
| ~ qmltpeq(sK15(X2,X4,X0),X2,X4)
| ~ '$ki_accessible'(X5,X0)
| ~ '$ki_exists_in_world_$i'(X5,X3)
| ~ '$ki_accessible'(X6,X5)
| ~ '$ki_exists_in_world_$i'(X6,X4)
| ~ '$ki_accessible'(sK0('$ki_local_world'),X6)
| ~ '$ki_accessible'(X0,X1)
| in(X1,X4,X3) ) ).
cnf(u1633,axiom,
( ~ '$ki_accessible'(sK0('$ki_local_world'),X4)
| ~ qmltpeq(sK15(sK1(sK0('$ki_local_world')),X2,X1),sK1(sK0('$ki_local_world')),X2)
| ~ '$ki_accessible'(X3,X1)
| ~ '$ki_exists_in_world_$i'(X3,X0)
| ~ '$ki_accessible'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X4,X2)
| ~ in(sK14(sK1(sK0('$ki_local_world')),X0,X1),sK1(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X1,X5)
| in(X5,X2,X0) ) ).
cnf(u184,axiom,
( ~ '$ki_accessible'('$ki_local_world',X0)
| ~ '$ki_accessible'(X2,X4)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| qmltpeq(X4,set_intersection2(X1,X3),set_intersection2(X3,X1)) ) ).
cnf(u4072,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X0)
| '$ki_accessible'(X0,sK7(sK1(sK0('$ki_local_world')),X1,X0))
| ~ '$ki_accessible'(X0,X2)
| qmltpeq(X2,singleton(sK1(sK0('$ki_local_world'))),singleton(X1)) ) ).
cnf(u294,negated_conjecture,
( ~ qmltpeq(sK2(sK27,sK29,X0),sK27,sK29)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,sK29,sK27) ) ).
cnf(u377,negated_conjecture,
( ~ qmltpeq(sK2(sK1(sK26),sK29,X0),sK1(sK26),sK29)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,sK29,sK1(sK26)) ) ).
cnf(u193,axiom,
( ~ '$ki_accessible'('$ki_local_world',X1)
| '$ki_accessible'(X1,sK24(X1)) ) ).
cnf(u902,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK26),X0)
| '$ki_accessible'(X0,sK20(sK1(sK26),sK1(sK0(sK26)),X0))
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,singleton(sK1(sK26)),sK1(sK0(sK26))) ) ).
cnf(u279,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X0)
| ~ '$ki_accessible'(sK24(sK26),X1)
| qmltpeq(X1,set_intersection2(sK1(sK26),X0),set_intersection2(X0,sK1(sK26))) ) ).
cnf(u1530,negated_conjecture,
( ~ qmltpeq(sK4(sK1(sK26),sK29,X1),sK1(sK26),sK29)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| ~ qmltpeq(sK3(sK29,X2,X1),sK29,X2)
| ~ '$ki_accessible'(X1,X3)
| qmltpeq(X3,sK1(sK26),X2) ) ).
cnf(u4087,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK28),X0)
| ~ '$ki_accessible'(sK0(sK28),X1)
| '$ki_accessible'(X1,sK11(sK1(sK26),sK1(sK28),X1))
| ~ disjoint(sK10(sK1(sK26),X0,X1),X0,sK1(sK26))
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,X0,sK1(sK28)) ) ).
cnf(u301,negated_conjecture,
( ~ '$ki_accessible'(sK26,X2)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X1)
| '$ki_accessible'(X0,sK2(sK1(sK26),X1,X0))
| ~ '$ki_accessible'(X0,X3)
| qmltpeq(X3,X1,sK1(sK26)) ) ).
cnf(u1204,negated_conjecture,
'$ki_accessible'(sK0(sK0(sK28)),sK18(sK27,sK1(sK28),sK0(sK0(sK28)))) ).
cnf(u938,negated_conjecture,
( ~ in(sK21(sK1(sK26),sK1(sK28),X0),sK1(sK26),sK1(sK28))
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(sK1(sK28),singleton(sK1(sK26))),singleton(sK1(sK26))) ) ).
cnf(u315,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| '$ki_accessible'(X0,sK2(sK27,sK1(sK28),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,sK1(sK28),sK27) ) ).
cnf(u1397,axiom,
( ~ '$ki_accessible'(sK0('$ki_local_world'),X2)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X0)
| ~ in(sK19(sK1(sK0('$ki_local_world')),X0,X1),sK1(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X1,X3)
| ~ in(sK18(sK1(sK0('$ki_local_world')),X0,X3),X0,sK1(sK0('$ki_local_world'))) ) ).
cnf(u730,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X1)
| ~ '$ki_accessible'(sK24(sK26),X0)
| ~ in(sK19(sK27,X1,X0),sK27,X1)
| ~ '$ki_accessible'(X0,X2)
| ~ in(sK18(sK27,X1,X2),X1,sK27) ) ).
cnf(u3138,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK28),X0)
| ~ '$ki_accessible'(sK0(sK28),X1)
| '$ki_accessible'(X1,sK17(sK27,sK1(sK28),X1))
| '$ki_accessible'(X1,sK16(sK27,X0,X1))
| ~ '$ki_accessible'(X1,X2)
| in(X2,X0,sK1(sK28)) ) ).
cnf(u153,axiom,
( ~ '$ki_accessible'('$ki_local_world',X0)
| ~ '$ki_accessible'(X6,X7)
| ~ qmltpeq(sK3(X3,X5,X6),X3,X5)
| ~ qmltpeq(sK4(X1,X3,X6),X1,X3)
| ~ '$ki_accessible'(X4,X6)
| ~ '$ki_exists_in_world_$i'(X4,X5)
| ~ '$ki_accessible'(X2,X4)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| qmltpeq(X7,X1,X5) ) ).
cnf(u1439,negated_conjecture,
'$ki_accessible'(sK12(sK27,sK0(sK28)),sK18(sK1(sK26),sK1(sK28),sK12(sK27,sK0(sK28)))) ).
cnf(u719,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK26,X2)
| ~ in(sK14(X2,X3,X0),X2,X3)
| ~ qmltpeq(sK15(X2,X4,X0),X2,X4)
| ~ '$ki_accessible'(X5,X0)
| ~ '$ki_exists_in_world_$i'(X5,X3)
| ~ '$ki_accessible'(X6,X5)
| ~ '$ki_exists_in_world_$i'(X6,X4)
| ~ '$ki_accessible'(sK26,X6)
| ~ '$ki_accessible'(X0,X1)
| in(X1,X4,X3) ) ).
cnf(u183,axiom,
( ~ '$ki_accessible'('$ki_local_world',X0)
| ~ '$ki_accessible'(X4,X5)
| ~ in(sK19(X1,X3,X4),X1,X3)
| ~ '$ki_accessible'(X2,X4)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ in(sK18(X1,X3,X5),X3,X1) ) ).
cnf(u487,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK26,X2)
| '$ki_accessible'(X0,sK19(X2,X3,X0))
| ~ '$ki_accessible'(X4,X0)
| ~ '$ki_exists_in_world_$i'(X4,X3)
| ~ '$ki_accessible'(sK26,X4)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK18(X2,X3,X1)) ) ).
cnf(u3383,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK4(sK27,sK29,X1))
| ~ qmltpeq(sK3(sK29,X2,X1),sK29,X2)
| ~ '$ki_accessible'(X1,X3)
| qmltpeq(X3,sK27,X2) ) ).
cnf(u2318,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK0(sK26)),X0)
| '$ki_accessible'(X0,sK5(sK1(sK26),sK1(sK0(sK26)),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(sK1(sK26),sK1(sK0(sK0(sK26)))),set_intersection2(sK1(sK0(sK26)),sK1(sK0(sK0(sK26))))) ) ).
cnf(u2663,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK28),X0)
| ~ '$ki_accessible'(sK0(sK28),X1)
| '$ki_accessible'(X1,sK9(sK27,sK1(sK28),X1))
| '$ki_accessible'(X1,sK8(sK27,X0,X1))
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,sK1(sK28),X0) ) ).
cnf(u1036,negated_conjecture,
( ~ qmltpeq(sK6(sK27,sK29,X2),sK27,sK29)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ '$ki_accessible'(X2,X3)
| qmltpeq(X3,set_intersection2(X1,sK27),set_intersection2(X1,sK29)) ) ).
cnf(u410,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK26,X2)
| ~ in(sK19(X2,X3,X0),X2,X3)
| ~ '$ki_accessible'(X4,X0)
| ~ '$ki_exists_in_world_$i'(X4,X3)
| ~ '$ki_accessible'(sK26,X4)
| ~ '$ki_accessible'(X0,X1)
| ~ in(sK18(X2,X3,X1),X3,X2) ) ).
cnf(u509,axiom,
( ~ '$ki_exists_in_world_$i'(sK0('$ki_local_world'),X2)
| ~ qmltpeq(sK5(X2,X3,X0),X2,X3)
| ~ '$ki_accessible'(X4,X0)
| ~ '$ki_exists_in_world_$i'(X4,X5)
| ~ '$ki_accessible'(X6,X4)
| ~ '$ki_exists_in_world_$i'(X6,X3)
| ~ '$ki_accessible'(sK0('$ki_local_world'),X6)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(X2,X5),set_intersection2(X3,X5)) ) ).
cnf(u770,negated_conjecture,
~ '$ki_accessible'(sK0(sK28),sK31) ).
cnf(u202,negated_conjecture,
~ disjoint(sK31,singleton(sK27),sK29) ).
cnf(u690,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK26,X2)
| ~ disjoint(sK10(X2,X3,X0),X3,X2)
| ~ qmltpeq(sK11(X2,X4,X0),X2,X4)
| ~ '$ki_accessible'(X5,X0)
| ~ '$ki_exists_in_world_$i'(X5,X3)
| ~ '$ki_accessible'(X6,X5)
| ~ '$ki_exists_in_world_$i'(X6,X4)
| ~ '$ki_accessible'(sK26,X6)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,X3,X4) ) ).
cnf(u1173,axiom,
( ~ '$ki_exists_in_world_$i'(sK0('$ki_local_world'),X2)
| '$ki_accessible'(X0,sK8(X2,X3,X0))
| '$ki_accessible'(X0,sK9(X2,X4,X0))
| ~ '$ki_accessible'(X5,X0)
| ~ '$ki_exists_in_world_$i'(X5,X3)
| ~ '$ki_accessible'(X6,X5)
| ~ '$ki_exists_in_world_$i'(X6,X4)
| ~ '$ki_accessible'(sK0('$ki_local_world'),X6)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,X4,X3) ) ).
cnf(u4210,negated_conjecture,
( ~ qmltpeq(sK15(sK1(sK26),sK1(sK0(sK26)),X1),sK1(sK26),sK1(sK0(sK26)))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK14(sK1(sK26),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| in(X3,sK1(sK0(sK26)),X2) ) ).
cnf(u2325,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ '$ki_accessible'(X0,X2)
| '$ki_accessible'(X2,sK6(sK1(sK26),sK1(sK28),X2))
| ~ '$ki_accessible'(X2,X3)
| qmltpeq(X3,set_intersection2(X1,sK1(sK26)),set_intersection2(X1,sK1(sK28))) ) ).
cnf(u417,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| '$ki_accessible'(X0,sK2(sK1(sK26),sK29,X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,sK29,sK1(sK26)) ) ).
cnf(u4104,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK30,X0)
| ~ '$ki_accessible'(sK30,X1)
| '$ki_accessible'(X1,sK15(sK1(sK26),sK1(sK28),X1))
| ~ in(sK14(sK1(sK26),X0,X1),sK1(sK26),X0)
| ~ '$ki_accessible'(X1,X2)
| in(X2,sK1(sK28),X0) ) ).
cnf(u721,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK26,X2)
| '$ki_accessible'(X0,sK21(X2,X3,X0))
| ~ '$ki_accessible'(X4,X0)
| ~ '$ki_exists_in_world_$i'(X4,X3)
| ~ '$ki_accessible'(sK26,X4)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(X3,singleton(X2)),singleton(X2)) ) ).
cnf(u4241,negated_conjecture,
( ~ qmltpeq(sK3(sK1(sK24(sK26)),sK1(sK0(sK24(sK26))),X0),sK1(sK24(sK26)),sK1(sK0(sK24(sK26))))
| '$ki_accessible'(X0,sK4(sK1(sK26),sK1(sK24(sK26)),X0))
| ~ '$ki_accessible'(sK0(sK24(sK26)),X0)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,sK1(sK26),sK1(sK0(sK24(sK26)))) ) ).
cnf(u1430,negated_conjecture,
'$ki_accessible'(sK12(sK27,sK31),sK18(sK1(sK26),sK1(sK28),sK12(sK27,sK31))) ).
cnf(u4134,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK0(sK26)),X0)
| ~ '$ki_accessible'(sK0(sK0(sK26)),X1)
| '$ki_accessible'(X1,sK9(sK1(sK26),sK1(sK0(sK26)),X1))
| '$ki_accessible'(X1,sK8(sK1(sK26),X0,X1))
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,sK1(sK0(sK26)),X0) ) ).
cnf(u1918,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK28),X0)
| '$ki_accessible'(X0,sK5(sK27,sK29,X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(sK27,sK1(sK0(sK28))),set_intersection2(sK29,sK1(sK0(sK28)))) ) ).
cnf(u1222,negated_conjecture,
'$ki_accessible'(sK0(sK0(sK24(sK26))),sK18(sK27,sK1(sK24(sK26)),sK0(sK0(sK24(sK26))))) ).
cnf(u4156,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK0(sK26)),X0)
| '$ki_accessible'(X0,sK17(sK1(sK26),sK1(sK0(sK26)),X0))
| '$ki_accessible'(X0,sK16(sK1(sK26),sK1(sK0(sK0(sK26))),X0))
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK1(sK0(sK0(sK26))),sK1(sK0(sK26))) ) ).
cnf(u3463,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK24(sK26)),X0)
| ~ '$ki_accessible'(sK0(sK24(sK26)),X1)
| '$ki_accessible'(X1,sK11(sK27,sK1(sK24(sK26)),X1))
| ~ disjoint(sK10(sK27,X0,X1),X0,sK27)
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,X0,sK1(sK24(sK26))) ) ).
cnf(u1452,negated_conjecture,
( ~ qmltpeq(sK17(sK27,sK1(sK28),X1),sK27,sK1(sK28))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| ~ in(sK16(sK27,X2,X1),X2,sK27)
| ~ '$ki_accessible'(X1,X3)
| in(X3,X2,sK1(sK28)) ) ).
cnf(u829,negated_conjecture,
( ~ in(sK21(sK27,sK29,X0),sK27,sK29)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(sK29,singleton(sK27)),singleton(sK27)) ) ).
cnf(u3374,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK0(sK26),X2)
| ~ qmltpeq(sK4(sK27,X0,X1),sK27,X0)
| '$ki_accessible'(X1,sK3(X0,X3,X1))
| ~ '$ki_accessible'(X1,X4)
| qmltpeq(X4,sK27,X3) ) ).
cnf(u1244,negated_conjecture,
( ~ qmltpeq(sK4(sK27,sK1(sK0(sK26)),X1),sK27,sK1(sK0(sK26)))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| ~ qmltpeq(sK3(sK1(sK0(sK26)),X2,X1),sK1(sK0(sK26)),X2)
| ~ '$ki_accessible'(X1,X3)
| qmltpeq(X3,sK27,X2) ) ).
cnf(u1133,negated_conjecture,
( ~ qmltpeq(sK5(sK1(sK26),sK1(sK24(sK26)),X2),sK1(sK26),sK1(sK24(sK26)))
| ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ '$ki_accessible'(X2,X3)
| qmltpeq(X3,set_intersection2(sK1(sK26),X1),set_intersection2(sK1(sK24(sK26)),X1)) ) ).
cnf(u1437,negated_conjecture,
'$ki_accessible'(sK12(sK27,sK30),sK18(sK27,sK29,sK12(sK27,sK30))) ).
cnf(u4653,axiom,
( ~ in(sK14(sK1(sK0('$ki_local_world')),sK1(sK0(sK24(sK0('$ki_local_world')))),X0),sK1(sK0('$ki_local_world')),sK1(sK0(sK24(sK0('$ki_local_world')))))
| '$ki_accessible'(X0,sK15(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X0))
| ~ '$ki_accessible'(sK0(sK24(sK0('$ki_local_world'))),X0)
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK1(sK24(sK0('$ki_local_world'))),sK1(sK0(sK24(sK0('$ki_local_world'))))) ) ).
cnf(u1797,axiom,
( ~ '$ki_exists_in_world_$i'(sK0('$ki_local_world'),X2)
| '$ki_accessible'(X0,sK14(X2,X3,X0))
| ~ qmltpeq(sK15(X2,X4,X0),X2,X4)
| ~ '$ki_accessible'(X5,X0)
| ~ '$ki_exists_in_world_$i'(X5,X3)
| ~ '$ki_accessible'(X6,X5)
| ~ '$ki_exists_in_world_$i'(X6,X4)
| ~ '$ki_accessible'(sK0('$ki_local_world'),X6)
| ~ '$ki_accessible'(X0,X1)
| in(X1,X4,X3) ) ).
cnf(u4498,axiom,
( ~ qmltpeq(sK11(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X1),sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK10(sK1(sK0('$ki_local_world')),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,X2,sK1(sK0(sK0('$ki_local_world')))) ) ).
cnf(u3666,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK28),X0)
| ~ '$ki_accessible'(sK0(sK28),X1)
| '$ki_accessible'(X1,sK9(sK1(sK26),sK29,X1))
| '$ki_accessible'(X1,sK8(sK1(sK26),X0,X1))
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,sK29,X0) ) ).
cnf(u1451,negated_conjecture,
( ~ qmltpeq(sK17(sK27,sK29,X1),sK27,sK29)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| ~ in(sK16(sK27,X2,X1),X2,sK27)
| ~ '$ki_accessible'(X1,X3)
| in(X3,X2,sK29) ) ).
cnf(u3381,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK0(sK26),X2)
| '$ki_accessible'(X0,sK4(sK27,X1,X0))
| ~ qmltpeq(sK3(X1,X3,X0),X1,X3)
| ~ '$ki_accessible'(X0,X4)
| qmltpeq(X4,sK27,X3) ) ).
cnf(u2664,negated_conjecture,
( ~ '$ki_accessible'(sK31,X0)
| '$ki_accessible'(X0,sK9(sK27,sK1(sK28),X0))
| '$ki_accessible'(X0,sK8(sK27,sK1(sK31),X0))
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK28),sK1(sK31)) ) ).
cnf(u2456,negated_conjecture,
( ~ '$ki_accessible'(sK26,X4)
| ~ qmltpeq(sK15(sK1(sK26),X2,X0),sK1(sK26),X2)
| ~ '$ki_accessible'(X3,X0)
| ~ '$ki_exists_in_world_$i'(X3,X1)
| ~ '$ki_accessible'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X4,X2)
| '$ki_accessible'(X0,sK14(sK1(sK26),X1,X0))
| ~ '$ki_accessible'(X0,X5)
| in(X5,X2,X1) ) ).
cnf(u4422,axiom,
( ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK9(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X1))
| '$ki_accessible'(X1,sK8(sK1(sK0('$ki_local_world')),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,sK1(sK0(sK0('$ki_local_world'))),X2) ) ).
cnf(u4505,axiom,
( ~ qmltpeq(sK17(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X1),sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK16(sK1(sK0('$ki_local_world')),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| in(X3,X2,sK1(sK24(sK0('$ki_local_world')))) ) ).
cnf(u1542,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK0(sK26),X2)
| ~ qmltpeq(sK9(sK1(sK26),X0,X1),sK1(sK26),X0)
| ~ disjoint(sK8(sK1(sK26),X3,X1),sK1(sK26),X3)
| ~ '$ki_accessible'(X1,X4)
| disjoint(X4,X0,X3) ) ).
cnf(u4444,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK24(sK0('$ki_local_world'))),X0)
| ~ '$ki_accessible'(sK0(sK24(sK0('$ki_local_world'))),X1)
| '$ki_accessible'(X1,sK17(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X1))
| '$ki_accessible'(X1,sK16(sK1(sK0('$ki_local_world')),X0,X1))
| ~ '$ki_accessible'(X1,X2)
| in(X2,X0,sK1(sK24(sK0('$ki_local_world')))) ) ).
cnf(u3044,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK0(sK26)),X0)
| '$ki_accessible'(X0,sK15(sK27,sK1(sK0(sK26)),X0))
| '$ki_accessible'(X0,sK14(sK27,sK1(sK0(sK0(sK26))),X0))
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK1(sK0(sK26)),sK1(sK0(sK0(sK26)))) ) ).
cnf(u4429,axiom,
( ~ '$ki_accessible'(sK0(sK24(sK0('$ki_local_world'))),X0)
| '$ki_accessible'(X0,sK5(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(sK1(sK0('$ki_local_world')),sK1(sK0(sK24(sK0('$ki_local_world'))))),set_intersection2(sK1(sK24(sK0('$ki_local_world'))),sK1(sK0(sK24(sK0('$ki_local_world')))))) ) ).
cnf(u4082,axiom,
( ~ '$ki_exists_in_world_$i'(sK24(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X0)
| '$ki_accessible'(X0,sK19(sK1(sK0('$ki_local_world')),X1,X0))
| ~ '$ki_accessible'(X0,X2)
| '$ki_accessible'(X2,sK18(sK1(sK0('$ki_local_world')),X1,X2)) ) ).
cnf(u2005,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK24(sK26)),X0)
| '$ki_accessible'(X0,sK5(sK27,sK1(sK24(sK26)),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(sK27,sK1(sK0(sK24(sK26)))),set_intersection2(sK1(sK24(sK26)),sK1(sK0(sK24(sK26))))) ) ).
cnf(u3476,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK24(sK26),X2)
| '$ki_accessible'(X0,sK15(sK27,X1,X0))
| ~ in(sK14(sK27,X3,X0),sK27,X3)
| ~ '$ki_accessible'(X0,X4)
| in(X4,X1,X3) ) ).
cnf(u4443,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK0(sK0('$ki_local_world'))),X0)
| ~ '$ki_accessible'(sK0(sK0(sK0('$ki_local_world'))),X1)
| '$ki_accessible'(X1,sK15(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X1))
| '$ki_accessible'(X1,sK14(sK1(sK0('$ki_local_world')),X0,X1))
| ~ '$ki_accessible'(X1,X2)
| in(X2,sK1(sK0(sK0('$ki_local_world'))),X0) ) ).
cnf(u3043,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK24(sK26)),X0)
| '$ki_accessible'(X0,sK15(sK27,sK1(sK24(sK26)),X0))
| '$ki_accessible'(X0,sK14(sK27,sK1(sK0(sK24(sK26))),X0))
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK1(sK24(sK26)),sK1(sK0(sK24(sK26)))) ) ).
cnf(u4116,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK30,X0)
| ~ '$ki_accessible'(sK30,X1)
| '$ki_accessible'(X1,sK17(sK1(sK26),sK29,X1))
| ~ in(sK16(sK1(sK26),X0,X1),X0,sK1(sK26))
| ~ '$ki_accessible'(X1,X2)
| in(X2,X0,sK29) ) ).
cnf(u4064,negated_conjecture,
( ~ disjoint(sK8(sK1(sK26),sK1(sK0(sK28)),X0),sK1(sK26),sK1(sK0(sK28)))
| '$ki_accessible'(X0,sK9(sK1(sK26),sK29,X0))
| ~ '$ki_accessible'(sK0(sK28),X0)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK29,sK1(sK0(sK28))) ) ).
cnf(u3461,negated_conjecture,
( ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK11(sK27,sK1(sK24(sK26)),X1))
| ~ disjoint(sK10(sK27,X2,X1),X2,sK27)
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,X2,sK1(sK24(sK26))) ) ).
cnf(u4089,negated_conjecture,
( ~ disjoint(sK10(sK1(sK26),sK1(sK30),X0),sK1(sK30),sK1(sK26))
| '$ki_accessible'(X0,sK11(sK1(sK26),sK1(sK28),X0))
| ~ '$ki_accessible'(sK30,X0)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK30),sK1(sK28)) ) ).
cnf(u4130,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(sK20(sK1(sK0('$ki_local_world')),X0,X1),X2)
| in(X2,sK1(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,singleton(sK1(sK0('$ki_local_world'))),X0) ) ).
cnf(u3475,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK28,X2)
| '$ki_accessible'(X0,sK15(sK27,X1,X0))
| ~ in(sK14(sK27,X3,X0),sK27,X3)
| ~ '$ki_accessible'(X0,X4)
| in(X4,X1,X3) ) ).
cnf(u3054,negated_conjecture,
( ~ '$ki_accessible'(sK31,X0)
| '$ki_accessible'(X0,sK17(sK27,sK29,X0))
| '$ki_accessible'(X0,sK16(sK27,sK1(sK31),X0))
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK1(sK31),sK29) ) ).
cnf(u4152,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK0(sK26)),X0)
| '$ki_accessible'(X0,sK15(sK1(sK26),sK1(sK0(sK26)),X0))
| '$ki_accessible'(X0,sK14(sK1(sK26),sK1(sK0(sK0(sK26))),X0))
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK1(sK0(sK26)),sK1(sK0(sK0(sK26)))) ) ).
cnf(u4079,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK28),X0)
| ~ '$ki_accessible'(sK0(sK28),X1)
| '$ki_accessible'(X1,sK11(sK1(sK26),sK29,X1))
| ~ disjoint(sK10(sK1(sK26),X0,X1),X0,sK1(sK26))
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,X0,sK29) ) ).
cnf(u4161,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK24(sK26)),X0)
| ~ '$ki_accessible'(sK0(sK24(sK26)),X1)
| '$ki_accessible'(X1,sK4(sK27,sK1(sK24(sK26)),X1))
| ~ qmltpeq(sK3(sK1(sK24(sK26)),X0,X1),sK1(sK24(sK26)),X0)
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,sK27,X0) ) ).
cnf(u4649,axiom,
( ~ disjoint(sK8(sK1(sK0('$ki_local_world')),sK1(sK0(sK24(sK0('$ki_local_world')))),X0),sK1(sK0('$ki_local_world')),sK1(sK0(sK24(sK0('$ki_local_world')))))
| '$ki_accessible'(X0,sK9(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X0))
| ~ '$ki_accessible'(sK0(sK24(sK0('$ki_local_world'))),X0)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK24(sK0('$ki_local_world'))),sK1(sK0(sK24(sK0('$ki_local_world'))))) ) ).
cnf(u4510,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK0(sK0('$ki_local_world'))),X0)
| ~ '$ki_accessible'(sK0(sK0(sK0('$ki_local_world'))),X1)
| '$ki_accessible'(X1,sK9(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X1))
| ~ disjoint(sK8(sK1(sK0('$ki_local_world')),X0,X1),sK1(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,sK1(sK0(sK0('$ki_local_world'))),X0) ) ).
cnf(u4347,axiom,
'$ki_accessible'(sK0(sK0(sK24(sK0('$ki_local_world')))),sK18(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),sK0(sK0(sK24(sK0('$ki_local_world')))))) ).
cnf(u4074,negated_conjecture,
( ~ qmltpeq(sK11(sK1(sK26),sK1(sK28),X1),sK1(sK26),sK1(sK28))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK10(sK1(sK26),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,X2,sK1(sK28)) ) ).
cnf(u3667,negated_conjecture,
( ~ '$ki_accessible'(sK31,X0)
| '$ki_accessible'(X0,sK9(sK1(sK26),sK29,X0))
| '$ki_accessible'(X0,sK8(sK1(sK26),sK1(sK31),X0))
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK29,sK1(sK31)) ) ).
cnf(u2731,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK0(sK26),X2)
| '$ki_accessible'(X0,sK11(sK27,X1,X0))
| '$ki_accessible'(X0,sK10(sK27,X3,X0))
| ~ '$ki_accessible'(X0,X4)
| disjoint(X4,X3,X1) ) ).
cnf(u4418,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK24(sK0('$ki_local_world'))),X0)
| ~ '$ki_accessible'(sK0(sK24(sK0('$ki_local_world'))),X1)
| '$ki_accessible'(X1,sK6(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X1))
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,set_intersection2(X0,sK1(sK0('$ki_local_world'))),set_intersection2(X0,sK1(sK24(sK0('$ki_local_world'))))) ) ).
cnf(u4517,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK24(sK0('$ki_local_world'))),X0)
| ~ '$ki_accessible'(sK0(sK24(sK0('$ki_local_world'))),X1)
| '$ki_accessible'(X1,sK4(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X1))
| ~ qmltpeq(sK3(sK1(sK24(sK0('$ki_local_world'))),X0,X1),sK1(sK24(sK0('$ki_local_world'))),X0)
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,sK1(sK0('$ki_local_world')),X0) ) ).
cnf(u4440,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK0(sK0('$ki_local_world'))),X0)
| ~ '$ki_accessible'(sK0(sK0(sK0('$ki_local_world'))),X1)
| '$ki_accessible'(X1,sK11(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X1))
| '$ki_accessible'(X1,sK10(sK1(sK0('$ki_local_world')),X0,X1))
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,X0,sK1(sK0(sK0('$ki_local_world')))) ) ).
cnf(u1536,negated_conjecture,
( ~ qmltpeq(sK4(sK1(sK26),sK1(sK24(sK26)),X1),sK1(sK26),sK1(sK24(sK26)))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| ~ qmltpeq(sK3(sK1(sK24(sK26)),X2,X1),sK1(sK24(sK26)),X2)
| ~ '$ki_accessible'(X1,X3)
| qmltpeq(X3,sK1(sK26),X2) ) ).
cnf(u4081,negated_conjecture,
( ~ disjoint(sK10(sK1(sK26),sK1(sK30),X0),sK1(sK30),sK1(sK26))
| '$ki_accessible'(X0,sK11(sK1(sK26),sK29,X0))
| ~ '$ki_accessible'(sK30,X0)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK30),sK29) ) ).
cnf(u3375,negated_conjecture,
( ~ qmltpeq(sK4(sK27,sK29,X1),sK27,sK29)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK3(sK29,X2,X1))
| ~ '$ki_accessible'(X1,X3)
| qmltpeq(X3,sK27,X2) ) ).
cnf(u2230,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK28),X0)
| '$ki_accessible'(X0,sK5(sK1(sK26),sK29,X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(sK1(sK26),sK1(sK0(sK28))),set_intersection2(sK29,sK1(sK0(sK28)))) ) ).
cnf(u4425,axiom,
( ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK15(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X1))
| '$ki_accessible'(X1,sK14(sK1(sK0('$ki_local_world')),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| in(X3,sK1(sK24(sK0('$ki_local_world'))),X2) ) ).
cnf(u1137,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X3)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| ~ qmltpeq(sK6(sK1(sK26),X3,X1),sK1(sK26),X3)
| ~ '$ki_accessible'(X1,X4)
| qmltpeq(X4,set_intersection2(X2,sK1(sK26)),set_intersection2(X2,X3)) ) ).
cnf(u3046,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK24(sK26),X2)
| '$ki_accessible'(X0,sK17(sK27,X1,X0))
| '$ki_accessible'(X0,sK16(sK27,X3,X0))
| ~ '$ki_accessible'(X0,X4)
| in(X4,X3,X1) ) ).
cnf(u1039,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| '$ki_accessible'(X0,sK7(sK1(sK26),sK1(sK28),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,singleton(sK1(sK26)),singleton(sK1(sK28))) ) ).
cnf(u4455,axiom,
( ~ '$ki_accessible'(sK0(sK24(sK0('$ki_local_world'))),X0)
| '$ki_accessible'(X0,sK17(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X0))
| '$ki_accessible'(X0,sK16(sK1(sK0('$ki_local_world')),sK1(sK0(sK24(sK0('$ki_local_world')))),X0))
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK1(sK0(sK24(sK0('$ki_local_world')))),sK1(sK24(sK0('$ki_local_world')))) ) ).
cnf(u4092,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X0)
| '$ki_accessible'(X0,sK13(sK1(sK0('$ki_local_world')),X1,X0))
| '$ki_accessible'(X0,sK12(sK1(sK0('$ki_local_world')),X0))
| ~ '$ki_accessible'(X0,X2)
| empty(X2,X1) ) ).
cnf(u2317,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK24(sK26)),X0)
| '$ki_accessible'(X0,sK5(sK1(sK26),sK1(sK24(sK26)),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(sK1(sK26),sK1(sK0(sK24(sK26)))),set_intersection2(sK1(sK24(sK26)),sK1(sK0(sK24(sK26))))) ) ).
cnf(u2138,negated_conjecture,
( ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ '$ki_accessible'(X0,X2)
| '$ki_accessible'(X2,sK6(sK27,sK1(sK24(sK26)),X2))
| ~ '$ki_accessible'(X2,X3)
| qmltpeq(X3,set_intersection2(X1,sK27),set_intersection2(X1,sK1(sK24(sK26)))) ) ).
cnf(u3053,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK28),X0)
| ~ '$ki_accessible'(sK0(sK28),X1)
| '$ki_accessible'(X1,sK17(sK27,sK29,X1))
| '$ki_accessible'(X1,sK16(sK27,X0,X1))
| ~ '$ki_accessible'(X1,X2)
| in(X2,X0,sK29) ) ).
cnf(u4400,axiom,
( ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X0)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ '$ki_accessible'(X0,X2)
| '$ki_accessible'(X2,sK5(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X2))
| ~ '$ki_accessible'(X2,X3)
| qmltpeq(X3,set_intersection2(sK1(sK0('$ki_local_world')),X1),set_intersection2(sK1(sK24(sK0('$ki_local_world'))),X1)) ) ).
cnf(u1546,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X1)
| ~ '$ki_accessible'(sK24(sK26),X0)
| '$ki_accessible'(X0,sK21(sK27,X1,X0))
| ~ '$ki_accessible'(X0,X2)
| qmltpeq(X2,set_intersection2(X1,singleton(sK27)),singleton(sK27)) ) ).
cnf(u4091,axiom,
( ~ '$ki_exists_in_world_$i'(sK24(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X0)
| '$ki_accessible'(X0,sK13(sK1(sK0('$ki_local_world')),X1,X0))
| '$ki_accessible'(X0,sK12(sK1(sK0('$ki_local_world')),X0))
| ~ '$ki_accessible'(X0,X2)
| empty(X2,X1) ) ).
cnf(u1744,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X1)
| qmltpeq(X1,set_intersection2(sK1(sK0('$ki_local_world')),X0),set_intersection2(X0,sK1(sK0('$ki_local_world')))) ) ).
cnf(u1208,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK26),X0)
| '$ki_accessible'(X0,sK19(sK27,sK1(sK0(sK26)),X0))
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK18(sK27,sK1(sK0(sK26)),X1)) ) ).
cnf(u4222,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK0(sK26)),X0)
| ~ '$ki_accessible'(sK0(sK0(sK26)),X1)
| '$ki_accessible'(X1,sK11(sK1(sK26),sK1(sK0(sK26)),X1))
| ~ disjoint(sK10(sK1(sK26),X0,X1),X0,sK1(sK26))
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,X0,sK1(sK0(sK26))) ) ).
cnf(u1000,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X3)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| ~ qmltpeq(sK5(sK27,X3,X1),sK27,X3)
| ~ '$ki_accessible'(X1,X4)
| qmltpeq(X4,set_intersection2(sK27,X2),set_intersection2(X3,X2)) ) ).
cnf(u1401,negated_conjecture,
( ~ qmltpeq(sK15(sK27,sK1(sK24(sK26)),X1),sK27,sK1(sK24(sK26)))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| ~ in(sK14(sK27,X2,X1),sK27,X2)
| ~ '$ki_accessible'(X1,X3)
| in(X3,sK1(sK24(sK26)),X2) ) ).
cnf(u3158,negated_conjecture,
( ~ '$ki_accessible'(sK30,X0)
| '$ki_accessible'(X0,sK17(sK27,sK1(sK28),X0))
| '$ki_accessible'(X0,sK16(sK27,sK1(sK30),X0))
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK1(sK30),sK1(sK28)) ) ).
cnf(u4415,axiom,
( ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK4(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X1))
| '$ki_accessible'(X1,sK3(sK1(sK24(sK0('$ki_local_world'))),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| qmltpeq(X3,sK1(sK0('$ki_local_world')),X2) ) ).
cnf(u4231,negated_conjecture,
( ~ disjoint(sK10(sK1(sK26),sK1(sK0(sK24(sK26))),X0),sK1(sK0(sK24(sK26))),sK1(sK26))
| '$ki_accessible'(X0,sK11(sK1(sK26),sK1(sK24(sK26)),X0))
| ~ '$ki_accessible'(sK0(sK24(sK26)),X0)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK0(sK24(sK26))),sK1(sK24(sK26))) ) ).
cnf(u3388,negated_conjecture,
( ~ qmltpeq(sK3(sK29,sK1(sK31),X0),sK29,sK1(sK31))
| '$ki_accessible'(X0,sK4(sK27,sK29,X0))
| ~ '$ki_accessible'(sK31,X0)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,sK27,sK1(sK31)) ) ).
cnf(u4253,axiom,
( ~ '$ki_exists_in_world_$i'(sK24(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X2)
| ~ qmltpeq(sK17(sK1(sK0('$ki_local_world')),X0,X1),sK1(sK0('$ki_local_world')),X0)
| '$ki_accessible'(X1,sK16(sK1(sK0('$ki_local_world')),X3,X1))
| ~ '$ki_accessible'(X1,X4)
| in(X4,X3,X0) ) ).
cnf(u924,negated_conjecture,
( ~ '$ki_accessible'(sK26,X2)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X1)
| '$ki_accessible'(X0,sK7(sK27,X1,X0))
| ~ '$ki_accessible'(X0,X3)
| qmltpeq(X3,singleton(sK27),singleton(X1)) ) ).
cnf(u3373,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK24(sK26),X2)
| ~ qmltpeq(sK4(sK27,X0,X1),sK27,X0)
| '$ki_accessible'(X1,sK3(X0,X3,X1))
| ~ '$ki_accessible'(X1,X4)
| qmltpeq(X4,sK27,X3) ) ).
cnf(u180,axiom,
( ~ '$ki_accessible'('$ki_local_world',X0)
| ~ '$ki_accessible'(X4,X5)
| '$ki_accessible'(X4,sK19(X1,X3,X4))
| ~ '$ki_accessible'(X2,X4)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| '$ki_accessible'(X5,sK18(X1,X3,X5)) ) ).
cnf(u3387,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK28),X0)
| ~ '$ki_accessible'(sK0(sK28),X1)
| '$ki_accessible'(X1,sK4(sK27,sK29,X1))
| ~ qmltpeq(sK3(sK29,X0,X1),sK29,X0)
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,sK27,X0) ) ).
cnf(u274,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK27,sK29),set_intersection2(sK29,sK27))
| ~ '$ki_accessible'(sK28,X0) ) ).
cnf(u1754,negated_conjecture,
( ~ '$ki_accessible'(sK26,X2)
| ~ qmltpeq(sK13(sK27,X1,X0),sK27,X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X1)
| '$ki_accessible'(X0,sK12(sK27,X0))
| ~ '$ki_accessible'(X0,X3)
| empty(X3,X1) ) ).
cnf(u1040,negated_conjecture,
( ~ '$ki_accessible'(sK26,X4)
| ~ qmltpeq(sK15(sK27,X2,X1),sK27,X2)
| ~ '$ki_accessible'(X3,X1)
| ~ '$ki_exists_in_world_$i'(X3,X0)
| ~ '$ki_accessible'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X4,X2)
| ~ in(sK14(sK27,X0,X1),sK27,X0)
| ~ '$ki_accessible'(X1,X5)
| in(X5,X2,X0) ) ).
cnf(u832,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X1)
| ~ '$ki_accessible'(sK24(sK26),X0)
| '$ki_accessible'(X0,sK20(sK1(sK26),X1,X0))
| ~ '$ki_accessible'(X0,X2)
| disjoint(X2,singleton(sK1(sK26)),X1) ) ).
cnf(u923,negated_conjecture,
( ~ in(sK19(sK1(sK26),sK1(sK24(sK26)),X0),sK1(sK26),sK1(sK24(sK26)))
| ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| ~ in(sK18(sK1(sK26),sK1(sK24(sK26)),X1),sK1(sK24(sK26)),sK1(sK26)) ) ).
cnf(u296,negated_conjecture,
( ~ qmltpeq(sK2(sK27,sK1(sK24(sK26)),X0),sK27,sK1(sK24(sK26)))
| ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,sK1(sK24(sK26)),sK27) ) ).
cnf(u1537,negated_conjecture,
( ~ qmltpeq(sK4(sK1(sK26),sK1(sK0(sK26)),X1),sK1(sK26),sK1(sK0(sK26)))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| ~ qmltpeq(sK3(sK1(sK0(sK26)),X2,X1),sK1(sK0(sK26)),X2)
| ~ '$ki_accessible'(X1,X3)
| qmltpeq(X3,sK1(sK26),X2) ) ).
cnf(u203,negated_conjecture,
'$ki_accessible'(sK28,sK30) ).
cnf(u2463,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK31,X0)
| ~ '$ki_accessible'(sK31,X1)
| '$ki_accessible'(X1,sK4(sK27,sK29,X1))
| '$ki_accessible'(X1,sK3(sK29,X0,X1))
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,sK27,X0) ) ).
cnf(u3574,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK0(sK26),X2)
| '$ki_accessible'(X0,sK11(sK1(sK26),X1,X0))
| '$ki_accessible'(X0,sK10(sK1(sK26),X3,X0))
| ~ '$ki_accessible'(X0,X4)
| disjoint(X4,X3,X1) ) ).
cnf(u3676,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK28),X0)
| '$ki_accessible'(X0,sK9(sK1(sK26),sK29,X0))
| '$ki_accessible'(X0,sK8(sK1(sK26),sK1(sK0(sK28)),X0))
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK29,sK1(sK0(sK28))) ) ).
cnf(u1743,axiom,
( ~ '$ki_exists_in_world_$i'(sK24(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X1)
| qmltpeq(X1,set_intersection2(sK1(sK0('$ki_local_world')),X0),set_intersection2(X0,sK1(sK0('$ki_local_world')))) ) ).
cnf(u281,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK1(sK26),sK29),set_intersection2(sK29,sK1(sK26)))
| ~ '$ki_accessible'(sK28,X0) ) ).
cnf(u1207,negated_conjecture,
( ~ qmltpeq(sK6(sK1(sK26),sK1(sK24(sK26)),X2),sK1(sK26),sK1(sK24(sK26)))
| ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ '$ki_accessible'(X2,X3)
| qmltpeq(X3,set_intersection2(X1,sK1(sK26)),set_intersection2(X1,sK1(sK24(sK26)))) ) ).
cnf(u3468,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK28,X2)
| ~ qmltpeq(sK15(sK27,X0,X1),sK27,X0)
| '$ki_accessible'(X1,sK14(sK27,X3,X1))
| ~ '$ki_accessible'(X1,X4)
| in(X4,X0,X3) ) ).
cnf(u934,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X1)
| ~ '$ki_accessible'(sK0(sK26),X0)
| ~ in(sK21(sK1(sK26),X1,X0),sK1(sK26),X1)
| ~ '$ki_accessible'(X0,X2)
| qmltpeq(X2,set_intersection2(X1,singleton(sK1(sK26))),singleton(sK1(sK26))) ) ).
cnf(u311,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X1)
| ~ '$ki_accessible'(sK0(sK26),X0)
| '$ki_accessible'(X0,sK2(sK27,X1,X0))
| ~ '$ki_accessible'(X0,X2)
| qmltpeq(X2,X1,sK27) ) ).
cnf(u1434,negated_conjecture,
'$ki_accessible'(sK12(sK27,sK30),sK18(sK1(sK26),sK1(sK28),sK12(sK27,sK30))) ).
cnf(u1794,axiom,
( ~ '$ki_exists_in_world_$i'(sK24(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X0)
| ~ in(sK19(sK1(sK0('$ki_local_world')),X1,X0),sK1(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(X0,X2)
| ~ in(sK18(sK1(sK0('$ki_local_world')),X1,X2),X1,sK1(sK0('$ki_local_world'))) ) ).
cnf(u1980,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK28),X0)
| '$ki_accessible'(X0,sK5(sK27,sK1(sK28),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(sK27,sK1(sK0(sK28))),set_intersection2(sK1(sK28),sK1(sK0(sK28)))) ) ).
cnf(u1316,negated_conjecture,
( ~ qmltpeq(sK9(sK27,sK1(sK0(sK26)),X1),sK27,sK1(sK0(sK26)))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| ~ disjoint(sK8(sK27,X2,X1),sK27,X2)
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,sK1(sK0(sK26)),X2) ) ).
cnf(u149,axiom,
( ~ '$ki_accessible'('$ki_local_world',X0)
| ~ '$ki_accessible'(X4,X5)
| ~ qmltpeq(sK2(X1,X3,X4),X1,X3)
| ~ '$ki_accessible'(X2,X4)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| qmltpeq(X5,X3,X1) ) ).
cnf(u1772,axiom,
( ~ disjoint(sK25(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X0),sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))))
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK24(sK0('$ki_local_world'))),sK1(sK0('$ki_local_world'))) ) ).
cnf(u3467,negated_conjecture,
( ~ disjoint(sK10(sK27,sK1(sK0(sK0(sK26))),X0),sK1(sK0(sK0(sK26))),sK27)
| '$ki_accessible'(X0,sK11(sK27,sK1(sK0(sK26)),X0))
| ~ '$ki_accessible'(sK0(sK0(sK26)),X0)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK0(sK0(sK26))),sK1(sK0(sK26))) ) ).
cnf(u453,negated_conjecture,
( ~ qmltpeq(sK7(sK27,sK29,X0),sK27,sK29)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,singleton(sK27),singleton(sK29)) ) ).
cnf(u941,negated_conjecture,
( ~ in(sK21(sK1(sK26),sK1(sK24(sK26)),X0),sK1(sK26),sK1(sK24(sK26)))
| ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(sK1(sK24(sK26)),singleton(sK1(sK26))),singleton(sK1(sK26))) ) ).
cnf(u3378,negated_conjecture,
( ~ qmltpeq(sK4(sK27,sK1(sK0(sK26)),X1),sK27,sK1(sK0(sK26)))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK3(sK1(sK0(sK26)),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| qmltpeq(X3,sK27,X2) ) ).
cnf(u163,axiom,
( ~ '$ki_accessible'('$ki_local_world',X0)
| ~ '$ki_accessible'(X6,X7)
| ~ disjoint(sK8(X1,X5,X6),X1,X5)
| ~ qmltpeq(sK9(X1,X3,X6),X1,X3)
| ~ '$ki_accessible'(X4,X6)
| ~ '$ki_exists_in_world_$i'(X4,X5)
| ~ '$ki_accessible'(X2,X4)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| disjoint(X7,X3,X5) ) ).
cnf(u1547,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X1)
| ~ '$ki_accessible'(sK0(sK26),X0)
| '$ki_accessible'(X0,sK21(sK27,X1,X0))
| ~ '$ki_accessible'(X0,X2)
| qmltpeq(X2,set_intersection2(X1,singleton(sK27)),singleton(sK27)) ) ).
cnf(u1441,negated_conjecture,
'$ki_accessible'(sK12(sK27,sK0(sK28)),sK18(sK27,sK1(sK28),sK12(sK27,sK0(sK28)))) ).
cnf(u1801,axiom,
( ~ in(sK19(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X0),sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))))
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X0,X1)
| ~ in(sK18(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X1),sK1(sK24(sK0('$ki_local_world'))),sK1(sK0('$ki_local_world'))) ) ).
cnf(u1315,negated_conjecture,
( ~ qmltpeq(sK9(sK27,sK1(sK24(sK26)),X1),sK27,sK1(sK24(sK26)))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| ~ disjoint(sK8(sK27,X2,X1),sK27,X2)
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,sK1(sK24(sK26)),X2) ) ).
cnf(u185,axiom,
( ~ '$ki_accessible'('$ki_local_world',X0)
| ~ '$ki_accessible'(X2,X4)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| qmltpeq(X4,set_intersection2(X1,X1),X1) ) ).
cnf(u2007,negated_conjecture,
( ~ '$ki_accessible'(sK26,X4)
| '$ki_accessible'(X0,sK9(sK27,X2,X0))
| ~ '$ki_accessible'(X3,X0)
| ~ '$ki_exists_in_world_$i'(X3,X1)
| ~ '$ki_accessible'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X4,X2)
| '$ki_accessible'(X0,sK8(sK27,X1,X0))
| ~ '$ki_accessible'(X0,X5)
| disjoint(X5,X2,X1) ) ).
cnf(u489,negated_conjecture,
( ~ '$ki_accessible'(sK26,X2)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X0)
| ~ in(sK19(sK27,X0,X1),sK27,X0)
| ~ '$ki_accessible'(X1,X3)
| '$ki_accessible'(X3,sK18(sK27,X0,X3)) ) ).
cnf(u3385,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK31,X0)
| ~ '$ki_accessible'(sK31,X1)
| '$ki_accessible'(X1,sK4(sK27,sK29,X1))
| ~ qmltpeq(sK3(sK29,X0,X1),sK29,X0)
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,sK27,X0) ) ).
cnf(u198,negated_conjecture,
'$ki_exists_in_world_$i'(sK26,sK27) ).
cnf(u1812,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_accessible'(sK20(sK27,sK1(sK0(sK26)),X0),X1)
| in(X1,sK27,sK1(sK0(sK26)))
| ~ '$ki_accessible'(X0,X2)
| disjoint(X2,singleton(sK27),sK1(sK0(sK26))) ) ).
cnf(u1862,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_accessible'(sK20(sK1(sK26),sK1(sK0(sK26)),X0),X1)
| in(X1,sK1(sK26),sK1(sK0(sK26)))
| ~ '$ki_accessible'(X0,X2)
| disjoint(X2,singleton(sK1(sK26)),sK1(sK0(sK26))) ) ).
cnf(u2002,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ '$ki_accessible'(X0,X2)
| '$ki_accessible'(X2,sK5(sK27,sK1(sK0(sK26)),X2))
| ~ '$ki_accessible'(X2,X3)
| qmltpeq(X3,set_intersection2(sK27,X1),set_intersection2(sK1(sK0(sK26)),X1)) ) ).
cnf(u2567,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK24(sK26)),X0)
| '$ki_accessible'(X0,sK4(sK27,sK1(sK24(sK26)),X0))
| '$ki_accessible'(X0,sK3(sK1(sK24(sK26)),sK1(sK0(sK24(sK26))),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,sK27,sK1(sK0(sK24(sK26)))) ) ).
cnf(u413,axiom,
( ~ '$ki_exists_in_world_$i'(sK0('$ki_local_world'),X2)
| '$ki_accessible'(X0,sK7(X2,X3,X0))
| ~ '$ki_accessible'(X4,X0)
| ~ '$ki_exists_in_world_$i'(X4,X3)
| ~ '$ki_accessible'(sK0('$ki_local_world'),X4)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,singleton(X2),singleton(X3)) ) ).
cnf(u802,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK26,X2)
| '$ki_accessible'(X0,sK12(X2,X0))
| ~ qmltpeq(sK13(X2,X3,X0),X2,X3)
| ~ '$ki_accessible'(X4,X0)
| ~ '$ki_exists_in_world_$i'(X4,X3)
| ~ '$ki_accessible'(sK26,X4)
| ~ '$ki_accessible'(X0,X1)
| empty(X1,X3) ) ).
cnf(u1524,negated_conjecture,
( ~ '$ki_accessible'(sK24(sK26),X0)
| '$ki_accessible'(X0,sK13(sK1(sK26),sK1(sK24(sK26)),X0))
| '$ki_accessible'(X0,sK12(sK1(sK26),X0))
| ~ '$ki_accessible'(X0,X1)
| empty(X1,sK1(sK24(sK26))) ) ).
cnf(u594,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK26,X4)
| ~ qmltpeq(sK3(X2,X3,X0),X2,X3)
| ~ qmltpeq(sK4(X4,X2,X0),X4,X2)
| ~ '$ki_accessible'(X5,X0)
| ~ '$ki_exists_in_world_$i'(X5,X3)
| ~ '$ki_accessible'(X6,X5)
| ~ '$ki_exists_in_world_$i'(X6,X2)
| ~ '$ki_accessible'(sK26,X6)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,X4,X3) ) ).
cnf(u1205,axiom,
( ~ '$ki_accessible'(sK0('$ki_local_world'),X2)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X0)
| ~ qmltpeq(sK2(sK1(sK0('$ki_local_world')),X0,X1),sK1(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X1,X3)
| qmltpeq(X3,X0,sK1(sK0('$ki_local_world'))) ) ).
cnf(u3458,negated_conjecture,
( ~ disjoint(sK10(sK27,sK1(sK30),X0),sK1(sK30),sK27)
| '$ki_accessible'(X0,sK11(sK27,sK1(sK28),X0))
| ~ '$ki_accessible'(sK30,X0)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK30),sK1(sK28)) ) ).
cnf(u1811,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK0('$ki_local_world')),X3)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X0,X1)
| ~ qmltpeq(sK5(sK1(sK0('$ki_local_world')),X3,X1),sK1(sK0('$ki_local_world')),X3)
| ~ '$ki_accessible'(X1,X4)
| qmltpeq(X4,set_intersection2(sK1(sK0('$ki_local_world')),X2),set_intersection2(X3,X2)) ) ).
cnf(u1869,negated_conjecture,
( ~ '$ki_accessible'(sK26,X4)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(X4,X2)
| ~ '$ki_exists_in_world_$i'(X4,X1)
| '$ki_accessible'(X0,sK5(sK1(sK26),X1,X0))
| ~ '$ki_accessible'(X0,X5)
| qmltpeq(X5,set_intersection2(sK1(sK26),X3),set_intersection2(X1,X3)) ) ).
cnf(u1755,negated_conjecture,
( ~ '$ki_accessible'(sK26,X2)
| ~ qmltpeq(sK13(sK1(sK26),X1,X0),sK1(sK26),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X1)
| '$ki_accessible'(X0,sK12(sK1(sK26),X0))
| ~ '$ki_accessible'(X0,X3)
| empty(X3,X1) ) ).
cnf(u4136,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK0(sK26)),X0)
| ~ '$ki_accessible'(sK0(sK0(sK26)),X1)
| '$ki_accessible'(X1,sK11(sK1(sK26),sK1(sK0(sK26)),X1))
| '$ki_accessible'(X1,sK10(sK1(sK26),X0,X1))
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,X0,sK1(sK0(sK26))) ) ).
cnf(u2009,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X3)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK6(sK27,X3,X1))
| ~ '$ki_accessible'(X1,X4)
| qmltpeq(X4,set_intersection2(X2,sK27),set_intersection2(X2,X3)) ) ).
cnf(u3480,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK15(sK27,sK1(sK28),X1))
| ~ in(sK14(sK27,X2,X1),sK27,X2)
| ~ '$ki_accessible'(X1,X3)
| in(X3,sK1(sK28),X2) ) ).
cnf(u1523,axiom,
( ~ '$ki_exists_in_world_$i'(sK0('$ki_local_world'),X4)
| ~ qmltpeq(sK3(X2,X3,X0),X2,X3)
| '$ki_accessible'(X0,sK4(X4,X2,X0))
| ~ '$ki_accessible'(X5,X0)
| ~ '$ki_exists_in_world_$i'(X5,X3)
| ~ '$ki_accessible'(X6,X5)
| ~ '$ki_exists_in_world_$i'(X6,X2)
| ~ '$ki_accessible'(sK0('$ki_local_world'),X6)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,X4,X3) ) ).
cnf(u158,axiom,
( ~ '$ki_accessible'('$ki_local_world',X0)
| ~ '$ki_accessible'(X4,X5)
| '$ki_accessible'(X4,sK7(X1,X3,X4))
| ~ '$ki_accessible'(X2,X4)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| qmltpeq(X5,singleton(X1),singleton(X3)) ) ).
cnf(u1015,negated_conjecture,
( ~ '$ki_accessible'(sK26,X4)
| ~ qmltpeq(sK11(sK27,X2,X1),sK27,X2)
| ~ '$ki_accessible'(X3,X1)
| ~ '$ki_exists_in_world_$i'(X3,X0)
| ~ '$ki_accessible'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X4,X2)
| ~ disjoint(sK10(sK27,X0,X1),X0,sK27)
| ~ '$ki_accessible'(X1,X5)
| disjoint(X5,X0,X2) ) ).
cnf(u3465,negated_conjecture,
( ~ disjoint(sK10(sK27,sK1(sK0(sK24(sK26))),X0),sK1(sK0(sK24(sK26))),sK27)
| '$ki_accessible'(X0,sK11(sK27,sK1(sK24(sK26)),X0))
| ~ '$ki_accessible'(sK0(sK24(sK26)),X0)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK0(sK24(sK26))),sK1(sK24(sK26))) ) ).
cnf(u1822,negated_conjecture,
( ~ qmltpeq(sK13(sK1(sK26),sK1(sK28),X0),sK1(sK26),sK1(sK28))
| ~ '$ki_accessible'(sK28,X0)
| '$ki_accessible'(X0,sK12(sK1(sK26),X0))
| ~ '$ki_accessible'(X0,X1)
| empty(X1,sK1(sK28)) ) ).
cnf(u4494,axiom,
( ~ qmltpeq(sK9(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X1),sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK8(sK1(sK0('$ki_local_world')),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,sK1(sK0(sK0('$ki_local_world'))),X2) ) ).
cnf(u2569,negated_conjecture,
( ~ '$ki_accessible'(sK26,X4)
| '$ki_accessible'(X1,sK17(sK1(sK26),X2,X1))
| ~ '$ki_accessible'(X3,X1)
| ~ '$ki_exists_in_world_$i'(X3,X0)
| ~ '$ki_accessible'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X4,X2)
| ~ in(sK16(sK1(sK26),X0,X1),X0,sK1(sK26))
| ~ '$ki_accessible'(X1,X5)
| in(X5,X0,X2) ) ).
cnf(u1356,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| '$ki_accessible'(X0,sK13(sK27,sK29,X0))
| '$ki_accessible'(X0,sK12(sK27,X0))
| ~ '$ki_accessible'(X0,X1)
| empty(X1,sK29) ) ).
cnf(u3495,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK28,X2)
| ~ qmltpeq(sK17(sK27,X0,X1),sK27,X0)
| '$ki_accessible'(X1,sK16(sK27,X3,X1))
| ~ '$ki_accessible'(X1,X4)
| in(X4,X3,X0) ) ).
cnf(u4516,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK0(sK0('$ki_local_world'))),X0)
| ~ '$ki_accessible'(sK0(sK0(sK0('$ki_local_world'))),X1)
| '$ki_accessible'(X1,sK17(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X1))
| ~ in(sK16(sK1(sK0('$ki_local_world')),X0,X1),X0,sK1(sK0('$ki_local_world')))
| ~ '$ki_accessible'(X1,X2)
| in(X2,X0,sK1(sK0(sK0('$ki_local_world')))) ) ).
cnf(u1276,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK28,X2)
| ~ qmltpeq(sK9(sK27,X0,X1),sK27,X0)
| ~ disjoint(sK8(sK27,X3,X1),sK27,X3)
| ~ '$ki_accessible'(X1,X4)
| disjoint(X4,X0,X3) ) ).
cnf(u1037,negated_conjecture,
( ~ qmltpeq(sK6(sK27,sK1(sK28),X2),sK27,sK1(sK28))
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ '$ki_accessible'(X2,X3)
| qmltpeq(X3,set_intersection2(X1,sK27),set_intersection2(X1,sK1(sK28))) ) ).
cnf(u2452,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK24(sK26)),X0)
| ~ '$ki_accessible'(sK0(sK24(sK26)),X1)
| '$ki_accessible'(X1,sK6(sK1(sK26),sK1(sK24(sK26)),X1))
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,set_intersection2(X0,sK1(sK26)),set_intersection2(X0,sK1(sK24(sK26)))) ) ).
cnf(u1829,axiom,
( ~ qmltpeq(sK6(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X2),sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))))
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ '$ki_accessible'(X2,X3)
| qmltpeq(X3,set_intersection2(X1,sK1(sK0('$ki_local_world'))),set_intersection2(X1,sK1(sK24(sK0('$ki_local_world'))))) ) ).
cnf(u4501,axiom,
( ~ qmltpeq(sK15(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X1),sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK14(sK1(sK0('$ki_local_world')),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| in(X3,sK1(sK24(sK0('$ki_local_world'))),X2) ) ).
cnf(u1773,axiom,
( ~ disjoint(sK25(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X0),sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))))
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK0(sK0('$ki_local_world'))),sK1(sK0('$ki_local_world'))) ) ).
cnf(u1355,negated_conjecture,
( ~ qmltpeq(sK15(sK27,sK1(sK28),X1),sK27,sK1(sK28))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| ~ in(sK14(sK27,X2,X1),sK27,X2)
| ~ '$ki_accessible'(X1,X3)
| in(X3,sK1(sK28),X2) ) ).
cnf(u2466,negated_conjecture,
( ~ '$ki_accessible'(sK31,X0)
| '$ki_accessible'(X0,sK4(sK27,sK29,X0))
| '$ki_accessible'(X0,sK3(sK29,sK1(sK31),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,sK27,sK1(sK31)) ) ).
cnf(u4424,axiom,
( ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK11(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X1))
| '$ki_accessible'(X1,sK10(sK1(sK0('$ki_local_world')),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,X2,sK1(sK0(sK0('$ki_local_world')))) ) ).
cnf(u4515,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK24(sK0('$ki_local_world'))),X0)
| ~ '$ki_accessible'(sK0(sK24(sK0('$ki_local_world'))),X1)
| '$ki_accessible'(X1,sK17(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X1))
| ~ in(sK16(sK1(sK0('$ki_local_world')),X0,X1),X0,sK1(sK0('$ki_local_world')))
| ~ '$ki_accessible'(X1,X2)
| in(X2,X0,sK1(sK24(sK0('$ki_local_world')))) ) ).
cnf(u2568,negated_conjecture,
( ~ '$ki_accessible'(sK26,X4)
| '$ki_accessible'(X1,sK17(sK27,X2,X1))
| ~ '$ki_accessible'(X3,X1)
| ~ '$ki_exists_in_world_$i'(X3,X0)
| ~ '$ki_accessible'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X4,X2)
| ~ in(sK16(sK27,X0,X1),X0,sK27)
| ~ '$ki_accessible'(X1,X5)
| in(X5,X0,X2) ) ).
cnf(u1017,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK26,X2)
| '$ki_accessible'(X0,sK6(X2,X3,X0))
| ~ '$ki_accessible'(X4,X0)
| ~ '$ki_exists_in_world_$i'(X4,X5)
| ~ '$ki_accessible'(X6,X4)
| ~ '$ki_exists_in_world_$i'(X6,X3)
| ~ '$ki_accessible'(sK26,X6)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(X5,X2),set_intersection2(X5,X3)) ) ).
cnf(u3680,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK30,X0)
| ~ '$ki_accessible'(sK30,X1)
| '$ki_accessible'(X1,sK9(sK1(sK26),sK1(sK28),X1))
| '$ki_accessible'(X1,sK8(sK1(sK26),X0,X1))
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,sK1(sK28),X0) ) ).
cnf(u2451,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ '$ki_accessible'(X0,X2)
| '$ki_accessible'(X2,sK6(sK1(sK26),sK1(sK0(sK26)),X2))
| ~ '$ki_accessible'(X2,X3)
| qmltpeq(X3,set_intersection2(X1,sK1(sK26)),set_intersection2(X1,sK1(sK0(sK26)))) ) ).
cnf(u726,negated_conjecture,
( ~ '$ki_accessible'(sK26,X2)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X1)
| '$ki_accessible'(X0,sK20(sK1(sK26),X1,X0))
| ~ '$ki_accessible'(X0,X3)
| disjoint(X3,singleton(sK1(sK26)),X1) ) ).
cnf(u4454,axiom,
( ~ '$ki_accessible'(sK0(sK0(sK0('$ki_local_world'))),X0)
| '$ki_accessible'(X0,sK15(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X0))
| '$ki_accessible'(X0,sK14(sK1(sK0('$ki_local_world')),sK1(sK0(sK0(sK0('$ki_local_world')))),X0))
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK1(sK0(sK0('$ki_local_world'))),sK1(sK0(sK0(sK0('$ki_local_world'))))) ) ).
cnf(u4439,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK24(sK0('$ki_local_world'))),X0)
| ~ '$ki_accessible'(sK0(sK24(sK0('$ki_local_world'))),X1)
| '$ki_accessible'(X1,sK11(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X1))
| '$ki_accessible'(X1,sK10(sK1(sK0('$ki_local_world')),X0,X1))
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,X0,sK1(sK24(sK0('$ki_local_world')))) ) ).
cnf(u3486,negated_conjecture,
( ~ in(sK14(sK27,sK1(sK0(sK28)),X0),sK27,sK1(sK0(sK28)))
| '$ki_accessible'(X0,sK15(sK27,sK29,X0))
| ~ '$ki_accessible'(sK0(sK28),X0)
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK29,sK1(sK0(sK28))) ) ).
cnf(u3508,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK17(sK27,sK29,X1))
| ~ in(sK16(sK27,X2,X1),X2,sK27)
| ~ '$ki_accessible'(X1,X3)
| in(X3,X2,sK29) ) ).
cnf(u4475,axiom,
( ~ qmltpeq(sK9(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X1),sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK8(sK1(sK0('$ki_local_world')),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,sK1(sK24(sK0('$ki_local_world'))),X2) ) ).
cnf(u2578,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK28),X0)
| ~ '$ki_accessible'(sK0(sK28),X1)
| '$ki_accessible'(X1,sK9(sK27,sK29,X1))
| '$ki_accessible'(X1,sK8(sK27,X0,X1))
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,sK29,X0) ) ).
cnf(u3493,negated_conjecture,
( ~ in(sK14(sK27,sK1(sK0(sK28)),X0),sK27,sK1(sK0(sK28)))
| '$ki_accessible'(X0,sK15(sK27,sK1(sK28),X0))
| ~ '$ki_accessible'(sK0(sK28),X0)
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK1(sK28),sK1(sK0(sK28))) ) ).
cnf(u4206,negated_conjecture,
( ~ qmltpeq(sK11(sK1(sK26),sK1(sK0(sK26)),X1),sK1(sK26),sK1(sK0(sK26)))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK10(sK1(sK26),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,X2,sK1(sK0(sK26))) ) ).
cnf(u2560,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK28),X0)
| '$ki_accessible'(X0,sK4(sK27,sK1(sK28),X0))
| '$ki_accessible'(X0,sK3(sK1(sK28),sK1(sK0(sK28)),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,sK27,sK1(sK0(sK28))) ) ).
cnf(u3507,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK0(sK26),X2)
| '$ki_accessible'(X0,sK17(sK27,X1,X0))
| ~ in(sK16(sK27,X3,X0),X3,sK27)
| ~ '$ki_accessible'(X0,X4)
| in(X4,X3,X1) ) ).
cnf(u1782,axiom,
( ~ qmltpeq(sK7(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X0),sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))))
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,singleton(sK1(sK0('$ki_local_world'))),singleton(sK1(sK0(sK0('$ki_local_world'))))) ) ).
cnf(u2249,negated_conjecture,
( ~ '$ki_accessible'(sK26,X4)
| '$ki_accessible'(X2,sK4(sK27,X0,X2))
| ~ '$ki_accessible'(X3,X2)
| ~ '$ki_exists_in_world_$i'(X3,X1)
| ~ '$ki_accessible'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X4,X0)
| ~ qmltpeq(sK3(X0,X1,X2),X0,X1)
| ~ '$ki_accessible'(X2,X5)
| qmltpeq(X5,sK27,X1) ) ).
cnf(u2142,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK24(sK26)),X0)
| '$ki_accessible'(X0,sK6(sK27,sK1(sK24(sK26)),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(sK1(sK0(sK24(sK26))),sK27),set_intersection2(sK1(sK0(sK24(sK26))),sK1(sK24(sK26)))) ) ).
cnf(u4100,negated_conjecture,
( ~ in(sK14(sK1(sK26),sK1(sK31),X0),sK1(sK26),sK1(sK31))
| '$ki_accessible'(X0,sK15(sK1(sK26),sK29,X0))
| ~ '$ki_accessible'(sK31,X0)
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK29,sK1(sK31)) ) ).
cnf(u3679,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK31,X0)
| ~ '$ki_accessible'(sK31,X1)
| '$ki_accessible'(X1,sK9(sK1(sK26),sK1(sK28),X1))
| '$ki_accessible'(X1,sK8(sK1(sK26),X0,X1))
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,sK1(sK28),X0) ) ).
cnf(u4237,negated_conjecture,
( ~ in(sK16(sK1(sK26),sK1(sK0(sK24(sK26))),X0),sK1(sK0(sK24(sK26))),sK1(sK26))
| '$ki_accessible'(X0,sK17(sK1(sK26),sK1(sK24(sK26)),X0))
| ~ '$ki_accessible'(sK0(sK24(sK26)),X0)
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK1(sK0(sK24(sK26))),sK1(sK24(sK26))) ) ).
cnf(u4114,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK17(sK1(sK26),sK1(sK28),X1))
| ~ in(sK16(sK1(sK26),X2,X1),X2,sK1(sK26))
| ~ '$ki_accessible'(X1,X3)
| in(X3,X2,sK1(sK28)) ) ).
cnf(u4193,axiom,
( ~ '$ki_exists_in_world_$i'(sK24(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X2)
| '$ki_accessible'(X0,sK17(sK1(sK0('$ki_local_world')),X1,X0))
| '$ki_accessible'(X0,sK16(sK1(sK0('$ki_local_world')),X3,X0))
| ~ '$ki_accessible'(X0,X4)
| in(X4,X3,X1) ) ).
cnf(u4251,axiom,
( ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X0)
| '$ki_accessible'(X0,sK2(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,sK1(sK24(sK0('$ki_local_world'))),sK1(sK0('$ki_local_world'))) ) ).
cnf(u2661,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK31,X0)
| ~ '$ki_accessible'(sK31,X1)
| '$ki_accessible'(X1,sK9(sK27,sK1(sK28),X1))
| '$ki_accessible'(X1,sK8(sK27,X0,X1))
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,sK1(sK28),X0) ) ).
cnf(u4223,axiom,
( ~ '$ki_exists_in_world_$i'(sK24(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X2)
| ~ qmltpeq(sK9(sK1(sK0('$ki_local_world')),X0,X1),sK1(sK0('$ki_local_world')),X0)
| '$ki_accessible'(X1,sK8(sK1(sK0('$ki_local_world')),X3,X1))
| ~ '$ki_accessible'(X1,X4)
| disjoint(X4,X0,X3) ) ).
cnf(u4436,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK0(sK0('$ki_local_world'))),X0)
| ~ '$ki_accessible'(sK0(sK0(sK0('$ki_local_world'))),X1)
| '$ki_accessible'(X1,sK4(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X1))
| '$ki_accessible'(X1,sK3(sK1(sK0(sK0('$ki_local_world'))),X0,X1))
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,sK1(sK0('$ki_local_world')),X0) ) ).
cnf(u4450,axiom,
( ~ '$ki_accessible'(sK0(sK24(sK0('$ki_local_world'))),X0)
| '$ki_accessible'(X0,sK11(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X0))
| '$ki_accessible'(X0,sK10(sK1(sK0('$ki_local_world')),sK1(sK0(sK24(sK0('$ki_local_world')))),X0))
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK0(sK24(sK0('$ki_local_world')))),sK1(sK24(sK0('$ki_local_world')))) ) ).
cnf(u2570,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK0(sK26)),X0)
| '$ki_accessible'(X0,sK4(sK27,sK1(sK0(sK26)),X0))
| '$ki_accessible'(X0,sK3(sK1(sK0(sK26)),sK1(sK0(sK0(sK26))),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,sK27,sK1(sK0(sK0(sK26)))) ) ).
cnf(u4421,axiom,
( ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK9(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X1))
| '$ki_accessible'(X1,sK8(sK1(sK0('$ki_local_world')),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,sK1(sK24(sK0('$ki_local_world'))),X2) ) ).
cnf(u3377,negated_conjecture,
( ~ qmltpeq(sK4(sK27,sK1(sK24(sK26)),X1),sK27,sK1(sK24(sK26)))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK3(sK1(sK24(sK26)),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| qmltpeq(X3,sK27,X2) ) ).
cnf(u3681,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK28),X0)
| ~ '$ki_accessible'(sK0(sK28),X1)
| '$ki_accessible'(X1,sK9(sK1(sK26),sK1(sK28),X1))
| '$ki_accessible'(X1,sK8(sK1(sK26),X0,X1))
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,sK1(sK28),X0) ) ).
cnf(u4435,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK24(sK0('$ki_local_world'))),X0)
| ~ '$ki_accessible'(sK0(sK24(sK0('$ki_local_world'))),X1)
| '$ki_accessible'(X1,sK4(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X1))
| '$ki_accessible'(X1,sK3(sK1(sK24(sK0('$ki_local_world'))),X0,X1))
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,sK1(sK0('$ki_local_world')),X0) ) ).
cnf(u3985,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK28),X0)
| '$ki_accessible'(X0,sK17(sK1(sK26),sK1(sK28),X0))
| '$ki_accessible'(X0,sK16(sK1(sK26),sK1(sK0(sK28)),X0))
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK1(sK0(sK28)),sK1(sK28)) ) ).
cnf(u3198,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK17(sK27,sK1(sK0(sK26)),X1))
| '$ki_accessible'(X1,sK16(sK27,X2,X1))
| ~ '$ki_accessible'(X1,X3)
| in(X3,X2,sK1(sK0(sK26))) ) ).
cnf(u4014,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK30,X0)
| ~ '$ki_accessible'(sK30,X1)
| '$ki_accessible'(X1,sK4(sK1(sK26),sK29,X1))
| ~ qmltpeq(sK3(sK29,X0,X1),sK29,X0)
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,sK1(sK26),X0) ) ).
cnf(u2950,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK28),X0)
| '$ki_accessible'(X0,sK15(sK27,sK29,X0))
| '$ki_accessible'(X0,sK14(sK27,sK1(sK0(sK28)),X0))
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK29,sK1(sK0(sK28))) ) ).
cnf(u3472,negated_conjecture,
( ~ qmltpeq(sK15(sK27,sK1(sK28),X1),sK27,sK1(sK28))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK14(sK27,X2,X1))
| ~ '$ki_accessible'(X1,X3)
| in(X3,sK1(sK28),X2) ) ).
cnf(u4021,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK0(sK26),X2)
| ~ qmltpeq(sK17(sK1(sK26),X0,X1),sK1(sK26),X0)
| '$ki_accessible'(X1,sK16(sK1(sK26),X3,X1))
| ~ '$ki_accessible'(X1,X4)
| in(X4,X3,X0) ) ).
cnf(u4410,axiom,
( ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X0)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ '$ki_accessible'(X0,X2)
| '$ki_accessible'(X2,sK5(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X2))
| ~ '$ki_accessible'(X2,X3)
| qmltpeq(X3,set_intersection2(sK1(sK0('$ki_local_world')),X1),set_intersection2(sK1(sK0(sK0('$ki_local_world'))),X1)) ) ).
cnf(u3457,negated_conjecture,
( ~ disjoint(sK10(sK27,sK1(sK31),X0),sK1(sK31),sK27)
| '$ki_accessible'(X0,sK11(sK27,sK1(sK28),X0))
| ~ '$ki_accessible'(sK31,X0)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK31),sK1(sK28)) ) ).
cnf(u1856,axiom,
( ~ '$ki_exists_in_world_$i'(sK0('$ki_local_world'),X2)
| '$ki_accessible'(X0,sK16(X2,X3,X0))
| ~ qmltpeq(sK17(X2,X4,X0),X2,X4)
| ~ '$ki_accessible'(X5,X0)
| ~ '$ki_exists_in_world_$i'(X5,X3)
| ~ '$ki_accessible'(X6,X5)
| ~ '$ki_exists_in_world_$i'(X6,X4)
| ~ '$ki_accessible'(sK0('$ki_local_world'),X6)
| ~ '$ki_accessible'(X0,X1)
| in(X1,X3,X4) ) ).
cnf(u1320,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK0(sK26),X2)
| ~ qmltpeq(sK11(sK27,X0,X1),sK27,X0)
| ~ disjoint(sK10(sK27,X3,X1),X3,sK27)
| ~ '$ki_accessible'(X1,X4)
| disjoint(X4,X3,X0) ) ).
cnf(u1776,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X0)
| ~ qmltpeq(sK7(sK1(sK0('$ki_local_world')),X1,X0),sK1(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(X0,X2)
| qmltpeq(X2,singleton(sK1(sK0('$ki_local_world'))),singleton(X1)) ) ).
cnf(u3487,axiom,
( ~ '$ki_accessible'(sK0('$ki_local_world'),X4)
| '$ki_accessible'(X1,sK17(sK1(sK0('$ki_local_world')),X2,X1))
| ~ '$ki_accessible'(X3,X1)
| ~ '$ki_exists_in_world_$i'(X3,X0)
| ~ '$ki_accessible'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X4,X2)
| ~ in(sK16(sK1(sK0('$ki_local_world')),X0,X1),X0,sK1(sK0('$ki_local_world')))
| ~ '$ki_accessible'(X1,X5)
| in(X5,X0,X2) ) ).
cnf(u2550,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK30,X0)
| ~ '$ki_accessible'(sK30,X1)
| '$ki_accessible'(X1,sK4(sK27,sK1(sK28),X1))
| '$ki_accessible'(X1,sK3(sK1(sK28),X0,X1))
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,sK27,X0) ) ).
cnf(u4233,axiom,
( ~ '$ki_exists_in_world_$i'(sK24(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X2)
| '$ki_accessible'(X0,sK9(sK1(sK0('$ki_local_world')),X1,X0))
| ~ disjoint(sK8(sK1(sK0('$ki_local_world')),X3,X0),sK1(sK0('$ki_local_world')),X3)
| ~ '$ki_accessible'(X0,X4)
| disjoint(X4,X1,X3) ) ).
cnf(u904,negated_conjecture,
( ~ in(sK19(sK1(sK26),sK1(sK28),X0),sK1(sK26),sK1(sK28))
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| ~ in(sK18(sK1(sK26),sK1(sK28),X1),sK1(sK28),sK1(sK26)) ) ).
cnf(u4126,negated_conjecture,
( ~ in(sK16(sK1(sK26),sK1(sK31),X0),sK1(sK31),sK1(sK26))
| '$ki_accessible'(X0,sK17(sK1(sK26),sK1(sK28),X0))
| ~ '$ki_accessible'(sK31,X0)
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK1(sK31),sK1(sK28)) ) ).
cnf(u1871,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X3)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK5(sK27,X3,X1))
| ~ '$ki_accessible'(X1,X4)
| qmltpeq(X4,set_intersection2(sK27,X2),set_intersection2(X3,X2)) ) ).
cnf(u4006,negated_conjecture,
( ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK17(sK27,sK1(sK24(sK26)),X1))
| ~ in(sK16(sK27,X2,X1),X2,sK27)
| ~ '$ki_accessible'(X1,X3)
| in(X3,X2,sK1(sK24(sK26))) ) ).
cnf(u4148,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK0(sK26)),X0)
| '$ki_accessible'(X0,sK9(sK1(sK26),sK1(sK0(sK26)),X0))
| '$ki_accessible'(X0,sK8(sK1(sK26),sK1(sK0(sK0(sK26))),X0))
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK0(sK26)),sK1(sK0(sK0(sK26)))) ) ).
cnf(u270,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X0)
| ~ '$ki_accessible'(sK24(sK26),X1)
| qmltpeq(X1,set_intersection2(sK27,X0),set_intersection2(X0,sK27)) ) ).
cnf(u2458,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK28,X2)
| '$ki_accessible'(X0,sK4(sK27,X1,X0))
| '$ki_accessible'(X0,sK3(X1,X3,X0))
| ~ '$ki_accessible'(X0,X4)
| qmltpeq(X4,sK27,X3) ) ).
cnf(u2557,negated_conjecture,
( ~ '$ki_accessible'(sK26,X4)
| ~ qmltpeq(sK17(sK1(sK26),X2,X0),sK1(sK26),X2)
| ~ '$ki_accessible'(X3,X0)
| ~ '$ki_exists_in_world_$i'(X3,X1)
| ~ '$ki_accessible'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X4,X2)
| '$ki_accessible'(X0,sK16(sK1(sK26),X1,X0))
| ~ '$ki_accessible'(X0,X5)
| in(X5,X1,X2) ) ).
cnf(u2250,negated_conjecture,
( ~ '$ki_accessible'(sK26,X4)
| '$ki_accessible'(X2,sK4(sK1(sK26),X0,X2))
| ~ '$ki_accessible'(X3,X2)
| ~ '$ki_exists_in_world_$i'(X3,X1)
| ~ '$ki_accessible'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X4,X0)
| ~ qmltpeq(sK3(X0,X1,X2),X0,X1)
| ~ '$ki_accessible'(X2,X5)
| qmltpeq(X5,sK1(sK26),X1) ) ).
cnf(u2139,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ '$ki_accessible'(X0,X2)
| '$ki_accessible'(X2,sK6(sK27,sK1(sK0(sK26)),X2))
| ~ '$ki_accessible'(X2,X3)
| qmltpeq(X3,set_intersection2(X1,sK27),set_intersection2(X1,sK1(sK0(sK26)))) ) ).
cnf(u292,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X1)
| ~ '$ki_accessible'(sK24(sK26),X0)
| ~ qmltpeq(sK2(sK27,X1,X0),sK27,X1)
| ~ '$ki_accessible'(X0,X2)
| qmltpeq(X2,X1,sK27) ) ).
cnf(u1816,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X0)
| ~ '$ki_accessible'(sK28,X1)
| ~ qmltpeq(sK13(sK1(sK26),X0,X1),sK1(sK26),X0)
| '$ki_accessible'(X1,sK12(sK1(sK26),X1))
| ~ '$ki_accessible'(X1,X2)
| empty(X2,X0) ) ).
cnf(u4013,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK31,X0)
| ~ '$ki_accessible'(sK31,X1)
| '$ki_accessible'(X1,sK4(sK1(sK26),sK29,X1))
| ~ qmltpeq(sK3(sK29,X0,X1),sK29,X0)
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,sK1(sK26),X0) ) ).
cnf(u306,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X1)
| ~ '$ki_accessible'(sK0(sK26),X0)
| ~ disjoint(sK25(sK27,X1,X0),sK27,X1)
| ~ '$ki_accessible'(X0,X2)
| disjoint(X2,X1,sK27) ) ).
cnf(u277,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK27,sK1(sK0(sK26))),set_intersection2(sK1(sK0(sK26)),sK27))
| ~ '$ki_accessible'(sK0(sK26),X0) ) ).
cnf(u1786,axiom,
( ~ in(sK19(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X0),sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))))
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK18(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X1)) ) ).
cnf(u523,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X1)
| ~ '$ki_accessible'(sK28,X0)
| '$ki_accessible'(X0,sK25(sK27,X1,X0))
| ~ '$ki_accessible'(X0,X2)
| disjoint(X2,X1,sK27) ) ).
cnf(u2465,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK28),X0)
| ~ '$ki_accessible'(sK0(sK28),X1)
| '$ki_accessible'(X1,sK4(sK27,sK29,X1))
| '$ki_accessible'(X1,sK3(sK29,X0,X1))
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,sK27,X0) ) ).
cnf(u1528,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK0(sK26),X2)
| ~ qmltpeq(sK4(sK1(sK26),X0,X1),sK1(sK26),X0)
| ~ qmltpeq(sK3(X0,X3,X1),X0,X3)
| ~ '$ki_accessible'(X1,X4)
| qmltpeq(X4,sK1(sK26),X3) ) ).
cnf(u2662,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK30,X0)
| ~ '$ki_accessible'(sK30,X1)
| '$ki_accessible'(X1,sK9(sK27,sK1(sK28),X1))
| '$ki_accessible'(X1,sK8(sK27,X0,X1))
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,sK1(sK28),X0) ) ).
cnf(u291,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X1)
| ~ '$ki_accessible'(sK28,X0)
| ~ qmltpeq(sK2(sK27,X1,X0),sK27,X1)
| ~ '$ki_accessible'(X0,X2)
| qmltpeq(X2,X1,sK27) ) ).
cnf(u1209,negated_conjecture,
( ~ qmltpeq(sK6(sK1(sK26),sK1(sK0(sK26)),X2),sK1(sK26),sK1(sK0(sK26)))
| ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ '$ki_accessible'(X2,X3)
| qmltpeq(X3,set_intersection2(X1,sK1(sK26)),set_intersection2(X1,sK1(sK0(sK26)))) ) ).
cnf(u2495,negated_conjecture,
( ~ '$ki_accessible'(sK26,X4)
| '$ki_accessible'(X1,sK15(sK1(sK26),X2,X1))
| ~ '$ki_accessible'(X3,X1)
| ~ '$ki_exists_in_world_$i'(X3,X0)
| ~ '$ki_accessible'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X4,X2)
| ~ in(sK14(sK1(sK26),X0,X1),sK1(sK26),X0)
| ~ '$ki_accessible'(X1,X5)
| in(X5,X2,X0) ) ).
cnf(u3478,axiom,
( ~ '$ki_accessible'(sK0('$ki_local_world'),X4)
| ~ qmltpeq(sK17(sK1(sK0('$ki_local_world')),X2,X0),sK1(sK0('$ki_local_world')),X2)
| ~ '$ki_accessible'(X3,X0)
| ~ '$ki_exists_in_world_$i'(X3,X1)
| ~ '$ki_accessible'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X4,X2)
| '$ki_accessible'(X0,sK16(sK1(sK0('$ki_local_world')),X1,X0))
| ~ '$ki_accessible'(X0,X5)
| in(X5,X1,X2) ) ).
cnf(u1831,negated_conjecture,
( ~ qmltpeq(sK13(sK1(sK26),sK1(sK24(sK26)),X0),sK1(sK26),sK1(sK24(sK26)))
| ~ '$ki_accessible'(sK24(sK26),X0)
| '$ki_accessible'(X0,sK12(sK1(sK26),X0))
| ~ '$ki_accessible'(X0,X1)
| empty(X1,sK1(sK24(sK26))) ) ).
cnf(u4008,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK28,X2)
| '$ki_accessible'(X0,sK15(sK1(sK26),X1,X0))
| ~ in(sK14(sK1(sK26),X3,X0),sK1(sK26),X3)
| ~ '$ki_accessible'(X0,X4)
| in(X4,X1,X3) ) ).
cnf(u1873,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK26,X2)
| ~ in(sK16(X2,X3,X0),X3,X2)
| '$ki_accessible'(X0,sK17(X2,X4,X0))
| ~ '$ki_accessible'(X5,X0)
| ~ '$ki_exists_in_world_$i'(X5,X3)
| ~ '$ki_accessible'(X6,X5)
| ~ '$ki_exists_in_world_$i'(X6,X4)
| ~ '$ki_accessible'(sK26,X6)
| ~ '$ki_accessible'(X0,X1)
| in(X1,X3,X4) ) ).
cnf(u1775,axiom,
( ~ '$ki_exists_in_world_$i'(sK24(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X0)
| ~ qmltpeq(sK7(sK1(sK0('$ki_local_world')),X1,X0),sK1(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(X0,X2)
| qmltpeq(X2,singleton(sK1(sK0('$ki_local_world'))),singleton(X1)) ) ).
cnf(u313,negated_conjecture,
( ~ disjoint(sK25(sK27,sK1(sK0(sK26)),X0),sK27,sK1(sK0(sK26)))
| ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK0(sK26)),sK27) ) ).
cnf(u3500,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK15(sK27,sK1(sK0(sK26)),X1))
| ~ in(sK14(sK27,X2,X1),sK27,X2)
| ~ '$ki_accessible'(X1,X3)
| in(X3,sK1(sK0(sK26)),X2) ) ).
cnf(u159,axiom,
( ~ '$ki_accessible'('$ki_local_world',X0)
| ~ '$ki_accessible'(X4,X5)
| ~ qmltpeq(sK7(X1,X3,X4),X1,X3)
| ~ '$ki_accessible'(X2,X4)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| qmltpeq(X5,singleton(X1),singleton(X3)) ) ).
cnf(u3485,negated_conjecture,
( ~ in(sK14(sK27,sK1(sK30),X0),sK27,sK1(sK30))
| '$ki_accessible'(X0,sK15(sK27,sK29,X0))
| ~ '$ki_accessible'(sK30,X0)
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK29,sK1(sK30)) ) ).
cnf(u1826,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK26,X2)
| ~ in(sK14(X2,X3,X0),X2,X3)
| '$ki_accessible'(X0,sK15(X2,X4,X0))
| ~ '$ki_accessible'(X5,X0)
| ~ '$ki_exists_in_world_$i'(X5,X3)
| ~ '$ki_accessible'(X6,X5)
| ~ '$ki_exists_in_world_$i'(X6,X4)
| ~ '$ki_accessible'(sK26,X6)
| ~ '$ki_accessible'(X0,X1)
| in(X1,X4,X3) ) ).
cnf(u3789,negated_conjecture,
( ~ '$ki_accessible'(sK30,X0)
| '$ki_accessible'(X0,sK11(sK1(sK26),sK1(sK28),X0))
| '$ki_accessible'(X0,sK10(sK1(sK26),sK1(sK30),X0))
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK30),sK1(sK28)) ) ).
cnf(u1618,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK26),X0)
| '$ki_accessible'(X0,sK21(sK27,sK1(sK0(sK26)),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(sK1(sK0(sK26)),singleton(sK27)),singleton(sK27)) ) ).
cnf(u181,axiom,
( ~ '$ki_accessible'('$ki_local_world',X0)
| ~ '$ki_accessible'(X4,X5)
| ~ in(sK19(X1,X3,X4),X1,X3)
| ~ '$ki_accessible'(X2,X4)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| '$ki_accessible'(X5,sK18(X1,X3,X5)) ) ).
cnf(u3499,negated_conjecture,
( ~ qmltpeq(sK17(sK27,sK1(sK28),X1),sK27,sK1(sK28))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK16(sK27,X2,X1))
| ~ '$ki_accessible'(X1,X3)
| in(X3,X2,sK1(sK28)) ) ).
cnf(u386,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X1)
| ~ '$ki_accessible'(sK24(sK26),X0)
| ~ disjoint(sK25(sK1(sK26),X1,X0),sK1(sK26),X1)
| ~ '$ki_accessible'(X0,X2)
| disjoint(X2,X1,sK1(sK26)) ) ).
cnf(u485,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK26,X2)
| ~ in(sK21(X2,X3,X0),X2,X3)
| ~ '$ki_accessible'(X4,X0)
| ~ '$ki_exists_in_world_$i'(X4,X3)
| ~ '$ki_accessible'(sK26,X4)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(X3,singleton(X2)),singleton(X2)) ) ).
cnf(u1041,negated_conjecture,
( ~ '$ki_accessible'(sK26,X4)
| ~ qmltpeq(sK15(sK1(sK26),X2,X1),sK1(sK26),X2)
| ~ '$ki_accessible'(X3,X1)
| ~ '$ki_exists_in_world_$i'(X3,X0)
| ~ '$ki_accessible'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X4,X2)
| ~ in(sK14(sK1(sK26),X0,X1),sK1(sK26),X0)
| ~ '$ki_accessible'(X1,X5)
| in(X5,X2,X0) ) ).
cnf(u731,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X1)
| ~ '$ki_accessible'(sK0(sK26),X0)
| ~ in(sK19(sK27,X1,X0),sK27,X1)
| ~ '$ki_accessible'(X0,X2)
| ~ in(sK18(sK27,X1,X2),X1,sK27) ) ).
cnf(u1345,negated_conjecture,
( ~ '$ki_accessible'(sK26,X2)
| '$ki_accessible'(X0,sK13(sK1(sK26),X1,X0))
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X1)
| '$ki_accessible'(X0,sK12(sK1(sK26),X0))
| ~ '$ki_accessible'(X0,X3)
| empty(X3,X1) ) ).
cnf(u1833,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X2)
| ~ qmltpeq(sK9(sK1(sK0('$ki_local_world')),X0,X1),sK1(sK0('$ki_local_world')),X0)
| ~ disjoint(sK8(sK1(sK0('$ki_local_world')),X3,X1),sK1(sK0('$ki_local_world')),X3)
| ~ '$ki_accessible'(X1,X4)
| disjoint(X4,X0,X3) ) ).
cnf(u1777,axiom,
( ~ '$ki_exists_in_world_$i'(sK24(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X0)
| ~ in(sK19(sK1(sK0('$ki_local_world')),X1,X0),sK1(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(X0,X2)
| '$ki_accessible'(X2,sK18(sK1(sK0('$ki_local_world')),X1,X2)) ) ).
cnf(u200,negated_conjecture,
'$ki_exists_in_world_$i'(sK28,sK29) ).
cnf(u2888,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK24(sK26),X2)
| '$ki_accessible'(X0,sK15(sK27,X1,X0))
| '$ki_accessible'(X0,sK14(sK27,X3,X0))
| ~ '$ki_accessible'(X0,X4)
| in(X4,X1,X3) ) ).
cnf(u3593,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK31,X0)
| ~ '$ki_accessible'(sK31,X1)
| '$ki_accessible'(X1,sK4(sK1(sK26),sK1(sK28),X1))
| '$ki_accessible'(X1,sK3(sK1(sK28),X0,X1))
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,sK1(sK26),X0) ) ).
cnf(u423,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X1)
| ~ '$ki_accessible'(sK0(sK26),X0)
| ~ qmltpeq(sK7(sK27,X1,X0),sK27,X1)
| ~ '$ki_accessible'(X0,X2)
| qmltpeq(X2,singleton(sK27),singleton(X1)) ) ).
cnf(u1534,negated_conjecture,
( ~ empty(sK12(sK27,X0),sK27)
| '$ki_accessible'(X0,sK13(sK27,X1,X0))
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X1)
| ~ '$ki_accessible'(sK26,X2)
| ~ '$ki_accessible'(X0,X3)
| empty(X3,X1) ) ).
cnf(u346,axiom,
( ~ '$ki_exists_in_world_$i'(sK0('$ki_local_world'),X2)
| '$ki_accessible'(X0,sK20(X2,X3,X0))
| ~ '$ki_accessible'(X4,X0)
| ~ '$ki_exists_in_world_$i'(X4,X3)
| ~ '$ki_accessible'(sK0('$ki_local_world'),X4)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,singleton(X2),X3) ) ).
cnf(u805,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK26),X0)
| '$ki_accessible'(X0,sK20(sK27,sK1(sK0(sK26)),X0))
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,singleton(sK27),sK1(sK0(sK26))) ) ).
cnf(u691,axiom,
( ~ '$ki_exists_in_world_$i'(sK0('$ki_local_world'),X2)
| ~ disjoint(sK10(X2,X3,X0),X3,X2)
| ~ qmltpeq(sK11(X2,X4,X0),X2,X4)
| ~ '$ki_accessible'(X5,X0)
| ~ '$ki_exists_in_world_$i'(X5,X3)
| ~ '$ki_accessible'(X6,X5)
| ~ '$ki_exists_in_world_$i'(X6,X4)
| ~ '$ki_accessible'(sK0('$ki_local_world'),X6)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,X3,X4) ) ).
cnf(u626,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK26,X2)
| ~ disjoint(sK8(X2,X3,X0),X2,X3)
| ~ qmltpeq(sK9(X2,X4,X0),X2,X4)
| ~ '$ki_accessible'(X5,X0)
| ~ '$ki_exists_in_world_$i'(X5,X3)
| ~ '$ki_accessible'(X6,X5)
| ~ '$ki_exists_in_world_$i'(X6,X4)
| ~ '$ki_accessible'(sK26,X6)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,X4,X3) ) ).
cnf(u3490,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK28),X0)
| ~ '$ki_accessible'(sK0(sK28),X1)
| '$ki_accessible'(X1,sK15(sK27,sK1(sK28),X1))
| ~ in(sK14(sK27,X0,X1),sK27,X0)
| ~ '$ki_accessible'(X1,X2)
| in(X2,sK1(sK28),X0) ) ).
cnf(u160,axiom,
( ~ '$ki_accessible'('$ki_local_world',X0)
| ~ '$ki_accessible'(X6,X7)
| '$ki_accessible'(X6,sK8(X1,X5,X6))
| '$ki_accessible'(X6,sK9(X1,X3,X6))
| ~ '$ki_accessible'(X4,X6)
| ~ '$ki_exists_in_world_$i'(X4,X5)
| ~ '$ki_accessible'(X2,X4)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| disjoint(X7,X3,X5) ) ).
cnf(u1787,axiom,
( ~ in(sK18(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X1),sK1(sK24(sK0('$ki_local_world'))),sK1(sK0('$ki_local_world')))
| '$ki_accessible'(X0,sK19(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X0))
| ~ '$ki_accessible'(X0,X1)
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X0) ) ).
cnf(u3512,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK28),X0)
| ~ '$ki_accessible'(sK0(sK28),X1)
| '$ki_accessible'(X1,sK17(sK27,sK29,X1))
| ~ in(sK16(sK27,X0,X1),X0,sK27)
| ~ '$ki_accessible'(X1,X2)
| in(X2,X0,sK29) ) ).
cnf(u190,axiom,
'$ki_exists_in_world_$i'('$ki_local_world',sK22) ).
cnf(u383,negated_conjecture,
( ~ qmltpeq(sK2(sK1(sK26),sK1(sK0(sK26)),X0),sK1(sK26),sK1(sK0(sK26)))
| ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,sK1(sK0(sK26)),sK1(sK26)) ) ).
cnf(u3497,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK0(sK26),X2)
| ~ qmltpeq(sK17(sK27,X0,X1),sK27,X0)
| '$ki_accessible'(X1,sK16(sK27,X3,X1))
| ~ '$ki_accessible'(X1,X4)
| in(X4,X3,X0) ) ).
cnf(u1854,axiom,
( ~ qmltpeq(sK9(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X1),sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X0,X1)
| ~ disjoint(sK8(sK1(sK0('$ki_local_world')),X2,X1),sK1(sK0('$ki_local_world')),X2)
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,sK1(sK24(sK0('$ki_local_world'))),X2) ) ).
cnf(u199,negated_conjecture,
'$ki_accessible'(sK26,sK28) ).
cnf(u1646,negated_conjecture,
( ~ qmltpeq(sK15(sK1(sK26),sK1(sK0(sK26)),X1),sK1(sK26),sK1(sK0(sK26)))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| ~ in(sK14(sK1(sK26),X2,X1),sK1(sK26),X2)
| ~ '$ki_accessible'(X1,X3)
| in(X3,sK1(sK0(sK26)),X2) ) ).
cnf(u4207,negated_conjecture,
( ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK11(sK1(sK26),sK1(sK24(sK26)),X1))
| ~ disjoint(sK10(sK1(sK26),X2,X1),X2,sK1(sK26))
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,X2,sK1(sK24(sK26))) ) ).
cnf(u3399,axiom,
( ~ '$ki_accessible'(sK0('$ki_local_world'),X4)
| ~ qmltpeq(sK4(sK1(sK0('$ki_local_world')),X1,X0),sK1(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(X3,X0)
| ~ '$ki_exists_in_world_$i'(X3,X2)
| ~ '$ki_accessible'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X4,X1)
| '$ki_accessible'(X0,sK3(X1,X2,X0))
| ~ '$ki_accessible'(X0,X5)
| qmltpeq(X5,sK1(sK0('$ki_local_world')),X2) ) ).
cnf(u2462,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK4(sK27,sK1(sK28),X1))
| '$ki_accessible'(X1,sK3(sK1(sK28),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| qmltpeq(X3,sK27,X2) ) ).
cnf(u4420,axiom,
( ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK4(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X1))
| '$ki_accessible'(X1,sK3(sK1(sK0(sK0('$ki_local_world'))),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| qmltpeq(X3,sK1(sK0('$ki_local_world')),X2) ) ).
cnf(u1069,negated_conjecture,
( ~ qmltpeq(sK6(sK27,sK1(sK24(sK26)),X2),sK27,sK1(sK24(sK26)))
| ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ '$ki_accessible'(X2,X3)
| qmltpeq(X3,set_intersection2(X1,sK27),set_intersection2(X1,sK1(sK24(sK26)))) ) ).
cnf(u2564,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK4(sK27,sK1(sK0(sK26)),X1))
| '$ki_accessible'(X1,sK3(sK1(sK0(sK26)),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| qmltpeq(X3,sK27,X2) ) ).
cnf(u4434,axiom,
( ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK4(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X1))
| ~ qmltpeq(sK3(sK1(sK0(sK0('$ki_local_world'))),X2,X1),sK1(sK0(sK0('$ki_local_world'))),X2)
| ~ '$ki_accessible'(X1,X3)
| qmltpeq(X3,sK1(sK0('$ki_local_world')),X2) ) ).
cnf(u1619,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK28,X2)
| ~ qmltpeq(sK15(sK1(sK26),X0,X1),sK1(sK26),X0)
| ~ in(sK14(sK1(sK26),X3,X1),sK1(sK26),X3)
| ~ '$ki_accessible'(X1,X4)
| in(X4,X0,X3) ) ).
cnf(u4456,axiom,
( ~ '$ki_accessible'(sK0(sK0(sK0('$ki_local_world'))),X0)
| '$ki_accessible'(X0,sK17(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X0))
| '$ki_accessible'(X0,sK16(sK1(sK0('$ki_local_world')),sK1(sK0(sK0(sK0('$ki_local_world')))),X0))
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK1(sK0(sK0(sK0('$ki_local_world')))),sK1(sK0(sK0('$ki_local_world')))) ) ).
cnf(u4419,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK0(sK0('$ki_local_world'))),X0)
| ~ '$ki_accessible'(sK0(sK0(sK0('$ki_local_world'))),X1)
| '$ki_accessible'(X1,sK6(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X1))
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,set_intersection2(X0,sK1(sK0('$ki_local_world'))),set_intersection2(X0,sK1(sK0(sK0('$ki_local_world'))))) ) ).
cnf(u4358,axiom,
( ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X0)
| '$ki_accessible'(X0,sK13(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X0))
| '$ki_accessible'(X0,sK12(sK1(sK0('$ki_local_world')),X0))
| ~ '$ki_accessible'(X0,X1)
| empty(X1,sK1(sK0(sK0('$ki_local_world')))) ) ).
cnf(u4441,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK24(sK0('$ki_local_world'))),X0)
| ~ '$ki_accessible'(sK0(sK24(sK0('$ki_local_world'))),X1)
| '$ki_accessible'(X1,sK15(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X1))
| '$ki_accessible'(X1,sK14(sK1(sK0('$ki_local_world')),X0,X1))
| ~ '$ki_accessible'(X1,X2)
| in(X2,sK1(sK24(sK0('$ki_local_world'))),X0) ) ).
cnf(u2184,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X3)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK5(sK1(sK26),X3,X1))
| ~ '$ki_accessible'(X1,X4)
| qmltpeq(X4,set_intersection2(sK1(sK26),X2),set_intersection2(X3,X2)) ) ).
cnf(u4023,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK0(sK26)),X0)
| ~ '$ki_accessible'(sK0(sK0(sK26)),X1)
| '$ki_accessible'(X1,sK17(sK27,sK1(sK0(sK26)),X1))
| ~ in(sK16(sK27,X0,X1),X0,sK27)
| ~ '$ki_accessible'(X1,X2)
| in(X2,X0,sK1(sK0(sK26))) ) ).
cnf(u1140,negated_conjecture,
( ~ qmltpeq(sK6(sK1(sK26),sK29,X2),sK1(sK26),sK29)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ '$ki_accessible'(X2,X3)
| qmltpeq(X3,set_intersection2(X1,sK1(sK26)),set_intersection2(X1,sK29)) ) ).
cnf(u2574,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK9(sK27,sK29,X1))
| '$ki_accessible'(X1,sK8(sK27,X2,X1))
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,sK29,X2) ) ).
cnf(u2980,axiom,
( ~ '$ki_accessible'(sK0('$ki_local_world'),X2)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X1)
| '$ki_accessible'(X0,sK21(sK1(sK0('$ki_local_world')),X1,X0))
| ~ '$ki_accessible'(X0,X3)
| qmltpeq(X3,set_intersection2(X1,singleton(sK1(sK0('$ki_local_world')))),singleton(sK1(sK0('$ki_local_world')))) ) ).
cnf(u3518,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK0(sK26),X2)
| '$ki_accessible'(X0,sK4(sK1(sK26),X1,X0))
| '$ki_accessible'(X0,sK3(X1,X3,X0))
| ~ '$ki_accessible'(X0,X4)
| qmltpeq(X4,sK1(sK26),X3) ) ).
cnf(u1277,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK24(sK26),X2)
| ~ qmltpeq(sK9(sK27,X0,X1),sK27,X0)
| ~ disjoint(sK8(sK27,X3,X1),sK27,X3)
| ~ '$ki_accessible'(X1,X4)
| disjoint(X4,X0,X3) ) ).
cnf(u4018,negated_conjecture,
( ~ qmltpeq(sK3(sK29,sK1(sK0(sK28)),X0),sK29,sK1(sK0(sK28)))
| '$ki_accessible'(X0,sK4(sK1(sK26),sK29,X0))
| ~ '$ki_accessible'(sK0(sK28),X0)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,sK1(sK26),sK1(sK0(sK28))) ) ).
cnf(u1941,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK28),X0)
| ~ '$ki_accessible'(sK0(sK28),X1)
| '$ki_accessible'(X1,sK5(sK27,sK1(sK28),X1))
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,set_intersection2(sK27,X0),set_intersection2(sK1(sK28),X0)) ) ).
cnf(u3412,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK9(sK27,sK29,X1))
| ~ disjoint(sK8(sK27,X2,X1),sK27,X2)
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,sK29,X2) ) ).
cnf(u2979,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK28),X0)
| ~ '$ki_accessible'(sK0(sK28),X1)
| '$ki_accessible'(X1,sK15(sK27,sK1(sK28),X1))
| '$ki_accessible'(X1,sK14(sK27,X0,X1))
| ~ '$ki_accessible'(X1,X2)
| in(X2,sK1(sK28),X0) ) ).
cnf(u3594,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK30,X0)
| ~ '$ki_accessible'(sK30,X1)
| '$ki_accessible'(X1,sK4(sK1(sK26),sK1(sK28),X1))
| '$ki_accessible'(X1,sK3(sK1(sK28),X0,X1))
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,sK1(sK26),X0) ) ).
cnf(u3397,negated_conjecture,
( ~ qmltpeq(sK3(sK1(sK28),sK1(sK0(sK28)),X0),sK1(sK28),sK1(sK0(sK28)))
| '$ki_accessible'(X0,sK4(sK27,sK1(sK28),X0))
| ~ '$ki_accessible'(sK0(sK28),X0)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,sK27,sK1(sK0(sK28))) ) ).
cnf(u4110,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X0)
| '$ki_accessible'(X0,sK21(sK1(sK0('$ki_local_world')),X1,X0))
| ~ '$ki_accessible'(X0,X2)
| qmltpeq(X2,set_intersection2(X1,singleton(sK1(sK0('$ki_local_world')))),singleton(sK1(sK0('$ki_local_world')))) ) ).
cnf(u3792,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK0(sK26),X2)
| ~ qmltpeq(sK9(sK1(sK26),X0,X1),sK1(sK26),X0)
| '$ki_accessible'(X1,sK8(sK1(sK26),X3,X1))
| ~ '$ki_accessible'(X1,X4)
| disjoint(X4,X0,X3) ) ).
cnf(u4025,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK30,X0)
| ~ '$ki_accessible'(sK30,X1)
| '$ki_accessible'(X1,sK4(sK1(sK26),sK1(sK28),X1))
| ~ qmltpeq(sK3(sK1(sK28),X0,X1),sK1(sK28),X0)
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,sK1(sK26),X0) ) ).
cnf(u3411,axiom,
( ~ '$ki_accessible'(sK0('$ki_local_world'),X4)
| '$ki_accessible'(X2,sK4(sK1(sK0('$ki_local_world')),X0,X2))
| ~ '$ki_accessible'(X3,X2)
| ~ '$ki_exists_in_world_$i'(X3,X1)
| ~ '$ki_accessible'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X4,X0)
| ~ qmltpeq(sK3(X0,X1,X2),X0,X1)
| ~ '$ki_accessible'(X2,X5)
| qmltpeq(X5,sK1(sK0('$ki_local_world')),X1) ) ).
cnf(u1686,negated_conjecture,
( ~ qmltpeq(sK17(sK1(sK26),sK1(sK0(sK26)),X1),sK1(sK26),sK1(sK0(sK26)))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| ~ in(sK16(sK1(sK26),X2,X1),X2,sK1(sK26))
| ~ '$ki_accessible'(X1,X3)
| in(X3,X2,sK1(sK0(sK26))) ) ).
cnf(u4247,axiom,
( ~ '$ki_exists_in_world_$i'(sK24(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X2)
| ~ qmltpeq(sK15(sK1(sK0('$ki_local_world')),X0,X1),sK1(sK0('$ki_local_world')),X0)
| '$ki_accessible'(X1,sK14(sK1(sK0('$ki_local_world')),X3,X1))
| ~ '$ki_accessible'(X1,X4)
| in(X4,X0,X3) ) ).
cnf(u4132,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK0(sK26)),X0)
| ~ '$ki_accessible'(sK0(sK0(sK26)),X1)
| '$ki_accessible'(X1,sK4(sK1(sK26),sK1(sK0(sK26)),X1))
| '$ki_accessible'(X1,sK3(sK1(sK0(sK26)),X0,X1))
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,sK1(sK26),X0) ) ).
cnf(u4015,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK28),X0)
| ~ '$ki_accessible'(sK0(sK28),X1)
| '$ki_accessible'(X1,sK4(sK1(sK26),sK29,X1))
| ~ qmltpeq(sK3(sK29,X0,X1),sK29,X0)
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,sK1(sK26),X0) ) ).
cnf(u2183,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X3)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK5(sK1(sK26),X3,X1))
| ~ '$ki_accessible'(X1,X4)
| qmltpeq(X4,set_intersection2(sK1(sK26),X2),set_intersection2(X3,X2)) ) ).
cnf(u4146,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK0(sK26)),X0)
| '$ki_accessible'(X0,sK4(sK1(sK26),sK1(sK0(sK26)),X0))
| '$ki_accessible'(X0,sK3(sK1(sK0(sK26)),sK1(sK0(sK0(sK26))),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,sK1(sK26),sK1(sK0(sK0(sK26)))) ) ).
cnf(u4097,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK31,X0)
| ~ '$ki_accessible'(sK31,X1)
| '$ki_accessible'(X1,sK15(sK1(sK26),sK29,X1))
| ~ in(sK14(sK1(sK26),X0,X1),sK1(sK26),X0)
| ~ '$ki_accessible'(X1,X2)
| in(X2,sK29,X0) ) ).
cnf(u4446,axiom,
( ~ '$ki_accessible'(sK0(sK24(sK0('$ki_local_world'))),X0)
| '$ki_accessible'(X0,sK4(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X0))
| '$ki_accessible'(X0,sK3(sK1(sK24(sK0('$ki_local_world'))),sK1(sK0(sK24(sK0('$ki_local_world')))),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,sK1(sK0('$ki_local_world')),sK1(sK0(sK24(sK0('$ki_local_world'))))) ) ).
cnf(u2565,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK24(sK26)),X0)
| ~ '$ki_accessible'(sK0(sK24(sK26)),X1)
| '$ki_accessible'(X1,sK4(sK27,sK1(sK24(sK26)),X1))
| '$ki_accessible'(X1,sK3(sK1(sK24(sK26)),X0,X1))
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,sK27,X0) ) ).
cnf(u2764,axiom,
( ~ '$ki_accessible'(sK0('$ki_local_world'),X2)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X1)
| '$ki_accessible'(X0,sK7(sK1(sK0('$ki_local_world')),X1,X0))
| ~ '$ki_accessible'(X0,X3)
| qmltpeq(X3,singleton(sK1(sK0('$ki_local_world'))),singleton(X1)) ) ).
cnf(u4127,negated_conjecture,
( ~ in(sK16(sK1(sK26),sK1(sK30),X0),sK1(sK30),sK1(sK26))
| '$ki_accessible'(X0,sK17(sK1(sK26),sK1(sK28),X0))
| ~ '$ki_accessible'(sK30,X0)
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK1(sK30),sK1(sK28)) ) ).
cnf(u4010,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK0(sK26),X2)
| '$ki_accessible'(X0,sK15(sK1(sK26),X1,X0))
| ~ in(sK14(sK1(sK26),X3,X0),sK1(sK26),X3)
| ~ '$ki_accessible'(X0,X4)
| in(X4,X1,X3) ) ).
cnf(u4177,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X2)
| '$ki_accessible'(X0,sK15(sK1(sK0('$ki_local_world')),X1,X0))
| '$ki_accessible'(X0,sK14(sK1(sK0('$ki_local_world')),X3,X0))
| ~ '$ki_accessible'(X0,X4)
| in(X4,X1,X3) ) ).
cnf(u4453,axiom,
( ~ '$ki_accessible'(sK0(sK24(sK0('$ki_local_world'))),X0)
| '$ki_accessible'(X0,sK15(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X0))
| '$ki_accessible'(X0,sK14(sK1(sK0('$ki_local_world')),sK1(sK0(sK24(sK0('$ki_local_world')))),X0))
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK1(sK24(sK0('$ki_local_world'))),sK1(sK0(sK24(sK0('$ki_local_world'))))) ) ).
cnf(u2880,negated_conjecture,
( ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK11(sK27,sK1(sK24(sK26)),X1))
| '$ki_accessible'(X1,sK10(sK27,X2,X1))
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,X2,sK1(sK24(sK26))) ) ).
cnf(u2254,negated_conjecture,
( ~ '$ki_accessible'(sK31,X0)
| '$ki_accessible'(X0,sK5(sK1(sK26),sK1(sK28),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(sK1(sK26),sK1(sK31)),set_intersection2(sK1(sK28),sK1(sK31))) ) ).
cnf(u4017,negated_conjecture,
( ~ qmltpeq(sK3(sK29,sK1(sK30),X0),sK29,sK1(sK30))
| '$ki_accessible'(X0,sK4(sK1(sK26),sK29,X0))
| ~ '$ki_accessible'(sK30,X0)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,sK1(sK26),sK1(sK30)) ) ).
cnf(u3791,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK24(sK26),X2)
| ~ qmltpeq(sK9(sK1(sK26),X0,X1),sK1(sK26),X0)
| '$ki_accessible'(X1,sK8(sK1(sK26),X3,X1))
| ~ '$ki_accessible'(X1,X4)
| disjoint(X4,X0,X3) ) ).
cnf(u2273,negated_conjecture,
( ~ '$ki_accessible'(sK30,X0)
| '$ki_accessible'(X0,sK5(sK1(sK26),sK1(sK28),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(sK1(sK26),sK1(sK30)),set_intersection2(sK1(sK28),sK1(sK30))) ) ).
cnf(u2895,negated_conjecture,
( ~ '$ki_accessible'(sK31,X0)
| '$ki_accessible'(X0,sK15(sK27,sK29,X0))
| '$ki_accessible'(X0,sK14(sK27,sK1(sK31),X0))
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK29,sK1(sK31)) ) ).
cnf(u3838,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK28),X0)
| ~ '$ki_accessible'(sK0(sK28),X1)
| '$ki_accessible'(X1,sK15(sK1(sK26),sK29,X1))
| '$ki_accessible'(X1,sK14(sK1(sK26),X0,X1))
| ~ '$ki_accessible'(X1,X2)
| in(X2,sK29,X0) ) ).
cnf(u3482,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK30,X0)
| ~ '$ki_accessible'(sK30,X1)
| '$ki_accessible'(X1,sK15(sK27,sK29,X1))
| ~ in(sK14(sK27,X0,X1),sK27,X0)
| ~ '$ki_accessible'(X1,X2)
| in(X2,sK29,X0) ) ).
cnf(u4028,negated_conjecture,
( ~ qmltpeq(sK3(sK1(sK28),sK1(sK30),X0),sK1(sK28),sK1(sK30))
| '$ki_accessible'(X0,sK4(sK1(sK26),sK1(sK28),X0))
| ~ '$ki_accessible'(sK30,X0)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,sK1(sK26),sK1(sK30)) ) ).
cnf(u3504,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK0(sK26)),X0)
| ~ '$ki_accessible'(sK0(sK0(sK26)),X1)
| '$ki_accessible'(X1,sK15(sK27,sK1(sK0(sK26)),X1))
| ~ in(sK14(sK27,X0,X1),sK27,X0)
| ~ '$ki_accessible'(X1,X2)
| in(X2,sK1(sK0(sK26)),X0) ) ).
cnf(u3925,negated_conjecture,
( ~ '$ki_accessible'(sK31,X0)
| '$ki_accessible'(X0,sK17(sK1(sK26),sK29,X0))
| '$ki_accessible'(X0,sK16(sK1(sK26),sK1(sK31),X0))
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK1(sK31),sK29) ) ).
cnf(u2890,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK15(sK27,sK29,X1))
| '$ki_accessible'(X1,sK14(sK27,X2,X1))
| ~ '$ki_accessible'(X1,X3)
| in(X3,sK29,X2) ) ).
cnf(u4229,negated_conjecture,
( ~ disjoint(sK8(sK1(sK26),sK1(sK0(sK24(sK26))),X0),sK1(sK26),sK1(sK0(sK24(sK26))))
| '$ki_accessible'(X0,sK9(sK1(sK26),sK1(sK24(sK26)),X0))
| ~ '$ki_accessible'(sK0(sK24(sK26)),X0)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK24(sK26)),sK1(sK0(sK24(sK26)))) ) ).
cnf(u3595,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK28),X0)
| ~ '$ki_accessible'(sK0(sK28),X1)
| '$ki_accessible'(X1,sK4(sK1(sK26),sK1(sK28),X1))
| '$ki_accessible'(X1,sK3(sK1(sK28),X0,X1))
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,sK1(sK26),X0) ) ).
cnf(u3489,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK30,X0)
| ~ '$ki_accessible'(sK30,X1)
| '$ki_accessible'(X1,sK15(sK27,sK1(sK28),X1))
| ~ in(sK14(sK27,X0,X1),sK27,X0)
| ~ '$ki_accessible'(X1,X2)
| in(X2,sK1(sK28),X0) ) ).
cnf(u4027,negated_conjecture,
( ~ qmltpeq(sK3(sK1(sK28),sK1(sK31),X0),sK1(sK28),sK1(sK31))
| '$ki_accessible'(X0,sK4(sK1(sK26),sK1(sK28),X0))
| ~ '$ki_accessible'(sK31,X0)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,sK1(sK26),sK1(sK31)) ) ).
cnf(u4243,axiom,
( ~ '$ki_exists_in_world_$i'(sK24(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X2)
| ~ qmltpeq(sK11(sK1(sK0('$ki_local_world')),X0,X1),sK1(sK0('$ki_local_world')),X0)
| '$ki_accessible'(X1,sK10(sK1(sK0('$ki_local_world')),X3,X1))
| ~ '$ki_accessible'(X1,X4)
| disjoint(X4,X3,X0) ) ).
cnf(u3519,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK31,X0)
| ~ '$ki_accessible'(sK31,X1)
| '$ki_accessible'(X1,sK17(sK27,sK1(sK28),X1))
| ~ in(sK16(sK27,X0,X1),X0,sK27)
| ~ '$ki_accessible'(X1,X2)
| in(X2,X0,sK1(sK28)) ) ).
cnf(u2454,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK24(sK26)),X0)
| '$ki_accessible'(X0,sK6(sK1(sK26),sK1(sK24(sK26)),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(sK1(sK0(sK24(sK26))),sK1(sK26)),set_intersection2(sK1(sK0(sK24(sK26))),sK1(sK24(sK26)))) ) ).
cnf(u4158,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK4(sK1(sK26),sK1(sK0(sK26)),X1))
| ~ qmltpeq(sK3(sK1(sK0(sK26)),X2,X1),sK1(sK0(sK26)),X2)
| ~ '$ki_accessible'(X1,X3)
| qmltpeq(X3,sK1(sK26),X2) ) ).
cnf(u936,axiom,
( ~ '$ki_exists_in_world_$i'(sK0('$ki_local_world'),X2)
| '$ki_accessible'(X0,sK5(X2,X3,X0))
| ~ '$ki_accessible'(X4,X0)
| ~ '$ki_exists_in_world_$i'(X4,X5)
| ~ '$ki_accessible'(X6,X4)
| ~ '$ki_exists_in_world_$i'(X6,X3)
| ~ '$ki_accessible'(sK0('$ki_local_world'),X6)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(X2,X5),set_intersection2(X3,X5)) ) ).
cnf(u2684,negated_conjecture,
( ~ '$ki_accessible'(sK30,X0)
| '$ki_accessible'(X0,sK9(sK27,sK1(sK28),X0))
| '$ki_accessible'(X0,sK8(sK27,sK1(sK30),X0))
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK28),sK1(sK30)) ) ).
cnf(u302,negated_conjecture,
( ~ '$ki_accessible'(sK26,X2)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X0)
| ~ disjoint(sK25(sK27,X0,X1),sK27,X0)
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,X0,sK27) ) ).
cnf(u519,negated_conjecture,
( ~ '$ki_accessible'(sK26,X2)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X1)
| '$ki_accessible'(X0,sK25(sK27,X1,X0))
| ~ '$ki_accessible'(X0,X3)
| disjoint(X3,X1,sK27) ) ).
cnf(u2461,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK4(sK27,sK29,X1))
| '$ki_accessible'(X1,sK3(sK29,X2,X1))
| ~ '$ki_accessible'(X1,X3)
| qmltpeq(X3,sK27,X2) ) ).
cnf(u4300,axiom,
( ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X0)
| '$ki_accessible'(X0,sK19(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X0))
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK18(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X1)) ) ).
cnf(u1487,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| '$ki_accessible'(X0,sK13(sK1(sK26),sK1(sK28),X0))
| '$ki_accessible'(X0,sK12(sK1(sK26),X0))
| ~ '$ki_accessible'(X0,X1)
| empty(X1,sK1(sK28)) ) ).
cnf(u2765,negated_conjecture,
( ~ '$ki_accessible'(sK30,X0)
| '$ki_accessible'(X0,sK11(sK27,sK29,X0))
| '$ki_accessible'(X0,sK10(sK27,sK1(sK30),X0))
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK30),sK29) ) ).
cnf(u1848,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X2)
| ~ qmltpeq(sK15(sK1(sK0('$ki_local_world')),X0,X1),sK1(sK0('$ki_local_world')),X0)
| ~ in(sK14(sK1(sK0('$ki_local_world')),X3,X1),sK1(sK0('$ki_local_world')),X3)
| ~ '$ki_accessible'(X1,X4)
| in(X4,X0,X3) ) ).
cnf(u4203,axiom,
( ~ '$ki_exists_in_world_$i'(sK24(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X2)
| '$ki_accessible'(X0,sK4(sK1(sK0('$ki_local_world')),X1,X0))
| ~ qmltpeq(sK3(X1,X3,X0),X1,X3)
| ~ '$ki_accessible'(X0,X4)
| qmltpeq(X4,sK1(sK0('$ki_local_world')),X3) ) ).
cnf(u2369,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK28),X0)
| '$ki_accessible'(X0,sK6(sK1(sK26),sK29,X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(sK1(sK0(sK28)),sK1(sK26)),set_intersection2(sK1(sK0(sK28)),sK29)) ) ).
cnf(u1432,negated_conjecture,
'$ki_accessible'(sK12(sK27,sK31),sK18(sK27,sK1(sK28),sK12(sK27,sK31))) ).
cnf(u768,negated_conjecture,
~ '$ki_accessible'(sK31,sK31) ).
cnf(u2566,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK0(sK26)),X0)
| ~ '$ki_accessible'(sK0(sK0(sK26)),X1)
| '$ki_accessible'(X1,sK4(sK27,sK1(sK0(sK26)),X1))
| '$ki_accessible'(X1,sK3(sK1(sK0(sK26)),X0,X1))
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,sK27,X0) ) ).
cnf(u3510,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK31,X0)
| ~ '$ki_accessible'(sK31,X1)
| '$ki_accessible'(X1,sK17(sK27,sK29,X1))
| ~ in(sK16(sK27,X0,X1),X0,sK27)
| ~ '$ki_accessible'(X1,X2)
| in(X2,X0,sK29) ) ).
cnf(u161,axiom,
( ~ '$ki_accessible'('$ki_local_world',X0)
| ~ '$ki_accessible'(X6,X7)
| '$ki_accessible'(X6,sK8(X1,X5,X6))
| ~ qmltpeq(sK9(X1,X3,X6),X1,X3)
| ~ '$ki_accessible'(X4,X6)
| ~ '$ki_exists_in_world_$i'(X4,X5)
| ~ '$ki_accessible'(X2,X4)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| disjoint(X7,X3,X5) ) ).
cnf(u3404,negated_conjecture,
( ~ qmltpeq(sK9(sK27,sK29,X1),sK27,sK29)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK8(sK27,X2,X1))
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,sK29,X2) ) ).
cnf(u521,negated_conjecture,
( ~ '$ki_accessible'(sK26,X2)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X1)
| '$ki_accessible'(X0,sK19(sK27,X1,X0))
| ~ '$ki_accessible'(X0,X3)
| ~ in(sK18(sK27,X1,X3),X1,sK27) ) ).
cnf(u1447,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK24(sK26),X2)
| ~ qmltpeq(sK17(sK27,X0,X1),sK27,X0)
| ~ in(sK16(sK27,X3,X1),X3,sK27)
| ~ '$ki_accessible'(X1,X4)
| in(X4,X3,X0) ) ).
cnf(u727,negated_conjecture,
( ~ '$ki_accessible'(sK26,X2)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X0)
| ~ in(sK19(sK27,X0,X1),sK27,X0)
| ~ '$ki_accessible'(X1,X3)
| ~ in(sK18(sK27,X0,X3),X0,sK27) ) ).
cnf(u191,axiom,
( empty(X1,sK22)
| ~ '$ki_accessible'('$ki_local_world',X1) ) ).
cnf(u3517,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK24(sK26),X2)
| '$ki_accessible'(X0,sK4(sK1(sK26),X1,X0))
| '$ki_accessible'(X0,sK3(X1,X3,X0))
| ~ '$ki_accessible'(X0,X4)
| qmltpeq(X4,sK1(sK26),X3) ) ).
cnf(u2251,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK31,X0)
| ~ '$ki_accessible'(sK31,X1)
| '$ki_accessible'(X1,sK5(sK1(sK26),sK1(sK28),X1))
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,set_intersection2(sK1(sK26),X0),set_intersection2(sK1(sK28),X0)) ) ).
cnf(u495,negated_conjecture,
( ~ in(sK19(sK27,sK1(sK28),X0),sK27,sK1(sK28))
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK18(sK27,sK1(sK28),X1)) ) ).
cnf(u1650,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X1)
| ~ '$ki_accessible'(sK28,X0)
| '$ki_accessible'(X0,sK21(sK1(sK26),X1,X0))
| ~ '$ki_accessible'(X0,X2)
| qmltpeq(X2,set_intersection2(X1,singleton(sK1(sK26))),singleton(sK1(sK26))) ) ).
cnf(u196,axiom,
( ~ '$ki_accessible'('$ki_local_world',X0)
| ~ '$ki_accessible'(X4,X5)
| ~ disjoint(sK25(X1,X3,X4),X1,X3)
| ~ '$ki_accessible'(X2,X4)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| disjoint(X5,X3,X1) ) ).
cnf(u3403,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK0(sK26),X2)
| ~ qmltpeq(sK9(sK27,X0,X1),sK27,X0)
| '$ki_accessible'(X1,sK8(sK27,X3,X1))
| ~ '$ki_accessible'(X1,X4)
| disjoint(X4,X0,X3) ) ).
cnf(u418,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| '$ki_accessible'(X0,sK2(sK1(sK26),sK1(sK28),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,sK1(sK28),sK1(sK26)) ) ).
cnf(u389,negated_conjecture,
( ~ disjoint(sK25(sK1(sK26),sK1(sK28),X0),sK1(sK26),sK1(sK28))
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK28),sK1(sK26)) ) ).
cnf(u520,negated_conjecture,
( ~ '$ki_accessible'(sK26,X2)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X1)
| '$ki_accessible'(X0,sK25(sK1(sK26),X1,X0))
| ~ '$ki_accessible'(X0,X3)
| disjoint(X3,X1,sK1(sK26)) ) ).
cnf(u210,negated_conjecture,
( qmltpeq(X0,sK1(sK26),sK1(sK26))
| ~ '$ki_accessible'(sK26,X0) ) ).
cnf(u698,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK26),X0)
| '$ki_accessible'(X0,sK25(sK1(sK26),sK1(sK0(sK26)),X0))
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK0(sK26)),sK1(sK26)) ) ).
cnf(u1731,axiom,
( ~ '$ki_exists_in_world_$i'(sK0('$ki_local_world'),X2)
| '$ki_accessible'(X0,sK10(X2,X3,X0))
| ~ qmltpeq(sK11(X2,X4,X0),X2,X4)
| ~ '$ki_accessible'(X5,X0)
| ~ '$ki_exists_in_world_$i'(X5,X3)
| ~ '$ki_accessible'(X6,X5)
| ~ '$ki_exists_in_world_$i'(X6,X4)
| ~ '$ki_accessible'(sK0('$ki_local_world'),X6)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,X3,X4) ) ).
cnf(u830,negated_conjecture,
( ~ in(sK21(sK27,sK1(sK28),X0),sK27,sK1(sK28))
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(sK1(sK28),singleton(sK27)),singleton(sK27)) ) ).
cnf(u729,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X1)
| ~ '$ki_accessible'(sK28,X0)
| ~ in(sK19(sK27,X1,X0),sK27,X1)
| ~ '$ki_accessible'(X0,X2)
| ~ in(sK18(sK27,X1,X2),X1,sK27) ) ).
cnf(u622,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X1)
| ~ '$ki_accessible'(sK0(sK26),X0)
| '$ki_accessible'(X0,sK25(sK1(sK26),X1,X0))
| ~ '$ki_accessible'(X0,X2)
| disjoint(X2,X1,sK1(sK26)) ) ).
cnf(u900,negated_conjecture,
( ~ '$ki_accessible'(sK26,X4)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(X4,X2)
| ~ '$ki_exists_in_world_$i'(X4,X0)
| ~ qmltpeq(sK6(sK27,X0,X1),sK27,X0)
| ~ '$ki_accessible'(X1,X5)
| qmltpeq(X5,set_intersection2(X3,sK27),set_intersection2(X3,X0)) ) ).
cnf(u1438,negated_conjecture,
empty(sK12(sK27,sK0(sK28)),sK29) ).
cnf(u156,axiom,
( ~ '$ki_accessible'('$ki_local_world',X0)
| ~ '$ki_accessible'(X6,X7)
| '$ki_accessible'(X6,sK6(X1,X3,X6))
| ~ '$ki_accessible'(X4,X6)
| ~ '$ki_exists_in_world_$i'(X4,X5)
| ~ '$ki_accessible'(X2,X4)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| qmltpeq(X7,set_intersection2(X5,X1),set_intersection2(X5,X3)) ) ).
cnf(u1540,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK28,X2)
| ~ qmltpeq(sK9(sK1(sK26),X0,X1),sK1(sK26),X0)
| ~ disjoint(sK8(sK1(sK26),X3,X1),sK1(sK26),X3)
| ~ '$ki_accessible'(X1,X4)
| disjoint(X4,X0,X3) ) ).
cnf(u378,negated_conjecture,
( ~ qmltpeq(sK2(sK1(sK26),sK1(sK28),X0),sK1(sK26),sK1(sK28))
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,sK1(sK28),sK1(sK26)) ) ).
cnf(u1730,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK26,X2)
| '$ki_accessible'(X0,sK10(X2,X3,X0))
| ~ qmltpeq(sK11(X2,X4,X0),X2,X4)
| ~ '$ki_accessible'(X5,X0)
| ~ '$ki_exists_in_world_$i'(X5,X3)
| ~ '$ki_accessible'(X6,X5)
| ~ '$ki_exists_in_world_$i'(X6,X4)
| ~ '$ki_accessible'(sK26,X6)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,X3,X4) ) ).
cnf(u595,axiom,
( ~ '$ki_exists_in_world_$i'(sK0('$ki_local_world'),X4)
| ~ qmltpeq(sK3(X2,X3,X0),X2,X3)
| ~ qmltpeq(sK4(X4,X2,X0),X4,X2)
| ~ '$ki_accessible'(X5,X0)
| ~ '$ki_exists_in_world_$i'(X5,X3)
| ~ '$ki_accessible'(X6,X5)
| ~ '$ki_exists_in_world_$i'(X6,X2)
| ~ '$ki_accessible'(sK0('$ki_local_world'),X6)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,X4,X3) ) ).
cnf(u170,axiom,
( ~ '$ki_accessible'('$ki_local_world',X0)
| ~ '$ki_accessible'(X4,X5)
| ~ empty(sK12(X1,X4),X1)
| '$ki_accessible'(X4,sK13(X1,X3,X4))
| ~ '$ki_accessible'(X2,X4)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| empty(X5,X3) ) ).
cnf(u530,negated_conjecture,
( ~ in(sK18(sK27,sK1(sK28),X1),sK1(sK28),sK27)
| '$ki_accessible'(X0,sK19(sK27,sK1(sK28),X0))
| ~ '$ki_accessible'(X0,X1)
| ~ '$ki_accessible'(sK28,X0) ) ).
cnf(u1141,negated_conjecture,
( ~ qmltpeq(sK6(sK1(sK26),sK1(sK28),X2),sK1(sK26),sK1(sK28))
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ '$ki_accessible'(X2,X3)
| qmltpeq(X3,set_intersection2(X1,sK1(sK26)),set_intersection2(X1,sK1(sK28))) ) ).
cnf(u899,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X1)
| ~ '$ki_accessible'(sK0(sK26),X0)
| ~ in(sK19(sK1(sK26),X1,X0),sK1(sK26),X1)
| ~ '$ki_accessible'(X0,X2)
| ~ in(sK18(sK1(sK26),X1,X2),X1,sK1(sK26)) ) ).
cnf(u272,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK26,X2)
| ~ qmltpeq(sK2(X2,X3,X0),X2,X3)
| ~ '$ki_accessible'(X4,X0)
| ~ '$ki_exists_in_world_$i'(X4,X3)
| ~ '$ki_accessible'(sK26,X4)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,X3,X2) ) ).
cnf(u3394,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK28),X0)
| ~ '$ki_accessible'(sK0(sK28),X1)
| '$ki_accessible'(X1,sK4(sK27,sK1(sK28),X1))
| ~ qmltpeq(sK3(sK1(sK28),X0,X1),sK1(sK28),X0)
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,sK27,X0) ) ).
cnf(u1445,axiom,
( ~ '$ki_accessible'(sK0('$ki_local_world'),X2)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X0)
| ~ in(sK21(sK1(sK0('$ki_local_world')),X0,X1),sK1(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X1,X3)
| qmltpeq(X3,set_intersection2(X0,singleton(sK1(sK0('$ki_local_world')))),singleton(sK1(sK0('$ki_local_world')))) ) ).
cnf(u728,negated_conjecture,
( ~ '$ki_accessible'(sK26,X2)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X0)
| ~ in(sK19(sK1(sK26),X0,X1),sK1(sK26),X0)
| ~ '$ki_accessible'(X1,X3)
| ~ in(sK18(sK1(sK26),X0,X3),X0,sK1(sK26)) ) ).
cnf(u257,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK26,X2)
| '$ki_accessible'(X0,sK2(X2,X3,X0))
| ~ '$ki_accessible'(X4,X0)
| ~ '$ki_exists_in_world_$i'(X4,X3)
| ~ '$ki_accessible'(sK26,X4)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,X3,X2) ) ).
cnf(u3416,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK28),X0)
| ~ '$ki_accessible'(sK0(sK28),X1)
| '$ki_accessible'(X1,sK9(sK27,sK29,X1))
| ~ disjoint(sK8(sK27,X0,X1),sK27,X0)
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,sK29,X0) ) ).
cnf(u201,negated_conjecture,
'$ki_accessible'(sK28,sK31) ).
cnf(u287,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK26,X2)
| '$ki_accessible'(X0,sK25(X2,X3,X0))
| ~ '$ki_accessible'(X4,X0)
| ~ '$ki_exists_in_world_$i'(X4,X3)
| ~ '$ki_accessible'(sK26,X4)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,X3,X2) ) ).
cnf(u1398,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK26,X2)
| '$ki_accessible'(X0,sK16(X2,X3,X0))
| '$ki_accessible'(X0,sK17(X2,X4,X0))
| ~ '$ki_accessible'(X5,X0)
| ~ '$ki_exists_in_world_$i'(X5,X3)
| ~ '$ki_accessible'(X6,X5)
| ~ '$ki_exists_in_world_$i'(X6,X4)
| ~ '$ki_accessible'(sK26,X6)
| ~ '$ki_accessible'(X0,X1)
| in(X1,X3,X4) ) ).
cnf(u3401,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK28,X2)
| ~ qmltpeq(sK9(sK27,X0,X1),sK27,X0)
| '$ki_accessible'(X1,sK8(sK27,X3,X1))
| ~ '$ki_accessible'(X1,X4)
| disjoint(X4,X0,X3) ) ).
cnf(u4430,axiom,
( ~ '$ki_accessible'(sK0(sK0(sK0('$ki_local_world'))),X0)
| '$ki_accessible'(X0,sK5(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(sK1(sK0('$ki_local_world')),sK1(sK0(sK0(sK0('$ki_local_world'))))),set_intersection2(sK1(sK0(sK0('$ki_local_world'))),sK1(sK0(sK0(sK0('$ki_local_world')))))) ) ).
cnf(u4111,negated_conjecture,
( ~ qmltpeq(sK17(sK1(sK26),sK29,X1),sK1(sK26),sK29)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK16(sK1(sK26),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| in(X3,X2,sK29) ) ).
cnf(u1550,axiom,
( ~ '$ki_exists_in_world_$i'(sK0('$ki_local_world'),X2)
| '$ki_accessible'(X0,sK8(X2,X3,X0))
| ~ qmltpeq(sK9(X2,X4,X0),X2,X4)
| ~ '$ki_accessible'(X5,X0)
| ~ '$ki_exists_in_world_$i'(X5,X3)
| ~ '$ki_accessible'(X6,X5)
| ~ '$ki_exists_in_world_$i'(X6,X4)
| ~ '$ki_accessible'(sK0('$ki_local_world'),X6)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,X4,X3) ) ).
cnf(u2006,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK0(sK26)),X0)
| '$ki_accessible'(X0,sK5(sK27,sK1(sK0(sK26)),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(sK27,sK1(sK0(sK0(sK26)))),set_intersection2(sK1(sK0(sK26)),sK1(sK0(sK0(sK26))))) ) ).
cnf(u309,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X1)
| ~ '$ki_accessible'(sK28,X0)
| '$ki_accessible'(X0,sK2(sK27,X1,X0))
| ~ '$ki_accessible'(X0,X2)
| qmltpeq(X2,X1,sK27) ) ).
cnf(u3431,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK0(sK26)),X0)
| ~ '$ki_accessible'(sK0(sK0(sK26)),X1)
| '$ki_accessible'(X1,sK9(sK27,sK1(sK0(sK26)),X1))
| ~ disjoint(sK8(sK27,X0,X1),sK27,X0)
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,sK1(sK0(sK26)),X0) ) ).
cnf(u2494,negated_conjecture,
( ~ '$ki_accessible'(sK26,X4)
| '$ki_accessible'(X1,sK15(sK27,X2,X1))
| ~ '$ki_accessible'(X3,X1)
| ~ '$ki_exists_in_world_$i'(X3,X0)
| ~ '$ki_accessible'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X4,X2)
| ~ in(sK14(sK27,X0,X1),sK27,X0)
| ~ '$ki_accessible'(X1,X5)
| in(X5,X2,X0) ) ).
cnf(u4452,axiom,
( ~ '$ki_accessible'(sK0(sK0(sK0('$ki_local_world'))),X0)
| '$ki_accessible'(X0,sK11(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X0))
| '$ki_accessible'(X0,sK10(sK1(sK0('$ki_local_world')),sK1(sK0(sK0(sK0('$ki_local_world')))),X0))
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK0(sK0(sK0('$ki_local_world')))),sK1(sK0(sK0('$ki_local_world')))) ) ).
cnf(u1212,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK0(sK26),X2)
| ~ qmltpeq(sK4(sK27,X0,X1),sK27,X0)
| ~ qmltpeq(sK3(X0,X3,X1),X0,X3)
| ~ '$ki_accessible'(X1,X4)
| qmltpeq(X4,sK27,X3) ) ).
cnf(u2388,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK31,X0)
| ~ '$ki_accessible'(sK31,X1)
| '$ki_accessible'(X1,sK6(sK1(sK26),sK1(sK28),X1))
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,set_intersection2(X0,sK1(sK26)),set_intersection2(X0,sK1(sK28))) ) ).
cnf(u738,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| '$ki_accessible'(X0,sK20(sK27,sK1(sK28),X0))
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,singleton(sK27),sK1(sK28)) ) ).
cnf(u1651,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X1)
| ~ '$ki_accessible'(sK24(sK26),X0)
| '$ki_accessible'(X0,sK21(sK1(sK26),X1,X0))
| ~ '$ki_accessible'(X0,X2)
| qmltpeq(X2,set_intersection2(X1,singleton(sK1(sK26))),singleton(sK1(sK26))) ) ).
cnf(u2013,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ '$ki_accessible'(X0,X2)
| '$ki_accessible'(X2,sK6(sK27,sK1(sK28),X2))
| ~ '$ki_accessible'(X2,X3)
| qmltpeq(X3,set_intersection2(X1,sK27),set_intersection2(X1,sK1(sK28))) ) ).
cnf(u1235,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X1)
| ~ '$ki_accessible'(sK0(sK26),X0)
| '$ki_accessible'(X0,sK19(sK1(sK26),X1,X0))
| ~ '$ki_accessible'(X0,X2)
| '$ki_accessible'(X2,sK18(sK1(sK26),X1,X2)) ) ).
cnf(u4451,axiom,
( ~ qmltpeq(sK4(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X1),sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK3(sK1(sK0(sK0('$ki_local_world'))),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| qmltpeq(X3,sK1(sK0('$ki_local_world')),X2) ) ).
cnf(u4390,axiom,
( ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(sK20(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X0),X1)
| in(X1,sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))))
| ~ '$ki_accessible'(X0,X2)
| disjoint(X2,singleton(sK1(sK0('$ki_local_world'))),sK1(sK0(sK0('$ki_local_world')))) ) ).
cnf(u4412,axiom,
( ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X0)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ '$ki_accessible'(X0,X2)
| '$ki_accessible'(X2,sK6(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X2))
| ~ '$ki_accessible'(X2,X3)
| qmltpeq(X3,set_intersection2(X1,sK1(sK0('$ki_local_world'))),set_intersection2(X1,sK1(sK0(sK0('$ki_local_world'))))) ) ).
cnf(u1758,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X0)
| ~ '$ki_accessible'(sK0(sK26),X1)
| ~ qmltpeq(sK13(sK27,X0,X1),sK27,X0)
| '$ki_accessible'(X1,sK12(sK27,X1))
| ~ '$ki_accessible'(X1,X2)
| empty(X2,X0) ) ).
cnf(u2606,negated_conjecture,
( ~ '$ki_accessible'(sK30,X0)
| '$ki_accessible'(X0,sK9(sK27,sK29,X0))
| '$ki_accessible'(X0,sK8(sK27,sK1(sK30),X0))
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK29,sK1(sK30)) ) ).
cnf(u2884,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK0(sK26)),X0)
| ~ '$ki_accessible'(sK0(sK0(sK26)),X1)
| '$ki_accessible'(X1,sK11(sK27,sK1(sK0(sK26)),X1))
| '$ki_accessible'(X1,sK10(sK27,X0,X1))
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,X0,sK1(sK0(sK26))) ) ).
cnf(u3422,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK30,X0)
| ~ '$ki_accessible'(sK30,X1)
| '$ki_accessible'(X1,sK9(sK27,sK1(sK28),X1))
| ~ disjoint(sK8(sK27,X0,X1),sK27,X0)
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,sK1(sK28),X0) ) ).
cnf(u1541,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK24(sK26),X2)
| ~ qmltpeq(sK9(sK1(sK26),X0,X1),sK1(sK26),X0)
| ~ disjoint(sK8(sK1(sK26),X3,X1),sK1(sK26),X3)
| ~ '$ki_accessible'(X1,X4)
| disjoint(X4,X0,X3) ) ).
cnf(u1485,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X1)
| ~ '$ki_accessible'(sK0(sK26),X0)
| '$ki_accessible'(X0,sK13(sK1(sK26),X1,X0))
| '$ki_accessible'(X0,sK12(sK1(sK26),X0))
| ~ '$ki_accessible'(X0,X2)
| empty(X2,X1) ) ).
cnf(u3922,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK31,X0)
| ~ '$ki_accessible'(sK31,X1)
| '$ki_accessible'(X1,sK17(sK1(sK26),sK29,X1))
| '$ki_accessible'(X1,sK16(sK1(sK26),X0,X1))
| ~ '$ki_accessible'(X1,X2)
| in(X2,X0,sK29) ) ).
cnf(u3444,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK0(sK26),X2)
| '$ki_accessible'(X0,sK11(sK27,X1,X0))
| ~ disjoint(sK10(sK27,X3,X0),X3,sK27)
| ~ '$ki_accessible'(X0,X4)
| disjoint(X4,X3,X1) ) ).
cnf(u4411,axiom,
( ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X0)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ '$ki_accessible'(X0,X2)
| '$ki_accessible'(X2,sK6(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X2))
| ~ '$ki_accessible'(X2,X3)
| qmltpeq(X3,set_intersection2(X1,sK1(sK0('$ki_local_world'))),set_intersection2(X1,sK1(sK24(sK0('$ki_local_world'))))) ) ).
cnf(u2579,negated_conjecture,
( ~ '$ki_accessible'(sK31,X0)
| '$ki_accessible'(X0,sK9(sK27,sK29,X0))
| '$ki_accessible'(X0,sK8(sK27,sK1(sK31),X0))
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK29,sK1(sK31)) ) ).
cnf(u4227,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK24(sK26)),X0)
| ~ '$ki_accessible'(sK0(sK24(sK26)),X1)
| '$ki_accessible'(X1,sK17(sK1(sK26),sK1(sK24(sK26)),X1))
| ~ in(sK16(sK1(sK26),X0,X1),X0,sK1(sK26))
| ~ '$ki_accessible'(X1,X2)
| in(X2,X0,sK1(sK24(sK26))) ) ).
cnf(u2883,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK24(sK26)),X0)
| ~ '$ki_accessible'(sK0(sK24(sK26)),X1)
| '$ki_accessible'(X1,sK11(sK27,sK1(sK24(sK26)),X1))
| '$ki_accessible'(X1,sK10(sK27,X0,X1))
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,X0,sK1(sK24(sK26))) ) ).
cnf(u3429,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK9(sK27,sK1(sK0(sK26)),X1))
| ~ disjoint(sK8(sK27,X2,X1),sK27,X2)
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,sK1(sK0(sK26)),X2) ) ).
cnf(u4249,axiom,
( ~ '$ki_exists_in_world_$i'(sK24(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X2)
| '$ki_accessible'(X0,sK15(sK1(sK0('$ki_local_world')),X1,X0))
| ~ in(sK14(sK1(sK0('$ki_local_world')),X3,X0),sK1(sK0('$ki_local_world')),X3)
| ~ '$ki_accessible'(X0,X4)
| in(X4,X1,X3) ) ).
cnf(u4142,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK0(sK26)),X0)
| ~ '$ki_accessible'(sK0(sK0(sK26)),X1)
| '$ki_accessible'(X1,sK17(sK1(sK26),sK1(sK0(sK26)),X1))
| '$ki_accessible'(X1,sK16(sK1(sK26),X0,X1))
| ~ '$ki_accessible'(X1,X2)
| in(X2,X0,sK1(sK0(sK26))) ) ).
cnf(u3929,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK24(sK26),X2)
| '$ki_accessible'(X0,sK11(sK1(sK26),X1,X0))
| ~ disjoint(sK10(sK1(sK26),X3,X0),X3,sK1(sK26))
| ~ '$ki_accessible'(X0,X4)
| disjoint(X4,X3,X1) ) ).
cnf(u3443,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK24(sK26),X2)
| '$ki_accessible'(X0,sK11(sK27,X1,X0))
| ~ disjoint(sK10(sK27,X3,X0),X3,sK27)
| ~ '$ki_accessible'(X0,X4)
| disjoint(X4,X3,X1) ) ).
cnf(u2185,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ '$ki_accessible'(X0,X2)
| '$ki_accessible'(X2,sK5(sK1(sK26),sK29,X2))
| ~ '$ki_accessible'(X2,X3)
| qmltpeq(X3,set_intersection2(sK1(sK26),X1),set_intersection2(sK29,X1)) ) ).
cnf(u2078,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK28),X0)
| ~ '$ki_accessible'(sK0(sK28),X1)
| '$ki_accessible'(X1,sK6(sK27,sK1(sK28),X1))
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,set_intersection2(X0,sK27),set_intersection2(X0,sK1(sK28))) ) ).
cnf(u4656,axiom,
( ~ in(sK16(sK1(sK0('$ki_local_world')),sK1(sK0(sK0(sK0('$ki_local_world')))),X0),sK1(sK0(sK0(sK0('$ki_local_world')))),sK1(sK0('$ki_local_world')))
| '$ki_accessible'(X0,sK17(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X0))
| ~ '$ki_accessible'(sK0(sK0(sK0('$ki_local_world'))),X0)
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK1(sK0(sK0(sK0('$ki_local_world')))),sK1(sK0(sK0('$ki_local_world')))) ) ).
cnf(u2894,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK28),X0)
| ~ '$ki_accessible'(sK0(sK28),X1)
| '$ki_accessible'(X1,sK15(sK27,sK29,X1))
| '$ki_accessible'(X1,sK14(sK27,X0,X1))
| ~ '$ki_accessible'(X1,X2)
| in(X2,sK29,X0) ) ).
cnf(u4129,axiom,
( ~ '$ki_exists_in_world_$i'(sK24(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(sK20(sK1(sK0('$ki_local_world')),X0,X1),X2)
| in(X2,sK1(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,singleton(sK1(sK0('$ki_local_world'))),X0) ) ).
cnf(u3940,negated_conjecture,
( ~ '$ki_accessible'(sK31,X0)
| '$ki_accessible'(X0,sK17(sK1(sK26),sK1(sK28),X0))
| '$ki_accessible'(X0,sK16(sK1(sK26),sK1(sK31),X0))
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK1(sK31),sK1(sK28)) ) ).
cnf(u4298,axiom,
( ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X0)
| '$ki_accessible'(X0,sK7(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,singleton(sK1(sK0('$ki_local_world'))),singleton(sK1(sK0(sK0('$ki_local_world'))))) ) ).
cnf(u4159,axiom,
( ~ '$ki_exists_in_world_$i'(sK24(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X2)
| '$ki_accessible'(X0,sK9(sK1(sK0('$ki_local_world')),X1,X0))
| '$ki_accessible'(X0,sK8(sK1(sK0('$ki_local_world')),X3,X0))
| ~ '$ki_accessible'(X0,X4)
| disjoint(X4,X1,X3) ) ).
cnf(u3524,negated_conjecture,
( ~ in(sK16(sK27,sK1(sK0(sK28)),X0),sK1(sK0(sK28)),sK27)
| '$ki_accessible'(X0,sK17(sK27,sK1(sK28),X0))
| ~ '$ki_accessible'(sK0(sK28),X0)
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK1(sK0(sK28)),sK1(sK28)) ) ).
cnf(u4372,axiom,
( ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X0)
| '$ki_accessible'(X0,sK21(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(sK1(sK24(sK0('$ki_local_world'))),singleton(sK1(sK0('$ki_local_world')))),singleton(sK1(sK0('$ki_local_world')))) ) ).
cnf(u2722,negated_conjecture,
( ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK9(sK27,sK1(sK24(sK26)),X1))
| '$ki_accessible'(X1,sK8(sK27,X2,X1))
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,sK1(sK24(sK26)),X2) ) ).
cnf(u4209,negated_conjecture,
( ~ qmltpeq(sK15(sK1(sK26),sK1(sK24(sK26)),X1),sK1(sK26),sK1(sK24(sK26)))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK14(sK1(sK26),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| in(X3,sK1(sK24(sK26)),X2) ) ).
cnf(u3834,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK15(sK1(sK26),sK29,X1))
| '$ki_accessible'(X1,sK14(sK1(sK26),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| in(X3,sK29,X2) ) ).
cnf(u2571,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK28,X2)
| '$ki_accessible'(X0,sK9(sK27,X1,X0))
| '$ki_accessible'(X0,sK8(sK27,X3,X0))
| ~ '$ki_accessible'(X0,X4)
| disjoint(X4,X1,X3) ) ).
cnf(u3939,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK28),X0)
| ~ '$ki_accessible'(sK0(sK28),X1)
| '$ki_accessible'(X1,sK17(sK1(sK26),sK1(sK28),X1))
| '$ki_accessible'(X1,sK16(sK1(sK26),X0,X1))
| ~ '$ki_accessible'(X1,X2)
| in(X2,X0,sK1(sK28)) ) ).
cnf(u4386,axiom,
( ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X0)
| '$ki_accessible'(X0,sK21(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(sK1(sK0(sK0('$ki_local_world'))),singleton(sK1(sK0('$ki_local_world')))),singleton(sK1(sK0('$ki_local_world')))) ) ).
cnf(u4357,axiom,
'$ki_accessible'(sK0(sK0(sK0(sK0('$ki_local_world')))),sK18(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),sK0(sK0(sK0(sK0('$ki_local_world')))))) ).
cnf(u3617,negated_conjecture,
( ~ '$ki_accessible'(sK30,X0)
| '$ki_accessible'(X0,sK4(sK1(sK26),sK1(sK28),X0))
| '$ki_accessible'(X0,sK3(sK1(sK28),sK1(sK30),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,sK1(sK26),sK1(sK30)) ) ).
cnf(u3523,negated_conjecture,
( ~ in(sK16(sK27,sK1(sK30),X0),sK1(sK30),sK27)
| '$ki_accessible'(X0,sK17(sK27,sK1(sK28),X0))
| ~ '$ki_accessible'(sK30,X0)
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK1(sK30),sK1(sK28)) ) ).
cnf(u3921,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK17(sK1(sK26),sK1(sK28),X1))
| '$ki_accessible'(X1,sK16(sK1(sK26),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| in(X3,X2,sK1(sK28)) ) ).
cnf(u4437,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK24(sK0('$ki_local_world'))),X0)
| ~ '$ki_accessible'(sK0(sK24(sK0('$ki_local_world'))),X1)
| '$ki_accessible'(X1,sK9(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X1))
| '$ki_accessible'(X1,sK8(sK1(sK0('$ki_local_world')),X0,X1))
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,sK1(sK24(sK0('$ki_local_world'))),X0) ) ).
cnf(u2886,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK0(sK26)),X0)
| '$ki_accessible'(X0,sK11(sK27,sK1(sK0(sK26)),X0))
| '$ki_accessible'(X0,sK10(sK27,sK1(sK0(sK0(sK26))),X0))
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK0(sK0(sK26))),sK1(sK0(sK26))) ) ).
cnf(u3514,negated_conjecture,
( ~ in(sK16(sK27,sK1(sK30),X0),sK1(sK30),sK27)
| '$ki_accessible'(X0,sK17(sK27,sK29,X0))
| ~ '$ki_accessible'(sK30,X0)
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK1(sK30),sK29) ) ).
cnf(u1543,negated_conjecture,
( ~ qmltpeq(sK9(sK1(sK26),sK29,X1),sK1(sK26),sK29)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| ~ disjoint(sK8(sK1(sK26),X2,X1),sK1(sK26),X2)
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,sK29,X2) ) ).
cnf(u3724,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK28,X2)
| '$ki_accessible'(X0,sK4(sK1(sK26),X1,X0))
| ~ qmltpeq(sK3(X1,X3,X0),X1,X3)
| ~ '$ki_accessible'(X0,X4)
| qmltpeq(X4,sK1(sK26),X3) ) ).
cnf(u3408,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK28,X2)
| '$ki_accessible'(X0,sK9(sK27,X1,X0))
| ~ disjoint(sK8(sK27,X3,X0),sK27,X3)
| ~ '$ki_accessible'(X0,X4)
| disjoint(X4,X1,X3) ) ).
cnf(u3200,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK0(sK26)),X0)
| ~ '$ki_accessible'(sK0(sK0(sK26)),X1)
| '$ki_accessible'(X1,sK17(sK27,sK1(sK0(sK26)),X1))
| '$ki_accessible'(X1,sK16(sK27,X0,X1))
| ~ '$ki_accessible'(X1,X2)
| in(X2,X0,sK1(sK0(sK26))) ) ).
cnf(u2893,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK30,X0)
| ~ '$ki_accessible'(sK30,X1)
| '$ki_accessible'(X1,sK15(sK27,sK29,X1))
| '$ki_accessible'(X1,sK14(sK27,X0,X1))
| ~ '$ki_accessible'(X1,X2)
| in(X2,sK29,X0) ) ).
cnf(u3393,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK30,X0)
| ~ '$ki_accessible'(sK30,X1)
| '$ki_accessible'(X1,sK4(sK27,sK1(sK28),X1))
| ~ qmltpeq(sK3(sK1(sK28),X0,X1),sK1(sK28),X0)
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,sK27,X0) ) ).
cnf(u1792,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(sK20(sK27,sK29,X0),X1)
| in(X1,sK27,sK29)
| ~ '$ki_accessible'(X0,X2)
| disjoint(X2,singleton(sK27),sK29) ) ).
cnf(u3931,negated_conjecture,
( ~ '$ki_accessible'(sK30,X0)
| '$ki_accessible'(X0,sK17(sK1(sK26),sK29,X0))
| '$ki_accessible'(X0,sK16(sK1(sK26),sK1(sK30),X0))
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK1(sK30),sK29) ) ).
cnf(u3423,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK28),X0)
| ~ '$ki_accessible'(sK0(sK28),X1)
| '$ki_accessible'(X1,sK9(sK27,sK1(sK28),X1))
| ~ disjoint(sK8(sK27,X0,X1),sK27,X0)
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,sK1(sK28),X0) ) ).
cnf(u2703,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK28),X0)
| '$ki_accessible'(X0,sK9(sK27,sK1(sK28),X0))
| '$ki_accessible'(X0,sK8(sK27,sK1(sK0(sK28)),X0))
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK28),sK1(sK0(sK28))) ) ).
cnf(u1545,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X1)
| ~ '$ki_accessible'(sK28,X0)
| '$ki_accessible'(X0,sK21(sK27,X1,X0))
| ~ '$ki_accessible'(X0,X2)
| qmltpeq(X2,set_intersection2(X1,singleton(sK27)),singleton(sK27)) ) ).
cnf(u1807,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X0)
| ~ in(sK21(sK1(sK0('$ki_local_world')),X1,X0),sK1(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(X0,X2)
| qmltpeq(X2,set_intersection2(X1,singleton(sK1(sK0('$ki_local_world')))),singleton(sK1(sK0('$ki_local_world')))) ) ).
cnf(u4199,negated_conjecture,
( ~ qmltpeq(sK9(sK1(sK26),sK1(sK24(sK26)),X1),sK1(sK26),sK1(sK24(sK26)))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK8(sK1(sK26),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,sK1(sK24(sK26)),X2) ) ).
cnf(u2493,negated_conjecture,
( ~ '$ki_accessible'(sK30,X0)
| '$ki_accessible'(X0,sK4(sK27,sK29,X0))
| '$ki_accessible'(X0,sK3(sK29,sK1(sK30),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,sK27,sK1(sK30)) ) ).
cnf(u4221,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK24(sK26)),X0)
| ~ '$ki_accessible'(sK0(sK24(sK26)),X1)
| '$ki_accessible'(X1,sK11(sK1(sK26),sK1(sK24(sK26)),X1))
| ~ disjoint(sK10(sK1(sK26),X0,X1),X0,sK1(sK26))
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,X0,sK1(sK24(sK26))) ) ).
cnf(u2186,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ '$ki_accessible'(X0,X2)
| '$ki_accessible'(X2,sK5(sK1(sK26),sK1(sK28),X2))
| ~ '$ki_accessible'(X2,X3)
| qmltpeq(X3,set_intersection2(sK1(sK26),X1),set_intersection2(sK1(sK28),X1)) ) ).
cnf(u4037,negated_conjecture,
( ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK4(sK1(sK26),sK1(sK24(sK26)),X1))
| '$ki_accessible'(X1,sK3(sK1(sK24(sK26)),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| qmltpeq(X3,sK1(sK26),X2) ) ).
cnf(u1442,negated_conjecture,
'$ki_accessible'(sK12(sK27,sK0(sK28)),sK18(sK27,sK29,sK12(sK27,sK0(sK28)))) ).
cnf(u4107,negated_conjecture,
( ~ in(sK14(sK1(sK26),sK1(sK30),X0),sK1(sK26),sK1(sK30))
| '$ki_accessible'(X0,sK15(sK1(sK26),sK1(sK28),X0))
| ~ '$ki_accessible'(sK30,X0)
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK1(sK28),sK1(sK30)) ) ).
cnf(u1802,axiom,
( ~ in(sK19(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X0),sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))))
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X0,X1)
| ~ in(sK18(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X1),sK1(sK0(sK0('$ki_local_world'))),sK1(sK0('$ki_local_world'))) ) ).
cnf(u3835,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK15(sK1(sK26),sK1(sK28),X1))
| '$ki_accessible'(X1,sK14(sK1(sK26),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| in(X3,sK1(sK28),X2) ) ).
cnf(u1544,negated_conjecture,
( ~ qmltpeq(sK9(sK1(sK26),sK1(sK28),X1),sK1(sK26),sK1(sK28))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| ~ disjoint(sK8(sK1(sK26),X2,X1),sK1(sK26),X2)
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,sK1(sK28),X2) ) ).
cnf(u1234,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X1)
| ~ '$ki_accessible'(sK24(sK26),X0)
| '$ki_accessible'(X0,sK19(sK1(sK26),X1,X0))
| ~ '$ki_accessible'(X0,X2)
| '$ki_accessible'(X2,sK18(sK1(sK26),X1,X2)) ) ).
cnf(u4240,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK0(sK26)),X0)
| ~ '$ki_accessible'(sK0(sK0(sK26)),X1)
| '$ki_accessible'(X1,sK4(sK1(sK26),sK1(sK0(sK26)),X1))
| ~ qmltpeq(sK3(sK1(sK0(sK26)),X0,X1),sK1(sK0(sK26)),X0)
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,sK1(sK26),X0) ) ).
cnf(u800,negated_conjecture,
( ~ empty(sK12(sK27,X0),sK27)
| ~ qmltpeq(sK13(sK27,X1,X0),sK27,X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X1)
| ~ '$ki_accessible'(sK26,X2)
| ~ '$ki_accessible'(X0,X3)
| empty(X3,X1) ) ).
cnf(u592,negated_conjecture,
( ~ in(sK18(sK27,sK1(sK0(sK26)),X1),sK1(sK0(sK26)),sK27)
| '$ki_accessible'(X0,sK19(sK27,sK1(sK0(sK26)),X0))
| ~ '$ki_accessible'(X0,X1)
| ~ '$ki_accessible'(sK0(sK26),X0) ) ).
cnf(u2431,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK28),X0)
| '$ki_accessible'(X0,sK6(sK1(sK26),sK1(sK28),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(sK1(sK0(sK28)),sK1(sK26)),set_intersection2(sK1(sK0(sK28)),sK1(sK28))) ) ).
cnf(u3414,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK31,X0)
| ~ '$ki_accessible'(sK31,X1)
| '$ki_accessible'(X1,sK9(sK27,sK29,X1))
| ~ disjoint(sK8(sK27,X0,X1),sK27,X0)
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,sK29,X0) ) ).
cnf(u1449,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK26,X4)
| '$ki_accessible'(X0,sK3(X2,X3,X0))
| ~ qmltpeq(sK4(X4,X2,X0),X4,X2)
| ~ '$ki_accessible'(X5,X0)
| ~ '$ki_exists_in_world_$i'(X5,X3)
| ~ '$ki_accessible'(X6,X5)
| ~ '$ki_exists_in_world_$i'(X6,X2)
| ~ '$ki_accessible'(sK26,X6)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,X4,X3) ) ).
cnf(u384,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK26),X0)
| '$ki_accessible'(X0,sK2(sK27,sK1(sK0(sK26)),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,sK1(sK0(sK26)),sK27) ) ).
cnf(u1809,axiom,
( ~ in(sK21(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X0),sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))))
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(sK1(sK24(sK0('$ki_local_world'))),singleton(sK1(sK0('$ki_local_world')))),singleton(sK1(sK0('$ki_local_world')))) ) ).
cnf(u2015,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK30,X0)
| ~ '$ki_accessible'(sK30,X1)
| '$ki_accessible'(X1,sK6(sK27,sK29,X1))
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,set_intersection2(X0,sK27),set_intersection2(X0,sK29)) ) ).
cnf(u3436,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK0(sK26),X2)
| ~ qmltpeq(sK11(sK27,X0,X1),sK27,X0)
| '$ki_accessible'(X1,sK10(sK27,X3,X1))
| ~ '$ki_accessible'(X1,X4)
| disjoint(X4,X3,X0) ) ).
cnf(u1351,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK28,X2)
| ~ qmltpeq(sK15(sK27,X0,X1),sK27,X0)
| ~ in(sK14(sK27,X3,X1),sK27,X3)
| ~ '$ki_accessible'(X1,X4)
| in(X4,X0,X3) ) ).
cnf(u414,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X1)
| ~ '$ki_accessible'(sK28,X0)
| '$ki_accessible'(X0,sK2(sK1(sK26),X1,X0))
| ~ '$ki_accessible'(X0,X2)
| qmltpeq(X2,X1,sK1(sK26)) ) ).
cnf(u815,negated_conjecture,
( ~ '$ki_accessible'(sK26,X2)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X0)
| ~ in(sK21(sK27,X0,X1),sK27,X0)
| ~ '$ki_accessible'(X1,X3)
| qmltpeq(X3,set_intersection2(X0,singleton(sK27)),singleton(sK27)) ) ).
cnf(u1402,negated_conjecture,
( ~ qmltpeq(sK15(sK27,sK1(sK0(sK26)),X1),sK27,sK1(sK0(sK26)))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| ~ in(sK14(sK27,X2,X1),sK27,X2)
| ~ '$ki_accessible'(X1,X3)
| in(X3,sK1(sK0(sK26)),X2) ) ).
cnf(u3421,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK31,X0)
| ~ '$ki_accessible'(sK31,X1)
| '$ki_accessible'(X1,sK9(sK27,sK1(sK28),X1))
| ~ disjoint(sK8(sK27,X0,X1),sK27,X0)
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,sK1(sK28),X0) ) ).
cnf(u1820,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK0('$ki_local_world')),X3)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X0,X1)
| ~ qmltpeq(sK6(sK1(sK0('$ki_local_world')),X3,X1),sK1(sK0('$ki_local_world')),X3)
| ~ '$ki_accessible'(X1,X4)
| qmltpeq(X4,set_intersection2(X2,sK1(sK0('$ki_local_world'))),set_intersection2(X2,X3)) ) ).
cnf(u3725,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK24(sK26),X2)
| '$ki_accessible'(X0,sK4(sK1(sK26),X1,X0))
| ~ qmltpeq(sK3(X1,X3,X0),X1,X3)
| ~ '$ki_accessible'(X0,X4)
| qmltpeq(X4,sK1(sK26),X3) ) ).
cnf(u1554,negated_conjecture,
( ~ qmltpeq(sK9(sK1(sK26),sK1(sK0(sK26)),X1),sK1(sK26),sK1(sK0(sK26)))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| ~ disjoint(sK8(sK1(sK26),X2,X1),sK1(sK26),X2)
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,sK1(sK0(sK26)),X2) ) ).
cnf(u2010,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X3)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK6(sK27,X3,X1))
| ~ '$ki_accessible'(X1,X4)
| qmltpeq(X4,set_intersection2(X2,sK27),set_intersection2(X2,X3)) ) ).
cnf(u3435,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK24(sK26),X2)
| ~ qmltpeq(sK11(sK27,X0,X1),sK27,X0)
| '$ki_accessible'(X1,sK10(sK27,X3,X1))
| ~ '$ki_accessible'(X1,X4)
| disjoint(X4,X3,X0) ) ).
cnf(u421,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X1)
| ~ '$ki_accessible'(sK28,X0)
| ~ qmltpeq(sK7(sK27,X1,X0),sK27,X1)
| ~ '$ki_accessible'(X0,X2)
| qmltpeq(X2,singleton(sK27),singleton(X1)) ) ).
cnf(u971,negated_conjecture,
( ~ '$ki_accessible'(sK26,X4)
| ~ qmltpeq(sK9(sK1(sK26),X2,X1),sK1(sK26),X2)
| ~ '$ki_accessible'(X3,X1)
| ~ '$ki_exists_in_world_$i'(X3,X0)
| ~ '$ki_accessible'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X4,X2)
| ~ disjoint(sK8(sK1(sK26),X0,X1),sK1(sK26),X0)
| ~ '$ki_accessible'(X1,X5)
| disjoint(X5,X2,X0) ) ).
cnf(u344,axiom,
( ~ '$ki_exists_in_world_$i'(sK0('$ki_local_world'),X2)
| ~ in(sK19(X2,X3,X0),X2,X3)
| ~ '$ki_accessible'(X4,X0)
| ~ '$ki_exists_in_world_$i'(X4,X3)
| ~ '$ki_accessible'(sK0('$ki_local_world'),X4)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK18(X2,X3,X1)) ) ).
cnf(u1819,axiom,
( ~ '$ki_exists_in_world_$i'(sK24(sK0('$ki_local_world')),X3)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X0,X1)
| ~ qmltpeq(sK6(sK1(sK0('$ki_local_world')),X3,X1),sK1(sK0('$ki_local_world')),X3)
| ~ '$ki_accessible'(X1,X4)
| qmltpeq(X4,set_intersection2(X2,sK1(sK0('$ki_local_world'))),set_intersection2(X2,X3)) ) ).
cnf(u1763,axiom,
( ~ '$ki_exists_in_world_$i'(sK24(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X0)
| ~ qmltpeq(sK2(sK1(sK0('$ki_local_world')),X1,X0),sK1(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(X0,X2)
| qmltpeq(X2,X1,sK1(sK0('$ki_local_world'))) ) ).
cnf(u2017,negated_conjecture,
( ~ '$ki_accessible'(sK31,X0)
| '$ki_accessible'(X0,sK6(sK27,sK29,X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(sK1(sK31),sK27),set_intersection2(sK1(sK31),sK29)) ) ).
cnf(u1311,negated_conjecture,
( ~ '$ki_accessible'(sK24(sK26),X0)
| '$ki_accessible'(X0,sK19(sK1(sK26),sK1(sK24(sK26)),X0))
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK18(sK1(sK26),sK1(sK24(sK26)),X1)) ) ).
cnf(u374,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X1)
| ~ '$ki_accessible'(sK28,X0)
| ~ qmltpeq(sK2(sK1(sK26),X1,X0),sK1(sK26),X1)
| ~ '$ki_accessible'(X0,X2)
| qmltpeq(X2,X1,sK1(sK26)) ) ).
cnf(u591,negated_conjecture,
( ~ in(sK18(sK27,sK1(sK24(sK26)),X1),sK1(sK24(sK26)),sK27)
| '$ki_accessible'(X0,sK19(sK27,sK1(sK24(sK26)),X0))
| ~ '$ki_accessible'(X0,X1)
| ~ '$ki_accessible'(sK24(sK26),X0) ) ).
cnf(u166,axiom,
( ~ '$ki_accessible'('$ki_local_world',X0)
| ~ '$ki_accessible'(X6,X7)
| ~ disjoint(sK10(X1,X5,X6),X5,X1)
| '$ki_accessible'(X6,sK11(X1,X3,X6))
| ~ '$ki_accessible'(X4,X6)
| ~ '$ki_exists_in_world_$i'(X4,X5)
| ~ '$ki_accessible'(X2,X4)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| disjoint(X7,X5,X3) ) ).
cnf(u526,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X1)
| ~ '$ki_accessible'(sK28,X0)
| '$ki_accessible'(X0,sK19(sK27,X1,X0))
| ~ '$ki_accessible'(X0,X2)
| ~ in(sK18(sK27,X1,X2),X1,sK27) ) ).
cnf(u932,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X1)
| ~ '$ki_accessible'(sK28,X0)
| ~ in(sK21(sK1(sK26),X1,X0),sK1(sK26),X1)
| ~ '$ki_accessible'(X0,X2)
| qmltpeq(X2,set_intersection2(X1,singleton(sK1(sK26))),singleton(sK1(sK26))) ) ).
cnf(u268,negated_conjecture,
( ~ '$ki_accessible'(sK26,X0)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ '$ki_accessible'(X0,X2)
| qmltpeq(X2,set_intersection2(sK1(sK26),X1),set_intersection2(X1,sK1(sK26))) ) ).
cnf(u724,negated_conjecture,
( ~ in(sK18(sK1(sK26),sK1(sK0(sK26)),X1),sK1(sK0(sK26)),sK1(sK26))
| '$ki_accessible'(X0,sK19(sK1(sK26),sK1(sK0(sK26)),X0))
| ~ '$ki_accessible'(X0,X1)
| ~ '$ki_accessible'(sK0(sK26),X0) ) ).
cnf(u1830,axiom,
( ~ qmltpeq(sK6(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X2),sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))))
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ '$ki_accessible'(X2,X3)
| qmltpeq(X3,set_intersection2(X1,sK1(sK0('$ki_local_world'))),set_intersection2(X1,sK1(sK0(sK0('$ki_local_world'))))) ) ).
cnf(u188,axiom,
( ~ '$ki_accessible'('$ki_local_world',X0)
| ~ '$ki_accessible'(X4,X5)
| '$ki_accessible'(X4,sK21(X1,X3,X4))
| ~ '$ki_accessible'(X2,X4)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| qmltpeq(X5,set_intersection2(X3,singleton(X1)),singleton(X1)) ) ).
cnf(u1482,axiom,
( ~ '$ki_accessible'(sK0('$ki_local_world'),X4)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(X4,X2)
| ~ '$ki_exists_in_world_$i'(X4,X0)
| ~ qmltpeq(sK5(sK1(sK0('$ki_local_world')),X0,X1),sK1(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X1,X5)
| qmltpeq(X5,set_intersection2(sK1(sK0('$ki_local_world')),X3),set_intersection2(X0,X3)) ) ).
cnf(u4039,negated_conjecture,
( ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK9(sK1(sK26),sK1(sK24(sK26)),X1))
| '$ki_accessible'(X1,sK8(sK1(sK26),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,sK1(sK24(sK26)),X2) ) ).
cnf(u282,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK1(sK26),sK1(sK28)),set_intersection2(sK1(sK28),sK1(sK26)))
| ~ '$ki_accessible'(sK28,X0) ) ).
cnf(u381,negated_conjecture,
( ~ '$ki_accessible'(sK24(sK26),X0)
| '$ki_accessible'(X0,sK2(sK27,sK1(sK24(sK26)),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,sK1(sK24(sK26)),sK27) ) ).
cnf(u1762,axiom,
( qmltpeq(X0,set_intersection2(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world')))),set_intersection2(sK1(sK0(sK0('$ki_local_world'))),sK1(sK0('$ki_local_world'))))
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X0) ) ).
cnf(u627,axiom,
( ~ '$ki_exists_in_world_$i'(sK0('$ki_local_world'),X2)
| ~ disjoint(sK8(X2,X3,X0),X2,X3)
| ~ qmltpeq(sK9(X2,X4,X0),X2,X4)
| ~ '$ki_accessible'(X5,X0)
| ~ '$ki_exists_in_world_$i'(X5,X3)
| ~ '$ki_accessible'(X6,X5)
| ~ '$ki_exists_in_world_$i'(X6,X4)
| ~ '$ki_accessible'(sK0('$ki_local_world'),X6)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,X4,X3) ) ).
cnf(u197,negated_conjecture,
'$ki_accessible'('$ki_local_world',sK26) ).
cnf(u562,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK26,X2)
| '$ki_accessible'(X0,sK12(X2,X0))
| '$ki_accessible'(X0,sK13(X2,X3,X0))
| ~ '$ki_accessible'(X4,X0)
| ~ '$ki_exists_in_world_$i'(X4,X3)
| ~ '$ki_accessible'(sK26,X4)
| ~ '$ki_accessible'(X0,X1)
| empty(X1,X3) ) ).
cnf(u1018,axiom,
( ~ '$ki_exists_in_world_$i'(sK0('$ki_local_world'),X2)
| '$ki_accessible'(X0,sK6(X2,X3,X0))
| ~ '$ki_accessible'(X4,X0)
| ~ '$ki_exists_in_world_$i'(X4,X5)
| ~ '$ki_accessible'(X6,X4)
| ~ '$ki_exists_in_world_$i'(X6,X3)
| ~ '$ki_accessible'(sK0('$ki_local_world'),X6)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(X5,X2),set_intersection2(X5,X3)) ) ).
cnf(u931,negated_conjecture,
( ~ '$ki_accessible'(sK26,X4)
| ~ qmltpeq(sK4(sK1(sK26),X0,X2),sK1(sK26),X0)
| ~ '$ki_accessible'(X3,X2)
| ~ '$ki_exists_in_world_$i'(X3,X1)
| ~ '$ki_accessible'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X4,X0)
| ~ qmltpeq(sK3(X0,X1,X2),X0,X1)
| ~ '$ki_accessible'(X2,X5)
| qmltpeq(X5,sK1(sK26),X1) ) ).
cnf(u304,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X1)
| ~ '$ki_accessible'(sK28,X0)
| ~ disjoint(sK25(sK27,X1,X0),sK27,X1)
| ~ '$ki_accessible'(X0,X2)
| disjoint(X2,X1,sK27) ) ).
cnf(u267,negated_conjecture,
( ~ '$ki_accessible'(sK26,X0)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ '$ki_accessible'(X0,X2)
| qmltpeq(X2,set_intersection2(sK27,X1),set_intersection2(X1,sK27)) ) ).
cnf(u3426,negated_conjecture,
( ~ disjoint(sK8(sK27,sK1(sK0(sK28)),X0),sK27,sK1(sK0(sK28)))
| '$ki_accessible'(X0,sK9(sK27,sK1(sK28),X0))
| ~ '$ki_accessible'(sK0(sK28),X0)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK28),sK1(sK0(sK28))) ) ).
cnf(u1349,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X1)
| ~ '$ki_accessible'(sK24(sK26),X0)
| '$ki_accessible'(X0,sK13(sK27,X1,X0))
| '$ki_accessible'(X0,sK12(sK27,X0))
| ~ '$ki_accessible'(X0,X2)
| empty(X2,X1) ) ).
cnf(u211,axiom,
( qmltpeq(X0,sK1(sK0('$ki_local_world')),sK1(sK0('$ki_local_world')))
| ~ '$ki_accessible'(sK0('$ki_local_world'),X0) ) ).
cnf(u1837,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X0)
| ~ '$ki_accessible'(sK28,X1)
| ~ '$ki_accessible'(sK20(sK1(sK26),X0,X1),X2)
| in(X2,sK1(sK26),X0)
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,singleton(sK1(sK26)),X0) ) ).
cnf(u289,negated_conjecture,
( ~ '$ki_accessible'(sK26,X2)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X0)
| ~ qmltpeq(sK2(sK27,X0,X1),sK27,X0)
| ~ '$ki_accessible'(X1,X3)
| qmltpeq(X3,X0,sK27) ) ).
cnf(u3448,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK30,X0)
| ~ '$ki_accessible'(sK30,X1)
| '$ki_accessible'(X1,sK11(sK27,sK29,X1))
| ~ disjoint(sK10(sK27,X0,X1),X0,sK27)
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,X0,sK29) ) ).
cnf(u593,negated_conjecture,
( ~ '$ki_accessible'(sK24(sK26),X0)
| '$ki_accessible'(X0,sK25(sK27,sK1(sK24(sK26)),X0))
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK24(sK26)),sK27) ) ).
cnf(u454,negated_conjecture,
( ~ qmltpeq(sK7(sK27,sK1(sK28),X0),sK27,sK1(sK28))
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,singleton(sK27),singleton(sK1(sK28))) ) ).
cnf(u897,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X1)
| ~ '$ki_accessible'(sK28,X0)
| ~ in(sK19(sK1(sK26),X1,X0),sK1(sK26),X1)
| ~ '$ki_accessible'(X0,X2)
| ~ in(sK18(sK1(sK26),X1,X2),X1,sK1(sK26)) ) ).
cnf(u3433,negated_conjecture,
( ~ disjoint(sK8(sK27,sK1(sK0(sK0(sK26))),X0),sK27,sK1(sK0(sK0(sK26))))
| '$ki_accessible'(X0,sK9(sK27,sK1(sK0(sK26)),X0))
| ~ '$ki_accessible'(sK0(sK0(sK26)),X0)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK0(sK26)),sK1(sK0(sK0(sK26)))) ) ).
cnf(u734,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X1)
| ~ '$ki_accessible'(sK0(sK26),X0)
| '$ki_accessible'(X0,sK20(sK27,X1,X0))
| ~ '$ki_accessible'(X0,X2)
| disjoint(X2,singleton(sK27),X1) ) ).
cnf(u1860,axiom,
( ~ qmltpeq(sK11(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X1),sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X0,X1)
| ~ disjoint(sK10(sK1(sK0('$ki_local_world')),X2,X1),X2,sK1(sK0('$ki_local_world')))
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,X2,sK1(sK0(sK0('$ki_local_world')))) ) ).
cnf(u4143,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK24(sK26)),X0)
| '$ki_accessible'(X0,sK4(sK1(sK26),sK1(sK24(sK26)),X0))
| '$ki_accessible'(X0,sK3(sK1(sK24(sK26)),sK1(sK0(sK24(sK26))),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,sK1(sK26),sK1(sK0(sK24(sK26)))) ) ).
cnf(u157,axiom,
( ~ '$ki_accessible'('$ki_local_world',X0)
| ~ '$ki_accessible'(X6,X7)
| ~ qmltpeq(sK6(X1,X3,X6),X1,X3)
| ~ '$ki_accessible'(X4,X6)
| ~ '$ki_exists_in_world_$i'(X4,X5)
| ~ '$ki_accessible'(X2,X4)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| qmltpeq(X7,set_intersection2(X5,X1),set_intersection2(X5,X3)) ) ).
cnf(u1780,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X0)
| '$ki_accessible'(X0,sK19(sK1(sK0('$ki_local_world')),X1,X0))
| ~ '$ki_accessible'(X0,X2)
| ~ in(sK18(sK1(sK0('$ki_local_world')),X1,X2),X1,sK1(sK0('$ki_local_world'))) ) ).
cnf(u1116,negated_conjecture,
( ~ qmltpeq(sK5(sK1(sK26),sK29,X2),sK1(sK26),sK29)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ '$ki_accessible'(X2,X3)
| qmltpeq(X3,set_intersection2(sK1(sK26),X1),set_intersection2(sK29,X1)) ) ).
cnf(u490,negated_conjecture,
( ~ '$ki_accessible'(sK26,X2)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X0)
| ~ in(sK19(sK1(sK26),X0,X1),sK1(sK26),X0)
| ~ '$ki_accessible'(X1,X3)
| '$ki_accessible'(X3,sK18(sK1(sK26),X0,X3)) ) ).
cnf(u3047,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK0(sK26),X2)
| '$ki_accessible'(X0,sK17(sK27,X1,X0))
| '$ki_accessible'(X0,sK16(sK27,X3,X0))
| ~ '$ki_accessible'(X0,X4)
| in(X4,X3,X1) ) ).
cnf(u1309,negated_conjecture,
( ~ qmltpeq(sK9(sK27,sK29,X1),sK27,sK29)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| ~ disjoint(sK8(sK27,X2,X1),sK27,X2)
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,sK29,X2) ) ).
cnf(u171,axiom,
( ~ '$ki_accessible'('$ki_local_world',X0)
| ~ '$ki_accessible'(X4,X5)
| ~ empty(sK12(X1,X4),X1)
| ~ qmltpeq(sK13(X1,X3,X4),X1,X3)
| ~ '$ki_accessible'(X2,X4)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| empty(X5,X3) ) ).
cnf(u1555,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK28,X2)
| ~ qmltpeq(sK11(sK1(sK26),X0,X1),sK1(sK26),X0)
| ~ disjoint(sK10(sK1(sK26),X3,X1),X3,sK1(sK26))
| ~ '$ki_accessible'(X1,X4)
| disjoint(X4,X3,X0) ) ).
cnf(u1859,negated_conjecture,
( ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_accessible'(sK20(sK1(sK26),sK1(sK24(sK26)),X0),X1)
| in(X1,sK1(sK26),sK1(sK24(sK26)))
| ~ '$ki_accessible'(X0,X2)
| disjoint(X2,singleton(sK1(sK26)),sK1(sK24(sK26))) ) ).
cnf(u497,negated_conjecture,
( ~ in(sK19(sK27,sK1(sK24(sK26)),X0),sK27,sK1(sK24(sK26)))
| ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK18(sK27,sK1(sK24(sK26)),X1)) ) ).
cnf(u3528,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK24(sK26),X2)
| '$ki_accessible'(X0,sK9(sK1(sK26),X1,X0))
| '$ki_accessible'(X0,sK8(sK1(sK26),X3,X0))
| ~ '$ki_accessible'(X0,X4)
| disjoint(X4,X1,X3) ) ).
cnf(u206,axiom,
'$ki_accessible'(sK0('$ki_local_world'),sK24(sK0('$ki_local_world'))) ).
cnf(u2328,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK28),X0)
| ~ '$ki_accessible'(sK0(sK28),X1)
| '$ki_accessible'(X1,sK6(sK1(sK26),sK29,X1))
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,set_intersection2(X0,sK1(sK26)),set_intersection2(X0,sK29)) ) ).
cnf(u694,negated_conjecture,
( ~ in(sK19(sK1(sK26),sK1(sK0(sK26)),X0),sK1(sK26),sK1(sK0(sK26)))
| ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK18(sK1(sK26),sK1(sK0(sK26)),X1)) ) ).
cnf(u1870,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X3)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK5(sK27,X3,X1))
| ~ '$ki_accessible'(X1,X4)
| qmltpeq(X4,set_intersection2(sK27,X2),set_intersection2(X3,X2)) ) ).
cnf(u2313,negated_conjecture,
( ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ '$ki_accessible'(X0,X2)
| '$ki_accessible'(X2,sK5(sK1(sK26),sK1(sK24(sK26)),X2))
| ~ '$ki_accessible'(X2,X3)
| qmltpeq(X3,set_intersection2(sK1(sK26),X1),set_intersection2(sK1(sK24(sK26)),X1)) ) ).
cnf(u1790,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X0)
| ~ '$ki_accessible'(sK0(sK26),X1)
| ~ '$ki_accessible'(sK20(sK27,X0,X1),X2)
| in(X2,sK27,X0)
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,singleton(sK27),X0) ) ).
cnf(u1532,axiom,
( ~ '$ki_accessible'(sK0('$ki_local_world'),X4)
| ~ qmltpeq(sK4(sK1(sK0('$ki_local_world')),X0,X2),sK1(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X3,X2)
| ~ '$ki_exists_in_world_$i'(X3,X1)
| ~ '$ki_accessible'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X4,X0)
| ~ qmltpeq(sK3(X0,X1,X2),X0,X1)
| ~ '$ki_accessible'(X2,X5)
| qmltpeq(X5,sK1(sK0('$ki_local_world')),X1) ) ).
cnf(u725,negated_conjecture,
( ~ '$ki_accessible'(sK26,X2)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X1)
| '$ki_accessible'(X0,sK20(sK27,X1,X0))
| ~ '$ki_accessible'(X0,X3)
| disjoint(X3,singleton(sK27),X1) ) ).
cnf(u3454,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK31,X0)
| ~ '$ki_accessible'(sK31,X1)
| '$ki_accessible'(X1,sK11(sK27,sK1(sK28),X1))
| ~ disjoint(sK10(sK27,X0,X1),X0,sK27)
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,X0,sK1(sK28)) ) ).
cnf(u4245,axiom,
( ~ '$ki_exists_in_world_$i'(sK24(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X2)
| '$ki_accessible'(X0,sK11(sK1(sK0('$ki_local_world')),X1,X0))
| ~ disjoint(sK10(sK1(sK0('$ki_local_world')),X3,X0),X3,sK1(sK0('$ki_local_world')))
| ~ '$ki_accessible'(X0,X4)
| disjoint(X4,X3,X1) ) ).
cnf(u1877,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK31,X0)
| ~ '$ki_accessible'(sK31,X1)
| '$ki_accessible'(X1,sK5(sK27,sK29,X1))
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,set_intersection2(sK27,X0),set_intersection2(sK29,X0)) ) ).
cnf(u1099,negated_conjecture,
( ~ '$ki_accessible'(sK26,X4)
| ~ qmltpeq(sK17(sK27,X2,X1),sK27,X2)
| ~ '$ki_accessible'(X3,X1)
| ~ '$ki_exists_in_world_$i'(X3,X0)
| ~ '$ki_accessible'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X4,X2)
| ~ in(sK16(sK27,X0,X1),X0,sK27)
| ~ '$ki_accessible'(X1,X5)
| in(X5,X0,X2) ) ).
cnf(u1531,negated_conjecture,
( ~ qmltpeq(sK4(sK1(sK26),sK1(sK28),X1),sK1(sK26),sK1(sK28))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| ~ qmltpeq(sK3(sK1(sK28),X2,X1),sK1(sK28),X2)
| ~ '$ki_accessible'(X1,X3)
| qmltpeq(X3,sK1(sK26),X2) ) ).
cnf(u3961,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK28,X2)
| ~ qmltpeq(sK15(sK1(sK26),X0,X1),sK1(sK26),X0)
| '$ki_accessible'(X1,sK14(sK1(sK26),X3,X1))
| ~ '$ki_accessible'(X1,X4)
| in(X4,X0,X3) ) ).
cnf(u3520,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK30,X0)
| ~ '$ki_accessible'(sK30,X1)
| '$ki_accessible'(X1,sK17(sK27,sK1(sK28),X1))
| ~ in(sK16(sK27,X0,X1),X0,sK27)
| ~ '$ki_accessible'(X1,X2)
| in(X2,X0,sK1(sK28)) ) ).
cnf(u1622,negated_conjecture,
( ~ qmltpeq(sK15(sK1(sK26),sK29,X1),sK1(sK26),sK29)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| ~ in(sK14(sK1(sK26),X2,X1),sK1(sK26),X2)
| ~ '$ki_accessible'(X1,X3)
| in(X3,sK29,X2) ) ).
cnf(u3201,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK24(sK26)),X0)
| '$ki_accessible'(X0,sK17(sK27,sK1(sK24(sK26)),X0))
| '$ki_accessible'(X0,sK16(sK27,sK1(sK0(sK24(sK26))),X0))
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK1(sK0(sK24(sK26))),sK1(sK24(sK26))) ) ).
cnf(u2119,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK28),X0)
| '$ki_accessible'(X0,sK6(sK27,sK1(sK28),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(sK1(sK0(sK28)),sK27),set_intersection2(sK1(sK0(sK28)),sK1(sK28))) ) ).
cnf(u4205,negated_conjecture,
( ~ qmltpeq(sK11(sK1(sK26),sK1(sK24(sK26)),X1),sK1(sK26),sK1(sK24(sK26)))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK10(sK1(sK26),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,X2,sK1(sK24(sK26))) ) ).
cnf(u2551,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK28),X0)
| ~ '$ki_accessible'(sK0(sK28),X1)
| '$ki_accessible'(X1,sK4(sK27,sK1(sK28),X1))
| '$ki_accessible'(X1,sK3(sK1(sK28),X0,X1))
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,sK27,X0) ) ).
cnf(u3844,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK0(sK26),X2)
| '$ki_accessible'(X0,sK9(sK1(sK26),X1,X0))
| ~ disjoint(sK8(sK1(sK26),X3,X0),sK1(sK26),X3)
| ~ '$ki_accessible'(X0,X4)
| disjoint(X4,X1,X3) ) ).
cnf(u1781,axiom,
( ~ qmltpeq(sK7(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X0),sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))))
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,singleton(sK1(sK0('$ki_local_world'))),singleton(sK1(sK24(sK0('$ki_local_world'))))) ) ).
cnf(u4034,negated_conjecture,
( ~ in(sK14(sK27,sK1(sK0(sK0(sK26))),X0),sK27,sK1(sK0(sK0(sK26))))
| '$ki_accessible'(X0,sK15(sK27,sK1(sK0(sK26)),X0))
| ~ '$ki_accessible'(sK0(sK0(sK26)),X0)
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK1(sK0(sK26)),sK1(sK0(sK0(sK26)))) ) ).
cnf(u4219,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK24(sK26)),X0)
| ~ '$ki_accessible'(sK0(sK24(sK26)),X1)
| '$ki_accessible'(X1,sK9(sK1(sK26),sK1(sK24(sK26)),X1))
| ~ disjoint(sK8(sK1(sK26),X0,X1),sK1(sK26),X0)
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,sK1(sK24(sK26)),X0) ) ).
cnf(u4224,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X2)
| ~ qmltpeq(sK9(sK1(sK0('$ki_local_world')),X0,X1),sK1(sK0('$ki_local_world')),X0)
| '$ki_accessible'(X1,sK8(sK1(sK0('$ki_local_world')),X3,X1))
| ~ '$ki_accessible'(X1,X4)
| disjoint(X4,X0,X3) ) ).
cnf(u4113,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK17(sK1(sK26),sK29,X1))
| ~ in(sK16(sK1(sK26),X2,X1),X2,sK1(sK26))
| ~ '$ki_accessible'(X1,X3)
| in(X3,X2,sK29) ) ).
cnf(u3843,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK24(sK26),X2)
| '$ki_accessible'(X0,sK9(sK1(sK26),X1,X0))
| ~ disjoint(sK8(sK1(sK26),X3,X0),sK1(sK26),X3)
| ~ '$ki_accessible'(X0,X4)
| disjoint(X4,X1,X3) ) ).
cnf(u4389,axiom,
( ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(sK20(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X0),X1)
| in(X1,sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))))
| ~ '$ki_accessible'(X0,X2)
| disjoint(X2,singleton(sK1(sK0('$ki_local_world'))),sK1(sK24(sK0('$ki_local_world')))) ) ).
cnf(u4041,axiom,
( ~ '$ki_exists_in_world_$i'(sK24(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X0)
| '$ki_accessible'(X0,sK2(sK1(sK0('$ki_local_world')),X1,X0))
| ~ '$ki_accessible'(X0,X2)
| qmltpeq(X2,X1,sK1(sK0('$ki_local_world'))) ) ).
cnf(u2736,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK28),X0)
| ~ '$ki_accessible'(sK0(sK28),X1)
| '$ki_accessible'(X1,sK11(sK27,sK29,X1))
| '$ki_accessible'(X1,sK10(sK27,X0,X1))
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,X0,sK29) ) ).
cnf(u2841,axiom,
( ~ '$ki_accessible'(sK0('$ki_local_world'),X2)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X1)
| '$ki_accessible'(X0,sK19(sK1(sK0('$ki_local_world')),X1,X0))
| ~ '$ki_accessible'(X0,X3)
| '$ki_accessible'(X3,sK18(sK1(sK0('$ki_local_world')),X1,X3)) ) ).
cnf(u2190,negated_conjecture,
( ~ '$ki_accessible'(sK26,X4)
| ~ qmltpeq(sK4(sK27,X1,X0),sK27,X1)
| ~ '$ki_accessible'(X3,X0)
| ~ '$ki_exists_in_world_$i'(X3,X2)
| ~ '$ki_accessible'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X4,X1)
| '$ki_accessible'(X0,sK3(X1,X2,X0))
| ~ '$ki_accessible'(X0,X5)
| qmltpeq(X5,sK27,X2) ) ).
cnf(u3727,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK28),X0)
| '$ki_accessible'(X0,sK9(sK1(sK26),sK1(sK28),X0))
| '$ki_accessible'(X0,sK8(sK1(sK26),sK1(sK0(sK28)),X0))
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK28),sK1(sK0(sK28))) ) ).
cnf(u3854,negated_conjecture,
( ~ '$ki_accessible'(sK31,X0)
| '$ki_accessible'(X0,sK15(sK1(sK26),sK1(sK28),X0))
| '$ki_accessible'(X0,sK14(sK1(sK26),sK1(sK31),X0))
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK1(sK28),sK1(sK31)) ) ).
cnf(u4650,axiom,
( ~ disjoint(sK8(sK1(sK0('$ki_local_world')),sK1(sK0(sK0(sK0('$ki_local_world')))),X0),sK1(sK0('$ki_local_world')),sK1(sK0(sK0(sK0('$ki_local_world')))))
| '$ki_accessible'(X0,sK9(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X0))
| ~ '$ki_accessible'(sK0(sK0(sK0('$ki_local_world'))),X0)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK0(sK0('$ki_local_world'))),sK1(sK0(sK0(sK0('$ki_local_world'))))) ) ).
cnf(u4052,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X0)
| '$ki_accessible'(X0,sK25(sK1(sK0('$ki_local_world')),X1,X0))
| ~ '$ki_accessible'(X0,X2)
| disjoint(X2,X1,sK1(sK0('$ki_local_world'))) ) ).
cnf(u3418,negated_conjecture,
( ~ disjoint(sK8(sK27,sK1(sK30),X0),sK27,sK1(sK30))
| '$ki_accessible'(X0,sK9(sK27,sK29,X0))
| ~ '$ki_accessible'(sK30,X0)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK29,sK1(sK30)) ) ).
cnf(u3964,negated_conjecture,
( ~ '$ki_accessible'(sK30,X0)
| '$ki_accessible'(X0,sK17(sK1(sK26),sK1(sK28),X0))
| '$ki_accessible'(X0,sK16(sK1(sK26),sK1(sK30),X0))
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK1(sK30),sK1(sK28)) ) ).
cnf(u3042,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK0(sK26)),X0)
| ~ '$ki_accessible'(sK0(sK0(sK26)),X1)
| '$ki_accessible'(X1,sK15(sK27,sK1(sK0(sK26)),X1))
| '$ki_accessible'(X1,sK14(sK27,X0,X1))
| ~ '$ki_accessible'(X1,X2)
| in(X2,sK1(sK0(sK26)),X0) ) ).
cnf(u3440,negated_conjecture,
( ~ qmltpeq(sK11(sK27,sK1(sK24(sK26)),X1),sK27,sK1(sK24(sK26)))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK10(sK27,X2,X1))
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,X2,sK1(sK24(sK26))) ) ).
cnf(u4165,negated_conjecture,
( ~ qmltpeq(sK3(sK1(sK24(sK26)),sK1(sK0(sK24(sK26))),X0),sK1(sK24(sK26)),sK1(sK0(sK24(sK26))))
| '$ki_accessible'(X0,sK4(sK27,sK1(sK24(sK26)),X0))
| ~ '$ki_accessible'(sK0(sK24(sK26)),X0)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,sK27,sK1(sK0(sK24(sK26)))) ) ).
cnf(u4051,axiom,
( ~ '$ki_exists_in_world_$i'(sK24(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X0)
| '$ki_accessible'(X0,sK25(sK1(sK0('$ki_local_world')),X1,X0))
| ~ '$ki_accessible'(X0,X2)
| disjoint(X2,X1,sK1(sK0('$ki_local_world'))) ) ).
cnf(u3425,negated_conjecture,
( ~ disjoint(sK8(sK27,sK1(sK30),X0),sK27,sK1(sK30))
| '$ki_accessible'(X0,sK9(sK27,sK1(sK28),X0))
| ~ '$ki_accessible'(sK30,X0)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK28),sK1(sK30)) ) ).
cnf(u1824,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X2)
| ~ qmltpeq(sK4(sK1(sK0('$ki_local_world')),X0,X1),sK1(sK0('$ki_local_world')),X0)
| ~ qmltpeq(sK3(X0,X3,X1),X0,X3)
| ~ '$ki_accessible'(X1,X4)
| qmltpeq(X4,sK1(sK0('$ki_local_world')),X3) ) ).
cnf(u3963,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK0(sK26),X2)
| ~ qmltpeq(sK15(sK1(sK26),X0,X1),sK1(sK26),X0)
| '$ki_accessible'(X1,sK14(sK1(sK26),X3,X1))
| ~ '$ki_accessible'(X1,X4)
| in(X4,X0,X3) ) ).
cnf(u3049,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK17(sK27,sK1(sK28),X1))
| '$ki_accessible'(X1,sK16(sK27,X2,X1))
| ~ '$ki_accessible'(X1,X3)
| in(X3,X2,sK1(sK28)) ) ).
cnf(u1616,negated_conjecture,
( ~ qmltpeq(sK11(sK1(sK26),sK1(sK24(sK26)),X1),sK1(sK26),sK1(sK24(sK26)))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| ~ disjoint(sK10(sK1(sK26),X2,X1),X2,sK1(sK26))
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,X2,sK1(sK24(sK26))) ) ).
cnf(u4033,negated_conjecture,
( ~ in(sK14(sK27,sK1(sK0(sK24(sK26))),X0),sK27,sK1(sK0(sK24(sK26))))
| '$ki_accessible'(X0,sK15(sK27,sK1(sK24(sK26)),X0))
| ~ '$ki_accessible'(sK0(sK24(sK26)),X0)
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK1(sK24(sK26)),sK1(sK0(sK24(sK26)))) ) ).
cnf(u3455,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK30,X0)
| ~ '$ki_accessible'(sK30,X1)
| '$ki_accessible'(X1,sK11(sK27,sK1(sK28),X1))
| ~ disjoint(sK10(sK27,X0,X1),X0,sK27)
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,X0,sK1(sK28)) ) ).
cnf(u2390,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK28),X0)
| ~ '$ki_accessible'(sK0(sK28),X1)
| '$ki_accessible'(X1,sK6(sK1(sK26),sK1(sK28),X1))
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,set_intersection2(X0,sK1(sK26)),set_intersection2(X0,sK1(sK28))) ) ).
cnf(u4201,negated_conjecture,
( ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK9(sK1(sK26),sK1(sK24(sK26)),X1))
| ~ disjoint(sK8(sK1(sK26),X2,X1),sK1(sK26),X2)
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,sK1(sK24(sK26)),X2) ) ).
cnf(u2735,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK30,X0)
| ~ '$ki_accessible'(sK30,X1)
| '$ki_accessible'(X1,sK11(sK27,sK29,X1))
| '$ki_accessible'(X1,sK10(sK27,X0,X1))
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,X0,sK29) ) ).
cnf(u2182,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X3)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK5(sK1(sK26),X3,X1))
| ~ '$ki_accessible'(X1,X4)
| qmltpeq(X4,set_intersection2(sK1(sK26),X2),set_intersection2(X3,X2)) ) ).
cnf(u4062,axiom,
( ~ '$ki_exists_in_world_$i'(sK24(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X0)
| '$ki_accessible'(X0,sK20(sK1(sK0('$ki_local_world')),X1,X0))
| ~ '$ki_accessible'(X0,X2)
| disjoint(X2,singleton(sK1(sK0('$ki_local_world'))),X1) ) ).
cnf(u3039,negated_conjecture,
( ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK15(sK27,sK1(sK24(sK26)),X1))
| '$ki_accessible'(X1,sK14(sK27,X2,X1))
| ~ '$ki_accessible'(X1,X3)
| in(X3,sK1(sK24(sK26)),X2) ) ).
cnf(u4652,axiom,
( ~ disjoint(sK10(sK1(sK0('$ki_local_world')),sK1(sK0(sK0(sK0('$ki_local_world')))),X0),sK1(sK0(sK0(sK0('$ki_local_world')))),sK1(sK0('$ki_local_world')))
| '$ki_accessible'(X0,sK11(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X0))
| ~ '$ki_accessible'(sK0(sK0(sK0('$ki_local_world'))),X0)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK0(sK0(sK0('$ki_local_world')))),sK1(sK0(sK0('$ki_local_world')))) ) ).
cnf(u1839,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X0)
| ~ '$ki_accessible'(sK0(sK26),X1)
| ~ '$ki_accessible'(sK20(sK1(sK26),X0,X1),X2)
| in(X2,sK1(sK26),X0)
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,singleton(sK1(sK26)),X0) ) ).
cnf(u4103,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK31,X0)
| ~ '$ki_accessible'(sK31,X1)
| '$ki_accessible'(X1,sK15(sK1(sK26),sK1(sK28),X1))
| ~ in(sK14(sK1(sK26),X0,X1),sK1(sK26),X0)
| ~ '$ki_accessible'(X1,X2)
| in(X2,sK1(sK28),X0) ) ).
cnf(u1783,axiom,
( ~ in(sK19(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X0),sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))))
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK18(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X1)) ) ).
cnf(u4044,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK11(sK1(sK26),sK1(sK0(sK26)),X1))
| '$ki_accessible'(X1,sK10(sK1(sK26),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,X2,sK1(sK0(sK26))) ) ).
cnf(u3765,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK31,X0)
| ~ '$ki_accessible'(sK31,X1)
| '$ki_accessible'(X1,sK11(sK1(sK26),sK1(sK28),X1))
| '$ki_accessible'(X1,sK10(sK1(sK26),X0,X1))
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,X0,sK1(sK28)) ) ).
cnf(u4236,negated_conjecture,
( ~ in(sK14(sK1(sK26),sK1(sK0(sK0(sK26))),X0),sK1(sK26),sK1(sK0(sK0(sK26))))
| '$ki_accessible'(X0,sK15(sK1(sK26),sK1(sK0(sK26)),X0))
| ~ '$ki_accessible'(sK0(sK0(sK26)),X0)
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK1(sK0(sK26)),sK1(sK0(sK0(sK26)))) ) ).
cnf(u4125,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK28),X0)
| ~ '$ki_accessible'(sK0(sK28),X1)
| '$ki_accessible'(X1,sK17(sK1(sK26),sK1(sK28),X1))
| ~ in(sK16(sK1(sK26),X0,X1),X0,sK1(sK26))
| ~ '$ki_accessible'(X1,X2)
| in(X2,X0,sK1(sK28)) ) ).
cnf(u4069,negated_conjecture,
( ~ disjoint(sK8(sK1(sK26),sK1(sK30),X0),sK1(sK26),sK1(sK30))
| '$ki_accessible'(X0,sK9(sK1(sK26),sK1(sK28),X0))
| ~ '$ki_accessible'(sK30,X0)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK28),sK1(sK30)) ) ).
cnf(u2320,negated_conjecture,
( ~ '$ki_accessible'(sK26,X4)
| '$ki_accessible'(X1,sK9(sK1(sK26),X2,X1))
| ~ '$ki_accessible'(X3,X1)
| ~ '$ki_exists_in_world_$i'(X3,X0)
| ~ '$ki_accessible'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X4,X2)
| ~ disjoint(sK8(sK1(sK26),X0,X1),sK1(sK26),X0)
| ~ '$ki_accessible'(X1,X5)
| disjoint(X5,X2,X0) ) ).
cnf(u4250,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X2)
| '$ki_accessible'(X0,sK15(sK1(sK0('$ki_local_world')),X1,X0))
| ~ in(sK14(sK1(sK0('$ki_local_world')),X3,X0),sK1(sK0('$ki_local_world')),X3)
| ~ '$ki_accessible'(X0,X4)
| in(X4,X1,X3) ) ).
cnf(u1346,negated_conjecture,
( ~ qmltpeq(sK11(sK27,sK1(sK24(sK26)),X1),sK27,sK1(sK24(sK26)))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| ~ disjoint(sK10(sK27,X2,X1),X2,sK27)
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,X2,sK1(sK24(sK26))) ) ).
cnf(u4139,axiom,
( ~ '$ki_exists_in_world_$i'(sK24(sK0('$ki_local_world')),X3)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK5(sK1(sK0('$ki_local_world')),X3,X1))
| ~ '$ki_accessible'(X1,X4)
| qmltpeq(X4,set_intersection2(sK1(sK0('$ki_local_world')),X2),set_intersection2(X3,X2)) ) ).
cnf(u1834,negated_conjecture,
( ~ qmltpeq(sK13(sK1(sK26),sK1(sK0(sK26)),X0),sK1(sK26),sK1(sK0(sK26)))
| ~ '$ki_accessible'(sK0(sK26),X0)
| '$ki_accessible'(X0,sK12(sK1(sK26),X0))
| ~ '$ki_accessible'(X0,X1)
| empty(X1,sK1(sK0(sK26))) ) ).
cnf(u3853,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK28),X0)
| ~ '$ki_accessible'(sK0(sK28),X1)
| '$ki_accessible'(X1,sK15(sK1(sK26),sK1(sK28),X1))
| '$ki_accessible'(X1,sK14(sK1(sK26),X0,X1))
| ~ '$ki_accessible'(X1,X2)
| in(X2,sK1(sK28),X0) ) ).
cnf(u4043,negated_conjecture,
( ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK11(sK1(sK26),sK1(sK24(sK26)),X1))
| '$ki_accessible'(X1,sK10(sK1(sK26),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,X2,sK1(sK24(sK26))) ) ).
cnf(u2737,negated_conjecture,
( ~ '$ki_accessible'(sK31,X0)
| '$ki_accessible'(X0,sK11(sK27,sK29,X0))
| '$ki_accessible'(X0,sK10(sK27,sK1(sK31),X0))
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK31),sK29) ) ).
cnf(u624,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| '$ki_accessible'(X0,sK25(sK1(sK26),sK29,X0))
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK29,sK1(sK26)) ) ).
cnf(u3041,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK24(sK26)),X0)
| ~ '$ki_accessible'(sK0(sK24(sK26)),X1)
| '$ki_accessible'(X1,sK15(sK27,sK1(sK24(sK26)),X1))
| '$ki_accessible'(X1,sK14(sK27,X0,X1))
| ~ '$ki_accessible'(X1,X2)
| in(X2,sK1(sK24(sK26)),X0) ) ).
cnf(u3446,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK11(sK27,sK1(sK28),X1))
| ~ disjoint(sK10(sK27,X2,X1),X2,sK27)
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,X2,sK1(sK28)) ) ).
cnf(u1353,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK0(sK26),X2)
| ~ qmltpeq(sK15(sK27,X0,X1),sK27,X0)
| ~ in(sK14(sK27,X3,X1),sK27,X3)
| ~ '$ki_accessible'(X1,X4)
| in(X4,X0,X3) ) ).
cnf(u416,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X1)
| ~ '$ki_accessible'(sK0(sK26),X0)
| '$ki_accessible'(X0,sK2(sK1(sK26),X1,X0))
| ~ '$ki_accessible'(X0,X2)
| qmltpeq(X2,X1,sK1(sK26)) ) ).
cnf(u1841,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(sK20(sK1(sK26),sK1(sK28),X0),X1)
| in(X1,sK1(sK26),sK1(sK28))
| ~ '$ki_accessible'(X0,X2)
| disjoint(X2,singleton(sK1(sK26)),sK1(sK28)) ) ).
cnf(u1615,negated_conjecture,
( ~ '$ki_accessible'(sK24(sK26),X0)
| '$ki_accessible'(X0,sK21(sK27,sK1(sK24(sK26)),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(sK1(sK24(sK26)),singleton(sK27)),singleton(sK27)) ) ).
cnf(u1785,negated_conjecture,
( ~ '$ki_accessible'(sK26,X3)
| ~ '$ki_accessible'(sK20(sK1(sK26),X1,X2),X0)
| ~ '$ki_accessible'(X3,X2)
| ~ '$ki_exists_in_world_$i'(X3,X1)
| in(X0,sK1(sK26),X1)
| ~ '$ki_accessible'(X2,X4)
| disjoint(X4,singleton(sK1(sK26)),X1) ) ).
cnf(u4054,negated_conjecture,
( ~ qmltpeq(sK9(sK1(sK26),sK1(sK28),X1),sK1(sK26),sK1(sK28))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK8(sK1(sK26),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,sK1(sK28),X2) ) ).
cnf(u1306,negated_conjecture,
'$ki_accessible'(sK0(sK31),sK18(sK1(sK26),sK1(sK28),sK0(sK31))) ).
cnf(u1004,negated_conjecture,
( ~ qmltpeq(sK5(sK27,sK1(sK28),X2),sK27,sK1(sK28))
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ '$ki_accessible'(X2,X3)
| qmltpeq(X3,set_intersection2(sK27,X1),set_intersection2(sK1(sK28),X1)) ) ).
cnf(u3453,negated_conjecture,
( ~ disjoint(sK10(sK27,sK1(sK0(sK28)),X0),sK1(sK0(sK28)),sK27)
| '$ki_accessible'(X0,sK11(sK27,sK29,X0))
| ~ '$ki_accessible'(sK0(sK28),X0)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK0(sK28)),sK29) ) ).
cnf(u2187,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK31,X0)
| ~ '$ki_accessible'(sK31,X1)
| '$ki_accessible'(X1,sK5(sK1(sK26),sK29,X1))
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,set_intersection2(sK1(sK26),X0),set_intersection2(sK29,X0)) ) ).
cnf(u1852,axiom,
( ~ '$ki_exists_in_world_$i'(sK24(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X2)
| ~ qmltpeq(sK17(sK1(sK0('$ki_local_world')),X0,X1),sK1(sK0('$ki_local_world')),X0)
| ~ in(sK16(sK1(sK0('$ki_local_world')),X3,X1),X3,sK1(sK0('$ki_local_world')))
| ~ '$ki_accessible'(X1,X4)
| in(X4,X3,X0) ) ).
cnf(u1098,negated_conjecture,
( ~ '$ki_accessible'(sK24(sK26),X0)
| '$ki_accessible'(X0,sK7(sK1(sK26),sK1(sK24(sK26)),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,singleton(sK1(sK26)),singleton(sK1(sK24(sK26)))) ) ).
cnf(u3757,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK28,X2)
| ~ qmltpeq(sK4(sK1(sK26),X0,X1),sK1(sK26),X0)
| '$ki_accessible'(X1,sK3(X0,X3,X1))
| ~ '$ki_accessible'(X1,X4)
| qmltpeq(X4,sK1(sK26),X3) ) ).
cnf(u1586,negated_conjecture,
( ~ qmltpeq(sK11(sK1(sK26),sK1(sK28),X1),sK1(sK26),sK1(sK28))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| ~ disjoint(sK10(sK1(sK26),X2,X1),X2,sK1(sK26))
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,X2,sK1(sK28)) ) ).
cnf(u1864,axiom,
( ~ qmltpeq(sK17(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X1),sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X0,X1)
| ~ in(sK16(sK1(sK0('$ki_local_world')),X2,X1),X2,sK1(sK0('$ki_local_world')))
| ~ '$ki_accessible'(X1,X3)
| in(X3,X2,sK1(sK24(sK0('$ki_local_world')))) ) ).
cnf(u4061,negated_conjecture,
( ~ disjoint(sK8(sK1(sK26),sK1(sK30),X0),sK1(sK26),sK1(sK30))
| '$ki_accessible'(X0,sK9(sK1(sK26),sK29,X0))
| ~ '$ki_accessible'(sK30,X0)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK29,sK1(sK30)) ) ).
cnf(u1784,negated_conjecture,
( ~ '$ki_accessible'(sK26,X3)
| ~ '$ki_accessible'(sK20(sK27,X1,X2),X0)
| ~ '$ki_accessible'(X3,X2)
| ~ '$ki_exists_in_world_$i'(X3,X1)
| in(X0,sK27,X1)
| ~ '$ki_accessible'(X2,X4)
| disjoint(X4,singleton(sK27),X1) ) ).
cnf(u699,negated_conjecture,
( ~ in(sK18(sK1(sK26),sK29,X1),sK29,sK1(sK26))
| '$ki_accessible'(X0,sK19(sK1(sK26),sK29,X0))
| ~ '$ki_accessible'(X0,X1)
| ~ '$ki_accessible'(sK28,X0) ) ).
cnf(u146,axiom,
'$ki_exists_in_world_$i'(X0,sK1(X0)) ).
cnf(u634,negated_conjecture,
( ~ in(sK19(sK1(sK26),sK29,X0),sK1(sK26),sK29)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK18(sK1(sK26),sK29,X1)) ) ).
cnf(u1313,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK26,X2)
| '$ki_accessible'(X0,sK14(X2,X3,X0))
| '$ki_accessible'(X0,sK15(X2,X4,X0))
| ~ '$ki_accessible'(X5,X0)
| ~ '$ki_exists_in_world_$i'(X5,X3)
| ~ '$ki_accessible'(X6,X5)
| ~ '$ki_exists_in_world_$i'(X6,X4)
| ~ '$ki_accessible'(sK26,X6)
| ~ '$ki_accessible'(X0,X1)
| in(X1,X4,X3) ) ).
cnf(u1003,negated_conjecture,
( ~ qmltpeq(sK5(sK27,sK29,X2),sK27,sK29)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ '$ki_accessible'(X2,X3)
| qmltpeq(X3,set_intersection2(sK27,X1),set_intersection2(sK29,X1)) ) ).
cnf(u376,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X1)
| ~ '$ki_accessible'(sK0(sK26),X0)
| ~ qmltpeq(sK2(sK1(sK26),X1,X0),sK1(sK26),X1)
| ~ '$ki_accessible'(X0,X2)
| qmltpeq(X2,X1,sK1(sK26)) ) ).
cnf(u1617,negated_conjecture,
( ~ qmltpeq(sK11(sK1(sK26),sK1(sK0(sK26)),X1),sK1(sK26),sK1(sK0(sK26)))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| ~ disjoint(sK10(sK1(sK26),X2,X1),X2,sK1(sK26))
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,X2,sK1(sK0(sK26))) ) ).
cnf(u168,axiom,
( ~ '$ki_accessible'('$ki_local_world',X0)
| ~ '$ki_accessible'(X4,X5)
| '$ki_accessible'(X4,sK12(X1,X4))
| '$ki_accessible'(X4,sK13(X1,X3,X4))
| ~ '$ki_accessible'(X2,X4)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| empty(X5,X3) ) ).
cnf(u3526,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK4(sK1(sK26),sK1(sK28),X1))
| '$ki_accessible'(X1,sK3(sK1(sK28),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| qmltpeq(X3,sK1(sK26),X2) ) ).
cnf(u1879,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK28),X0)
| ~ '$ki_accessible'(sK0(sK28),X1)
| '$ki_accessible'(X1,sK5(sK27,sK29,X1))
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,set_intersection2(sK27,X0),set_intersection2(sK29,X0)) ) ).
cnf(u4056,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK9(sK1(sK26),sK1(sK28),X1))
| ~ disjoint(sK8(sK1(sK26),X2,X1),sK1(sK26),X2)
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,sK1(sK28),X2) ) ).
cnf(u1343,axiom,
( ~ '$ki_accessible'(sK0('$ki_local_world'),X2)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X1)
| '$ki_accessible'(X0,sK19(sK1(sK0('$ki_local_world')),X1,X0))
| ~ '$ki_accessible'(X0,X3)
| ~ in(sK18(sK1(sK0('$ki_local_world')),X1,X3),X1,sK1(sK0('$ki_local_world'))) ) ).
cnf(u278,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X0)
| ~ '$ki_accessible'(sK28,X1)
| qmltpeq(X1,set_intersection2(sK1(sK26),X0),set_intersection2(X0,sK1(sK26))) ) ).
cnf(u3756,negated_conjecture,
( ~ '$ki_accessible'(sK30,X0)
| '$ki_accessible'(X0,sK11(sK1(sK26),sK29,X0))
| '$ki_accessible'(X0,sK10(sK1(sK26),sK1(sK30),X0))
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK30),sK29) ) ).
cnf(u623,negated_conjecture,
( ~ qmltpeq(sK7(sK1(sK26),sK1(sK24(sK26)),X0),sK1(sK26),sK1(sK24(sK26)))
| ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,singleton(sK1(sK26)),singleton(sK1(sK24(sK26)))) ) ).
cnf(u836,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| '$ki_accessible'(X0,sK20(sK1(sK26),sK29,X0))
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,singleton(sK1(sK26)),sK29) ) ).
cnf(u927,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X1)
| ~ '$ki_accessible'(sK28,X0)
| '$ki_accessible'(X0,sK7(sK27,X1,X0))
| ~ '$ki_accessible'(X0,X2)
| qmltpeq(X2,singleton(sK27),singleton(X1)) ) ).
cnf(u300,negated_conjecture,
( ~ '$ki_accessible'(sK26,X2)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X1)
| '$ki_accessible'(X0,sK2(sK27,X1,X0))
| ~ '$ki_accessible'(X0,X3)
| qmltpeq(X3,X1,sK27) ) ).
cnf(u207,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK26,X1)
| ~ '$ki_accessible'(sK26,X0)
| qmltpeq(X0,X1,X1) ) ).
cnf(u3767,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK28),X0)
| ~ '$ki_accessible'(sK0(sK28),X1)
| '$ki_accessible'(X1,sK11(sK1(sK26),sK1(sK28),X1))
| '$ki_accessible'(X1,sK10(sK1(sK26),X0,X1))
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,X0,sK1(sK28)) ) ).
cnf(u3533,negated_conjecture,
( ~ '$ki_accessible'(sK31,X0)
| '$ki_accessible'(X0,sK4(sK1(sK26),sK29,X0))
| '$ki_accessible'(X0,sK3(sK29,sK1(sK31),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,sK1(sK26),sK1(sK31)) ) ).
cnf(u1874,axiom,
( ~ '$ki_exists_in_world_$i'(sK0('$ki_local_world'),X2)
| ~ in(sK16(X2,X3,X0),X3,X2)
| '$ki_accessible'(X0,sK17(X2,X4,X0))
| ~ '$ki_accessible'(X5,X0)
| ~ '$ki_exists_in_world_$i'(X5,X3)
| ~ '$ki_accessible'(X6,X5)
| ~ '$ki_exists_in_world_$i'(X6,X4)
| ~ '$ki_accessible'(sK0('$ki_local_world'),X6)
| ~ '$ki_accessible'(X0,X1)
| in(X1,X3,X4) ) ).
cnf(u4071,axiom,
( ~ '$ki_exists_in_world_$i'(sK24(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X0)
| '$ki_accessible'(X0,sK7(sK1(sK0('$ki_local_world')),X1,X0))
| ~ '$ki_accessible'(X0,X2)
| qmltpeq(X2,singleton(sK1(sK0('$ki_local_world'))),singleton(X1)) ) ).
cnf(u314,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| '$ki_accessible'(X0,sK2(sK27,sK29,X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,sK29,sK27) ) ).
cnf(u285,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK26,X2)
| ~ disjoint(sK25(X2,X3,X0),X2,X3)
| ~ '$ki_accessible'(X4,X0)
| ~ '$ki_exists_in_world_$i'(X4,X3)
| ~ '$ki_accessible'(sK26,X4)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,X3,X2) ) ).
cnf(u531,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| '$ki_accessible'(X0,sK25(sK27,sK29,X0))
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK29,sK27) ) ).
cnf(u835,negated_conjecture,
( ~ in(sK21(sK27,sK1(sK0(sK26)),X0),sK27,sK1(sK0(sK26)))
| ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(sK1(sK0(sK26)),singleton(sK27)),singleton(sK27)) ) ).
cnf(u299,axiom,
( ~ '$ki_exists_in_world_$i'(sK0('$ki_local_world'),X2)
| ~ qmltpeq(sK7(X2,X3,X0),X2,X3)
| ~ '$ki_accessible'(X4,X0)
| ~ '$ki_exists_in_world_$i'(X4,X3)
| ~ '$ki_accessible'(sK0('$ki_local_world'),X4)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,singleton(X2),singleton(X3)) ) ).
cnf(u1521,axiom,
( ~ '$ki_accessible'(sK0('$ki_local_world'),X4)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(X4,X2)
| ~ '$ki_exists_in_world_$i'(X4,X0)
| ~ qmltpeq(sK6(sK1(sK0('$ki_local_world')),X0,X1),sK1(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X1,X5)
| qmltpeq(X5,set_intersection2(X3,sK1(sK0('$ki_local_world'))),set_intersection2(X3,X0)) ) ).
cnf(u3766,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK30,X0)
| ~ '$ki_accessible'(sK30,X1)
| '$ki_accessible'(X1,sK11(sK1(sK26),sK1(sK28),X1))
| '$ki_accessible'(X1,sK10(sK1(sK26),X0,X1))
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,X0,sK1(sK28)) ) ).
cnf(u625,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| '$ki_accessible'(X0,sK25(sK1(sK26),sK1(sK28),X0))
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK28),sK1(sK26)) ) ).
cnf(u486,axiom,
( ~ '$ki_exists_in_world_$i'(sK0('$ki_local_world'),X2)
| ~ in(sK21(X2,X3,X0),X2,X3)
| ~ '$ki_accessible'(X4,X0)
| ~ '$ki_exists_in_world_$i'(X4,X3)
| ~ '$ki_accessible'(sK0('$ki_local_world'),X4)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(X3,singleton(X2)),singleton(X2)) ) ).
cnf(u929,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X1)
| ~ '$ki_accessible'(sK0(sK26),X0)
| '$ki_accessible'(X0,sK7(sK27,X1,X0))
| ~ '$ki_accessible'(X0,X2)
| qmltpeq(X2,singleton(sK27),singleton(X1)) ) ).
cnf(u167,axiom,
( ~ '$ki_accessible'('$ki_local_world',X0)
| ~ '$ki_accessible'(X6,X7)
| ~ disjoint(sK10(X1,X5,X6),X5,X1)
| ~ qmltpeq(sK11(X1,X3,X6),X1,X3)
| ~ '$ki_accessible'(X4,X6)
| ~ '$ki_exists_in_world_$i'(X4,X5)
| ~ '$ki_accessible'(X2,X4)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| disjoint(X7,X5,X3) ) ).
cnf(u508,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK26,X2)
| ~ qmltpeq(sK5(X2,X3,X0),X2,X3)
| ~ '$ki_accessible'(X4,X0)
| ~ '$ki_exists_in_world_$i'(X4,X5)
| ~ '$ki_accessible'(X6,X4)
| ~ '$ki_exists_in_world_$i'(X6,X3)
| ~ '$ki_accessible'(sK26,X6)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(X2,X5),set_intersection2(X3,X5)) ) ).
cnf(u1942,negated_conjecture,
( ~ '$ki_accessible'(sK31,X0)
| '$ki_accessible'(X0,sK5(sK27,sK1(sK28),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(sK27,sK1(sK31)),set_intersection2(sK1(sK28),sK1(sK31))) ) ).
cnf(u2430,negated_conjecture,
( ~ '$ki_accessible'(sK26,X4)
| '$ki_accessible'(X1,sK11(sK1(sK26),X2,X1))
| ~ '$ki_accessible'(X3,X1)
| ~ '$ki_exists_in_world_$i'(X3,X0)
| ~ '$ki_accessible'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X4,X2)
| ~ disjoint(sK10(sK1(sK26),X0,X1),X0,sK1(sK26))
| ~ '$ki_accessible'(X1,X5)
| disjoint(X5,X0,X2) ) ).
cnf(u189,axiom,
( ~ '$ki_accessible'('$ki_local_world',X0)
| ~ '$ki_accessible'(X4,X5)
| ~ in(sK21(X1,X3,X4),X1,X3)
| ~ '$ki_accessible'(X2,X4)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| qmltpeq(X5,set_intersection2(X3,singleton(X1)),singleton(X1)) ) ).
cnf(u4388,axiom,
( ~ qmltpeq(sK13(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X0),sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))))
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X0)
| '$ki_accessible'(X0,sK12(sK1(sK0('$ki_local_world')),X0))
| ~ '$ki_accessible'(X0,X1)
| empty(X1,sK1(sK0(sK0('$ki_local_world')))) ) ).
cnf(u493,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X1)
| ~ '$ki_accessible'(sK0(sK26),X0)
| ~ in(sK19(sK27,X1,X0),sK27,X1)
| ~ '$ki_accessible'(X0,X2)
| '$ki_accessible'(X2,sK18(sK27,X1,X2)) ) ).
cnf(u739,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK26,X2)
| ~ in(sK16(X2,X3,X0),X3,X2)
| ~ qmltpeq(sK17(X2,X4,X0),X2,X4)
| ~ '$ki_accessible'(X5,X0)
| ~ '$ki_exists_in_world_$i'(X5,X3)
| ~ '$ki_accessible'(X6,X5)
| ~ '$ki_exists_in_world_$i'(X6,X4)
| ~ '$ki_accessible'(sK26,X6)
| ~ '$ki_accessible'(X0,X1)
| in(X1,X3,X4) ) ).
cnf(u2324,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ '$ki_accessible'(X0,X2)
| '$ki_accessible'(X2,sK6(sK1(sK26),sK29,X2))
| ~ '$ki_accessible'(X2,X3)
| qmltpeq(X3,set_intersection2(X1,sK1(sK26)),set_intersection2(X1,sK29)) ) ).
cnf(u1587,axiom,
( ~ '$ki_accessible'(sK0('$ki_local_world'),X4)
| ~ qmltpeq(sK11(sK1(sK0('$ki_local_world')),X2,X1),sK1(sK0('$ki_local_world')),X2)
| ~ '$ki_accessible'(X3,X1)
| ~ '$ki_exists_in_world_$i'(X3,X0)
| ~ '$ki_accessible'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X4,X2)
| ~ disjoint(sK10(sK1(sK0('$ki_local_world')),X0,X1),X0,sK1(sK0('$ki_local_world')))
| ~ '$ki_accessible'(X1,X5)
| disjoint(X5,X0,X2) ) ).
cnf(u1645,negated_conjecture,
( ~ qmltpeq(sK15(sK1(sK26),sK1(sK24(sK26)),X1),sK1(sK26),sK1(sK24(sK26)))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| ~ in(sK14(sK1(sK26),X2,X1),sK1(sK26),X2)
| ~ '$ki_accessible'(X1,X3)
| in(X3,sK1(sK24(sK26)),X2) ) ).
cnf(u3848,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK28),X0)
| '$ki_accessible'(X0,sK15(sK1(sK26),sK29,X0))
| '$ki_accessible'(X0,sK14(sK1(sK26),sK1(sK0(sK28)),X0))
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK29,sK1(sK0(sK28))) ) ).
cnf(u208,axiom,
( ~ '$ki_exists_in_world_$i'(sK0('$ki_local_world'),X1)
| ~ '$ki_accessible'(sK0('$ki_local_world'),X0)
| qmltpeq(X0,X1,X1) ) ).
cnf(u3768,negated_conjecture,
( ~ '$ki_accessible'(sK31,X0)
| '$ki_accessible'(X0,sK11(sK1(sK26),sK1(sK28),X0))
| '$ki_accessible'(X0,sK10(sK1(sK26),sK1(sK31),X0))
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK31),sK1(sK28)) ) ).
cnf(u1171,axiom,
( ~ '$ki_accessible'(sK0('$ki_local_world'),X0)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ '$ki_accessible'(X0,X2)
| qmltpeq(X2,set_intersection2(sK1(sK0('$ki_local_world')),X1),set_intersection2(X1,sK1(sK0('$ki_local_world')))) ) ).
cnf(u4387,axiom,
( ~ qmltpeq(sK13(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X0),sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))))
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X0)
| '$ki_accessible'(X0,sK12(sK1(sK0('$ki_local_world')),X0))
| ~ '$ki_accessible'(X0,X1)
| empty(X1,sK1(sK24(sK0('$ki_local_world')))) ) ).
cnf(u2323,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X3)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK6(sK1(sK26),X3,X1))
| ~ '$ki_accessible'(X1,X4)
| qmltpeq(X4,set_intersection2(X2,sK1(sK26)),set_intersection2(X2,X3)) ) ).
cnf(u598,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X1)
| ~ '$ki_accessible'(sK24(sK26),X0)
| ~ qmltpeq(sK7(sK1(sK26),X1,X0),sK1(sK26),X1)
| ~ '$ki_accessible'(X0,X2)
| qmltpeq(X2,singleton(sK1(sK26)),singleton(X1)) ) ).
cnf(u1436,negated_conjecture,
'$ki_accessible'(sK12(sK27,sK30),sK18(sK27,sK1(sK28),sK12(sK27,sK30))) ).
cnf(u2820,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK30,X0)
| ~ '$ki_accessible'(sK30,X1)
| '$ki_accessible'(X1,sK11(sK27,sK1(sK28),X1))
| '$ki_accessible'(X1,sK10(sK27,X0,X1))
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,X0,sK1(sK28)) ) ).
cnf(u3358,axiom,
( ~ '$ki_accessible'(sK0('$ki_local_world'),X4)
| '$ki_accessible'(X0,sK11(sK1(sK0('$ki_local_world')),X2,X0))
| ~ '$ki_accessible'(X3,X0)
| ~ '$ki_exists_in_world_$i'(X3,X1)
| ~ '$ki_accessible'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X4,X2)
| '$ki_accessible'(X0,sK10(sK1(sK0('$ki_local_world')),X1,X0))
| ~ '$ki_accessible'(X0,X5)
| disjoint(X5,X1,X2) ) ).
cnf(u1117,negated_conjecture,
( ~ qmltpeq(sK5(sK1(sK26),sK1(sK28),X2),sK1(sK26),sK1(sK28))
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ '$ki_accessible'(X2,X3)
| qmltpeq(X3,set_intersection2(sK1(sK26),X1),set_intersection2(sK1(sK28),X1)) ) ).
cnf(u3380,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK24(sK26),X2)
| '$ki_accessible'(X0,sK4(sK27,X1,X0))
| ~ qmltpeq(sK3(X1,X3,X0),X1,X3)
| ~ '$ki_accessible'(X0,X4)
| qmltpeq(X4,sK27,X3) ) ).
cnf(u1131,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X1)
| ~ '$ki_accessible'(sK24(sK26),X0)
| '$ki_accessible'(X0,sK19(sK27,X1,X0))
| ~ '$ki_accessible'(X0,X2)
| '$ki_accessible'(X2,sK18(sK27,X1,X2)) ) ).
cnf(u4163,axiom,
( ~ '$ki_exists_in_world_$i'(sK24(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X2)
| '$ki_accessible'(X0,sK11(sK1(sK0('$ki_local_world')),X1,X0))
| '$ki_accessible'(X0,sK10(sK1(sK0('$ki_local_world')),X3,X0))
| ~ '$ki_accessible'(X0,X4)
| disjoint(X4,X3,X1) ) ).
cnf(u1435,negated_conjecture,
'$ki_accessible'(sK12(sK27,sK30),sK18(sK1(sK26),sK29,sK12(sK27,sK30))) ).
cnf(u2819,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK31,X0)
| ~ '$ki_accessible'(sK31,X1)
| '$ki_accessible'(X1,sK11(sK27,sK1(sK28),X1))
| '$ki_accessible'(X1,sK10(sK27,X0,X1))
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,X0,sK1(sK28)) ) ).
cnf(u969,negated_conjecture,
( ~ in(sK21(sK1(sK26),sK1(sK0(sK26)),X0),sK1(sK26),sK1(sK0(sK26)))
| ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(sK1(sK0(sK26)),singleton(sK1(sK26))),singleton(sK1(sK26))) ) ).
cnf(u3552,negated_conjecture,
( ~ '$ki_accessible'(sK30,X0)
| '$ki_accessible'(X0,sK4(sK1(sK26),sK29,X0))
| '$ki_accessible'(X0,sK3(sK29,sK1(sK30),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,sK1(sK26),sK1(sK30)) ) ).
cnf(u3379,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK28,X2)
| '$ki_accessible'(X0,sK4(sK27,X1,X0))
| ~ qmltpeq(sK3(X1,X3,X0),X1,X3)
| ~ '$ki_accessible'(X0,X4)
| qmltpeq(X4,sK27,X3) ) ).
cnf(u1654,negated_conjecture,
( ~ qmltpeq(sK17(sK1(sK26),sK1(sK28),X1),sK1(sK26),sK1(sK28))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| ~ in(sK16(sK1(sK26),X2,X1),X2,sK1(sK26))
| ~ '$ki_accessible'(X1,X3)
| in(X3,X2,sK1(sK28)) ) ).
cnf(u4215,negated_conjecture,
( ~ qmltpeq(sK17(sK1(sK26),sK1(sK24(sK26)),X1),sK1(sK26),sK1(sK24(sK26)))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK16(sK1(sK26),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| in(X3,X2,sK1(sK24(sK26))) ) ).
cnf(u4109,axiom,
( ~ '$ki_exists_in_world_$i'(sK24(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X0)
| '$ki_accessible'(X0,sK21(sK1(sK0('$ki_local_world')),X1,X0))
| ~ '$ki_accessible'(X0,X2)
| qmltpeq(X2,set_intersection2(X1,singleton(sK1(sK0('$ki_local_world')))),singleton(sK1(sK0('$ki_local_world')))) ) ).
cnf(u2455,negated_conjecture,
( ~ '$ki_accessible'(sK26,X4)
| ~ qmltpeq(sK15(sK27,X2,X0),sK27,X2)
| ~ '$ki_accessible'(X3,X0)
| ~ '$ki_exists_in_world_$i'(X3,X1)
| ~ '$ki_accessible'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X4,X2)
| '$ki_accessible'(X0,sK14(sK27,X1,X0))
| ~ '$ki_accessible'(X0,X5)
| in(X5,X2,X1) ) ).
cnf(u3876,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK28,X2)
| ~ qmltpeq(sK11(sK1(sK26),X0,X1),sK1(sK26),X0)
| '$ki_accessible'(X1,sK10(sK1(sK26),X3,X1))
| ~ '$ki_accessible'(X1,X4)
| disjoint(X4,X3,X0) ) ).
cnf(u1685,negated_conjecture,
( ~ qmltpeq(sK17(sK1(sK26),sK1(sK24(sK26)),X1),sK1(sK26),sK1(sK24(sK26)))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| ~ in(sK16(sK1(sK26),X2,X1),X2,sK1(sK26))
| ~ '$ki_accessible'(X1,X3)
| in(X3,X2,sK1(sK24(sK26))) ) ).
cnf(u4234,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X2)
| '$ki_accessible'(X0,sK9(sK1(sK0('$ki_local_world')),X1,X0))
| ~ disjoint(sK8(sK1(sK0('$ki_local_world')),X3,X0),sK1(sK0('$ki_local_world')),X3)
| ~ '$ki_accessible'(X0,X4)
| disjoint(X4,X1,X3) ) ).
cnf(u4123,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK31,X0)
| ~ '$ki_accessible'(sK31,X1)
| '$ki_accessible'(X1,sK17(sK1(sK26),sK1(sK28),X1))
| ~ in(sK16(sK1(sK26),X0,X1),X0,sK1(sK26))
| ~ '$ki_accessible'(X1,X2)
| in(X2,X0,sK1(sK28)) ) ).
cnf(u4066,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK30,X0)
| ~ '$ki_accessible'(sK30,X1)
| '$ki_accessible'(X1,sK9(sK1(sK26),sK1(sK28),X1))
| ~ disjoint(sK8(sK1(sK26),X0,X1),sK1(sK26),X0)
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,sK1(sK28),X0) ) ).
cnf(u3460,negated_conjecture,
( ~ disjoint(sK10(sK27,sK1(sK0(sK28)),X0),sK1(sK0(sK28)),sK27)
| '$ki_accessible'(X0,sK11(sK27,sK1(sK28),X0))
| ~ '$ki_accessible'(sK0(sK28),X0)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK0(sK28)),sK1(sK28)) ) ).
cnf(u2723,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK9(sK27,sK1(sK0(sK26)),X1))
| '$ki_accessible'(X1,sK8(sK27,X2,X1))
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,sK1(sK0(sK26)),X2) ) ).
cnf(u4256,axiom,
( ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X0)
| '$ki_accessible'(X0,sK25(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X0))
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK0(sK0('$ki_local_world'))),sK1(sK0('$ki_local_world'))) ) ).
cnf(u4145,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK0('$ki_local_world')),X3)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK6(sK1(sK0('$ki_local_world')),X3,X1))
| ~ '$ki_accessible'(X1,X4)
| qmltpeq(X4,set_intersection2(X2,sK1(sK0('$ki_local_world'))),set_intersection2(X2,X3)) ) ).
cnf(u4048,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK17(sK1(sK26),sK1(sK0(sK26)),X1))
| '$ki_accessible'(X1,sK16(sK1(sK26),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| in(X3,X2,sK1(sK0(sK26))) ) ).
cnf(u3573,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK24(sK26),X2)
| '$ki_accessible'(X0,sK11(sK1(sK26),X1,X0))
| '$ki_accessible'(X0,sK10(sK1(sK26),X3,X0))
| ~ '$ki_accessible'(X0,X4)
| disjoint(X4,X3,X1) ) ).
cnf(u3875,negated_conjecture,
( ~ '$ki_accessible'(sK30,X0)
| '$ki_accessible'(X0,sK15(sK1(sK26),sK1(sK28),X0))
| '$ki_accessible'(X0,sK14(sK1(sK26),sK1(sK30),X0))
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK1(sK28),sK1(sK30)) ) ).
cnf(u4073,negated_conjecture,
( ~ qmltpeq(sK11(sK1(sK26),sK29,X1),sK1(sK26),sK29)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK10(sK1(sK26),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,X2,sK29) ) ).
cnf(u3459,axiom,
( ~ '$ki_accessible'(sK0('$ki_local_world'),X4)
| ~ qmltpeq(sK15(sK1(sK0('$ki_local_world')),X2,X0),sK1(sK0('$ki_local_world')),X2)
| ~ '$ki_accessible'(X3,X0)
| ~ '$ki_exists_in_world_$i'(X3,X1)
| ~ '$ki_accessible'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X4,X2)
| '$ki_accessible'(X0,sK14(sK1(sK0('$ki_local_world')),X1,X0))
| ~ '$ki_accessible'(X0,X5)
| in(X5,X2,X1) ) ).
cnf(u3759,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK0(sK26),X2)
| ~ qmltpeq(sK4(sK1(sK26),X0,X1),sK1(sK26),X0)
| '$ki_accessible'(X1,sK3(X0,X3,X1))
| ~ '$ki_accessible'(X1,X4)
| qmltpeq(X4,sK1(sK26),X3) ) ).
cnf(u3038,axiom,
( ~ '$ki_accessible'(sK0('$ki_local_world'),X2)
| ~ qmltpeq(sK13(sK1(sK0('$ki_local_world')),X1,X0),sK1(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X1)
| '$ki_accessible'(X0,sK12(sK1(sK0('$ki_local_world')),X0))
| ~ '$ki_accessible'(X0,X3)
| empty(X3,X1) ) ).
cnf(u4063,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X0)
| '$ki_accessible'(X0,sK20(sK1(sK0('$ki_local_world')),X1,X0))
| ~ '$ki_accessible'(X0,X2)
| disjoint(X2,singleton(sK1(sK0('$ki_local_world'))),X1) ) ).
cnf(u2822,negated_conjecture,
( ~ '$ki_accessible'(sK31,X0)
| '$ki_accessible'(X0,sK11(sK27,sK1(sK28),X0))
| '$ki_accessible'(X0,sK10(sK27,sK1(sK31),X0))
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK31),sK1(sK28)) ) ).
cnf(u4084,negated_conjecture,
( ~ disjoint(sK10(sK1(sK26),sK1(sK0(sK28)),X0),sK1(sK0(sK28)),sK1(sK26))
| '$ki_accessible'(X0,sK11(sK1(sK26),sK29,X0))
| ~ '$ki_accessible'(sK0(sK28),X0)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK0(sK28)),sK29) ) ).
cnf(u2143,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK0(sK26)),X0)
| '$ki_accessible'(X0,sK6(sK27,sK1(sK0(sK26)),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(sK1(sK0(sK0(sK26))),sK27),set_intersection2(sK1(sK0(sK0(sK26))),sK1(sK0(sK26)))) ) ).
cnf(u3450,negated_conjecture,
( ~ disjoint(sK10(sK27,sK1(sK31),X0),sK1(sK31),sK27)
| '$ki_accessible'(X0,sK11(sK27,sK29,X0))
| ~ '$ki_accessible'(sK31,X0)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK31),sK29) ) ).
cnf(u3045,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK28,X2)
| '$ki_accessible'(X0,sK17(sK27,X1,X0))
| '$ki_accessible'(X0,sK16(sK27,X3,X0))
| ~ '$ki_accessible'(X0,X4)
| in(X4,X3,X1) ) ).
cnf(u4058,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK30,X0)
| ~ '$ki_accessible'(sK30,X1)
| '$ki_accessible'(X1,sK9(sK1(sK26),sK29,X1))
| ~ disjoint(sK8(sK1(sK26),X0,X1),sK1(sK26),X0)
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,sK29,X0) ) ).
cnf(u3136,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK31,X0)
| ~ '$ki_accessible'(sK31,X1)
| '$ki_accessible'(X1,sK17(sK27,sK1(sK28),X1))
| '$ki_accessible'(X1,sK16(sK27,X0,X1))
| ~ '$ki_accessible'(X1,X2)
| in(X2,X0,sK1(sK28)) ) ).
cnf(u4197,negated_conjecture,
( ~ qmltpeq(sK4(sK1(sK26),sK1(sK24(sK26)),X1),sK1(sK26),sK1(sK24(sK26)))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK3(sK1(sK24(sK26)),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| qmltpeq(X3,sK1(sK26),X2) ) ).
cnf(u4083,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X0)
| '$ki_accessible'(X0,sK19(sK1(sK0('$ki_local_world')),X1,X0))
| ~ '$ki_accessible'(X0,X2)
| '$ki_accessible'(X2,sK18(sK1(sK0('$ki_local_world')),X1,X2)) ) ).
cnf(u3019,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK28),X0)
| '$ki_accessible'(X0,sK15(sK27,sK1(sK28),X0))
| '$ki_accessible'(X0,sK14(sK27,sK1(sK0(sK28)),X0))
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK1(sK28),sK1(sK0(sK28))) ) ).
cnf(u4211,negated_conjecture,
( ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK15(sK1(sK26),sK1(sK24(sK26)),X1))
| ~ in(sK14(sK1(sK26),X2,X1),sK1(sK26),X2)
| ~ '$ki_accessible'(X1,X3)
| in(X3,sK1(sK24(sK26)),X2) ) ).
cnf(u1648,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK24(sK26),X2)
| ~ qmltpeq(sK17(sK1(sK26),X0,X1),sK1(sK26),X0)
| ~ in(sK16(sK1(sK26),X3,X1),X3,sK1(sK26))
| ~ '$ki_accessible'(X1,X4)
| in(X4,X3,X0) ) ).
cnf(u4065,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK31,X0)
| ~ '$ki_accessible'(sK31,X1)
| '$ki_accessible'(X1,sK9(sK1(sK26),sK1(sK28),X1))
| ~ disjoint(sK8(sK1(sK26),X0,X1),sK1(sK26),X0)
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,sK1(sK28),X0) ) ).
cnf(u4105,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK28),X0)
| ~ '$ki_accessible'(sK0(sK28),X1)
| '$ki_accessible'(X1,sK15(sK1(sK26),sK1(sK28),X1))
| ~ in(sK14(sK1(sK26),X0,X1),sK1(sK26),X0)
| ~ '$ki_accessible'(X1,X2)
| in(X2,sK1(sK28),X0) ) ).
cnf(u4094,negated_conjecture,
( ~ qmltpeq(sK15(sK1(sK26),sK1(sK28),X1),sK1(sK26),sK1(sK28))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK14(sK1(sK26),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| in(X3,sK1(sK28),X2) ) ).
cnf(u2316,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK0(sK26)),X0)
| ~ '$ki_accessible'(sK0(sK0(sK26)),X1)
| '$ki_accessible'(X1,sK5(sK1(sK26),sK1(sK0(sK26)),X1))
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,set_intersection2(sK1(sK26),X0),set_intersection2(sK1(sK0(sK26)),X0)) ) ).
cnf(u4246,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X2)
| '$ki_accessible'(X0,sK11(sK1(sK0('$ki_local_world')),X1,X0))
| ~ disjoint(sK10(sK1(sK0('$ki_local_world')),X3,X0),X3,sK1(sK0('$ki_local_world')))
| ~ '$ki_accessible'(X0,X4)
| disjoint(X4,X3,X1) ) ).
cnf(u3878,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK0(sK26),X2)
| ~ qmltpeq(sK11(sK1(sK26),X0,X1),sK1(sK26),X0)
| '$ki_accessible'(X1,sK10(sK1(sK26),X3,X1))
| ~ '$ki_accessible'(X1,X4)
| disjoint(X4,X3,X0) ) ).
cnf(u4135,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK24(sK26)),X0)
| ~ '$ki_accessible'(sK0(sK24(sK26)),X1)
| '$ki_accessible'(X1,sK11(sK1(sK26),sK1(sK24(sK26)),X1))
| '$ki_accessible'(X1,sK10(sK1(sK26),X0,X1))
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,X0,sK1(sK24(sK26))) ) ).
cnf(u3530,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK31,X0)
| ~ '$ki_accessible'(sK31,X1)
| '$ki_accessible'(X1,sK4(sK1(sK26),sK29,X1))
| '$ki_accessible'(X1,sK3(sK29,X0,X1))
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,sK1(sK26),X0) ) ).
cnf(u4076,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK11(sK1(sK26),sK1(sK28),X1))
| ~ disjoint(sK10(sK1(sK26),X2,X1),X2,sK1(sK26))
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,X2,sK1(sK28)) ) ).
cnf(u2429,negated_conjecture,
( ~ '$ki_accessible'(sK26,X4)
| '$ki_accessible'(X1,sK11(sK27,X2,X1))
| ~ '$ki_accessible'(X3,X1)
| ~ '$ki_exists_in_world_$i'(X3,X0)
| ~ '$ki_accessible'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X4,X2)
| ~ disjoint(sK10(sK27,X0,X1),X0,sK27)
| ~ '$ki_accessible'(X1,X5)
| disjoint(X5,X0,X2) ) ).
cnf(u4157,negated_conjecture,
( ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK4(sK1(sK26),sK1(sK24(sK26)),X1))
| ~ qmltpeq(sK3(sK1(sK24(sK26)),X2,X1),sK1(sK24(sK26)),X2)
| ~ '$ki_accessible'(X1,X3)
| qmltpeq(X3,sK1(sK26),X2) ) ).
cnf(u828,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X1)
| ~ '$ki_accessible'(sK0(sK26),X0)
| ~ in(sK21(sK27,X1,X0),sK27,X1)
| ~ '$ki_accessible'(X0,X2)
| qmltpeq(X2,set_intersection2(X1,singleton(sK27)),singleton(sK27)) ) ).
cnf(u2733,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK11(sK27,sK1(sK28),X1))
| '$ki_accessible'(X1,sK10(sK27,X2,X1))
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,X2,sK1(sK28)) ) ).
cnf(u2315,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK24(sK26)),X0)
| ~ '$ki_accessible'(sK0(sK24(sK26)),X1)
| '$ki_accessible'(X1,sK5(sK1(sK26),sK1(sK24(sK26)),X1))
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,set_intersection2(sK1(sK26),X0),set_intersection2(sK1(sK24(sK26)),X0)) ) ).
cnf(u2144,negated_conjecture,
( ~ '$ki_accessible'(sK26,X4)
| '$ki_accessible'(X0,sK17(sK27,X2,X0))
| ~ '$ki_accessible'(X3,X0)
| ~ '$ki_exists_in_world_$i'(X3,X1)
| ~ '$ki_accessible'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X4,X2)
| '$ki_accessible'(X0,sK16(sK27,X1,X0))
| ~ '$ki_accessible'(X0,X5)
| in(X5,X1,X2) ) ).
cnf(u1170,negated_conjecture,
'$ki_accessible'(sK0(sK30),sK18(sK27,sK29,sK0(sK30))) ).
cnf(u4075,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK11(sK1(sK26),sK29,X1))
| ~ disjoint(sK10(sK1(sK26),X2,X1),X2,sK1(sK26))
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,X2,sK29) ) ).
cnf(u1400,negated_conjecture,
empty(sK0(sK0(sK28)),sK29) ).
cnf(u4176,axiom,
( ~ '$ki_exists_in_world_$i'(sK24(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X2)
| '$ki_accessible'(X0,sK15(sK1(sK0('$ki_local_world')),X1,X0))
| '$ki_accessible'(X0,sK14(sK1(sK0('$ki_local_world')),X3,X0))
| ~ '$ki_accessible'(X0,X4)
| in(X4,X1,X3) ) ).
cnf(u827,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X1)
| ~ '$ki_accessible'(sK24(sK26),X0)
| ~ in(sK21(sK27,X1,X0),sK27,X1)
| ~ '$ki_accessible'(X0,X2)
| qmltpeq(X2,set_intersection2(X1,singleton(sK27)),singleton(sK27)) ) ).
cnf(u528,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X1)
| ~ '$ki_accessible'(sK0(sK26),X0)
| '$ki_accessible'(X0,sK19(sK27,X1,X0))
| ~ '$ki_accessible'(X0,X2)
| ~ in(sK18(sK27,X1,X2),X1,sK27) ) ).
cnf(u2367,negated_conjecture,
( ~ '$ki_accessible'(sK26,X4)
| ~ qmltpeq(sK11(sK27,X2,X0),sK27,X2)
| ~ '$ki_accessible'(X3,X0)
| ~ '$ki_exists_in_world_$i'(X3,X1)
| ~ '$ki_accessible'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X4,X2)
| '$ki_accessible'(X0,sK10(sK27,X1,X0))
| ~ '$ki_accessible'(X0,X5)
| disjoint(X5,X1,X2) ) ).
cnf(u2732,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK11(sK27,sK29,X1))
| '$ki_accessible'(X1,sK10(sK27,X2,X1))
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,X2,sK29) ) ).
cnf(u1647,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK28,X2)
| ~ qmltpeq(sK17(sK1(sK26),X0,X1),sK1(sK26),X0)
| ~ in(sK16(sK1(sK26),X3,X1),X3,sK1(sK26))
| ~ '$ki_accessible'(X1,X4)
| in(X4,X3,X0) ) ).
cnf(u4086,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK30,X0)
| ~ '$ki_accessible'(sK30,X1)
| '$ki_accessible'(X1,sK11(sK1(sK26),sK1(sK28),X1))
| ~ disjoint(sK10(sK1(sK26),X0,X1),X0,sK1(sK26))
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,X0,sK1(sK28)) ) ).
cnf(u3372,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK28,X2)
| ~ qmltpeq(sK4(sK27,X0,X1),sK27,X0)
| '$ki_accessible'(X1,sK3(X0,X3,X1))
| ~ '$ki_accessible'(X1,X4)
| qmltpeq(X4,sK27,X3) ) ).
cnf(u695,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X1)
| ~ '$ki_accessible'(sK28,X0)
| '$ki_accessible'(X0,sK19(sK1(sK26),X1,X0))
| ~ '$ki_accessible'(X0,X2)
| ~ in(sK18(sK1(sK26),X1,X2),X1,sK1(sK26)) ) ).
cnf(u1130,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X1)
| ~ '$ki_accessible'(sK28,X0)
| '$ki_accessible'(X0,sK19(sK27,X1,X0))
| ~ '$ki_accessible'(X0,X2)
| '$ki_accessible'(X2,sK18(sK27,X1,X2)) ) ).
cnf(u164,axiom,
( ~ '$ki_accessible'('$ki_local_world',X0)
| ~ '$ki_accessible'(X6,X7)
| '$ki_accessible'(X6,sK10(X1,X5,X6))
| '$ki_accessible'(X6,sK11(X1,X3,X6))
| ~ '$ki_accessible'(X4,X6)
| ~ '$ki_exists_in_world_$i'(X4,X5)
| ~ '$ki_accessible'(X2,X4)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| disjoint(X7,X5,X3) ) ).
cnf(u4093,negated_conjecture,
( ~ qmltpeq(sK15(sK1(sK26),sK29,X1),sK1(sK26),sK29)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK14(sK1(sK26),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| in(X3,sK29,X2) ) ).
cnf(u258,axiom,
( ~ '$ki_exists_in_world_$i'(sK0('$ki_local_world'),X2)
| '$ki_accessible'(X0,sK2(X2,X3,X0))
| ~ '$ki_accessible'(X4,X0)
| ~ '$ki_exists_in_world_$i'(X4,X3)
| ~ '$ki_accessible'(sK0('$ki_local_world'),X4)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,X3,X2) ) ).
cnf(u178,axiom,
( ~ '$ki_accessible'('$ki_local_world',X0)
| ~ '$ki_accessible'(X6,X7)
| ~ in(sK16(X1,X5,X6),X5,X1)
| '$ki_accessible'(X6,sK17(X1,X3,X6))
| ~ '$ki_accessible'(X4,X6)
| ~ '$ki_exists_in_world_$i'(X4,X5)
| ~ '$ki_accessible'(X2,X4)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| in(X7,X5,X3) ) ).
cnf(u280,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X0)
| ~ '$ki_accessible'(sK0(sK26),X1)
| qmltpeq(X1,set_intersection2(sK1(sK26),X0),set_intersection2(X0,sK1(sK26))) ) ).
cnf(u736,negated_conjecture,
( ~ in(sK19(sK27,sK1(sK28),X0),sK27,sK1(sK28))
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| ~ in(sK18(sK27,sK1(sK28),X1),sK1(sK28),sK27) ) ).
cnf(u1649,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK0(sK26),X2)
| ~ qmltpeq(sK17(sK1(sK26),X0,X1),sK1(sK26),X0)
| ~ in(sK16(sK1(sK26),X3,X1),X3,sK1(sK26))
| ~ '$ki_accessible'(X1,X4)
| in(X4,X3,X0) ) ).
cnf(u4088,negated_conjecture,
( ~ disjoint(sK10(sK1(sK26),sK1(sK31),X0),sK1(sK31),sK1(sK26))
| '$ki_accessible'(X0,sK11(sK1(sK26),sK1(sK28),X0))
| ~ '$ki_accessible'(sK31,X0)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK31),sK1(sK28)) ) ).
cnf(u310,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X1)
| ~ '$ki_accessible'(sK24(sK26),X0)
| '$ki_accessible'(X0,sK2(sK27,X1,X0))
| ~ '$ki_accessible'(X0,X2)
| qmltpeq(X2,X1,sK27) ) ).
cnf(u527,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X1)
| ~ '$ki_accessible'(sK24(sK26),X0)
| '$ki_accessible'(X0,sK19(sK27,X1,X0))
| ~ '$ki_accessible'(X0,X2)
| ~ in(sK18(sK27,X1,X2),X1,sK27) ) ).
cnf(u209,negated_conjecture,
( qmltpeq(X0,sK27,sK27)
| ~ '$ki_accessible'(sK26,X0) ) ).
cnf(u697,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X1)
| ~ '$ki_accessible'(sK0(sK26),X0)
| '$ki_accessible'(X0,sK19(sK1(sK26),X1,X0))
| ~ '$ki_accessible'(X0,X2)
| ~ in(sK18(sK1(sK26),X1,X2),X1,sK1(sK26)) ) ).
cnf(u868,axiom,
( ~ '$ki_exists_in_world_$i'(sK0('$ki_local_world'),X3)
| in(X2,X3,X4)
| ~ '$ki_accessible'(sK20(X3,X4,X0),X2)
| ~ '$ki_accessible'(X5,X0)
| ~ '$ki_exists_in_world_$i'(X5,X4)
| ~ '$ki_accessible'(sK0('$ki_local_world'),X5)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,singleton(X3),X4) ) ).
cnf(u295,negated_conjecture,
( ~ qmltpeq(sK2(sK27,sK1(sK28),X0),sK27,sK1(sK28))
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,sK1(sK28),sK27) ) ).
cnf(u452,axiom,
( ~ '$ki_exists_in_world_$i'(sK0('$ki_local_world'),X2)
| ~ empty(sK12(X2,X0),X2)
| ~ qmltpeq(sK13(X2,X3,X0),X2,X3)
| ~ '$ki_accessible'(X4,X0)
| ~ '$ki_exists_in_world_$i'(X4,X3)
| ~ '$ki_accessible'(sK0('$ki_local_world'),X4)
| ~ '$ki_accessible'(X0,X1)
| empty(X1,X3) ) ).
cnf(u563,axiom,
( ~ '$ki_exists_in_world_$i'(sK0('$ki_local_world'),X2)
| '$ki_accessible'(X0,sK12(X2,X0))
| '$ki_accessible'(X0,sK13(X2,X3,X0))
| ~ '$ki_accessible'(X4,X0)
| ~ '$ki_exists_in_world_$i'(X4,X3)
| ~ '$ki_accessible'(sK0('$ki_local_world'),X4)
| ~ '$ki_accessible'(X0,X1)
| empty(X1,X3) ) ).
cnf(u1756,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X0)
| ~ '$ki_accessible'(sK28,X1)
| ~ qmltpeq(sK13(sK27,X0,X1),sK27,X0)
| '$ki_accessible'(X1,sK12(sK27,X1))
| ~ '$ki_accessible'(X1,X2)
| empty(X2,X0) ) ).
cnf(u1440,negated_conjecture,
'$ki_accessible'(sK12(sK27,sK0(sK28)),sK18(sK1(sK26),sK29,sK12(sK27,sK0(sK28)))) ).
cnf(u621,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X1)
| ~ '$ki_accessible'(sK24(sK26),X0)
| '$ki_accessible'(X0,sK25(sK1(sK26),X1,X0))
| ~ '$ki_accessible'(X0,X2)
| disjoint(X2,X1,sK1(sK26)) ) ).
cnf(u867,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK26,X3)
| in(X2,X3,X4)
| ~ '$ki_accessible'(sK20(X3,X4,X0),X2)
| ~ '$ki_accessible'(X5,X0)
| ~ '$ki_exists_in_world_$i'(X5,X4)
| ~ '$ki_accessible'(sK26,X5)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,singleton(X3),X4) ) ).
cnf(u1232,negated_conjecture,
'$ki_accessible'(sK0(sK0(sK0(sK26))),sK18(sK27,sK1(sK0(sK26)),sK0(sK0(sK0(sK26))))) ).
cnf(u925,negated_conjecture,
( ~ '$ki_accessible'(sK26,X2)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X1)
| '$ki_accessible'(X0,sK7(sK1(sK26),X1,X0))
| ~ '$ki_accessible'(X0,X3)
| qmltpeq(X3,singleton(sK1(sK26)),singleton(X1)) ) ).
cnf(u696,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X1)
| ~ '$ki_accessible'(sK24(sK26),X0)
| '$ki_accessible'(X0,sK19(sK1(sK26),X1,X0))
| ~ '$ki_accessible'(X0,X2)
| ~ in(sK18(sK1(sK26),X1,X2),X1,sK1(sK26)) ) ).
cnf(u147,axiom,
( ~ '$ki_accessible'('$ki_local_world',X0)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| qmltpeq(X2,X1,X1) ) ).
cnf(u488,axiom,
( ~ '$ki_exists_in_world_$i'(sK0('$ki_local_world'),X2)
| '$ki_accessible'(X0,sK19(X2,X3,X0))
| ~ '$ki_accessible'(X4,X0)
| ~ '$ki_exists_in_world_$i'(X4,X3)
| ~ '$ki_accessible'(sK0('$ki_local_world'),X4)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK18(X2,X3,X1)) ) ).
cnf(u451,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK26,X2)
| ~ empty(sK12(X2,X0),X2)
| ~ qmltpeq(sK13(X2,X3,X0),X2,X3)
| ~ '$ki_accessible'(X4,X0)
| ~ '$ki_exists_in_world_$i'(X4,X3)
| ~ '$ki_accessible'(sK26,X4)
| ~ '$ki_accessible'(X0,X1)
| empty(X1,X3) ) ).
cnf(u3384,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK4(sK27,sK1(sK28),X1))
| ~ qmltpeq(sK3(sK1(sK28),X2,X1),sK1(sK28),X2)
| ~ '$ki_accessible'(X1,X3)
| qmltpeq(X3,sK27,X2) ) ).
cnf(u3670,negated_conjecture,
( ~ '$ki_accessible'(sK30,X0)
| '$ki_accessible'(X0,sK9(sK1(sK26),sK29,X0))
| '$ki_accessible'(X0,sK8(sK1(sK26),sK1(sK30),X0))
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK29,sK1(sK30)) ) ).
cnf(u169,axiom,
( ~ '$ki_accessible'('$ki_local_world',X0)
| ~ '$ki_accessible'(X4,X5)
| '$ki_accessible'(X4,sK12(X1,X4))
| ~ qmltpeq(sK13(X1,X3,X4),X1,X3)
| ~ '$ki_accessible'(X2,X4)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| empty(X5,X3) ) ).
cnf(u1243,negated_conjecture,
( ~ qmltpeq(sK4(sK27,sK1(sK24(sK26)),X1),sK27,sK1(sK24(sK26)))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| ~ qmltpeq(sK3(sK1(sK24(sK26)),X2,X1),sK1(sK24(sK26)),X2)
| ~ '$ki_accessible'(X1,X3)
| qmltpeq(X3,sK27,X2) ) ).
cnf(u529,negated_conjecture,
( ~ in(sK18(sK27,sK29,X1),sK29,sK27)
| '$ki_accessible'(X0,sK19(sK27,sK29,X0))
| ~ '$ki_accessible'(X0,X1)
| ~ '$ki_accessible'(sK28,X0) ) ).
cnf(u390,negated_conjecture,
( ~ disjoint(sK25(sK1(sK26),sK1(sK24(sK26)),X0),sK1(sK26),sK1(sK24(sK26)))
| ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK24(sK26)),sK1(sK26)) ) ).
cnf(u833,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X1)
| ~ '$ki_accessible'(sK0(sK26),X0)
| '$ki_accessible'(X0,sK20(sK1(sK26),X1,X0))
| ~ '$ki_accessible'(X0,X2)
| disjoint(X2,singleton(sK1(sK26)),X1) ) ).
cnf(u735,negated_conjecture,
( ~ in(sK19(sK27,sK29,X0),sK27,sK29)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| ~ in(sK18(sK27,sK29,X1),sK29,sK27) ) ).
cnf(u620,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X1)
| ~ '$ki_accessible'(sK28,X0)
| '$ki_accessible'(X0,sK25(sK1(sK26),X1,X0))
| ~ '$ki_accessible'(X0,X2)
| disjoint(X2,X1,sK1(sK26)) ) ).
cnf(u3673,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK28,X2)
| '$ki_accessible'(X0,sK17(sK1(sK26),X1,X0))
| '$ki_accessible'(X0,sK16(sK1(sK26),X3,X0))
| ~ '$ki_accessible'(X0,X4)
| in(X4,X3,X1) ) ).
cnf(u1030,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X3)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| ~ qmltpeq(sK6(sK27,X3,X1),sK27,X3)
| ~ '$ki_accessible'(X1,X4)
| qmltpeq(X4,set_intersection2(X2,sK27),set_intersection2(X2,X3)) ) ).
cnf(u412,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK26,X2)
| '$ki_accessible'(X0,sK7(X2,X3,X0))
| ~ '$ki_accessible'(X4,X0)
| ~ '$ki_exists_in_world_$i'(X4,X3)
| ~ '$ki_accessible'(sK26,X4)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,singleton(X2),singleton(X3)) ) ).
cnf(u1796,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK26,X2)
| '$ki_accessible'(X0,sK14(X2,X3,X0))
| ~ qmltpeq(sK15(X2,X4,X0),X2,X4)
| ~ '$ki_accessible'(X5,X0)
| ~ '$ki_exists_in_world_$i'(X5,X3)
| ~ '$ki_accessible'(X6,X5)
| ~ '$ki_exists_in_world_$i'(X6,X4)
| ~ '$ki_accessible'(sK26,X6)
| ~ '$ki_accessible'(X0,X1)
| in(X1,X4,X3) ) ).
cnf(u1486,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| '$ki_accessible'(X0,sK13(sK1(sK26),sK29,X0))
| '$ki_accessible'(X0,sK12(sK1(sK26),X0))
| ~ '$ki_accessible'(X0,X1)
| empty(X1,sK29) ) ).
cnf(u204,negated_conjecture,
~ qmltpeq(sK30,set_intersection2(singleton(sK27),sK29),singleton(sK27)) ).
cnf(u1549,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK26,X2)
| '$ki_accessible'(X0,sK8(X2,X3,X0))
| ~ qmltpeq(sK9(X2,X4,X0),X2,X4)
| ~ '$ki_accessible'(X5,X0)
| ~ '$ki_exists_in_world_$i'(X5,X3)
| ~ '$ki_accessible'(X6,X5)
| ~ '$ki_exists_in_world_$i'(X6,X4)
| ~ '$ki_accessible'(sK26,X6)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,X4,X3) ) ).
cnf(u411,axiom,
( ~ '$ki_exists_in_world_$i'(sK0('$ki_local_world'),X2)
| ~ in(sK19(X2,X3,X0),X2,X3)
| ~ '$ki_accessible'(X4,X0)
| ~ '$ki_exists_in_world_$i'(X4,X3)
| ~ '$ki_accessible'(sK0('$ki_local_world'),X4)
| ~ '$ki_accessible'(X0,X1)
| ~ in(sK18(X2,X3,X1),X3,X2) ) ).
cnf(u1795,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X0)
| ~ in(sK19(sK1(sK0('$ki_local_world')),X1,X0),sK1(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(X0,X2)
| ~ in(sK18(sK1(sK0('$ki_local_world')),X1,X2),X1,sK1(sK0('$ki_local_world'))) ) ).
cnf(u1981,negated_conjecture,
( ~ '$ki_accessible'(sK26,X4)
| '$ki_accessible'(X0,sK4(sK27,X1,X0))
| ~ '$ki_accessible'(X3,X0)
| ~ '$ki_exists_in_world_$i'(X3,X2)
| ~ '$ki_accessible'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X4,X1)
| '$ki_accessible'(X0,sK3(X1,X2,X0))
| ~ '$ki_accessible'(X0,X5)
| qmltpeq(X5,sK27,X2) ) ).
cnf(u240,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK26,X3)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK26,X0)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(X3,X2),set_intersection2(X2,X3)) ) ).
cnf(u1203,negated_conjecture,
'$ki_accessible'(sK0(sK30),sK18(sK27,sK1(sK28),sK0(sK30))) ).
cnf(u3464,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK0(sK26)),X0)
| ~ '$ki_accessible'(sK0(sK0(sK26)),X1)
| '$ki_accessible'(X1,sK11(sK27,sK1(sK0(sK26)),X1))
| ~ disjoint(sK10(sK27,X0,X1),X0,sK27)
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,X0,sK1(sK0(sK26))) ) ).
cnf(u737,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| '$ki_accessible'(X0,sK20(sK27,sK29,X0))
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,singleton(sK27),sK29) ) ).
cnf(u630,axiom,
( ~ '$ki_exists_in_world_$i'(sK0('$ki_local_world'),X2)
| ~ empty(sK12(X2,X0),X2)
| '$ki_accessible'(X0,sK13(X2,X3,X0))
| ~ '$ki_accessible'(X4,X0)
| ~ '$ki_exists_in_world_$i'(X4,X3)
| ~ '$ki_accessible'(sK0('$ki_local_world'),X4)
| ~ '$ki_accessible'(X0,X1)
| empty(X1,X3) ) ).
cnf(u999,negated_conjecture,
( ~ '$ki_accessible'(sK24(sK26),X0)
| '$ki_accessible'(X0,sK7(sK27,sK1(sK24(sK26)),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,singleton(sK27),singleton(sK1(sK24(sK26)))) ) ).
cnf(u2056,negated_conjecture,
( ~ '$ki_accessible'(sK26,X4)
| '$ki_accessible'(X0,sK11(sK1(sK26),X2,X0))
| ~ '$ki_accessible'(X3,X0)
| ~ '$ki_exists_in_world_$i'(X3,X1)
| ~ '$ki_accessible'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X4,X2)
| '$ki_accessible'(X0,sK10(sK1(sK26),X1,X0))
| ~ '$ki_accessible'(X0,X5)
| disjoint(X5,X1,X2) ) ).
cnf(u1446,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK28,X2)
| ~ qmltpeq(sK17(sK27,X0,X1),sK27,X0)
| ~ in(sK16(sK27,X3,X1),X3,sK27)
| ~ '$ki_accessible'(X1,X4)
| in(X4,X3,X0) ) ).
cnf(u1806,axiom,
( ~ '$ki_exists_in_world_$i'(sK24(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X0)
| ~ in(sK21(sK1(sK0('$ki_local_world')),X1,X0),sK1(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(X0,X2)
| qmltpeq(X2,set_intersection2(X1,singleton(sK1(sK0('$ki_local_world')))),singleton(sK1(sK0('$ki_local_world')))) ) ).
cnf(u1548,axiom,
( ~ '$ki_accessible'(sK0('$ki_local_world'),X4)
| ~ qmltpeq(sK9(sK1(sK0('$ki_local_world')),X2,X1),sK1(sK0('$ki_local_world')),X2)
| ~ '$ki_accessible'(X3,X1)
| ~ '$ki_exists_in_world_$i'(X3,X0)
| ~ '$ki_accessible'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X4,X2)
| ~ disjoint(sK8(sK1(sK0('$ki_local_world')),X0,X1),sK1(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X1,X5)
| disjoint(X5,X2,X0) ) ).
cnf(u1238,negated_conjecture,
( ~ qmltpeq(sK4(sK27,sK1(sK28),X1),sK27,sK1(sK28))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| ~ qmltpeq(sK3(sK1(sK28),X2,X1),sK1(sK28),X2)
| ~ '$ki_accessible'(X1,X3)
| qmltpeq(X3,sK27,X2) ) ).
cnf(u2004,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK0(sK26)),X0)
| ~ '$ki_accessible'(sK0(sK0(sK26)),X1)
| '$ki_accessible'(X1,sK5(sK27,sK1(sK0(sK26)),X1))
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,set_intersection2(sK27,X0),set_intersection2(sK1(sK0(sK26)),X0)) ) ).
cnf(u1468,negated_conjecture,
( ~ qmltpeq(sK17(sK27,sK1(sK0(sK26)),X1),sK27,sK1(sK0(sK26)))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| ~ in(sK16(sK27,X2,X1),X2,sK27)
| ~ '$ki_accessible'(X1,X3)
| in(X3,X2,sK1(sK0(sK26))) ) ).
cnf(u3479,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK15(sK27,sK29,X1))
| ~ in(sK14(sK27,X2,X1),sK27,X2)
| ~ '$ki_accessible'(X1,X3)
| in(X3,sK29,X2) ) ).
cnf(u3390,negated_conjecture,
( ~ qmltpeq(sK3(sK29,sK1(sK0(sK28)),X0),sK29,sK1(sK0(sK28)))
| '$ki_accessible'(X0,sK4(sK27,sK29,X0))
| ~ '$ki_accessible'(sK0(sK28),X0)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,sK27,sK1(sK0(sK28))) ) ).
cnf(u1453,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK26),X0)
| '$ki_accessible'(X0,sK13(sK27,sK1(sK0(sK26)),X0))
| '$ki_accessible'(X0,sK12(sK27,X0))
| ~ '$ki_accessible'(X0,X1)
| empty(X1,sK1(sK0(sK26))) ) ).
cnf(u1813,axiom,
( ~ in(sK21(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X0),sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))))
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(sK1(sK0(sK0('$ki_local_world'))),singleton(sK1(sK0('$ki_local_world')))),singleton(sK1(sK0('$ki_local_world')))) ) ).
cnf(u1757,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X0)
| ~ '$ki_accessible'(sK24(sK26),X1)
| ~ qmltpeq(sK13(sK27,X0,X1),sK27,X0)
| '$ki_accessible'(X1,sK12(sK27,X1))
| ~ '$ki_accessible'(X1,X2)
| empty(X2,X0) ) ).
cnf(u1035,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X1)
| ~ '$ki_accessible'(sK0(sK26),X0)
| '$ki_accessible'(X0,sK7(sK1(sK26),X1,X0))
| ~ '$ki_accessible'(X0,X2)
| qmltpeq(X2,singleton(sK1(sK26)),singleton(X1)) ) ).
cnf(u3682,negated_conjecture,
( ~ '$ki_accessible'(sK31,X0)
| '$ki_accessible'(X0,sK9(sK1(sK26),sK1(sK28),X0))
| '$ki_accessible'(X0,sK8(sK1(sK26),sK1(sK31),X0))
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK28),sK1(sK31)) ) ).
cnf(u2117,negated_conjecture,
( ~ '$ki_accessible'(sK26,X4)
| '$ki_accessible'(X0,sK15(sK27,X2,X0))
| ~ '$ki_accessible'(X3,X0)
| ~ '$ki_exists_in_world_$i'(X3,X1)
| ~ '$ki_accessible'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X4,X2)
| '$ki_accessible'(X0,sK14(sK27,X1,X0))
| ~ '$ki_accessible'(X0,X5)
| in(X5,X2,X1) ) ).
cnf(u2003,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK24(sK26)),X0)
| ~ '$ki_accessible'(sK0(sK24(sK26)),X1)
| '$ki_accessible'(X1,sK5(sK27,sK1(sK24(sK26)),X1))
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,set_intersection2(sK27,X0),set_intersection2(sK1(sK24(sK26)),X0)) ) ).
cnf(u2450,negated_conjecture,
( ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ '$ki_accessible'(X0,X2)
| '$ki_accessible'(X2,sK6(sK1(sK26),sK1(sK24(sK26)),X2))
| ~ '$ki_accessible'(X2,X3)
| qmltpeq(X3,set_intersection2(X1,sK1(sK26)),set_intersection2(X1,sK1(sK24(sK26)))) ) ).
cnf(u2549,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK31,X0)
| ~ '$ki_accessible'(sK31,X1)
| '$ki_accessible'(X1,sK4(sK27,sK1(sK28),X1))
| '$ki_accessible'(X1,sK3(sK1(sK28),X0,X1))
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,sK27,X0) ) ).
cnf(u4328,axiom,
( ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X0)
| '$ki_accessible'(X0,sK13(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X0))
| '$ki_accessible'(X0,sK12(sK1(sK0('$ki_local_world')),X0))
| ~ '$ki_accessible'(X0,X1)
| empty(X1,sK1(sK24(sK0('$ki_local_world')))) ) ).
cnf(u1001,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X3)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| ~ qmltpeq(sK5(sK27,X3,X1),sK27,X3)
| ~ '$ki_accessible'(X1,X4)
| qmltpeq(X4,set_intersection2(sK27,X2),set_intersection2(X3,X2)) ) ).
cnf(u4217,negated_conjecture,
( ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK17(sK1(sK26),sK1(sK24(sK26)),X1))
| ~ in(sK16(sK1(sK26),X2,X1),X2,sK1(sK26))
| ~ '$ki_accessible'(X1,X3)
| in(X3,X2,sK1(sK24(sK26))) ) ).
cnf(u3664,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK31,X0)
| ~ '$ki_accessible'(sK31,X1)
| '$ki_accessible'(X1,sK9(sK1(sK26),sK29,X1))
| '$ki_accessible'(X1,sK8(sK1(sK26),X0,X1))
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,sK29,X0) ) ).
cnf(u4230,negated_conjecture,
( ~ disjoint(sK8(sK1(sK26),sK1(sK0(sK0(sK26))),X0),sK1(sK26),sK1(sK0(sK0(sK26))))
| '$ki_accessible'(X0,sK9(sK1(sK26),sK1(sK0(sK26)),X0))
| ~ '$ki_accessible'(sK0(sK0(sK26)),X0)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK0(sK26)),sK1(sK0(sK0(sK26)))) ) ).
cnf(u4119,negated_conjecture,
( ~ in(sK16(sK1(sK26),sK1(sK30),X0),sK1(sK30),sK1(sK26))
| '$ki_accessible'(X0,sK17(sK1(sK26),sK29,X0))
| ~ '$ki_accessible'(sK30,X0)
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK1(sK30),sK29) ) ).
cnf(u2014,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK31,X0)
| ~ '$ki_accessible'(sK31,X1)
| '$ki_accessible'(X1,sK6(sK27,sK29,X1))
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,set_intersection2(X0,sK27),set_intersection2(X0,sK29)) ) ).
cnf(u3137,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK30,X0)
| ~ '$ki_accessible'(sK30,X1)
| '$ki_accessible'(X1,sK17(sK27,sK1(sK28),X1))
| '$ki_accessible'(X1,sK16(sK27,X0,X1))
| ~ '$ki_accessible'(X1,X2)
| in(X2,X0,sK1(sK28)) ) ).
cnf(u2457,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK0(sK26)),X0)
| '$ki_accessible'(X0,sK6(sK1(sK26),sK1(sK0(sK26)),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(sK1(sK0(sK0(sK26))),sK1(sK26)),set_intersection2(sK1(sK0(sK0(sK26))),sK1(sK0(sK26)))) ) ).
cnf(u2055,negated_conjecture,
( ~ '$ki_accessible'(sK26,X4)
| '$ki_accessible'(X0,sK11(sK27,X2,X0))
| ~ '$ki_accessible'(X3,X0)
| ~ '$ki_exists_in_world_$i'(X3,X1)
| ~ '$ki_accessible'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X4,X2)
| '$ki_accessible'(X0,sK10(sK27,X1,X0))
| ~ '$ki_accessible'(X0,X5)
| disjoint(X5,X1,X2) ) ).
cnf(u4252,axiom,
( ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X0)
| '$ki_accessible'(X0,sK2(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,sK1(sK0(sK0('$ki_local_world'))),sK1(sK0('$ki_local_world'))) ) ).
cnf(u4141,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK24(sK26)),X0)
| ~ '$ki_accessible'(sK0(sK24(sK26)),X1)
| '$ki_accessible'(X1,sK17(sK1(sK26),sK1(sK24(sK26)),X1))
| '$ki_accessible'(X1,sK16(sK1(sK26),X0,X1))
| ~ '$ki_accessible'(X1,X2)
| in(X2,X0,sK1(sK24(sK26))) ) ).
cnf(u3470,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK0(sK26),X2)
| ~ qmltpeq(sK15(sK27,X0,X1),sK27,X0)
| '$ki_accessible'(X1,sK14(sK27,X3,X1))
| ~ '$ki_accessible'(X1,X4)
| in(X4,X0,X3) ) ).
cnf(u4155,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X2)
| '$ki_accessible'(X0,sK4(sK1(sK0('$ki_local_world')),X1,X0))
| '$ki_accessible'(X0,sK3(X1,X3,X0))
| ~ '$ki_accessible'(X0,X4)
| qmltpeq(X4,sK1(sK0('$ki_local_world')),X3) ) ).
cnf(u3492,negated_conjecture,
( ~ in(sK14(sK27,sK1(sK30),X0),sK27,sK1(sK30))
| '$ki_accessible'(X0,sK15(sK27,sK1(sK28),X0))
| ~ '$ki_accessible'(sK30,X0)
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK1(sK28),sK1(sK30)) ) ).
cnf(u4160,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X2)
| '$ki_accessible'(X0,sK9(sK1(sK0('$ki_local_world')),X1,X0))
| '$ki_accessible'(X0,sK8(sK1(sK0('$ki_local_world')),X3,X0))
| ~ '$ki_accessible'(X0,X4)
| disjoint(X4,X1,X3) ) ).
cnf(u3674,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK24(sK26),X2)
| '$ki_accessible'(X0,sK17(sK1(sK26),X1,X0))
| '$ki_accessible'(X0,sK16(sK1(sK26),X3,X0))
| ~ '$ki_accessible'(X0,X4)
| in(X4,X3,X1) ) ).
cnf(u4080,negated_conjecture,
( ~ disjoint(sK10(sK1(sK26),sK1(sK31),X0),sK1(sK31),sK1(sK26))
| '$ki_accessible'(X0,sK11(sK1(sK26),sK29,X0))
| ~ '$ki_accessible'(sK31,X0)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK31),sK29) ) ).
cnf(u3477,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK0(sK26),X2)
| '$ki_accessible'(X0,sK15(sK27,X1,X0))
| ~ in(sK14(sK27,X3,X0),sK27,X3)
| ~ '$ki_accessible'(X0,X4)
| in(X4,X1,X3) ) ).
cnf(u3491,negated_conjecture,
( ~ in(sK14(sK27,sK1(sK31),X0),sK27,sK1(sK31))
| '$ki_accessible'(X0,sK15(sK27,sK1(sK28),X0))
| ~ '$ki_accessible'(sK31,X0)
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK1(sK28),sK1(sK31)) ) ).
cnf(u1766,axiom,
( ~ '$ki_exists_in_world_$i'(sK0('$ki_local_world'),X2)
| ~ disjoint(sK10(X2,X3,X0),X3,X2)
| '$ki_accessible'(X0,sK11(X2,X4,X0))
| ~ '$ki_accessible'(X5,X0)
| ~ '$ki_exists_in_world_$i'(X5,X3)
| ~ '$ki_accessible'(X6,X5)
| ~ '$ki_exists_in_world_$i'(X6,X4)
| ~ '$ki_accessible'(sK0('$ki_local_world'),X6)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,X3,X4) ) ).
cnf(u3663,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK9(sK1(sK26),sK1(sK28),X1))
| '$ki_accessible'(X1,sK8(sK1(sK26),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,sK1(sK28),X2) ) ).
cnf(u2145,negated_conjecture,
( ~ '$ki_accessible'(sK26,X4)
| '$ki_accessible'(X0,sK17(sK1(sK26),X2,X0))
| ~ '$ki_accessible'(X3,X0)
| ~ '$ki_exists_in_world_$i'(X3,X1)
| ~ '$ki_accessible'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X4,X2)
| '$ki_accessible'(X0,sK16(sK1(sK26),X1,X0))
| ~ '$ki_accessible'(X0,X5)
| in(X5,X1,X2) ) ).
cnf(u4095,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK15(sK1(sK26),sK29,X1))
| ~ in(sK14(sK1(sK26),X2,X1),sK1(sK26),X2)
| ~ '$ki_accessible'(X1,X3)
| in(X3,sK29,X2) ) ).
cnf(u4496,axiom,
( ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK9(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X1))
| ~ disjoint(sK8(sK1(sK0('$ki_local_world')),X2,X1),sK1(sK0('$ki_local_world')),X2)
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,sK1(sK0(sK0('$ki_local_world'))),X2) ) ).
cnf(u3052,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK30,X0)
| ~ '$ki_accessible'(sK30,X1)
| '$ki_accessible'(X1,sK17(sK27,sK29,X1))
| '$ki_accessible'(X1,sK16(sK27,X0,X1))
| ~ '$ki_accessible'(X1,X2)
| in(X2,X0,sK29) ) ).
cnf(u2978,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK30,X0)
| ~ '$ki_accessible'(sK30,X1)
| '$ki_accessible'(X1,sK15(sK27,sK1(sK28),X1))
| '$ki_accessible'(X1,sK14(sK27,X0,X1))
| ~ '$ki_accessible'(X1,X2)
| in(X2,sK1(sK28),X0) ) ).
cnf(u4511,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK24(sK0('$ki_local_world'))),X0)
| ~ '$ki_accessible'(sK0(sK24(sK0('$ki_local_world'))),X1)
| '$ki_accessible'(X1,sK11(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X1))
| ~ disjoint(sK10(sK1(sK0('$ki_local_world')),X0,X1),X0,sK1(sK0('$ki_local_world')))
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,X0,sK1(sK24(sK0('$ki_local_world')))) ) ).
cnf(u4090,negated_conjecture,
( ~ disjoint(sK10(sK1(sK26),sK1(sK0(sK28)),X0),sK1(sK0(sK28)),sK1(sK26))
| '$ki_accessible'(X0,sK11(sK1(sK26),sK1(sK28),X0))
| ~ '$ki_accessible'(sK0(sK28),X0)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK0(sK28)),sK1(sK28)) ) ).
cnf(u3376,negated_conjecture,
( ~ qmltpeq(sK4(sK27,sK1(sK28),X1),sK27,sK1(sK28))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK3(sK1(sK28),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| qmltpeq(X3,sK27,X2) ) ).
cnf(u4101,negated_conjecture,
( ~ in(sK14(sK1(sK26),sK1(sK30),X0),sK1(sK26),sK1(sK30))
| '$ki_accessible'(X0,sK15(sK1(sK26),sK29,X0))
| ~ '$ki_accessible'(sK30,X0)
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK29,sK1(sK30)) ) ).
cnf(u3051,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK31,X0)
| ~ '$ki_accessible'(sK31,X1)
| '$ki_accessible'(X1,sK17(sK27,sK29,X1))
| '$ki_accessible'(X1,sK16(sK27,X0,X1))
| ~ '$ki_accessible'(X1,X2)
| in(X2,X0,sK29) ) ).
cnf(u4226,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK0(sK26)),X0)
| ~ '$ki_accessible'(sK0(sK0(sK26)),X1)
| '$ki_accessible'(X1,sK15(sK1(sK26),sK1(sK0(sK26)),X1))
| ~ in(sK14(sK1(sK26),X0,X1),sK1(sK26),X0)
| ~ '$ki_accessible'(X1,X2)
| in(X2,sK1(sK0(sK26)),X0) ) ).
cnf(u4115,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK31,X0)
| ~ '$ki_accessible'(sK31,X1)
| '$ki_accessible'(X1,sK17(sK1(sK26),sK29,X1))
| ~ in(sK16(sK1(sK26),X0,X1),X0,sK1(sK26))
| ~ '$ki_accessible'(X1,X2)
| in(X2,X0,sK29) ) ).
cnf(u3899,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK28),X0)
| '$ki_accessible'(X0,sK15(sK1(sK26),sK1(sK28),X0))
| '$ki_accessible'(X0,sK14(sK1(sK26),sK1(sK0(sK28)),X0))
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK1(sK28),sK1(sK0(sK28))) ) ).
cnf(u3665,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK30,X0)
| ~ '$ki_accessible'(sK30,X1)
| '$ki_accessible'(X1,sK9(sK1(sK26),sK29,X1))
| '$ki_accessible'(X1,sK8(sK1(sK26),X0,X1))
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,sK29,X0) ) ).
cnf(u1552,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| '$ki_accessible'(X0,sK21(sK27,sK29,X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(sK29,singleton(sK27)),singleton(sK27)) ) ).
cnf(u3391,axiom,
( ~ '$ki_accessible'(sK0('$ki_local_world'),X4)
| '$ki_accessible'(X0,sK17(sK1(sK0('$ki_local_world')),X2,X0))
| ~ '$ki_accessible'(X3,X0)
| ~ '$ki_exists_in_world_$i'(X3,X1)
| ~ '$ki_accessible'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X4,X2)
| '$ki_accessible'(X0,sK16(sK1(sK0('$ki_local_world')),X1,X0))
| ~ '$ki_accessible'(X0,X5)
| in(X5,X1,X2) ) ).
cnf(u2008,negated_conjecture,
( ~ '$ki_accessible'(sK26,X4)
| '$ki_accessible'(X0,sK9(sK1(sK26),X2,X0))
| ~ '$ki_accessible'(X3,X0)
| ~ '$ki_exists_in_world_$i'(X3,X1)
| ~ '$ki_accessible'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X4,X2)
| '$ki_accessible'(X0,sK8(sK1(sK26),X1,X0))
| ~ '$ki_accessible'(X0,X5)
| disjoint(X5,X2,X1) ) ).
cnf(u2326,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK31,X0)
| ~ '$ki_accessible'(sK31,X1)
| '$ki_accessible'(X1,sK6(sK1(sK26),sK29,X1))
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,set_intersection2(X0,sK1(sK26)),set_intersection2(X0,sK29)) ) ).
cnf(u4248,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X2)
| ~ qmltpeq(sK15(sK1(sK0('$ki_local_world')),X0,X1),sK1(sK0('$ki_local_world')),X0)
| '$ki_accessible'(X1,sK14(sK1(sK0('$ki_local_world')),X3,X1))
| ~ '$ki_accessible'(X1,X4)
| in(X4,X0,X3) ) ).
cnf(u4137,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK24(sK26)),X0)
| ~ '$ki_accessible'(sK0(sK24(sK26)),X1)
| '$ki_accessible'(X1,sK15(sK1(sK26),sK1(sK24(sK26)),X1))
| '$ki_accessible'(X1,sK14(sK1(sK26),X0,X1))
| ~ '$ki_accessible'(X1,X2)
| in(X2,sK1(sK24(sK26)),X0) ) ).
cnf(u2118,negated_conjecture,
( ~ '$ki_accessible'(sK26,X4)
| '$ki_accessible'(X0,sK15(sK1(sK26),X2,X0))
| ~ '$ki_accessible'(X3,X0)
| ~ '$ki_exists_in_world_$i'(X3,X1)
| ~ '$ki_accessible'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X4,X2)
| '$ki_accessible'(X0,sK14(sK1(sK26),X1,X0))
| ~ '$ki_accessible'(X0,X5)
| in(X5,X2,X1) ) ).
cnf(u2348,negated_conjecture,
( ~ '$ki_accessible'(sK30,X0)
| '$ki_accessible'(X0,sK6(sK1(sK26),sK29,X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(sK1(sK30),sK1(sK26)),set_intersection2(sK1(sK30),sK29)) ) ).
cnf(u3790,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK28,X2)
| ~ qmltpeq(sK9(sK1(sK26),X0,X1),sK1(sK26),X0)
| '$ki_accessible'(X1,sK8(sK1(sK26),X3,X1))
| ~ '$ki_accessible'(X1,X4)
| disjoint(X4,X0,X3) ) ).
cnf(u2140,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK24(sK26)),X0)
| ~ '$ki_accessible'(sK0(sK24(sK26)),X1)
| '$ki_accessible'(X1,sK6(sK27,sK1(sK24(sK26)),X1))
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,set_intersection2(X0,sK27),set_intersection2(X0,sK1(sK24(sK26)))) ) ).
cnf(u3456,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK28),X0)
| ~ '$ki_accessible'(sK0(sK28),X1)
| '$ki_accessible'(X1,sK11(sK27,sK1(sK28),X1))
| ~ disjoint(sK10(sK27,X0,X1),X0,sK27)
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,X0,sK1(sK28)) ) ).
cnf(u3675,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK0(sK26),X2)
| '$ki_accessible'(X0,sK17(sK1(sK26),X1,X0))
| '$ki_accessible'(X0,sK16(sK1(sK26),X3,X0))
| ~ '$ki_accessible'(X0,X4)
| in(X4,X3,X1) ) ).
cnf(u1202,negated_conjecture,
'$ki_accessible'(sK0(sK31),sK18(sK27,sK1(sK28),sK0(sK31))) ).
cnf(u4208,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK11(sK1(sK26),sK1(sK0(sK26)),X1))
| ~ disjoint(sK10(sK1(sK26),X2,X1),X2,sK1(sK26))
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,X2,sK1(sK0(sK26))) ) ).
cnf(u1760,negated_conjecture,
( ~ qmltpeq(sK13(sK27,sK1(sK28),X0),sK27,sK1(sK28))
| ~ '$ki_accessible'(sK28,X0)
| '$ki_accessible'(X0,sK12(sK27,X0))
| ~ '$ki_accessible'(X0,X1)
| empty(X1,sK1(sK28)) ) ).
cnf(u3471,negated_conjecture,
( ~ qmltpeq(sK15(sK27,sK29,X1),sK27,sK29)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK14(sK27,X2,X1))
| ~ '$ki_accessible'(X1,X3)
| in(X3,sK29,X2) ) ).
cnf(u560,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK26,X2)
| ~ qmltpeq(sK6(X2,X3,X0),X2,X3)
| ~ '$ki_accessible'(X4,X0)
| ~ '$ki_exists_in_world_$i'(X4,X5)
| ~ '$ki_accessible'(X6,X4)
| ~ '$ki_exists_in_world_$i'(X6,X3)
| ~ '$ki_accessible'(sK26,X6)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(X5,X2),set_intersection2(X5,X3)) ) ).
cnf(u3382,axiom,
( ~ '$ki_accessible'(sK0('$ki_local_world'),X4)
| '$ki_accessible'(X0,sK15(sK1(sK0('$ki_local_world')),X2,X0))
| ~ '$ki_accessible'(X3,X0)
| ~ '$ki_exists_in_world_$i'(X3,X1)
| ~ '$ki_accessible'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X4,X2)
| '$ki_accessible'(X0,sK14(sK1(sK0('$ki_local_world')),X1,X0))
| ~ '$ki_accessible'(X0,X5)
| in(X5,X2,X1) ) ).
cnf(u2977,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK31,X0)
| ~ '$ki_accessible'(sK31,X1)
| '$ki_accessible'(X1,sK15(sK27,sK1(sK28),X1))
| '$ki_accessible'(X1,sK14(sK27,X0,X1))
| ~ '$ki_accessible'(X1,X2)
| in(X2,sK1(sK28),X0) ) ).
cnf(u1016,negated_conjecture,
( ~ '$ki_accessible'(sK26,X4)
| ~ qmltpeq(sK11(sK1(sK26),X2,X1),sK1(sK26),X2)
| ~ '$ki_accessible'(X3,X1)
| ~ '$ki_exists_in_world_$i'(X3,X0)
| ~ '$ki_accessible'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X4,X2)
| ~ disjoint(sK10(sK1(sK26),X0,X1),X0,sK1(sK26))
| ~ '$ki_accessible'(X1,X5)
| disjoint(X5,X0,X2) ) ).
cnf(u1551,negated_conjecture,
( ~ qmltpeq(sK9(sK1(sK26),sK1(sK24(sK26)),X1),sK1(sK26),sK1(sK24(sK26)))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| ~ disjoint(sK8(sK1(sK26),X2,X1),sK1(sK26),X2)
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,sK1(sK24(sK26)),X2) ) ).
cnf(u1233,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X1)
| ~ '$ki_accessible'(sK28,X0)
| '$ki_accessible'(X0,sK19(sK1(sK26),X1,X0))
| ~ '$ki_accessible'(X0,X2)
| '$ki_accessible'(X2,sK18(sK1(sK26),X1,X2)) ) ).
cnf(u2556,negated_conjecture,
( ~ '$ki_accessible'(sK26,X4)
| ~ qmltpeq(sK17(sK27,X2,X0),sK27,X2)
| ~ '$ki_accessible'(X3,X0)
| ~ '$ki_exists_in_world_$i'(X3,X1)
| ~ '$ki_accessible'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X4,X2)
| '$ki_accessible'(X0,sK16(sK27,X1,X0))
| ~ '$ki_accessible'(X0,X5)
| in(X5,X1,X2) ) ).
cnf(u1319,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK24(sK26),X2)
| ~ qmltpeq(sK11(sK27,X0,X1),sK27,X0)
| ~ disjoint(sK10(sK27,X3,X1),X3,sK27)
| ~ '$ki_accessible'(X1,X4)
| disjoint(X4,X3,X0) ) ).
cnf(u382,negated_conjecture,
( ~ qmltpeq(sK2(sK1(sK26),sK1(sK24(sK26)),X0),sK1(sK26),sK1(sK24(sK26)))
| ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,sK1(sK24(sK26)),sK1(sK26)) ) ).
cnf(u3196,axiom,
( ~ '$ki_accessible'(sK0('$ki_local_world'),X4)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(X4,X2)
| ~ '$ki_exists_in_world_$i'(X4,X1)
| '$ki_accessible'(X0,sK6(sK1(sK0('$ki_local_world')),X1,X0))
| ~ '$ki_accessible'(X0,X5)
| qmltpeq(X5,set_intersection2(X3,sK1(sK0('$ki_local_world'))),set_intersection2(X3,X1)) ) ).
cnf(u599,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X1)
| ~ '$ki_accessible'(sK0(sK26),X0)
| ~ qmltpeq(sK7(sK1(sK26),X1,X0),sK1(sK26),X1)
| ~ '$ki_accessible'(X0,X2)
| qmltpeq(X2,singleton(sK1(sK26)),singleton(X1)) ) ).
cnf(u940,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| '$ki_accessible'(X0,sK7(sK27,sK1(sK28),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,singleton(sK27),singleton(sK1(sK28))) ) ).
cnf(u3389,negated_conjecture,
( ~ qmltpeq(sK3(sK29,sK1(sK30),X0),sK29,sK1(sK30))
| '$ki_accessible'(X0,sK4(sK27,sK29,X0))
| ~ '$ki_accessible'(sK30,X0)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,sK27,sK1(sK30)) ) ).
cnf(u276,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK27,sK1(sK24(sK26))),set_intersection2(sK1(sK24(sK26)),sK27))
| ~ '$ki_accessible'(sK24(sK26),X0) ) ).
cnf(u1034,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X1)
| ~ '$ki_accessible'(sK24(sK26),X0)
| '$ki_accessible'(X0,sK7(sK1(sK26),X1,X0))
| ~ '$ki_accessible'(X0,X2)
| qmltpeq(X2,singleton(sK1(sK26)),singleton(X1)) ) ).
cnf(u732,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X1)
| ~ '$ki_accessible'(sK28,X0)
| '$ki_accessible'(X0,sK20(sK27,X1,X0))
| ~ '$ki_accessible'(X0,X2)
| disjoint(X2,singleton(sK27),X1) ) ).
cnf(u2464,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK30,X0)
| ~ '$ki_accessible'(sK30,X1)
| '$ki_accessible'(X1,sK4(sK27,sK29,X1))
| '$ki_accessible'(X1,sK3(sK29,X0,X1))
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,sK27,X0) ) ).
cnf(u2555,negated_conjecture,
( ~ '$ki_accessible'(sK30,X0)
| '$ki_accessible'(X0,sK4(sK27,sK1(sK28),X0))
| '$ki_accessible'(X0,sK3(sK1(sK28),sK1(sK30),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,sK27,sK1(sK30)) ) ).
cnf(u290,negated_conjecture,
( ~ '$ki_accessible'(sK26,X2)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X0)
| ~ qmltpeq(sK2(sK1(sK26),X0,X1),sK1(sK26),X0)
| ~ '$ki_accessible'(X1,X3)
| qmltpeq(X3,X0,sK1(sK26)) ) ).
cnf(u1770,axiom,
( ~ qmltpeq(sK2(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X0),sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))))
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,sK1(sK0(sK0('$ki_local_world'))),sK1(sK0('$ki_local_world'))) ) ).
cnf(u635,negated_conjecture,
( ~ in(sK19(sK1(sK26),sK1(sK28),X0),sK1(sK26),sK1(sK28))
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK18(sK1(sK26),sK1(sK28),X1)) ) ).
cnf(u939,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| '$ki_accessible'(X0,sK7(sK27,sK29,X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,singleton(sK27),singleton(sK29)) ) ).
cnf(u312,negated_conjecture,
( ~ disjoint(sK25(sK27,sK1(sK24(sK26)),X0),sK27,sK1(sK24(sK26)))
| ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK24(sK26)),sK27) ) ).
cnf(u275,negated_conjecture,
( qmltpeq(X0,set_intersection2(sK27,sK1(sK28)),set_intersection2(sK1(sK28),sK27))
| ~ '$ki_accessible'(sK28,X0) ) ).
cnf(u1553,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| '$ki_accessible'(X0,sK21(sK27,sK1(sK28),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(sK1(sK28),singleton(sK27)),singleton(sK27)) ) ).
cnf(u3462,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK11(sK27,sK1(sK0(sK26)),X1))
| ~ disjoint(sK10(sK27,X2,X1),X2,sK27)
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,X2,sK1(sK0(sK26))) ) ).
cnf(u1857,axiom,
( ~ qmltpeq(sK9(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X1),sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X0,X1)
| ~ disjoint(sK8(sK1(sK0('$ki_local_world')),X2,X1),sK1(sK0('$ki_local_world')),X2)
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,sK1(sK0(sK0('$ki_local_world'))),X2) ) ).
cnf(u1759,negated_conjecture,
( ~ qmltpeq(sK13(sK27,sK29,X0),sK27,sK29)
| ~ '$ki_accessible'(sK28,X0)
| '$ki_accessible'(X0,sK12(sK27,X0))
| ~ '$ki_accessible'(X0,X1)
| empty(X1,sK29) ) ).
cnf(u297,negated_conjecture,
( ~ qmltpeq(sK2(sK27,sK1(sK0(sK26)),X0),sK27,sK1(sK0(sK26)))
| ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,sK1(sK0(sK26)),sK27) ) ).
cnf(u241,axiom,
( ~ '$ki_exists_in_world_$i'(sK0('$ki_local_world'),X3)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK0('$ki_local_world'),X0)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(X3,X2),set_intersection2(X2,X3)) ) ).
cnf(u3484,negated_conjecture,
( ~ in(sK14(sK27,sK1(sK31),X0),sK27,sK1(sK31))
| '$ki_accessible'(X0,sK15(sK27,sK29,X0))
| ~ '$ki_accessible'(sK31,X0)
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK29,sK1(sK31)) ) ).
cnf(u2861,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK28),X0)
| '$ki_accessible'(X0,sK11(sK27,sK1(sK28),X0))
| '$ki_accessible'(X0,sK10(sK27,sK1(sK0(sK28)),X0))
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK0(sK28)),sK1(sK28)) ) ).
cnf(u1527,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK24(sK26),X2)
| ~ qmltpeq(sK4(sK1(sK26),X0,X1),sK1(sK26),X0)
| ~ qmltpeq(sK3(X0,X3,X1),X0,X3)
| ~ '$ki_accessible'(X1,X4)
| qmltpeq(X4,sK1(sK26),X3) ) ).
cnf(u772,negated_conjecture,
( ~ in(sK19(sK27,sK1(sK0(sK26)),X0),sK27,sK1(sK0(sK26)))
| ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| ~ in(sK18(sK27,sK1(sK0(sK26)),X1),sK1(sK0(sK26)),sK27) ) ).
cnf(u1310,negated_conjecture,
( ~ qmltpeq(sK9(sK27,sK1(sK28),X1),sK27,sK1(sK28))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| ~ disjoint(sK8(sK27,X2,X1),sK27,X2)
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,sK1(sK28),X2) ) ).
cnf(u692,negated_conjecture,
( ~ in(sK19(sK1(sK26),sK1(sK24(sK26)),X0),sK1(sK26),sK1(sK24(sK26)))
| ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK18(sK1(sK26),sK1(sK24(sK26)),X1)) ) ).
cnf(u3703,negated_conjecture,
( ~ '$ki_accessible'(sK30,X0)
| '$ki_accessible'(X0,sK9(sK1(sK26),sK1(sK28),X0))
| '$ki_accessible'(X0,sK8(sK1(sK26),sK1(sK30),X0))
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK28),sK1(sK30)) ) ).
cnf(u3469,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK24(sK26),X2)
| ~ qmltpeq(sK15(sK27,X0,X1),sK27,X0)
| '$ki_accessible'(X1,sK14(sK27,X3,X1))
| ~ '$ki_accessible'(X1,X4)
| in(X4,X0,X3) ) ).
cnf(u1450,axiom,
( ~ '$ki_exists_in_world_$i'(sK0('$ki_local_world'),X4)
| '$ki_accessible'(X0,sK3(X2,X3,X0))
| ~ qmltpeq(sK4(X4,X2,X0),X4,X2)
| ~ '$ki_accessible'(X5,X0)
| ~ '$ki_exists_in_world_$i'(X5,X3)
| ~ '$ki_accessible'(X6,X5)
| ~ '$ki_exists_in_world_$i'(X6,X2)
| ~ '$ki_accessible'(sK0('$ki_local_world'),X6)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,X4,X3) ) ).
cnf(u1810,axiom,
( ~ '$ki_exists_in_world_$i'(sK24(sK0('$ki_local_world')),X3)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X0,X1)
| ~ qmltpeq(sK5(sK1(sK0('$ki_local_world')),X3,X1),sK1(sK0('$ki_local_world')),X3)
| ~ '$ki_accessible'(X1,X4)
| qmltpeq(X4,set_intersection2(sK1(sK0('$ki_local_world')),X2),set_intersection2(X3,X2)) ) ).
cnf(u484,negated_conjecture,
( ~ '$ki_accessible'(sK24(sK26),X0)
| '$ki_accessible'(X0,sK2(sK1(sK26),sK1(sK24(sK26)),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,sK1(sK24(sK26)),sK1(sK26)) ) ).
cnf(u3483,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK28),X0)
| ~ '$ki_accessible'(sK0(sK28),X1)
| '$ki_accessible'(X1,sK15(sK27,sK29,X1))
| ~ in(sK14(sK27,X0,X1),sK27,X0)
| ~ '$ki_accessible'(X1,X2)
| in(X2,sK29,X0) ) ).
cnf(u1868,negated_conjecture,
( ~ '$ki_accessible'(sK26,X4)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(X4,X2)
| ~ '$ki_exists_in_world_$i'(X4,X1)
| '$ki_accessible'(X0,sK5(sK27,X1,X0))
| ~ '$ki_accessible'(X0,X5)
| qmltpeq(X5,set_intersection2(sK27,X3),set_intersection2(X1,X3)) ) ).
cnf(u1242,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| '$ki_accessible'(X0,sK19(sK1(sK26),sK1(sK28),X0))
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK18(sK1(sK26),sK1(sK28),X1)) ) ).
cnf(u1332,negated_conjecture,
'$ki_accessible'(sK0(sK0(sK24(sK26))),sK18(sK1(sK26),sK1(sK24(sK26)),sK0(sK0(sK24(sK26))))) ).
cnf(u1788,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X0)
| ~ '$ki_accessible'(sK28,X1)
| ~ '$ki_accessible'(sK20(sK27,X0,X1),X2)
| in(X2,sK27,X0)
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,singleton(sK27),X0) ) ).
cnf(u165,axiom,
( ~ '$ki_accessible'('$ki_local_world',X0)
| ~ '$ki_accessible'(X6,X7)
| '$ki_accessible'(X6,sK10(X1,X5,X6))
| ~ qmltpeq(sK11(X1,X3,X6),X1,X3)
| ~ '$ki_accessible'(X4,X6)
| ~ '$ki_exists_in_world_$i'(X4,X5)
| ~ '$ki_accessible'(X2,X4)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| disjoint(X7,X5,X3) ) ).
cnf(u1344,negated_conjecture,
( ~ '$ki_accessible'(sK26,X2)
| '$ki_accessible'(X0,sK13(sK27,X1,X0))
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X1)
| '$ki_accessible'(X0,sK12(sK27,X0))
| ~ '$ki_accessible'(X0,X3)
| empty(X3,X1) ) ).
cnf(u525,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X1)
| ~ '$ki_accessible'(sK0(sK26),X0)
| '$ki_accessible'(X0,sK25(sK27,X1,X0))
| ~ '$ki_accessible'(X0,X2)
| disjoint(X2,X1,sK27) ) ).
cnf(u771,negated_conjecture,
( ~ in(sK19(sK27,sK1(sK24(sK26)),X0),sK27,sK1(sK24(sK26)))
| ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| ~ in(sK18(sK27,sK1(sK24(sK26)),X1),sK1(sK24(sK26)),sK27) ) ).
cnf(u498,negated_conjecture,
( ~ in(sK19(sK27,sK1(sK0(sK26)),X0),sK27,sK1(sK0(sK26)))
| ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK18(sK27,sK1(sK0(sK26)),X1)) ) ).
cnf(u1317,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK26),X0)
| '$ki_accessible'(X0,sK19(sK1(sK26),sK1(sK0(sK26)),X0))
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK18(sK1(sK26),sK1(sK0(sK26)),X1)) ) ).
cnf(u179,axiom,
( ~ '$ki_accessible'('$ki_local_world',X0)
| ~ '$ki_accessible'(X6,X7)
| ~ in(sK16(X1,X5,X6),X5,X1)
| ~ qmltpeq(sK17(X1,X3,X6),X1,X3)
| ~ '$ki_accessible'(X4,X6)
| ~ '$ki_exists_in_world_$i'(X4,X5)
| ~ '$ki_accessible'(X2,X4)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| in(X7,X5,X3) ) ).
cnf(u1817,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X0)
| ~ '$ki_accessible'(sK24(sK26),X1)
| ~ qmltpeq(sK13(sK1(sK26),X0,X1),sK1(sK26),X0)
| '$ki_accessible'(X1,sK12(sK1(sK26),X1))
| ~ '$ki_accessible'(X1,X2)
| empty(X2,X0) ) ).
cnf(u483,negated_conjecture,
( ~ qmltpeq(sK7(sK27,sK1(sK0(sK26)),X0),sK27,sK1(sK0(sK26)))
| ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,singleton(sK27),singleton(sK1(sK0(sK26)))) ) ).
cnf(u1761,axiom,
( qmltpeq(X0,set_intersection2(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world')))),set_intersection2(sK1(sK24(sK0('$ki_local_world'))),sK1(sK0('$ki_local_world'))))
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X0) ) ).
cnf(u561,axiom,
( ~ '$ki_exists_in_world_$i'(sK0('$ki_local_world'),X2)
| ~ qmltpeq(sK6(X2,X3,X0),X2,X3)
| ~ '$ki_accessible'(X4,X0)
| ~ '$ki_exists_in_world_$i'(X4,X5)
| ~ '$ki_accessible'(X6,X4)
| ~ '$ki_exists_in_world_$i'(X6,X3)
| ~ '$ki_accessible'(sK0('$ki_local_world'),X6)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(X5,X2),set_intersection2(X5,X3)) ) ).
cnf(u1275,negated_conjecture,
'$ki_accessible'(sK0(sK0(sK28)),sK18(sK1(sK26),sK29,sK0(sK0(sK28)))) ).
cnf(u422,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X1)
| ~ '$ki_accessible'(sK24(sK26),X0)
| ~ qmltpeq(sK7(sK27,X1,X0),sK27,X1)
| ~ '$ki_accessible'(X0,X2)
| qmltpeq(X2,singleton(sK27),singleton(X1)) ) ).
cnf(u3000,negated_conjecture,
( ~ '$ki_accessible'(sK30,X0)
| '$ki_accessible'(X0,sK15(sK27,sK1(sK28),X0))
| '$ki_accessible'(X0,sK14(sK27,sK1(sK30),X0))
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK1(sK28),sK1(sK30)) ) ).
cnf(u865,negated_conjecture,
( ~ '$ki_accessible'(sK26,X4)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(X4,X2)
| ~ '$ki_exists_in_world_$i'(X4,X0)
| ~ qmltpeq(sK5(sK27,X0,X1),sK27,X0)
| ~ '$ki_accessible'(X1,X5)
| qmltpeq(X5,set_intersection2(sK27,X3),set_intersection2(X0,X3)) ) ).
cnf(u524,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X1)
| ~ '$ki_accessible'(sK24(sK26),X0)
| '$ki_accessible'(X0,sK25(sK27,X1,X0))
| ~ '$ki_accessible'(X0,X2)
| disjoint(X2,X1,sK27) ) ).
cnf(u214,negated_conjecture,
( ~ '$ki_accessible'(sK26,X0)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ '$ki_accessible'(X0,X2)
| qmltpeq(X2,set_intersection2(sK27,sK27),sK27) ) ).
cnf(u1828,axiom,
( ~ qmltpeq(sK5(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X2),sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))))
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ '$ki_accessible'(X2,X3)
| qmltpeq(X3,set_intersection2(sK1(sK0('$ki_local_world')),X1),set_intersection2(sK1(sK0(sK0('$ki_local_world'))),X1)) ) ).
cnf(u1878,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK30,X0)
| ~ '$ki_accessible'(sK30,X1)
| '$ki_accessible'(X1,sK5(sK27,sK29,X1))
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,set_intersection2(sK27,X0),set_intersection2(sK29,X0)) ) ).
cnf(u1620,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK24(sK26),X2)
| ~ qmltpeq(sK15(sK1(sK26),X0,X1),sK1(sK26),X0)
| ~ in(sK14(sK1(sK26),X3,X1),sK1(sK26),X3)
| ~ '$ki_accessible'(X1,X4)
| in(X4,X0,X3) ) ).
cnf(u733,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X1)
| ~ '$ki_accessible'(sK24(sK26),X0)
| '$ki_accessible'(X0,sK20(sK27,X1,X0))
| ~ '$ki_accessible'(X0,X2)
| disjoint(X2,singleton(sK27),X1) ) ).
cnf(u610,negated_conjecture,
( ~ qmltpeq(sK7(sK1(sK26),sK1(sK28),X0),sK1(sK26),sK1(sK28))
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,singleton(sK1(sK26)),singleton(sK1(sK28))) ) ).
cnf(u3474,negated_conjecture,
( ~ qmltpeq(sK15(sK27,sK1(sK0(sK26)),X1),sK27,sK1(sK0(sK26)))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK14(sK27,X2,X1))
| ~ '$ki_accessible'(X1,X3)
| in(X3,sK1(sK0(sK26)),X2) ) ).
cnf(u1827,axiom,
( ~ '$ki_exists_in_world_$i'(sK0('$ki_local_world'),X2)
| ~ in(sK14(X2,X3,X0),X2,X3)
| '$ki_accessible'(X0,sK15(X2,X4,X0))
| ~ '$ki_accessible'(X5,X0)
| ~ '$ki_exists_in_world_$i'(X5,X3)
| ~ '$ki_accessible'(X6,X5)
| ~ '$ki_exists_in_world_$i'(X6,X4)
| ~ '$ki_accessible'(sK0('$ki_local_world'),X6)
| ~ '$ki_accessible'(X0,X1)
| in(X1,X4,X3) ) ).
cnf(u1525,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK26),X0)
| '$ki_accessible'(X0,sK13(sK1(sK26),sK1(sK0(sK26)),X0))
| '$ki_accessible'(X0,sK12(sK1(sK26),X0))
| ~ '$ki_accessible'(X0,X1)
| empty(X1,sK1(sK0(sK26))) ) ).
cnf(u1771,negated_conjecture,
( ~ qmltpeq(sK13(sK27,sK1(sK24(sK26)),X0),sK27,sK1(sK24(sK26)))
| ~ '$ki_accessible'(sK24(sK26),X0)
| '$ki_accessible'(X0,sK12(sK27,X0))
| ~ '$ki_accessible'(X0,X1)
| empty(X1,sK1(sK24(sK26))) ) ).
cnf(u3496,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK24(sK26),X2)
| ~ qmltpeq(sK17(sK27,X0,X1),sK27,X0)
| '$ki_accessible'(X1,sK16(sK27,X3,X1))
| ~ '$ki_accessible'(X1,X4)
| in(X4,X3,X0) ) ).
cnf(u174,axiom,
( ~ '$ki_accessible'('$ki_local_world',X0)
| ~ '$ki_accessible'(X6,X7)
| ~ in(sK14(X1,X5,X6),X1,X5)
| '$ki_accessible'(X6,sK15(X1,X3,X6))
| ~ '$ki_accessible'(X4,X6)
| ~ '$ki_exists_in_world_$i'(X4,X5)
| ~ '$ki_accessible'(X2,X4)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| in(X7,X3,X5) ) ).
cnf(u3177,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK28),X0)
| '$ki_accessible'(X0,sK17(sK27,sK1(sK28),X0))
| '$ki_accessible'(X0,sK16(sK27,sK1(sK0(sK28)),X0))
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK1(sK0(sK28)),sK1(sK28)) ) ).
cnf(u903,negated_conjecture,
( ~ in(sK19(sK1(sK26),sK29,X0),sK1(sK26),sK29)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| ~ in(sK18(sK1(sK26),sK29,X1),sK29,sK1(sK26)) ) ).
cnf(u1350,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X1)
| ~ '$ki_accessible'(sK0(sK26),X0)
| '$ki_accessible'(X0,sK13(sK27,X1,X0))
| '$ki_accessible'(X0,sK12(sK27,X0))
| ~ '$ki_accessible'(X0,X2)
| empty(X2,X1) ) ).
cnf(u3481,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK31,X0)
| ~ '$ki_accessible'(sK31,X1)
| '$ki_accessible'(X1,sK15(sK27,sK29,X1))
| ~ in(sK14(sK27,X0,X1),sK27,X0)
| ~ '$ki_accessible'(X1,X2)
| in(X2,sK29,X0) ) ).
cnf(u1838,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X0)
| ~ '$ki_accessible'(sK24(sK26),X1)
| ~ '$ki_accessible'(sK20(sK1(sK26),X0,X1),X2)
| in(X2,sK1(sK26),X0)
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,singleton(sK1(sK26)),X0) ) ).
cnf(u2036,negated_conjecture,
( ~ '$ki_accessible'(sK30,X0)
| '$ki_accessible'(X0,sK6(sK27,sK29,X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(sK1(sK30),sK27),set_intersection2(sK1(sK30),sK29)) ) ).
cnf(u3511,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK30,X0)
| ~ '$ki_accessible'(sK30,X1)
| '$ki_accessible'(X1,sK17(sK27,sK29,X1))
| ~ in(sK16(sK27,X0,X1),X0,sK27)
| ~ '$ki_accessible'(X1,X2)
| in(X2,X0,sK29) ) ).
cnf(u205,negated_conjecture,
'$ki_accessible'(sK26,sK24(sK26)) ).
cnf(u693,negated_conjecture,
( ~ '$ki_accessible'(sK24(sK26),X0)
| '$ki_accessible'(X0,sK25(sK1(sK26),sK1(sK24(sK26)),X0))
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK24(sK26)),sK1(sK26)) ) ).
cnf(u898,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X1)
| ~ '$ki_accessible'(sK24(sK26),X0)
| ~ in(sK19(sK1(sK26),X1,X0),sK1(sK26),X1)
| ~ '$ki_accessible'(X0,X2)
| ~ in(sK18(sK1(sK26),X1,X2),X1,sK1(sK26)) ) ).
cnf(u4213,axiom,
( ~ '$ki_exists_in_world_$i'(sK24(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X2)
| ~ qmltpeq(sK4(sK1(sK0('$ki_local_world')),X0,X1),sK1(sK0('$ki_local_world')),X0)
| '$ki_accessible'(X1,sK3(X0,X3,X1))
| ~ '$ki_accessible'(X1,X4)
| qmltpeq(X4,sK1(sK0('$ki_local_world')),X3) ) ).
cnf(u1357,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| '$ki_accessible'(X0,sK13(sK27,sK1(sK28),X0))
| '$ki_accessible'(X0,sK12(sK27,X0))
| ~ '$ki_accessible'(X0,X1)
| empty(X1,sK1(sK28)) ) ).
cnf(u1845,axiom,
( ~ '$ki_exists_in_world_$i'(sK24(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X2)
| ~ qmltpeq(sK11(sK1(sK0('$ki_local_world')),X0,X1),sK1(sK0('$ki_local_world')),X0)
| ~ disjoint(sK10(sK1(sK0('$ki_local_world')),X3,X1),X3,sK1(sK0('$ki_local_world')))
| ~ '$ki_accessible'(X1,X4)
| disjoint(X4,X3,X0) ) ).
cnf(u1789,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X0)
| ~ '$ki_accessible'(sK24(sK26),X1)
| ~ '$ki_accessible'(sK20(sK27,X0,X1),X2)
| in(X2,sK27,X0)
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,singleton(sK27),X0) ) ).
cnf(u4099,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK28),X0)
| ~ '$ki_accessible'(sK0(sK28),X1)
| '$ki_accessible'(X1,sK15(sK1(sK26),sK29,X1))
| ~ in(sK14(sK1(sK26),X0,X1),sK1(sK26),X0)
| ~ '$ki_accessible'(X1,X2)
| in(X2,sK29,X0) ) ).
cnf(u2453,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK0(sK26)),X0)
| ~ '$ki_accessible'(sK0(sK0(sK26)),X1)
| '$ki_accessible'(X1,sK6(sK1(sK26),sK1(sK0(sK26)),X1))
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,set_intersection2(X0,sK1(sK26)),set_intersection2(X0,sK1(sK0(sK26)))) ) ).
cnf(u4232,negated_conjecture,
( ~ disjoint(sK10(sK1(sK26),sK1(sK0(sK0(sK26))),X0),sK1(sK0(sK0(sK26))),sK1(sK26))
| '$ki_accessible'(X0,sK11(sK1(sK26),sK1(sK0(sK26)),X0))
| ~ '$ki_accessible'(sK0(sK0(sK26)),X0)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK0(sK0(sK26))),sK1(sK0(sK26))) ) ).
cnf(u4121,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X1)
| ~ qmltpeq(sK13(sK1(sK0('$ki_local_world')),X0,X1),sK1(sK0('$ki_local_world')),X0)
| '$ki_accessible'(X1,sK12(sK1(sK0('$ki_local_world')),X1))
| ~ '$ki_accessible'(X1,X2)
| empty(X2,X0) ) ).
cnf(u1102,axiom,
( ~ '$ki_exists_in_world_$i'(sK0('$ki_local_world'),X4)
| '$ki_accessible'(X0,sK3(X2,X3,X0))
| '$ki_accessible'(X0,sK4(X4,X2,X0))
| ~ '$ki_accessible'(X5,X0)
| ~ '$ki_exists_in_world_$i'(X5,X3)
| ~ '$ki_accessible'(X6,X5)
| ~ '$ki_exists_in_world_$i'(X6,X2)
| ~ '$ki_accessible'(sK0('$ki_local_world'),X6)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,X4,X3) ) ).
cnf(u2057,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK28),X0)
| '$ki_accessible'(X0,sK6(sK27,sK29,X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(sK1(sK0(sK28)),sK27),set_intersection2(sK1(sK0(sK28)),sK29)) ) ).
cnf(u4007,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK17(sK27,sK1(sK0(sK26)),X1))
| ~ in(sK16(sK27,X2,X1),X2,sK27)
| ~ '$ki_accessible'(X1,X3)
| in(X3,X2,sK1(sK0(sK26))) ) ).
cnf(u4151,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK24(sK26)),X0)
| '$ki_accessible'(X0,sK15(sK1(sK26),sK1(sK24(sK26)),X0))
| '$ki_accessible'(X0,sK14(sK1(sK26),sK1(sK0(sK24(sK26))),X0))
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK1(sK24(sK26)),sK1(sK0(sK24(sK26)))) ) ).
cnf(u3199,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK24(sK26)),X0)
| ~ '$ki_accessible'(sK0(sK24(sK26)),X1)
| '$ki_accessible'(X1,sK17(sK27,sK1(sK24(sK26)),X1))
| '$ki_accessible'(X1,sK16(sK27,X0,X1))
| ~ '$ki_accessible'(X1,X2)
| in(X2,X0,sK1(sK24(sK26))) ) ).
cnf(u2391,negated_conjecture,
( ~ '$ki_accessible'(sK31,X0)
| '$ki_accessible'(X0,sK6(sK1(sK26),sK1(sK28),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(sK1(sK31),sK1(sK26)),set_intersection2(sK1(sK31),sK1(sK28))) ) ).
cnf(u3502,negated_conjecture,
( ~ qmltpeq(sK17(sK27,sK1(sK0(sK26)),X1),sK27,sK1(sK0(sK26)))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK16(sK27,X2,X1))
| ~ '$ki_accessible'(X1,X3)
| in(X3,X2,sK1(sK0(sK26))) ) ).
cnf(u1621,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK0(sK26),X2)
| ~ qmltpeq(sK15(sK1(sK26),X0,X1),sK1(sK26),X0)
| ~ in(sK14(sK1(sK26),X3,X1),sK1(sK26),X3)
| ~ '$ki_accessible'(X1,X4)
| in(X4,X0,X3) ) ).
cnf(u4658,axiom,
( ~ qmltpeq(sK3(sK1(sK0(sK0('$ki_local_world'))),sK1(sK0(sK0(sK0('$ki_local_world')))),X0),sK1(sK0(sK0('$ki_local_world'))),sK1(sK0(sK0(sK0('$ki_local_world')))))
| '$ki_accessible'(X0,sK4(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X0))
| ~ '$ki_accessible'(sK0(sK0(sK0('$ki_local_world'))),X0)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,sK1(sK0('$ki_local_world')),sK1(sK0(sK0(sK0('$ki_local_world'))))) ) ).
cnf(u3396,negated_conjecture,
( ~ qmltpeq(sK3(sK1(sK28),sK1(sK30),X0),sK1(sK28),sK1(sK30))
| '$ki_accessible'(X0,sK4(sK27,sK1(sK28),X0))
| ~ '$ki_accessible'(sK30,X0)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,sK27,sK1(sK30)) ) ).
cnf(u3509,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK17(sK27,sK1(sK28),X1))
| ~ in(sK16(sK27,X2,X1),X2,sK27)
| ~ '$ki_accessible'(X1,X3)
| in(X3,X2,sK1(sK28)) ) ).
cnf(u2792,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK28),X0)
| '$ki_accessible'(X0,sK11(sK27,sK29,X0))
| '$ki_accessible'(X0,sK10(sK27,sK1(sK0(sK28)),X0))
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK0(sK28)),sK29) ) ).
cnf(u4009,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK24(sK26),X2)
| '$ki_accessible'(X0,sK15(sK1(sK26),X1,X0))
| ~ in(sK14(sK1(sK26),X3,X0),sK1(sK26),X3)
| ~ '$ki_accessible'(X0,X4)
| in(X4,X1,X3) ) ).
cnf(u2576,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK31,X0)
| ~ '$ki_accessible'(sK31,X1)
| '$ki_accessible'(X1,sK9(sK27,sK29,X1))
| '$ki_accessible'(X1,sK8(sK27,X0,X1))
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,sK29,X0) ) ).
cnf(u3395,negated_conjecture,
( ~ qmltpeq(sK3(sK1(sK28),sK1(sK31),X0),sK1(sK28),sK1(sK31))
| '$ki_accessible'(X0,sK4(sK27,sK1(sK28),X0))
| ~ '$ki_accessible'(sK31,X0)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,sK27,sK1(sK31)) ) ).
cnf(u2887,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK28,X2)
| '$ki_accessible'(X0,sK15(sK27,X1,X0))
| '$ki_accessible'(X0,sK14(sK27,X3,X0))
| ~ '$ki_accessible'(X0,X4)
| in(X4,X1,X3) ) ).
cnf(u3279,axiom,
( ~ '$ki_accessible'(sK0('$ki_local_world'),X4)
| '$ki_accessible'(X0,sK9(sK1(sK0('$ki_local_world')),X2,X0))
| ~ '$ki_accessible'(X3,X0)
| ~ '$ki_exists_in_world_$i'(X3,X1)
| ~ '$ki_accessible'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X4,X2)
| '$ki_accessible'(X0,sK8(sK1(sK0('$ki_local_world')),X1,X0))
| ~ '$ki_accessible'(X0,X5)
| disjoint(X5,X2,X1) ) ).
cnf(u4020,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK24(sK26),X2)
| ~ qmltpeq(sK17(sK1(sK26),X0,X1),sK1(sK26),X0)
| '$ki_accessible'(X1,sK16(sK1(sK26),X3,X1))
| ~ '$ki_accessible'(X1,X4)
| in(X4,X3,X0) ) ).
cnf(u2079,negated_conjecture,
( ~ '$ki_accessible'(sK31,X0)
| '$ki_accessible'(X0,sK6(sK27,sK1(sK28),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(sK1(sK31),sK27),set_intersection2(sK1(sK31),sK1(sK28))) ) ).
cnf(u3386,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK30,X0)
| ~ '$ki_accessible'(sK30,X1)
| '$ki_accessible'(X1,sK4(sK27,sK29,X1))
| ~ qmltpeq(sK3(sK29,X0,X1),sK29,X0)
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,sK27,X0) ) ).
cnf(u2882,axiom,
( ~ '$ki_accessible'(sK0('$ki_local_world'),X2)
| '$ki_accessible'(X0,sK13(sK1(sK0('$ki_local_world')),X1,X0))
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X1)
| '$ki_accessible'(X0,sK12(sK1(sK0('$ki_local_world')),X0))
| ~ '$ki_accessible'(X0,X3)
| empty(X3,X1) ) ).
cnf(u2981,negated_conjecture,
( ~ '$ki_accessible'(sK31,X0)
| '$ki_accessible'(X0,sK15(sK27,sK1(sK28),X0))
| '$ki_accessible'(X0,sK14(sK27,sK1(sK31),X0))
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK1(sK28),sK1(sK31)) ) ).
cnf(u4244,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X2)
| ~ qmltpeq(sK11(sK1(sK0('$ki_local_world')),X0,X1),sK1(sK0('$ki_local_world')),X0)
| '$ki_accessible'(X1,sK10(sK1(sK0('$ki_local_world')),X3,X1))
| ~ '$ki_accessible'(X1,X4)
| disjoint(X4,X3,X0) ) ).
cnf(u4133,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK24(sK26)),X0)
| ~ '$ki_accessible'(sK0(sK24(sK26)),X1)
| '$ki_accessible'(X1,sK9(sK1(sK26),sK1(sK24(sK26)),X1))
| '$ki_accessible'(X1,sK8(sK1(sK26),X0,X1))
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,sK1(sK24(sK26)),X0) ) ).
cnf(u4019,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK28,X2)
| ~ qmltpeq(sK17(sK1(sK26),X0,X1),sK1(sK26),X0)
| '$ki_accessible'(X1,sK16(sK1(sK26),X3,X1))
| ~ '$ki_accessible'(X1,X4)
| in(X4,X3,X0) ) ).
cnf(u4495,axiom,
( ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK9(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X1))
| ~ disjoint(sK8(sK1(sK0('$ki_local_world')),X2,X1),sK1(sK0('$ki_local_world')),X2)
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,sK1(sK24(sK0('$ki_local_world'))),X2) ) ).
cnf(u4258,axiom,
( ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X0)
| '$ki_accessible'(X0,sK20(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X0))
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,singleton(sK1(sK0('$ki_local_world'))),sK1(sK0(sK0('$ki_local_world')))) ) ).
cnf(u4147,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK24(sK26)),X0)
| '$ki_accessible'(X0,sK9(sK1(sK26),sK1(sK24(sK26)),X0))
| '$ki_accessible'(X0,sK8(sK1(sK26),sK1(sK0(sK24(sK26))),X0))
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK24(sK26)),sK1(sK0(sK24(sK26)))) ) ).
cnf(u2889,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK0(sK26),X2)
| '$ki_accessible'(X0,sK15(sK27,X1,X0))
| '$ki_accessible'(X0,sK14(sK27,X3,X0))
| ~ '$ki_accessible'(X0,X4)
| in(X4,X1,X3) ) ).
cnf(u2575,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK9(sK27,sK1(sK28),X1))
| '$ki_accessible'(X1,sK8(sK27,X2,X1))
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,sK1(sK28),X2) ) ).
cnf(u4030,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK28,X2)
| '$ki_accessible'(X0,sK17(sK1(sK26),X1,X0))
| ~ in(sK16(sK1(sK26),X3,X0),X3,sK1(sK26))
| ~ '$ki_accessible'(X0,X4)
| in(X4,X3,X1) ) ).
cnf(u3108,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK28),X0)
| '$ki_accessible'(X0,sK17(sK27,sK29,X0))
| '$ki_accessible'(X0,sK16(sK27,sK1(sK0(sK28)),X0))
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK1(sK0(sK28)),sK29) ) ).
cnf(u3466,axiom,
( ~ '$ki_accessible'(sK0('$ki_local_world'),X4)
| '$ki_accessible'(X1,sK15(sK1(sK0('$ki_local_world')),X2,X1))
| ~ '$ki_accessible'(X3,X1)
| ~ '$ki_exists_in_world_$i'(X3,X0)
| ~ '$ki_accessible'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X4,X2)
| ~ in(sK14(sK1(sK0('$ki_local_world')),X0,X1),sK1(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X1,X5)
| in(X5,X2,X0) ) ).
cnf(u1623,negated_conjecture,
( ~ qmltpeq(sK15(sK1(sK26),sK1(sK28),X1),sK1(sK26),sK1(sK28))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| ~ in(sK14(sK1(sK26),X2,X1),sK1(sK26),X2)
| ~ '$ki_accessible'(X1,X3)
| in(X3,sK1(sK28),X2) ) ).
cnf(u4012,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK4(sK1(sK26),sK1(sK28),X1))
| ~ qmltpeq(sK3(sK1(sK28),X2,X1),sK1(sK28),X2)
| ~ '$ki_accessible'(X1,X3)
| qmltpeq(X3,sK1(sK26),X2) ) ).
cnf(u4204,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X2)
| '$ki_accessible'(X0,sK4(sK1(sK0('$ki_local_world')),X1,X0))
| ~ qmltpeq(sK3(X1,X3,X0),X1,X3)
| ~ '$ki_accessible'(X0,X4)
| qmltpeq(X4,sK1(sK0('$ki_local_world')),X3) ) ).
cnf(u3488,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK31,X0)
| ~ '$ki_accessible'(sK31,X1)
| '$ki_accessible'(X1,sK15(sK27,sK1(sK28),X1))
| ~ in(sK14(sK27,X0,X1),sK27,X0)
| ~ '$ki_accessible'(X1,X2)
| in(X2,sK1(sK28),X0) ) ).
cnf(u1314,axiom,
( ~ '$ki_exists_in_world_$i'(sK0('$ki_local_world'),X2)
| '$ki_accessible'(X0,sK14(X2,X3,X0))
| '$ki_accessible'(X0,sK15(X2,X4,X0))
| ~ '$ki_accessible'(X5,X0)
| ~ '$ki_exists_in_world_$i'(X5,X3)
| ~ '$ki_accessible'(X6,X5)
| ~ '$ki_exists_in_world_$i'(X6,X4)
| ~ '$ki_accessible'(sK0('$ki_local_world'),X6)
| ~ '$ki_accessible'(X0,X1)
| in(X1,X4,X3) ) ).
cnf(u4218,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK17(sK1(sK26),sK1(sK0(sK26)),X1))
| ~ in(sK16(sK1(sK26),X2,X1),X2,sK1(sK26))
| ~ '$ki_accessible'(X1,X3)
| in(X3,X2,sK1(sK0(sK26))) ) ).
cnf(u3473,negated_conjecture,
( ~ qmltpeq(sK15(sK27,sK1(sK24(sK26)),X1),sK27,sK1(sK24(sK26)))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK14(sK27,X2,X1))
| ~ '$ki_accessible'(X1,X3)
| in(X3,sK1(sK24(sK26)),X2) ) ).
cnf(u1106,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X3)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| ~ qmltpeq(sK5(sK1(sK26),X3,X1),sK1(sK26),X3)
| ~ '$ki_accessible'(X1,X4)
| qmltpeq(X4,set_intersection2(sK1(sK26),X2),set_intersection2(X3,X2)) ) ).
cnf(u1872,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X3)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK5(sK27,X3,X1))
| ~ '$ki_accessible'(X1,X4)
| qmltpeq(X4,set_intersection2(sK27,X2),set_intersection2(X3,X2)) ) ).
cnf(u4011,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK4(sK1(sK26),sK29,X1))
| ~ qmltpeq(sK3(sK29,X2,X1),sK29,X2)
| ~ '$ki_accessible'(X1,X3)
| qmltpeq(X3,sK1(sK26),X2) ) ).
cnf(u4112,negated_conjecture,
( ~ qmltpeq(sK17(sK1(sK26),sK1(sK28),X1),sK1(sK26),sK1(sK28))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK16(sK1(sK26),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| in(X3,X2,sK1(sK28)) ) ).
cnf(u3503,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK24(sK26)),X0)
| ~ '$ki_accessible'(sK0(sK24(sK26)),X1)
| '$ki_accessible'(X1,sK15(sK27,sK1(sK24(sK26)),X1))
| ~ in(sK14(sK27,X0,X1),sK27,X0)
| ~ '$ki_accessible'(X1,X2)
| in(X2,sK1(sK24(sK26)),X0) ) ).
cnf(u2577,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK30,X0)
| ~ '$ki_accessible'(sK30,X1)
| '$ki_accessible'(X1,sK9(sK27,sK29,X1))
| '$ki_accessible'(X1,sK8(sK27,X0,X1))
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,sK29,X0) ) ).
cnf(u1128,negated_conjecture,
( ~ '$ki_accessible'(sK26,X2)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X1)
| '$ki_accessible'(X0,sK19(sK27,X1,X0))
| ~ '$ki_accessible'(X0,X3)
| '$ki_accessible'(X3,sK18(sK27,X1,X3)) ) ).
cnf(u2881,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK11(sK27,sK1(sK0(sK26)),X1))
| '$ki_accessible'(X1,sK10(sK27,X2,X1))
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,X2,sK1(sK0(sK26))) ) ).
cnf(u1321,negated_conjecture,
( ~ qmltpeq(sK11(sK27,sK29,X1),sK27,sK29)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| ~ disjoint(sK10(sK27,X2,X1),X2,sK27)
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,X2,sK29) ) ).
cnf(u2460,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK0(sK26),X2)
| '$ki_accessible'(X0,sK4(sK27,X1,X0))
| '$ki_accessible'(X0,sK3(X1,X3,X0))
| ~ '$ki_accessible'(X0,X4)
| qmltpeq(X4,sK27,X3) ) ).
cnf(u4022,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK24(sK26)),X0)
| ~ '$ki_accessible'(sK0(sK24(sK26)),X1)
| '$ki_accessible'(X1,sK17(sK27,sK1(sK24(sK26)),X1))
| ~ in(sK16(sK27,X0,X1),X0,sK27)
| ~ '$ki_accessible'(X1,X2)
| in(X2,X0,sK1(sK24(sK26))) ) ).
cnf(u2252,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK30,X0)
| ~ '$ki_accessible'(sK30,X1)
| '$ki_accessible'(X1,sK5(sK1(sK26),sK1(sK28),X1))
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,set_intersection2(sK1(sK26),X0),set_intersection2(sK1(sK28),X0)) ) ).
cnf(u2141,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK0(sK26)),X0)
| ~ '$ki_accessible'(sK0(sK0(sK26)),X1)
| '$ki_accessible'(X1,sK6(sK27,sK1(sK0(sK26)),X1))
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,set_intersection2(X0,sK27),set_intersection2(X0,sK1(sK0(sK26)))) ) ).
cnf(u286,axiom,
( ~ '$ki_exists_in_world_$i'(sK0('$ki_local_world'),X2)
| ~ disjoint(sK25(X2,X3,X0),X2,X3)
| ~ '$ki_accessible'(X4,X0)
| ~ '$ki_exists_in_world_$i'(X4,X3)
| ~ '$ki_accessible'(sK0('$ki_local_world'),X4)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,X3,X2) ) ).
cnf(u631,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X1)
| ~ '$ki_accessible'(sK28,X0)
| ~ in(sK19(sK1(sK26),X1,X0),sK1(sK26),X1)
| ~ '$ki_accessible'(X0,X2)
| '$ki_accessible'(X2,sK18(sK1(sK26),X1,X2)) ) ).
cnf(u3813,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK28),X0)
| '$ki_accessible'(X0,sK11(sK1(sK26),sK1(sK28),X0))
| '$ki_accessible'(X0,sK10(sK1(sK26),sK1(sK0(sK28)),X0))
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK0(sK28)),sK1(sK28)) ) ).
cnf(u308,negated_conjecture,
( ~ disjoint(sK25(sK27,sK1(sK28),X0),sK27,sK1(sK28))
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK28),sK27) ) ).
cnf(u4506,axiom,
( ~ qmltpeq(sK17(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X1),sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK16(sK1(sK0('$ki_local_world')),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| in(X3,X2,sK1(sK0(sK0('$ki_local_world')))) ) ).
cnf(u2368,negated_conjecture,
( ~ '$ki_accessible'(sK26,X4)
| ~ qmltpeq(sK11(sK1(sK26),X2,X0),sK1(sK26),X2)
| ~ '$ki_accessible'(X3,X0)
| ~ '$ki_exists_in_world_$i'(X3,X1)
| ~ '$ki_accessible'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X4,X2)
| '$ki_accessible'(X0,sK10(sK1(sK26),X1,X0))
| ~ '$ki_accessible'(X0,X5)
| disjoint(X5,X1,X2) ) ).
cnf(u2459,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK24(sK26),X2)
| '$ki_accessible'(X0,sK4(sK27,X1,X0))
| '$ki_accessible'(X0,sK3(X1,X3,X0))
| ~ '$ki_accessible'(X0,X4)
| qmltpeq(X4,sK27,X3) ) ).
cnf(u1522,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK26,X4)
| ~ qmltpeq(sK3(X2,X3,X0),X2,X3)
| '$ki_accessible'(X0,sK4(X4,X2,X0))
| ~ '$ki_accessible'(X5,X0)
| ~ '$ki_exists_in_world_$i'(X5,X3)
| ~ '$ki_accessible'(X6,X5)
| ~ '$ki_exists_in_world_$i'(X6,X2)
| ~ '$ki_accessible'(sK26,X6)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,X4,X3) ) ).
cnf(u1832,axiom,
( ~ '$ki_exists_in_world_$i'(sK24(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X2)
| ~ qmltpeq(sK9(sK1(sK0('$ki_local_world')),X0,X1),sK1(sK0('$ki_local_world')),X0)
| ~ disjoint(sK8(sK1(sK0('$ki_local_world')),X3,X1),sK1(sK0('$ki_local_world')),X3)
| ~ '$ki_accessible'(X1,X4)
| disjoint(X4,X0,X3) ) ).
cnf(u4029,negated_conjecture,
( ~ qmltpeq(sK3(sK1(sK28),sK1(sK0(sK28)),X0),sK1(sK28),sK1(sK0(sK28)))
| '$ki_accessible'(X0,sK4(sK1(sK26),sK1(sK28),X0))
| ~ '$ki_accessible'(sK0(sK28),X0)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,sK1(sK26),sK1(sK0(sK28))) ) ).
cnf(u293,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X1)
| ~ '$ki_accessible'(sK0(sK26),X0)
| ~ qmltpeq(sK2(sK27,X1,X0),sK27,X1)
| ~ '$ki_accessible'(X0,X2)
| qmltpeq(X2,X1,sK27) ) ).
cnf(u307,negated_conjecture,
( ~ disjoint(sK25(sK27,sK29,X0),sK27,sK29)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK29,sK27) ) ).
cnf(u4513,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK24(sK0('$ki_local_world'))),X0)
| ~ '$ki_accessible'(sK0(sK24(sK0('$ki_local_world'))),X1)
| '$ki_accessible'(X1,sK15(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X1))
| ~ in(sK14(sK1(sK0('$ki_local_world')),X0,X1),sK1(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X1,X2)
| in(X2,sK1(sK24(sK0('$ki_local_world'))),X0) ) ).
cnf(u1585,negated_conjecture,
( ~ qmltpeq(sK11(sK1(sK26),sK29,X1),sK1(sK26),sK29)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| ~ disjoint(sK10(sK1(sK26),X2,X1),X2,sK1(sK26))
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,X2,sK29) ) ).
cnf(u3494,negated_conjecture,
( ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK15(sK27,sK1(sK24(sK26)),X1))
| ~ in(sK14(sK27,X2,X1),sK27,X2)
| ~ '$ki_accessible'(X1,X3)
| in(X3,sK1(sK24(sK26)),X2) ) ).
cnf(u1847,axiom,
( ~ '$ki_exists_in_world_$i'(sK24(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X2)
| ~ qmltpeq(sK15(sK1(sK0('$ki_local_world')),X0,X1),sK1(sK0('$ki_local_world')),X0)
| ~ in(sK14(sK1(sK0('$ki_local_world')),X3,X1),sK1(sK0('$ki_local_world')),X3)
| ~ '$ki_accessible'(X1,X4)
| in(X4,X0,X3) ) ).
cnf(u4024,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK31,X0)
| ~ '$ki_accessible'(sK31,X1)
| '$ki_accessible'(X1,sK4(sK1(sK26),sK1(sK28),X1))
| ~ qmltpeq(sK3(sK1(sK28),X0,X1),sK1(sK28),X0)
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,sK1(sK26),X0) ) ).
cnf(u1791,axiom,
( ~ in(sK18(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X1),sK1(sK0(sK0('$ki_local_world'))),sK1(sK0('$ki_local_world')))
| '$ki_accessible'(X0,sK19(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X0))
| ~ '$ki_accessible'(X0,X1)
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X0) ) ).
cnf(u3596,negated_conjecture,
( ~ '$ki_accessible'(sK31,X0)
| '$ki_accessible'(X0,sK4(sK1(sK26),sK1(sK28),X0))
| '$ki_accessible'(X0,sK3(sK1(sK28),sK1(sK31),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,sK1(sK26),sK1(sK31)) ) ).
cnf(u1127,axiom,
( ~ '$ki_accessible'(sK0('$ki_local_world'),X0)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ '$ki_accessible'(X0,X2)
| qmltpeq(X2,set_intersection2(sK1(sK0('$ki_local_world')),sK1(sK0('$ki_local_world'))),sK1(sK0('$ki_local_world'))) ) ).
cnf(u3516,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK28,X2)
| '$ki_accessible'(X0,sK4(sK1(sK26),X1,X0))
| '$ki_accessible'(X0,sK3(X1,X3,X0))
| ~ '$ki_accessible'(X0,X4)
| qmltpeq(X4,sK1(sK26),X3) ) ).
cnf(u145,axiom,
'$ki_accessible'(X0,sK0(X0)) ).
cnf(u1431,negated_conjecture,
'$ki_accessible'(sK12(sK27,sK31),sK18(sK1(sK26),sK29,sK12(sK27,sK31))) ).
cnf(u633,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X1)
| ~ '$ki_accessible'(sK0(sK26),X0)
| ~ in(sK19(sK1(sK26),X1,X0),sK1(sK26),X1)
| ~ '$ki_accessible'(X0,X2)
| '$ki_accessible'(X2,sK18(sK1(sK26),X1,X2)) ) ).
cnf(u804,negated_conjecture,
( ~ '$ki_accessible'(sK24(sK26),X0)
| '$ki_accessible'(X0,sK20(sK27,sK1(sK24(sK26)),X0))
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,singleton(sK27),sK1(sK24(sK26))) ) ).
cnf(u494,negated_conjecture,
( ~ in(sK19(sK27,sK29,X0),sK27,sK29)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK18(sK27,sK29,X1)) ) ).
cnf(u3197,negated_conjecture,
( ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK17(sK27,sK1(sK24(sK26)),X1))
| '$ki_accessible'(X1,sK16(sK27,X2,X1))
| ~ '$ki_accessible'(X1,X3)
| in(X3,X2,sK1(sK24(sK26))) ) ).
cnf(u1342,negated_conjecture,
'$ki_accessible'(sK0(sK0(sK0(sK26))),sK18(sK1(sK26),sK1(sK0(sK26)),sK0(sK0(sK0(sK26))))) ).
cnf(u596,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK26),X0)
| '$ki_accessible'(X0,sK25(sK27,sK1(sK0(sK26)),X0))
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK0(sK26)),sK27) ) ).
cnf(u175,axiom,
( ~ '$ki_accessible'('$ki_local_world',X0)
| ~ '$ki_accessible'(X6,X7)
| ~ in(sK14(X1,X5,X6),X1,X5)
| ~ qmltpeq(sK15(X1,X3,X6),X1,X3)
| ~ '$ki_accessible'(X4,X6)
| ~ '$ki_exists_in_world_$i'(X4,X5)
| ~ '$ki_accessible'(X2,X4)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| in(X7,X3,X5) ) ).
cnf(u1354,negated_conjecture,
( ~ qmltpeq(sK15(sK27,sK29,X1),sK27,sK29)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| ~ in(sK14(sK27,X2,X1),sK27,X2)
| ~ '$ki_accessible'(X1,X3)
| in(X3,sK29,X2) ) ).
cnf(u3501,negated_conjecture,
( ~ qmltpeq(sK17(sK27,sK1(sK24(sK26)),X1),sK27,sK1(sK24(sK26)))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK16(sK27,X2,X1))
| ~ '$ki_accessible'(X1,X3)
| in(X3,X2,sK1(sK24(sK26))) ) ).
cnf(u388,negated_conjecture,
( ~ disjoint(sK25(sK1(sK26),sK29,X0),sK1(sK26),sK29)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK29,sK1(sK26)) ) ).
cnf(u1274,axiom,
( ~ '$ki_accessible'(sK0('$ki_local_world'),X2)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X0)
| ~ qmltpeq(sK7(sK1(sK0('$ki_local_world')),X0,X1),sK1(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X1,X3)
| qmltpeq(X3,singleton(sK1(sK0('$ki_local_world'))),singleton(X0)) ) ).
cnf(u1634,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK26,X2)
| ~ disjoint(sK8(X2,X3,X0),X2,X3)
| '$ki_accessible'(X0,sK9(X2,X4,X0))
| ~ '$ki_accessible'(X5,X0)
| ~ '$ki_exists_in_world_$i'(X5,X3)
| ~ '$ki_accessible'(X6,X5)
| ~ '$ki_exists_in_world_$i'(X6,X4)
| ~ '$ki_accessible'(sK26,X6)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,X4,X3) ) ).
cnf(u3515,negated_conjecture,
( ~ in(sK16(sK27,sK1(sK0(sK28)),X0),sK1(sK0(sK28)),sK27)
| '$ki_accessible'(X0,sK17(sK27,sK29,X0))
| ~ '$ki_accessible'(sK0(sK28),X0)
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK1(sK0(sK28)),sK29) ) ).
cnf(u803,axiom,
( ~ '$ki_exists_in_world_$i'(sK0('$ki_local_world'),X2)
| '$ki_accessible'(X0,sK12(X2,X0))
| ~ qmltpeq(sK13(X2,X3,X0),X2,X3)
| ~ '$ki_accessible'(X4,X0)
| ~ '$ki_exists_in_world_$i'(X4,X3)
| ~ '$ki_accessible'(sK0('$ki_local_world'),X4)
| ~ '$ki_accessible'(X0,X1)
| empty(X1,X3) ) ).
cnf(u632,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X1)
| ~ '$ki_accessible'(sK24(sK26),X0)
| ~ in(sK19(sK1(sK26),X1,X0),sK1(sK26),X1)
| ~ '$ki_accessible'(X0,X2)
| '$ki_accessible'(X2,sK18(sK1(sK26),X1,X2)) ) ).
cnf(u194,axiom,
( ~ empty(sK24(X1),sK23)
| ~ '$ki_accessible'('$ki_local_world',X1) ) ).
cnf(u387,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X1)
| ~ '$ki_accessible'(sK0(sK26),X0)
| ~ disjoint(sK25(sK1(sK26),X1,X0),sK1(sK26),X1)
| ~ '$ki_accessible'(X0,X2)
| disjoint(X2,X1,sK1(sK26)) ) ).
cnf(u1899,negated_conjecture,
( ~ '$ki_accessible'(sK30,X0)
| '$ki_accessible'(X0,sK5(sK27,sK29,X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(sK27,sK1(sK30)),set_intersection2(sK29,sK1(sK30))) ) ).
cnf(u769,negated_conjecture,
~ '$ki_accessible'(sK30,sK31) ).
cnf(u1652,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X1)
| ~ '$ki_accessible'(sK0(sK26),X0)
| '$ki_accessible'(X0,sK21(sK1(sK26),X1,X0))
| ~ '$ki_accessible'(X0,X2)
| qmltpeq(X2,set_intersection2(X1,singleton(sK1(sK26))),singleton(sK1(sK26))) ) ).
cnf(u1444,negated_conjecture,
( ~ '$ki_accessible'(sK24(sK26),X0)
| '$ki_accessible'(X0,sK13(sK27,sK1(sK24(sK26)),X0))
| '$ki_accessible'(X0,sK12(sK27,X0))
| ~ '$ki_accessible'(X0,X1)
| empty(X1,sK1(sK24(sK26))) ) ).
cnf(u154,axiom,
( ~ '$ki_accessible'('$ki_local_world',X0)
| ~ '$ki_accessible'(X6,X7)
| '$ki_accessible'(X6,sK5(X1,X3,X6))
| ~ '$ki_accessible'(X4,X6)
| ~ '$ki_exists_in_world_$i'(X4,X5)
| ~ '$ki_accessible'(X2,X4)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| qmltpeq(X7,set_intersection2(X1,X5),set_intersection2(X3,X5)) ) ).
cnf(u1236,axiom,
( ~ '$ki_accessible'(sK0('$ki_local_world'),X2)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X0)
| ~ disjoint(sK25(sK1(sK0('$ki_local_world')),X0,X1),sK1(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,X0,sK1(sK0('$ki_local_world'))) ) ).
cnf(u970,negated_conjecture,
( ~ '$ki_accessible'(sK26,X4)
| ~ qmltpeq(sK9(sK27,X2,X1),sK27,X2)
| ~ '$ki_accessible'(X3,X1)
| ~ '$ki_exists_in_world_$i'(X3,X0)
| ~ '$ki_accessible'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X4,X2)
| ~ disjoint(sK8(sK27,X0,X1),sK27,X0)
| ~ '$ki_accessible'(X1,X5)
| disjoint(X5,X2,X0) ) ).
cnf(u3506,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK24(sK26),X2)
| '$ki_accessible'(X0,sK17(sK27,X1,X0))
| ~ in(sK16(sK27,X3,X0),X3,sK27)
| ~ '$ki_accessible'(X0,X4)
| in(X4,X3,X1) ) ).
cnf(u176,axiom,
( ~ '$ki_accessible'('$ki_local_world',X0)
| ~ '$ki_accessible'(X6,X7)
| '$ki_accessible'(X6,sK16(X1,X5,X6))
| '$ki_accessible'(X6,sK17(X1,X3,X6))
| ~ '$ki_accessible'(X4,X6)
| ~ '$ki_exists_in_world_$i'(X4,X5)
| ~ '$ki_accessible'(X2,X4)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| in(X7,X5,X3) ) ).
cnf(u1139,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X3)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| ~ qmltpeq(sK6(sK1(sK26),X3,X1),sK1(sK26),X3)
| ~ '$ki_accessible'(X1,X4)
| qmltpeq(X4,set_intersection2(X2,sK1(sK26)),set_intersection2(X2,X3)) ) ).
cnf(u2098,negated_conjecture,
( ~ '$ki_accessible'(sK30,X0)
| '$ki_accessible'(X0,sK6(sK27,sK1(sK28),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(sK1(sK30),sK27),set_intersection2(sK1(sK30),sK1(sK28))) ) ).
cnf(u3400,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK4(sK27,sK1(sK0(sK26)),X1))
| ~ qmltpeq(sK3(sK1(sK0(sK26)),X2,X1),sK1(sK0(sK26)),X2)
| ~ '$ki_accessible'(X1,X3)
| qmltpeq(X3,sK27,X2) ) ).
cnf(u1443,axiom,
( ~ empty(sK12(sK1(sK0('$ki_local_world')),X0),sK1(sK0('$ki_local_world')))
| ~ qmltpeq(sK13(sK1(sK0('$ki_local_world')),X1,X0),sK1(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X1)
| ~ '$ki_accessible'(sK0('$ki_local_world'),X2)
| ~ '$ki_accessible'(X0,X3)
| empty(X3,X1) ) ).
cnf(u3081,negated_conjecture,
( ~ '$ki_accessible'(sK30,X0)
| '$ki_accessible'(X0,sK17(sK27,sK29,X0))
| '$ki_accessible'(X0,sK16(sK27,sK1(sK30),X0))
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK1(sK30),sK29) ) ).
cnf(u935,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK26,X2)
| '$ki_accessible'(X0,sK5(X2,X3,X0))
| ~ '$ki_accessible'(X4,X0)
| ~ '$ki_exists_in_world_$i'(X4,X5)
| ~ '$ki_accessible'(X6,X4)
| ~ '$ki_exists_in_world_$i'(X6,X3)
| ~ '$ki_accessible'(sK26,X6)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(X2,X5),set_intersection2(X3,X5)) ) ).
cnf(u271,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X0)
| ~ '$ki_accessible'(sK0(sK26),X1)
| qmltpeq(X1,set_intersection2(sK27,X0),set_intersection2(X0,sK27)) ) ).
cnf(u3513,negated_conjecture,
( ~ in(sK16(sK27,sK1(sK31),X0),sK1(sK31),sK27)
| '$ki_accessible'(X0,sK17(sK27,sK29,X0))
| ~ '$ki_accessible'(sK31,X0)
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK1(sK31),sK29) ) ).
cnf(u215,negated_conjecture,
( ~ '$ki_accessible'(sK26,X0)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ '$ki_accessible'(X0,X2)
| qmltpeq(X2,set_intersection2(sK1(sK26),sK1(sK26)),sK1(sK26)) ) ).
cnf(u1174,negated_conjecture,
'$ki_accessible'(sK0(sK0(sK28)),sK18(sK27,sK29,sK0(sK0(sK28)))) ).
cnf(u1940,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK30,X0)
| ~ '$ki_accessible'(sK30,X1)
| '$ki_accessible'(X1,sK5(sK27,sK1(sK28),X1))
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,set_intersection2(sK27,X0),set_intersection2(sK1(sK28),X0)) ) ).
cnf(u3415,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK30,X0)
| ~ '$ki_accessible'(sK30,X1)
| '$ki_accessible'(X1,sK9(sK27,sK29,X1))
| ~ disjoint(sK8(sK27,X0,X1),sK27,X0)
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,sK29,X0) ) ).
cnf(u1732,negated_conjecture,
( ~ '$ki_accessible'(sK24(sK26),X0)
| '$ki_accessible'(X0,sK21(sK1(sK26),sK1(sK24(sK26)),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(sK1(sK24(sK26)),singleton(sK1(sK26))),singleton(sK1(sK26))) ) ).
cnf(u597,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X1)
| ~ '$ki_accessible'(sK28,X0)
| ~ qmltpeq(sK7(sK1(sK26),X1,X0),sK1(sK26),X1)
| ~ '$ki_accessible'(X0,X2)
| qmltpeq(X2,singleton(sK1(sK26)),singleton(X1)) ) ).
cnf(u930,negated_conjecture,
( ~ '$ki_accessible'(sK26,X4)
| ~ qmltpeq(sK4(sK27,X0,X2),sK27,X0)
| ~ '$ki_accessible'(X3,X2)
| ~ '$ki_exists_in_world_$i'(X3,X1)
| ~ '$ki_accessible'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X4,X0)
| ~ qmltpeq(sK3(X0,X1,X2),X0,X1)
| ~ '$ki_accessible'(X2,X5)
| qmltpeq(X5,sK27,X1) ) ).
cnf(u901,negated_conjecture,
( ~ '$ki_accessible'(sK26,X4)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(X4,X2)
| ~ '$ki_exists_in_world_$i'(X4,X0)
| ~ qmltpeq(sK6(sK1(sK26),X0,X1),sK1(sK26),X0)
| ~ '$ki_accessible'(X1,X5)
| qmltpeq(X5,set_intersection2(X3,sK1(sK26)),set_intersection2(X3,X0)) ) ).
cnf(u4117,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK28),X0)
| ~ '$ki_accessible'(sK0(sK28),X1)
| '$ki_accessible'(X1,sK17(sK1(sK26),sK29,X1))
| ~ in(sK16(sK1(sK26),X0,X1),X0,sK1(sK26))
| ~ '$ki_accessible'(X1,X2)
| in(X2,X0,sK29) ) ).
cnf(u722,axiom,
( ~ '$ki_exists_in_world_$i'(sK0('$ki_local_world'),X2)
| '$ki_accessible'(X0,sK21(X2,X3,X0))
| ~ '$ki_accessible'(X4,X0)
| ~ '$ki_exists_in_world_$i'(X4,X3)
| ~ '$ki_accessible'(sK0('$ki_local_world'),X4)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(X3,singleton(X2)),singleton(X2)) ) ).
cnf(u1635,axiom,
( ~ '$ki_exists_in_world_$i'(sK0('$ki_local_world'),X2)
| ~ disjoint(sK8(X2,X3,X0),X2,X3)
| '$ki_accessible'(X0,sK9(X2,X4,X0))
| ~ '$ki_accessible'(X5,X0)
| ~ '$ki_exists_in_world_$i'(X5,X3)
| ~ '$ki_accessible'(X6,X5)
| ~ '$ki_exists_in_world_$i'(X6,X4)
| ~ '$ki_accessible'(sK0('$ki_local_world'),X6)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,X4,X3) ) ).
cnf(u2292,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK28),X0)
| '$ki_accessible'(X0,sK5(sK1(sK26),sK1(sK28),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(sK1(sK26),sK1(sK0(sK28))),set_intersection2(sK1(sK28),sK1(sK0(sK28)))) ) ).
cnf(u4242,negated_conjecture,
( ~ qmltpeq(sK3(sK1(sK0(sK26)),sK1(sK0(sK0(sK26))),X0),sK1(sK0(sK26)),sK1(sK0(sK0(sK26))))
| '$ki_accessible'(X0,sK4(sK1(sK26),sK1(sK0(sK26)),X0))
| ~ '$ki_accessible'(sK0(sK0(sK26)),X0)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,sK1(sK26),sK1(sK0(sK0(sK26)))) ) ).
cnf(u1939,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK31,X0)
| ~ '$ki_accessible'(sK31,X1)
| '$ki_accessible'(X1,sK5(sK27,sK1(sK28),X1))
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,set_intersection2(sK27,X0),set_intersection2(sK1(sK28),X0)) ) ).
cnf(u4131,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK24(sK26)),X0)
| ~ '$ki_accessible'(sK0(sK24(sK26)),X1)
| '$ki_accessible'(X1,sK4(sK1(sK26),sK1(sK24(sK26)),X1))
| '$ki_accessible'(X1,sK3(sK1(sK24(sK26)),X0,X1))
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,sK1(sK26),X0) ) ).
cnf(u937,negated_conjecture,
( ~ in(sK21(sK1(sK26),sK29,X0),sK1(sK26),sK29)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(sK29,singleton(sK1(sK26))),singleton(sK1(sK26))) ) ).
cnf(u4153,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK24(sK26)),X0)
| '$ki_accessible'(X0,sK17(sK1(sK26),sK1(sK24(sK26)),X0))
| '$ki_accessible'(X0,sK16(sK1(sK26),sK1(sK0(sK24(sK26))),X0))
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK1(sK0(sK24(sK26))),sK1(sK24(sK26))) ) ).
cnf(u1134,negated_conjecture,
( ~ qmltpeq(sK5(sK1(sK26),sK1(sK0(sK26)),X2),sK1(sK26),sK1(sK0(sK26)))
| ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ '$ki_accessible'(X2,X3)
| qmltpeq(X3,set_intersection2(sK1(sK26),X1),set_intersection2(sK1(sK0(sK26)),X1)) ) ).
cnf(u4166,negated_conjecture,
( ~ qmltpeq(sK3(sK1(sK0(sK26)),sK1(sK0(sK0(sK26))),X0),sK1(sK0(sK26)),sK1(sK0(sK0(sK26))))
| '$ki_accessible'(X0,sK4(sK27,sK1(sK0(sK26)),X0))
| ~ '$ki_accessible'(sK0(sK0(sK26)),X0)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,sK27,sK1(sK0(sK0(sK26)))) ) ).
cnf(u4654,axiom,
( ~ in(sK14(sK1(sK0('$ki_local_world')),sK1(sK0(sK0(sK0('$ki_local_world')))),X0),sK1(sK0('$ki_local_world')),sK1(sK0(sK0(sK0('$ki_local_world')))))
| '$ki_accessible'(X0,sK15(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X0))
| ~ '$ki_accessible'(sK0(sK0(sK0('$ki_local_world'))),X0)
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK1(sK0(sK0('$ki_local_world'))),sK1(sK0(sK0(sK0('$ki_local_world'))))) ) ).
cnf(u1484,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X1)
| ~ '$ki_accessible'(sK24(sK26),X0)
| '$ki_accessible'(X0,sK13(sK1(sK26),X1,X0))
| '$ki_accessible'(X0,sK12(sK1(sK26),X0))
| ~ '$ki_accessible'(X0,X2)
| empty(X2,X1) ) ).
cnf(u3406,negated_conjecture,
( ~ qmltpeq(sK9(sK27,sK1(sK24(sK26)),X1),sK27,sK1(sK24(sK26)))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK8(sK27,X2,X1))
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,sK1(sK24(sK26)),X2) ) ).
cnf(u1653,negated_conjecture,
( ~ qmltpeq(sK17(sK1(sK26),sK29,X1),sK1(sK26),sK29)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| ~ in(sK16(sK1(sK26),X2,X1),X2,sK1(sK26))
| ~ '$ki_accessible'(X1,X3)
| in(X3,X2,sK29) ) ).
cnf(u4202,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK9(sK1(sK26),sK1(sK0(sK26)),X1))
| ~ disjoint(sK8(sK1(sK26),X2,X1),sK1(sK26),X2)
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,sK1(sK0(sK26)),X2) ) ).
cnf(u3428,axiom,
( ~ '$ki_accessible'(sK0('$ki_local_world'),X4)
| '$ki_accessible'(X1,sK9(sK1(sK0('$ki_local_world')),X2,X1))
| ~ '$ki_accessible'(X3,X1)
| ~ '$ki_exists_in_world_$i'(X3,X0)
| ~ '$ki_accessible'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X4,X2)
| ~ disjoint(sK8(sK1(sK0('$ki_local_world')),X0,X1),sK1(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X1,X5)
| disjoint(X5,X2,X0) ) ).
cnf(u2563,negated_conjecture,
( ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK4(sK27,sK1(sK24(sK26)),X1))
| '$ki_accessible'(X1,sK3(sK1(sK24(sK26)),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| qmltpeq(X3,sK27,X2) ) ).
cnf(u4096,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK15(sK1(sK26),sK1(sK28),X1))
| ~ in(sK14(sK1(sK26),X2,X1),sK1(sK26),X2)
| ~ '$ki_accessible'(X1,X3)
| in(X3,sK1(sK28),X2) ) ).
cnf(u1483,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X1)
| ~ '$ki_accessible'(sK28,X0)
| '$ki_accessible'(X0,sK13(sK1(sK26),X1,X0))
| '$ki_accessible'(X0,sK12(sK1(sK26),X0))
| ~ '$ki_accessible'(X0,X2)
| empty(X2,X1) ) ).
cnf(u4016,negated_conjecture,
( ~ qmltpeq(sK3(sK29,sK1(sK31),X0),sK29,sK1(sK31))
| '$ki_accessible'(X0,sK4(sK1(sK26),sK29,X0))
| ~ '$ki_accessible'(sK31,X0)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,sK1(sK26),sK1(sK31)) ) ).
cnf(u3413,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK9(sK27,sK1(sK28),X1))
| ~ disjoint(sK8(sK27,X2,X1),sK27,X2)
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,sK1(sK28),X2) ) ).
cnf(u3427,negated_conjecture,
( ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK9(sK27,sK1(sK24(sK26)),X1))
| ~ disjoint(sK8(sK27,X2,X1),sK27,X2)
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,sK1(sK24(sK26)),X2) ) ).
cnf(u4031,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK24(sK26),X2)
| '$ki_accessible'(X0,sK17(sK1(sK26),X1,X0))
| ~ in(sK16(sK1(sK26),X3,X0),X3,sK1(sK26))
| ~ '$ki_accessible'(X0,X4)
| in(X4,X3,X1) ) ).
cnf(u4432,axiom,
( ~ '$ki_accessible'(sK0(sK0(sK0('$ki_local_world'))),X0)
| '$ki_accessible'(X0,sK6(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(sK1(sK0(sK0(sK0('$ki_local_world')))),sK1(sK0('$ki_local_world'))),set_intersection2(sK1(sK0(sK0(sK0('$ki_local_world')))),sK1(sK0(sK0('$ki_local_world'))))) ) ).
cnf(u3924,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK28),X0)
| ~ '$ki_accessible'(sK0(sK28),X1)
| '$ki_accessible'(X1,sK17(sK1(sK26),sK29,X1))
| '$ki_accessible'(X1,sK16(sK1(sK26),X0,X1))
| ~ '$ki_accessible'(X1,X2)
| in(X2,X0,sK29) ) ).
cnf(u1733,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK26),X0)
| '$ki_accessible'(X0,sK21(sK1(sK26),sK1(sK0(sK26)),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(sK1(sK0(sK26)),singleton(sK1(sK26))),singleton(sK1(sK26))) ) ).
cnf(u4512,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK0(sK0('$ki_local_world'))),X0)
| ~ '$ki_accessible'(sK0(sK0(sK0('$ki_local_world'))),X1)
| '$ki_accessible'(X1,sK11(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X1))
| ~ disjoint(sK10(sK1(sK0('$ki_local_world')),X0,X1),X0,sK1(sK0('$ki_local_world')))
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,X0,sK1(sK0(sK0('$ki_local_world')))) ) ).
cnf(u2885,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK24(sK26)),X0)
| '$ki_accessible'(X0,sK11(sK27,sK1(sK24(sK26)),X0))
| '$ki_accessible'(X0,sK10(sK27,sK1(sK0(sK24(sK26))),X0))
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK0(sK24(sK26))),sK1(sK24(sK26))) ) ).
cnf(u4026,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK28),X0)
| ~ '$ki_accessible'(sK0(sK28),X1)
| '$ki_accessible'(X1,sK4(sK1(sK26),sK1(sK28),X1))
| ~ qmltpeq(sK3(sK1(sK28),X0,X1),sK1(sK28),X0)
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,sK1(sK26),X0) ) ).
cnf(u4497,axiom,
( ~ qmltpeq(sK11(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X1),sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK10(sK1(sK0('$ki_local_world')),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,X2,sK1(sK24(sK0('$ki_local_world')))) ) ).
cnf(u2683,axiom,
( ~ '$ki_accessible'(sK0('$ki_local_world'),X2)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X1)
| '$ki_accessible'(X0,sK25(sK1(sK0('$ki_local_world')),X1,X0))
| ~ '$ki_accessible'(X0,X3)
| disjoint(X3,X1,sK1(sK0('$ki_local_world'))) ) ).
cnf(u3923,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK30,X0)
| ~ '$ki_accessible'(sK30,X1)
| '$ki_accessible'(X1,sK17(sK1(sK26),sK29,X1))
| '$ki_accessible'(X1,sK16(sK1(sK26),X0,X1))
| ~ '$ki_accessible'(X1,X2)
| in(X2,X0,sK29) ) ).
cnf(u2896,axiom,
( ~ empty(sK12(sK1(sK0('$ki_local_world')),X0),sK1(sK0('$ki_local_world')))
| '$ki_accessible'(X0,sK13(sK1(sK0('$ki_local_world')),X1,X0))
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X1)
| ~ '$ki_accessible'(sK0('$ki_local_world'),X2)
| ~ '$ki_accessible'(X0,X3)
| empty(X3,X1) ) ).
cnf(u4162,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK0(sK26)),X0)
| ~ '$ki_accessible'(sK0(sK0(sK26)),X1)
| '$ki_accessible'(X1,sK4(sK27,sK1(sK0(sK26)),X1))
| ~ qmltpeq(sK3(sK1(sK0(sK26)),X0,X1),sK1(sK0(sK26)),X0)
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,sK27,X0) ) ).
cnf(u4228,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK0(sK26)),X0)
| ~ '$ki_accessible'(sK0(sK0(sK26)),X1)
| '$ki_accessible'(X1,sK17(sK1(sK26),sK1(sK0(sK26)),X1))
| ~ in(sK16(sK1(sK26),X0,X1),X0,sK1(sK26))
| ~ '$ki_accessible'(X1,X2)
| in(X2,X0,sK1(sK0(sK26))) ) ).
cnf(u4299,axiom,
( ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X0)
| '$ki_accessible'(X0,sK19(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X0))
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK18(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X1)) ) ).
cnf(u2607,axiom,
( ~ '$ki_accessible'(sK0('$ki_local_world'),X2)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X1)
| '$ki_accessible'(X0,sK2(sK1(sK0('$ki_local_world')),X1,X0))
| ~ '$ki_accessible'(X0,X3)
| qmltpeq(X3,X1,sK1(sK0('$ki_local_world'))) ) ).
cnf(u3934,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK28),X0)
| '$ki_accessible'(X0,sK17(sK1(sK26),sK29,X0))
| '$ki_accessible'(X0,sK16(sK1(sK26),sK1(sK0(sK28)),X0))
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK1(sK0(sK28)),sK29) ) ).
cnf(u3726,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK0(sK26),X2)
| '$ki_accessible'(X0,sK4(sK1(sK26),X1,X0))
| ~ qmltpeq(sK3(X1,X3,X0),X1,X3)
| ~ '$ki_accessible'(X0,X4)
| qmltpeq(X4,sK1(sK26),X3) ) ).
cnf(u4214,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X2)
| ~ qmltpeq(sK4(sK1(sK0('$ki_local_world')),X0,X1),sK1(sK0('$ki_local_world')),X0)
| '$ki_accessible'(X1,sK3(X0,X3,X1))
| ~ '$ki_accessible'(X1,X4)
| qmltpeq(X4,sK1(sK0('$ki_local_world')),X3) ) ).
cnf(u2191,negated_conjecture,
( ~ '$ki_accessible'(sK26,X4)
| ~ qmltpeq(sK4(sK1(sK26),X1,X0),sK1(sK26),X1)
| ~ '$ki_accessible'(X3,X0)
| ~ '$ki_exists_in_world_$i'(X3,X2)
| ~ '$ki_accessible'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X4,X1)
| '$ki_accessible'(X0,sK3(X1,X2,X0))
| ~ '$ki_accessible'(X0,X5)
| qmltpeq(X5,sK1(sK26),X2) ) ).
cnf(u3498,negated_conjecture,
( ~ qmltpeq(sK17(sK27,sK29,X1),sK27,sK29)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK16(sK27,X2,X1))
| ~ '$ki_accessible'(X1,X3)
| in(X3,X2,sK29) ) ).
cnf(u2076,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK31,X0)
| ~ '$ki_accessible'(sK31,X1)
| '$ki_accessible'(X1,sK6(sK27,sK1(sK28),X1))
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,set_intersection2(X0,sK27),set_intersection2(X0,sK1(sK28))) ) ).
cnf(u1655,axiom,
( ~ '$ki_accessible'(sK0('$ki_local_world'),X4)
| ~ qmltpeq(sK17(sK1(sK0('$ki_local_world')),X2,X1),sK1(sK0('$ki_local_world')),X2)
| ~ '$ki_accessible'(X3,X1)
| ~ '$ki_exists_in_world_$i'(X3,X0)
| ~ '$ki_accessible'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X4,X2)
| ~ in(sK16(sK1(sK0('$ki_local_world')),X0,X1),X0,sK1(sK0('$ki_local_world')))
| ~ '$ki_accessible'(X1,X5)
| in(X5,X0,X2) ) ).
cnf(u4108,negated_conjecture,
( ~ in(sK14(sK1(sK26),sK1(sK0(sK28)),X0),sK1(sK26),sK1(sK0(sK28)))
| '$ki_accessible'(X0,sK15(sK1(sK26),sK1(sK28),X0))
| ~ '$ki_accessible'(sK0(sK28),X0)
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK1(sK28),sK1(sK0(sK28))) ) ).
cnf(u3836,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK31,X0)
| ~ '$ki_accessible'(sK31,X1)
| '$ki_accessible'(X1,sK15(sK1(sK26),sK29,X1))
| '$ki_accessible'(X1,sK14(sK1(sK26),X0,X1))
| ~ '$ki_accessible'(X1,X2)
| in(X2,sK29,X0) ) ).
cnf(u3392,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK31,X0)
| ~ '$ki_accessible'(sK31,X1)
| '$ki_accessible'(X1,sK4(sK27,sK1(sK28),X1))
| ~ qmltpeq(sK3(sK1(sK28),X0,X1),sK1(sK28),X0)
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,sK27,X0) ) ).
cnf(u2573,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK0(sK26),X2)
| '$ki_accessible'(X0,sK9(sK27,X1,X0))
| '$ki_accessible'(X0,sK8(sK27,X3,X0))
| ~ '$ki_accessible'(X0,X4)
| disjoint(X4,X1,X3) ) ).
cnf(u4122,negated_conjecture,
( ~ in(sK16(sK1(sK26),sK1(sK0(sK28)),X0),sK1(sK0(sK28)),sK1(sK26))
| '$ki_accessible'(X0,sK17(sK1(sK26),sK29,X0))
| ~ '$ki_accessible'(sK0(sK28),X0)
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK1(sK0(sK28)),sK29) ) ).
cnf(u3505,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK28,X2)
| '$ki_accessible'(X0,sK17(sK27,X1,X0))
| ~ in(sK16(sK27,X3,X0),X3,sK27)
| ~ '$ki_accessible'(X0,X4)
| in(X4,X3,X1) ) ).
cnf(u1138,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X3)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| ~ qmltpeq(sK6(sK1(sK26),X3,X1),sK1(sK26),X3)
| ~ '$ki_accessible'(X1,X4)
| qmltpeq(X4,set_intersection2(X2,sK1(sK26)),set_intersection2(X2,X3)) ) ).
cnf(u4144,axiom,
( ~ '$ki_exists_in_world_$i'(sK24(sK0('$ki_local_world')),X3)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK6(sK1(sK0('$ki_local_world')),X3,X1))
| ~ '$ki_accessible'(X1,X4)
| qmltpeq(X4,set_intersection2(X2,sK1(sK0('$ki_local_world'))),set_intersection2(X2,X3)) ) ).
cnf(u3407,negated_conjecture,
( ~ qmltpeq(sK9(sK27,sK1(sK0(sK26)),X1),sK27,sK1(sK0(sK26)))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK8(sK27,X2,X1))
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,sK1(sK0(sK26)),X2) ) ).
cnf(u1032,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X3)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| ~ qmltpeq(sK6(sK27,X3,X1),sK27,X3)
| ~ '$ki_accessible'(X1,X4)
| qmltpeq(X4,set_intersection2(X2,sK27),set_intersection2(X2,X3)) ) ).
cnf(u2572,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK24(sK26),X2)
| '$ki_accessible'(X0,sK9(sK27,X1,X0))
| '$ki_accessible'(X0,sK8(sK27,X3,X0))
| ~ '$ki_accessible'(X0,X4)
| disjoint(X4,X1,X3) ) ).
cnf(u4502,axiom,
( ~ qmltpeq(sK15(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X1),sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK14(sK1(sK0('$ki_local_world')),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| in(X3,sK1(sK0(sK0('$ki_local_world'))),X2) ) ).
cnf(u1169,negated_conjecture,
'$ki_accessible'(sK0(sK31),sK18(sK27,sK29,sK0(sK31))) ).
cnf(u1657,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| '$ki_accessible'(X0,sK21(sK1(sK26),sK1(sK28),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(sK1(sK28),singleton(sK1(sK26))),singleton(sK1(sK26))) ) ).
cnf(u1919,negated_conjecture,
( ~ '$ki_accessible'(sK26,X4)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(X4,X2)
| ~ '$ki_exists_in_world_$i'(X4,X1)
| '$ki_accessible'(X0,sK6(sK27,X1,X0))
| ~ '$ki_accessible'(X0,X5)
| qmltpeq(X5,set_intersection2(X3,sK27),set_intersection2(X3,X1)) ) ).
cnf(u4509,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK24(sK0('$ki_local_world'))),X0)
| ~ '$ki_accessible'(sK0(sK24(sK0('$ki_local_world'))),X1)
| '$ki_accessible'(X1,sK9(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X1))
| ~ disjoint(sK8(sK1(sK0('$ki_local_world')),X0,X1),sK1(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,sK1(sK24(sK0('$ki_local_world'))),X0) ) ).
cnf(u2192,negated_conjecture,
( ~ '$ki_accessible'(sK31,X0)
| '$ki_accessible'(X0,sK5(sK1(sK26),sK29,X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(sK1(sK26),sK1(sK31)),set_intersection2(sK29,sK1(sK31))) ) ).
cnf(u1656,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| '$ki_accessible'(X0,sK21(sK1(sK26),sK29,X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(sK29,singleton(sK1(sK26))),singleton(sK1(sK26))) ) ).
cnf(u1448,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK0(sK26),X2)
| ~ qmltpeq(sK17(sK27,X0,X1),sK27,X0)
| ~ in(sK16(sK27,X3,X1),X3,sK27)
| ~ '$ki_accessible'(X1,X4)
| in(X4,X3,X0) ) ).
cnf(u1240,axiom,
( ~ '$ki_exists_in_world_$i'(sK0('$ki_local_world'),X2)
| '$ki_accessible'(X0,sK10(X2,X3,X0))
| '$ki_accessible'(X0,sK11(X2,X4,X0))
| ~ '$ki_accessible'(X5,X0)
| ~ '$ki_exists_in_world_$i'(X5,X3)
| ~ '$ki_accessible'(X6,X5)
| ~ '$ki_exists_in_world_$i'(X6,X4)
| ~ '$ki_accessible'(sK0('$ki_local_world'),X6)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,X3,X4) ) ).
cnf(u1129,negated_conjecture,
( ~ '$ki_accessible'(sK26,X2)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X1)
| '$ki_accessible'(X0,sK19(sK1(sK26),X1,X0))
| ~ '$ki_accessible'(X0,X3)
| '$ki_accessible'(X3,sK18(sK1(sK26),X1,X3)) ) ).
cnf(u4417,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK0(sK0('$ki_local_world'))),X0)
| ~ '$ki_accessible'(sK0(sK0(sK0('$ki_local_world'))),X1)
| '$ki_accessible'(X1,sK5(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X1))
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,set_intersection2(sK1(sK0('$ki_local_world')),X0),set_intersection2(sK1(sK0(sK0('$ki_local_world'))),X0)) ) ).
cnf(u4254,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X2)
| ~ qmltpeq(sK17(sK1(sK0('$ki_local_world')),X0,X1),sK1(sK0('$ki_local_world')),X0)
| '$ki_accessible'(X1,sK16(sK1(sK0('$ki_local_world')),X3,X1))
| ~ '$ki_accessible'(X1,X4)
| in(X4,X3,X0) ) ).
cnf(u3398,negated_conjecture,
( ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK4(sK27,sK1(sK24(sK26)),X1))
| ~ qmltpeq(sK3(sK1(sK24(sK26)),X2,X1),sK1(sK24(sK26)),X2)
| ~ '$ki_accessible'(X1,X3)
| qmltpeq(X3,sK27,X2) ) ).
cnf(u1433,negated_conjecture,
'$ki_accessible'(sK12(sK27,sK31),sK18(sK27,sK29,sK12(sK27,sK31))) ).
cnf(u496,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK26),X0)
| '$ki_accessible'(X0,sK2(sK1(sK26),sK1(sK0(sK26)),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,sK1(sK0(sK26)),sK1(sK26)) ) ).
cnf(u1793,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(sK20(sK27,sK1(sK28),X0),X1)
| in(X1,sK27,sK1(sK28))
| ~ '$ki_accessible'(X0,X2)
| disjoint(X2,singleton(sK27),sK1(sK28)) ) ).
cnf(u1031,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X3)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| ~ qmltpeq(sK6(sK27,X3,X1),sK27,X3)
| ~ '$ki_accessible'(X1,X4)
| qmltpeq(X4,set_intersection2(X2,sK27),set_intersection2(X2,X3)) ) ).
cnf(u4447,axiom,
( ~ '$ki_accessible'(sK0(sK0(sK0('$ki_local_world'))),X0)
| '$ki_accessible'(X0,sK4(sK1(sK0('$ki_local_world')),sK1(sK0(sK0('$ki_local_world'))),X0))
| '$ki_accessible'(X0,sK3(sK1(sK0(sK0('$ki_local_world'))),sK1(sK0(sK0(sK0('$ki_local_world')))),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,sK1(sK0('$ki_local_world')),sK1(sK0(sK0(sK0('$ki_local_world'))))) ) ).
cnf(u177,axiom,
( ~ '$ki_accessible'('$ki_local_world',X0)
| ~ '$ki_accessible'(X6,X7)
| '$ki_accessible'(X6,sK16(X1,X5,X6))
| ~ qmltpeq(sK17(X1,X3,X6),X1,X3)
| ~ '$ki_accessible'(X4,X6)
| ~ '$ki_exists_in_world_$i'(X4,X5)
| ~ '$ki_accessible'(X2,X4)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| in(X7,X5,X3) ) ).
cnf(u3420,axiom,
( ~ '$ki_accessible'(sK0('$ki_local_world'),X4)
| ~ qmltpeq(sK9(sK1(sK0('$ki_local_world')),X2,X0),sK1(sK0('$ki_local_world')),X2)
| ~ '$ki_accessible'(X3,X0)
| ~ '$ki_exists_in_world_$i'(X3,X1)
| ~ '$ki_accessible'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X4,X2)
| '$ki_accessible'(X0,sK8(sK1(sK0('$ki_local_world')),X1,X0))
| ~ '$ki_accessible'(X0,X5)
| disjoint(X5,X2,X1) ) ).
cnf(u2253,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK28),X0)
| ~ '$ki_accessible'(sK0(sK28),X1)
| '$ki_accessible'(X1,sK5(sK1(sK26),sK1(sK28),X1))
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,set_intersection2(sK1(sK26),X0),set_intersection2(sK1(sK28),X0)) ) ).
cnf(u3212,axiom,
( ~ '$ki_accessible'(sK0('$ki_local_world'),X4)
| '$ki_accessible'(X0,sK4(sK1(sK0('$ki_local_world')),X1,X0))
| ~ '$ki_accessible'(X3,X0)
| ~ '$ki_exists_in_world_$i'(X3,X2)
| ~ '$ki_accessible'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X4,X1)
| '$ki_accessible'(X0,sK3(X1,X2,X0))
| ~ '$ki_accessible'(X0,X5)
| qmltpeq(X5,sK1(sK0('$ki_local_world')),X2) ) ).
cnf(u628,negated_conjecture,
( ~ qmltpeq(sK7(sK1(sK26),sK1(sK0(sK26)),X0),sK1(sK26),sK1(sK0(sK26)))
| ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,singleton(sK1(sK26)),singleton(sK1(sK0(sK26)))) ) ).
cnf(u3639,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK24(sK26),X2)
| '$ki_accessible'(X0,sK15(sK1(sK26),X1,X0))
| '$ki_accessible'(X0,sK14(sK1(sK26),X3,X0))
| ~ '$ki_accessible'(X0,X4)
| in(X4,X1,X3) ) ).
cnf(u3405,negated_conjecture,
( ~ qmltpeq(sK9(sK27,sK1(sK28),X1),sK27,sK1(sK28))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK8(sK27,X2,X1))
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,sK1(sK28),X2) ) ).
cnf(u420,negated_conjecture,
( ~ '$ki_accessible'(sK26,X2)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X0)
| ~ qmltpeq(sK7(sK1(sK26),X0,X1),sK1(sK26),X0)
| ~ '$ki_accessible'(X1,X3)
| qmltpeq(X3,singleton(sK1(sK26)),singleton(X0)) ) ).
cnf(u3837,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK30,X0)
| ~ '$ki_accessible'(sK30,X1)
| '$ki_accessible'(X1,sK15(sK1(sK26),sK29,X1))
| '$ki_accessible'(X1,sK14(sK1(sK26),X0,X1))
| ~ '$ki_accessible'(X1,X2)
| in(X2,sK29,X0) ) ).
cnf(u1538,negated_conjecture,
( ~ '$ki_accessible'(sK26,X2)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X1)
| '$ki_accessible'(X0,sK21(sK27,X1,X0))
| ~ '$ki_accessible'(X0,X3)
| qmltpeq(X3,set_intersection2(X1,singleton(sK27)),singleton(sK27)) ) ).
cnf(u212,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK26,X3)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK26,X0)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(X3,X3),X3) ) ).
cnf(u3419,negated_conjecture,
( ~ disjoint(sK8(sK27,sK1(sK0(sK28)),X0),sK27,sK1(sK0(sK28)))
| '$ki_accessible'(X0,sK9(sK27,sK29,X0))
| ~ '$ki_accessible'(sK0(sK28),X0)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK29,sK1(sK0(sK28))) ) ).
cnf(u419,negated_conjecture,
( ~ '$ki_accessible'(sK26,X2)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X0)
| ~ qmltpeq(sK7(sK27,X0,X1),sK27,X0)
| ~ '$ki_accessible'(X1,X3)
| qmltpeq(X3,singleton(sK27),singleton(X0)) ) ).
cnf(u3638,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK28,X2)
| '$ki_accessible'(X0,sK15(sK1(sK26),X1,X0))
| '$ki_accessible'(X0,sK14(sK1(sK26),X3,X0))
| ~ '$ki_accessible'(X0,X4)
| in(X4,X1,X3) ) ).
cnf(u2001,negated_conjecture,
( ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ '$ki_accessible'(X0,X2)
| '$ki_accessible'(X2,sK5(sK27,sK1(sK24(sK26)),X2))
| ~ '$ki_accessible'(X2,X3)
| qmltpeq(X3,set_intersection2(sK27,X1),set_intersection2(sK1(sK24(sK26)),X1)) ) ).
cnf(u1239,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK26,X2)
| '$ki_accessible'(X0,sK10(X2,X3,X0))
| '$ki_accessible'(X0,sK11(X2,X4,X0))
| ~ '$ki_accessible'(X5,X0)
| ~ '$ki_exists_in_world_$i'(X5,X3)
| ~ '$ki_accessible'(X6,X5)
| ~ '$ki_exists_in_world_$i'(X6,X4)
| ~ '$ki_accessible'(sK26,X6)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,X3,X4) ) ).
cnf(u801,negated_conjecture,
( ~ empty(sK12(sK1(sK26),X0),sK1(sK26))
| ~ qmltpeq(sK13(sK1(sK26),X1,X0),sK1(sK26),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X1)
| ~ '$ki_accessible'(sK26,X2)
| ~ '$ki_accessible'(X0,X3)
| empty(X3,X1) ) ).
cnf(u150,axiom,
( ~ '$ki_accessible'('$ki_local_world',X0)
| ~ '$ki_accessible'(X6,X7)
| '$ki_accessible'(X6,sK3(X3,X5,X6))
| '$ki_accessible'(X6,sK4(X1,X3,X6))
| ~ '$ki_accessible'(X4,X6)
| ~ '$ki_exists_in_world_$i'(X4,X5)
| ~ '$ki_accessible'(X2,X4)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| qmltpeq(X7,X1,X5) ) ).
cnf(u3641,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK28),X0)
| '$ki_accessible'(X0,sK4(sK1(sK26),sK1(sK28),X0))
| '$ki_accessible'(X0,sK3(sK1(sK28),sK1(sK0(sK28)),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,sK1(sK26),sK1(sK0(sK28))) ) ).
cnf(u380,axiom,
( ~ '$ki_exists_in_world_$i'(sK0('$ki_local_world'),X2)
| '$ki_accessible'(X0,sK19(X2,X3,X0))
| ~ '$ki_accessible'(X4,X0)
| ~ '$ki_exists_in_world_$i'(X4,X3)
| ~ '$ki_accessible'(sK0('$ki_local_world'),X4)
| ~ '$ki_accessible'(X0,X1)
| ~ in(sK18(X2,X3,X1),X3,X2) ) ).
cnf(u343,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK26,X2)
| ~ in(sK19(X2,X3,X0),X2,X3)
| ~ '$ki_accessible'(X4,X0)
| ~ '$ki_exists_in_world_$i'(X4,X3)
| ~ '$ki_accessible'(sK26,X4)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK18(X2,X3,X1)) ) ).
cnf(u1454,negated_conjecture,
( ~ qmltpeq(sK17(sK27,sK1(sK24(sK26)),X1),sK27,sK1(sK24(sK26)))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| ~ in(sK16(sK27,X2,X1),X2,sK27)
| ~ '$ki_accessible'(X1,X3)
| in(X3,X2,sK1(sK24(sK26))) ) ).
cnf(u172,axiom,
( ~ '$ki_accessible'('$ki_local_world',X0)
| ~ '$ki_accessible'(X6,X7)
| '$ki_accessible'(X6,sK14(X1,X5,X6))
| '$ki_accessible'(X6,sK15(X1,X3,X6))
| ~ '$ki_accessible'(X4,X6)
| ~ '$ki_exists_in_world_$i'(X4,X5)
| ~ '$ki_accessible'(X2,X4)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| in(X7,X3,X5) ) ).
cnf(u1556,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK24(sK26),X2)
| ~ qmltpeq(sK11(sK1(sK26),X0,X1),sK1(sK26),X0)
| ~ disjoint(sK10(sK1(sK26),X3,X1),X3,sK1(sK26))
| ~ '$ki_accessible'(X1,X4)
| disjoint(X4,X3,X0) ) ).
cnf(u2012,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ '$ki_accessible'(X0,X2)
| '$ki_accessible'(X2,sK6(sK27,sK29,X2))
| ~ '$ki_accessible'(X2,X3)
| qmltpeq(X3,set_intersection2(X1,sK27),set_intersection2(X1,sK29)) ) ).
cnf(u1348,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X1)
| ~ '$ki_accessible'(sK28,X0)
| '$ki_accessible'(X0,sK13(sK27,X1,X0))
| '$ki_accessible'(X0,sK12(sK27,X0))
| ~ '$ki_accessible'(X0,X2)
| empty(X2,X1) ) ).
cnf(u186,axiom,
( ~ '$ki_accessible'('$ki_local_world',X0)
| ~ '$ki_accessible'(X4,X5)
| '$ki_accessible'(X4,sK20(X1,X3,X4))
| ~ '$ki_accessible'(X2,X4)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| disjoint(X5,singleton(X1),X3) ) ).
cnf(u288,axiom,
( ~ '$ki_exists_in_world_$i'(sK0('$ki_local_world'),X2)
| '$ki_accessible'(X0,sK25(X2,X3,X0))
| ~ '$ki_accessible'(X4,X0)
| ~ '$ki_exists_in_world_$i'(X4,X3)
| ~ '$ki_accessible'(sK0('$ki_local_world'),X4)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,X3,X2) ) ).
cnf(u1002,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X3)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| ~ qmltpeq(sK5(sK27,X3,X1),sK27,X3)
| ~ '$ki_accessible'(X1,X4)
| qmltpeq(X4,set_intersection2(sK27,X2),set_intersection2(X3,X2)) ) ).
cnf(u379,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK26,X2)
| '$ki_accessible'(X0,sK19(X2,X3,X0))
| ~ '$ki_accessible'(X4,X0)
| ~ '$ki_exists_in_world_$i'(X4,X3)
| ~ '$ki_accessible'(sK26,X4)
| ~ '$ki_accessible'(X0,X1)
| ~ in(sK18(X2,X3,X1),X3,X2) ) ).
cnf(u3410,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK0(sK26),X2)
| '$ki_accessible'(X0,sK9(sK27,X1,X0))
| ~ disjoint(sK8(sK27,X3,X0),sK27,X3)
| ~ '$ki_accessible'(X0,X4)
| disjoint(X4,X1,X3) ) ).
cnf(u195,axiom,
( ~ '$ki_accessible'('$ki_local_world',X0)
| ~ '$ki_accessible'(X4,X5)
| '$ki_accessible'(X4,sK25(X1,X3,X4))
| ~ '$ki_accessible'(X2,X4)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| disjoint(X5,X3,X1) ) ).
cnf(u1821,negated_conjecture,
( ~ qmltpeq(sK13(sK1(sK26),sK29,X0),sK1(sK26),sK29)
| ~ '$ki_accessible'(sK28,X0)
| '$ki_accessible'(X0,sK12(sK1(sK26),X0))
| ~ '$ki_accessible'(X0,X1)
| empty(X1,sK29) ) ).
cnf(u3640,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK0(sK26),X2)
| '$ki_accessible'(X0,sK15(sK1(sK26),X1,X0))
| '$ki_accessible'(X0,sK14(sK1(sK26),X3,X0))
| ~ '$ki_accessible'(X0,X4)
| in(X4,X1,X3) ) ).
cnf(u3202,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK0(sK26)),X0)
| '$ki_accessible'(X0,sK17(sK27,sK1(sK0(sK26)),X0))
| '$ki_accessible'(X0,sK16(sK27,sK1(sK0(sK0(sK26))),X0))
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK1(sK0(sK0(sK26))),sK1(sK0(sK26))) ) ).
cnf(u1961,negated_conjecture,
( ~ '$ki_accessible'(sK30,X0)
| '$ki_accessible'(X0,sK5(sK27,sK1(sK28),X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(sK27,sK1(sK30)),set_intersection2(sK1(sK28),sK1(sK30))) ) ).
cnf(u2011,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X3)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK6(sK27,X3,X1))
| ~ '$ki_accessible'(X1,X4)
| qmltpeq(X4,set_intersection2(X2,sK27),set_intersection2(X2,X3)) ) ).
cnf(u273,axiom,
( ~ '$ki_exists_in_world_$i'(sK0('$ki_local_world'),X2)
| ~ qmltpeq(sK2(X2,X3,X0),X2,X3)
| ~ '$ki_accessible'(X4,X0)
| ~ '$ki_exists_in_world_$i'(X4,X3)
| ~ '$ki_accessible'(sK0('$ki_local_world'),X4)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,X3,X2) ) ).
cnf(u3432,negated_conjecture,
( ~ disjoint(sK8(sK27,sK1(sK0(sK24(sK26))),X0),sK27,sK1(sK0(sK24(sK26))))
| '$ki_accessible'(X0,sK9(sK27,sK1(sK24(sK26)),X0))
| ~ '$ki_accessible'(sK0(sK24(sK26)),X0)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK24(sK26)),sK1(sK0(sK24(sK26)))) ) ).
cnf(u1347,negated_conjecture,
( ~ qmltpeq(sK11(sK27,sK1(sK0(sK26)),X1),sK27,sK1(sK0(sK26)))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| ~ disjoint(sK10(sK27,X2,X1),X2,sK27)
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,X2,sK1(sK0(sK26))) ) ).
cnf(u926,negated_conjecture,
( ~ in(sK19(sK1(sK26),sK1(sK0(sK26)),X0),sK1(sK26),sK1(sK0(sK26)))
| ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| ~ in(sK18(sK1(sK26),sK1(sK0(sK26)),X1),sK1(sK0(sK26)),sK1(sK26)) ) ).
cnf(u303,negated_conjecture,
( ~ '$ki_accessible'(sK26,X2)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X0)
| ~ disjoint(sK25(sK1(sK26),X0,X1),sK1(sK26),X0)
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,X0,sK1(sK26)) ) ).
cnf(u3417,negated_conjecture,
( ~ disjoint(sK8(sK27,sK1(sK31),X0),sK27,sK1(sK31))
| '$ki_accessible'(X0,sK9(sK27,sK29,X0))
| ~ '$ki_accessible'(sK31,X0)
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK29,sK1(sK31)) ) ).
cnf(u1206,negated_conjecture,
( ~ '$ki_accessible'(sK24(sK26),X0)
| '$ki_accessible'(X0,sK19(sK27,sK1(sK24(sK26)),X0))
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK18(sK27,sK1(sK24(sK26)),X1)) ) ).
cnf(u4149,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK24(sK26)),X0)
| '$ki_accessible'(X0,sK11(sK1(sK26),sK1(sK24(sK26)),X0))
| '$ki_accessible'(X0,sK10(sK1(sK26),sK1(sK0(sK24(sK26))),X0))
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK0(sK24(sK26))),sK1(sK24(sK26))) ) ).
cnf(u1308,negated_conjecture,
'$ki_accessible'(sK0(sK0(sK28)),sK18(sK1(sK26),sK1(sK28),sK0(sK0(sK28)))) ).
cnf(u3447,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK31,X0)
| ~ '$ki_accessible'(sK31,X1)
| '$ki_accessible'(X1,sK11(sK27,sK29,X1))
| ~ disjoint(sK10(sK27,X0,X1),X0,sK27)
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,X0,sK29) ) ).
cnf(u1764,axiom,
( ~ '$ki_exists_in_world_$i'(sK0(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(sK0(sK0('$ki_local_world')),X0)
| ~ qmltpeq(sK2(sK1(sK0('$ki_local_world')),X1,X0),sK1(sK0('$ki_local_world')),X1)
| ~ '$ki_accessible'(X0,X2)
| qmltpeq(X2,X1,sK1(sK0('$ki_local_world'))) ) ).
cnf(u629,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK26,X2)
| ~ empty(sK12(X2,X0),X2)
| '$ki_accessible'(X0,sK13(X2,X3,X0))
| ~ '$ki_accessible'(X4,X0)
| ~ '$ki_exists_in_world_$i'(X4,X3)
| ~ '$ki_accessible'(sK26,X4)
| ~ '$ki_accessible'(X0,X1)
| empty(X1,X3) ) ).
cnf(u1100,negated_conjecture,
( ~ '$ki_accessible'(sK26,X4)
| ~ qmltpeq(sK17(sK1(sK26),X2,X1),sK1(sK26),X2)
| ~ '$ki_accessible'(X3,X1)
| ~ '$ki_exists_in_world_$i'(X3,X0)
| ~ '$ki_accessible'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X4,X2)
| ~ in(sK16(sK1(sK26),X0,X1),X0,sK1(sK26))
| ~ '$ki_accessible'(X1,X5)
| in(X5,X0,X2) ) ).
cnf(u2727,negated_conjecture,
( ~ '$ki_accessible'(sK0(sK24(sK26)),X0)
| '$ki_accessible'(X0,sK9(sK27,sK1(sK24(sK26)),X0))
| '$ki_accessible'(X0,sK8(sK27,sK1(sK0(sK24(sK26))),X0))
| ~ '$ki_accessible'(X0,X1)
| disjoint(X1,sK1(sK24(sK26)),sK1(sK0(sK24(sK26)))) ) ).
cnf(u834,negated_conjecture,
( ~ in(sK21(sK27,sK1(sK24(sK26)),X0),sK27,sK1(sK24(sK26)))
| ~ '$ki_accessible'(sK24(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,set_intersection2(sK1(sK24(sK26)),singleton(sK27)),singleton(sK27)) ) ).
cnf(u933,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X1)
| ~ '$ki_accessible'(sK24(sK26),X0)
| ~ in(sK21(sK1(sK26),X1,X0),sK1(sK26),X1)
| ~ '$ki_accessible'(X0,X2)
| qmltpeq(X2,set_intersection2(X1,singleton(sK1(sK26))),singleton(sK1(sK26))) ) ).
cnf(u1539,negated_conjecture,
( ~ '$ki_accessible'(sK26,X2)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X1)
| '$ki_accessible'(X0,sK21(sK1(sK26),X1,X0))
| ~ '$ki_accessible'(X0,X3)
| qmltpeq(X3,set_intersection2(X1,singleton(sK1(sK26))),singleton(sK1(sK26))) ) ).
cnf(u155,axiom,
( ~ '$ki_accessible'('$ki_local_world',X0)
| ~ '$ki_accessible'(X6,X7)
| ~ qmltpeq(sK5(X1,X3,X6),X1,X3)
| ~ '$ki_accessible'(X4,X6)
| ~ '$ki_exists_in_world_$i'(X4,X5)
| ~ '$ki_accessible'(X2,X4)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| qmltpeq(X7,set_intersection2(X1,X5),set_intersection2(X3,X5)) ) ).
cnf(u1237,negated_conjecture,
( ~ qmltpeq(sK4(sK27,sK29,X1),sK27,sK29)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| ~ qmltpeq(sK3(sK29,X2,X1),sK29,X2)
| ~ '$ki_accessible'(X1,X3)
| qmltpeq(X3,sK27,X2) ) ).
cnf(u3928,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK28,X2)
| '$ki_accessible'(X0,sK11(sK1(sK26),X1,X0))
| ~ disjoint(sK10(sK1(sK26),X3,X0),X3,sK1(sK26))
| ~ '$ki_accessible'(X0,X4)
| disjoint(X4,X3,X1) ) ).
cnf(u1307,negated_conjecture,
'$ki_accessible'(sK0(sK30),sK18(sK1(sK26),sK1(sK28),sK0(sK30))) ).
cnf(u2389,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK30,X0)
| ~ '$ki_accessible'(sK30,X1)
| '$ki_accessible'(X1,sK6(sK1(sK26),sK1(sK28),X1))
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,set_intersection2(X0,sK1(sK26)),set_intersection2(X0,sK1(sK28))) ) ).
cnf(u1038,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| '$ki_accessible'(X0,sK7(sK1(sK26),sK29,X0))
| ~ '$ki_accessible'(X0,X1)
| qmltpeq(X1,singleton(sK1(sK26)),singleton(sK29)) ) ).
cnf(u4198,negated_conjecture,
( ~ qmltpeq(sK4(sK1(sK26),sK1(sK0(sK26)),X1),sK1(sK26),sK1(sK0(sK26)))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK0(sK26),X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK3(sK1(sK0(sK26)),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| qmltpeq(X3,sK1(sK26),X2) ) ).
cnf(u1982,negated_conjecture,
( ~ '$ki_accessible'(sK26,X4)
| '$ki_accessible'(X0,sK4(sK1(sK26),X1,X0))
| ~ '$ki_accessible'(X3,X0)
| ~ '$ki_exists_in_world_$i'(X3,X2)
| ~ '$ki_accessible'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X4,X1)
| '$ki_accessible'(X0,sK3(X1,X2,X0))
| ~ '$ki_accessible'(X0,X5)
| qmltpeq(X5,sK1(sK26),X2) ) ).
cnf(u1774,negated_conjecture,
( ~ qmltpeq(sK13(sK27,sK1(sK0(sK26)),X0),sK27,sK1(sK0(sK26)))
| ~ '$ki_accessible'(sK0(sK26),X0)
| '$ki_accessible'(X0,sK12(sK27,X0))
| ~ '$ki_accessible'(X0,X1)
| empty(X1,sK1(sK0(sK26))) ) ).
cnf(u4220,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK0(sK26)),X0)
| ~ '$ki_accessible'(sK0(sK0(sK26)),X1)
| '$ki_accessible'(X1,sK9(sK1(sK26),sK1(sK0(sK26)),X1))
| ~ disjoint(sK8(sK1(sK26),X0,X1),sK1(sK26),X0)
| ~ '$ki_accessible'(X1,X2)
| disjoint(X2,sK1(sK0(sK26)),X0) ) ).
cnf(u2729,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK28,X2)
| '$ki_accessible'(X0,sK11(sK27,X1,X0))
| '$ki_accessible'(X0,sK10(sK27,X3,X0))
| ~ '$ki_accessible'(X0,X4)
| disjoint(X4,X3,X1) ) ).
cnf(u3527,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK28,X1)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK28,X2)
| '$ki_accessible'(X0,sK9(sK1(sK26),X1,X0))
| '$ki_accessible'(X0,sK8(sK1(sK26),X3,X0))
| ~ '$ki_accessible'(X0,X4)
| disjoint(X4,X1,X3) ) ).
cnf(u3135,axiom,
( ~ '$ki_accessible'(sK0('$ki_local_world'),X4)
| ~ '$ki_accessible'(X2,X0)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(X4,X2)
| ~ '$ki_exists_in_world_$i'(X4,X1)
| '$ki_accessible'(X0,sK5(sK1(sK0('$ki_local_world')),X1,X0))
| ~ '$ki_accessible'(X0,X5)
| qmltpeq(X5,set_intersection2(sK1(sK0('$ki_local_world')),X3),set_intersection2(X1,X3)) ) ).
cnf(u2327,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK30,X0)
| ~ '$ki_accessible'(sK30,X1)
| '$ki_accessible'(X1,sK6(sK1(sK26),sK29,X1))
| ~ '$ki_accessible'(X1,X2)
| qmltpeq(X2,set_intersection2(X0,sK1(sK26)),set_intersection2(X0,sK29)) ) ).
cnf(u3438,negated_conjecture,
( ~ qmltpeq(sK11(sK27,sK1(sK28),X1),sK27,sK1(sK28))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK10(sK27,X2,X1))
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,X2,sK1(sK28)) ) ).
cnf(u1557,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK0(sK26),X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK0(sK26),X2)
| ~ qmltpeq(sK11(sK1(sK26),X0,X1),sK1(sK26),X0)
| ~ disjoint(sK10(sK1(sK26),X3,X1),X3,sK1(sK26))
| ~ '$ki_accessible'(X1,X4)
| disjoint(X4,X3,X0) ) ).
cnf(u4106,negated_conjecture,
( ~ in(sK14(sK1(sK26),sK1(sK31),X0),sK1(sK26),sK1(sK31))
| '$ki_accessible'(X0,sK15(sK1(sK26),sK1(sK28),X0))
| ~ '$ki_accessible'(sK31,X0)
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK1(sK28),sK1(sK31)) ) ).
cnf(u3938,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK30,X0)
| ~ '$ki_accessible'(sK30,X1)
| '$ki_accessible'(X1,sK17(sK1(sK26),sK1(sK28),X1))
| '$ki_accessible'(X1,sK16(sK1(sK26),X0,X1))
| ~ '$ki_accessible'(X1,X2)
| in(X2,X0,sK1(sK28)) ) ).
cnf(u1861,axiom,
( ~ qmltpeq(sK15(sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))),X1),sK1(sK0('$ki_local_world')),sK1(sK24(sK0('$ki_local_world'))))
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(sK24(sK0('$ki_local_world')),X0)
| ~ '$ki_accessible'(X0,X1)
| ~ in(sK14(sK1(sK0('$ki_local_world')),X2,X1),sK1(sK0('$ki_local_world')),X2)
| ~ '$ki_accessible'(X1,X3)
| in(X3,sK1(sK24(sK0('$ki_local_world'))),X2) ) ).
cnf(u1211,negated_conjecture,
( ~ '$ki_exists_in_world_$i'(sK24(sK26),X0)
| ~ '$ki_accessible'(X2,X1)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(sK24(sK26),X2)
| ~ qmltpeq(sK4(sK27,X0,X1),sK27,X0)
| ~ qmltpeq(sK3(X0,X3,X1),X0,X3)
| ~ '$ki_accessible'(X1,X4)
| qmltpeq(X4,sK27,X3) ) ).
cnf(u2293,negated_conjecture,
( ~ '$ki_accessible'(sK26,X4)
| ~ qmltpeq(sK9(sK27,X2,X0),sK27,X2)
| ~ '$ki_accessible'(X3,X0)
| ~ '$ki_exists_in_world_$i'(X3,X1)
| ~ '$ki_accessible'(X4,X3)
| ~ '$ki_exists_in_world_$i'(X4,X2)
| '$ki_accessible'(X0,sK8(sK27,X1,X0))
| ~ '$ki_accessible'(X0,X5)
| disjoint(X5,X2,X1) ) ).
cnf(u4128,negated_conjecture,
( ~ in(sK16(sK1(sK26),sK1(sK0(sK28)),X0),sK1(sK0(sK28)),sK1(sK26))
| '$ki_accessible'(X0,sK17(sK1(sK26),sK1(sK28),X0))
| ~ '$ki_accessible'(sK0(sK28),X0)
| ~ '$ki_accessible'(X0,X1)
| in(X1,sK1(sK0(sK28)),sK1(sK28)) ) ).
cnf(u3920,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK17(sK1(sK26),sK29,X1))
| '$ki_accessible'(X1,sK16(sK1(sK26),X2,X1))
| ~ '$ki_accessible'(X1,X3)
| in(X3,X2,sK29) ) ).
cnf(u3445,negated_conjecture,
( ~ '$ki_accessible'(sK28,X0)
| ~ '$ki_exists_in_world_$i'(X0,X2)
| ~ '$ki_accessible'(X0,X1)
| '$ki_accessible'(X1,sK11(sK27,sK29,X1))
| ~ disjoint(sK10(sK27,X2,X1),X2,sK27)
| ~ '$ki_accessible'(X1,X3)
| disjoint(X3,X2,sK29) ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : LCL966_9 : 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 file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.13/0.34 % Computer : n003.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 02:16:37 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.34 This is a TF0_CSA_NEQ_NAR problem
% 0.13/0.34 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.53/0.76 % (21258)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.53/0.76 % (21259)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2995ds/33Mi)
% 0.53/0.76 % (21260)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on theBenchmark for (2995ds/34Mi)
% 0.53/0.76 % (21261)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2995ds/45Mi)
% 0.53/0.76 % (21262)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on theBenchmark for (2995ds/83Mi)
% 0.53/0.77 % (21263)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2995ds/56Mi)
% 0.53/0.77 % (21256)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on theBenchmark for (2995ds/34Mi)
% 0.53/0.77 % (21261)Refutation not found, incomplete strategy% (21261)------------------------------
% 0.53/0.77 % (21261)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.53/0.77 % (21261)Termination reason: Refutation not found, incomplete strategy
% 0.53/0.77
% 0.53/0.77 % (21261)Memory used [KB]: 1192
% 0.53/0.77 % (21261)Time elapsed: 0.004 s
% 0.53/0.77 % (21261)Instructions burned: 6 (million)
% 0.53/0.77 % (21261)------------------------------
% 0.53/0.77 % (21261)------------------------------
% 0.53/0.77 % (21259)Refutation not found, incomplete strategy% (21259)------------------------------
% 0.53/0.77 % (21259)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.53/0.77 % (21259)Termination reason: Refutation not found, incomplete strategy
% 0.53/0.77
% 0.53/0.77 % (21259)Memory used [KB]: 1217
% 0.53/0.77 % (21259)Time elapsed: 0.007 s
% 0.53/0.77 % (21259)Instructions burned: 11 (million)
% 0.53/0.77 % (21259)------------------------------
% 0.53/0.77 % (21259)------------------------------
% 0.61/0.77 % (21257)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on theBenchmark for (2995ds/51Mi)
% 0.61/0.77 % (21264)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on theBenchmark for (2995ds/55Mi)
% 0.61/0.78 % (21264)Refutation not found, incomplete strategy% (21264)------------------------------
% 0.61/0.78 % (21264)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.78 % (21264)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.78
% 0.61/0.78 % (21264)Memory used [KB]: 1266
% 0.61/0.78 % (21264)Time elapsed: 0.008 s
% 0.61/0.78 % (21264)Instructions burned: 15 (million)
% 0.61/0.78 % (21264)------------------------------
% 0.61/0.78 % (21264)------------------------------
% 0.61/0.78 % (21260)Instruction limit reached!
% 0.61/0.78 % (21260)------------------------------
% 0.61/0.78 % (21260)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.78 % (21260)Termination reason: Unknown
% 0.61/0.78 % (21260)Termination phase: Saturation
% 0.61/0.78
% 0.61/0.78 % (21260)Memory used [KB]: 1534
% 0.61/0.78 % (21260)Time elapsed: 0.018 s
% 0.61/0.78 % (21260)Instructions burned: 34 (million)
% 0.61/0.78 % (21260)------------------------------
% 0.61/0.78 % (21260)------------------------------
% 0.61/0.78 % (21265)dis+3_25:4_sil=16000:sos=all:erd=off:i=50:s2at=4.0:bd=off:nm=60:sup=off:cond=on:av=off:ins=2:nwc=10.0:etr=on:to=lpo:s2agt=20:fd=off:bsr=unit_only:slsq=on:slsqr=28,19:awrs=converge:awrsf=500:tgt=ground:bs=unit_only_0 on theBenchmark for (2995ds/50Mi)
% 0.61/0.78 % (21257)Refutation not found, incomplete strategy% (21257)------------------------------
% 0.61/0.78 % (21257)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.78 % (21257)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.78
% 0.61/0.78 % (21257)Memory used [KB]: 1364
% 0.61/0.78 % (21257)Time elapsed: 0.012 s
% 0.61/0.78 % (21257)Instructions burned: 23 (million)
% 0.61/0.78 % (21258)Instruction limit reached!
% 0.61/0.78 % (21258)------------------------------
% 0.61/0.78 % (21258)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.78 % (21258)Termination reason: Unknown
% 0.61/0.78 % (21258)Termination phase: Saturation
% 0.61/0.78
% 0.61/0.78 % (21258)Memory used [KB]: 1570
% 0.61/0.78 % (21258)Time elapsed: 0.019 s
% 0.61/0.78 % (21258)Instructions burned: 78 (million)
% 0.61/0.78 % (21258)------------------------------
% 0.61/0.78 % (21258)------------------------------
% 0.61/0.78 % (21257)------------------------------
% 0.61/0.78 % (21257)------------------------------
% 0.61/0.78 % (21256)Instruction limit reached!
% 0.61/0.78 % (21256)------------------------------
% 0.61/0.78 % (21256)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.78 % (21256)Termination reason: Unknown
% 0.61/0.78 % (21256)Termination phase: Saturation
% 0.61/0.78
% 0.61/0.78 % (21256)Memory used [KB]: 1362
% 0.61/0.78 % (21256)Time elapsed: 0.020 s
% 0.61/0.78 % (21256)Instructions burned: 35 (million)
% 0.61/0.78 % (21256)------------------------------
% 0.61/0.78 % (21256)------------------------------
% 0.61/0.78 % (21267)lrs-1011_1:1_sil=4000:plsq=on:plsqr=32,1:sp=frequency:plsql=on:nwc=10.0:i=52:aac=none:afr=on:ss=axioms:er=filter:sgt=16:rawr=on:etr=on:lma=on_0 on theBenchmark for (2995ds/52Mi)
% 0.61/0.78 % (21268)lrs-1010_1:1_to=lpo:sil=2000:sp=reverse_arity:sos=on:urr=ec_only:i=518:sd=2:bd=off:ss=axioms:sgt=16_0 on theBenchmark for (2995ds/518Mi)
% 0.61/0.79 % (21266)lrs+1010_1:2_sil=4000:tgt=ground:nwc=10.0:st=2.0:i=208:sd=1:bd=off:ss=axioms_0 on theBenchmark for (2995ds/208Mi)
% 0.61/0.79 % (21263)Instruction limit reached!
% 0.61/0.79 % (21263)------------------------------
% 0.61/0.79 % (21263)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.79 % (21263)Termination reason: Unknown
% 0.61/0.79 % (21263)Termination phase: Saturation
% 0.61/0.79
% 0.61/0.79 % (21263)Memory used [KB]: 1392
% 0.61/0.79 % (21263)Time elapsed: 0.024 s
% 0.61/0.79 % (21263)Instructions burned: 58 (million)
% 0.61/0.79 % (21263)------------------------------
% 0.61/0.79 % (21263)------------------------------
% 0.61/0.79 % (21270)dis+1011_1258907:1048576_bsr=unit_only:to=lpo:drc=off:sil=2000:tgt=full:fde=none:sp=frequency:spb=goal:rnwc=on:nwc=6.70083:sac=on:newcnf=on:st=2:i=243:bs=unit_only:sd=3:afp=300:awrs=decay:awrsf=218:nm=16:ins=3:afq=3.76821:afr=on:ss=axioms:sgt=5:rawr=on:add=off:bsd=on_0 on theBenchmark for (2995ds/243Mi)
% 0.61/0.79 % (21269)lrs+1011_87677:1048576_sil=8000:sos=on:spb=non_intro:nwc=10.0:kmz=on:i=42:ep=RS:nm=0:ins=1:uhcvi=on:rawr=on:fde=unused:afp=2000:afq=1.444:plsq=on:nicw=on_0 on theBenchmark for (2995ds/42Mi)
% 0.61/0.79 % (21268)Refutation not found, incomplete strategy% (21268)------------------------------
% 0.61/0.79 % (21268)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.79 % (21268)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.79
% 0.61/0.79 % (21268)Memory used [KB]: 1370
% 0.61/0.79 % (21268)Time elapsed: 0.007 s
% 0.61/0.79 % (21268)Instructions burned: 22 (million)
% 0.61/0.79 % (21268)------------------------------
% 0.61/0.79 % (21268)------------------------------
% 0.61/0.79 % (21271)lrs+1011_2:9_sil=2000:lsd=10:newcnf=on:i=117:sd=2:awrs=decay:ss=included:amm=off:ep=R_0 on theBenchmark for (2995ds/117Mi)
% 0.61/0.79 % (21272)dis+1011_11:1_sil=2000:avsq=on:i=143:avsqr=1,16:ep=RS:rawr=on:aac=none:lsd=100:mep=off:fde=none:newcnf=on:bsr=unit_only_0 on theBenchmark for (2995ds/143Mi)
% 0.61/0.80 % (21269)Refutation not found, incomplete strategy% (21269)------------------------------
% 0.61/0.80 % (21269)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.80 % (21269)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.80
% 0.61/0.80 % (21269)Memory used [KB]: 1274
% 0.61/0.80 % (21269)Time elapsed: 0.008 s
% 0.61/0.80 % (21269)Instructions burned: 13 (million)
% 0.61/0.80 % (21269)------------------------------
% 0.61/0.80 % (21269)------------------------------
% 0.61/0.80 % (21271)Refutation not found, incomplete strategy% (21271)------------------------------
% 0.61/0.80 % (21271)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.80 % (21271)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.80
% 0.61/0.80 % (21271)Memory used [KB]: 1247
% 0.61/0.80 % (21271)Time elapsed: 0.008 s
% 0.61/0.80 % (21271)Instructions burned: 14 (million)
% 0.61/0.80 % (21270)Refutation not found, incomplete strategy% (21270)------------------------------
% 0.61/0.80 % (21270)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.80 % (21271)------------------------------
% 0.61/0.80 % (21271)------------------------------
% 0.61/0.80 % (21270)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.80
% 0.61/0.80 % (21270)Memory used [KB]: 1278
% 0.61/0.80 % (21270)Time elapsed: 0.014 s
% 0.61/0.80 % (21270)Instructions burned: 23 (million)
% 0.61/0.80 % (21273)lrs+1011_1:2_to=lpo:sil=8000:plsqc=1:plsq=on:plsqr=326,59:sp=weighted_frequency:plsql=on:nwc=10.0:newcnf=on:i=93:awrs=converge:awrsf=200:bd=off:ins=1:rawr=on:alpa=false:avsq=on:avsqr=1,16_0 on theBenchmark for (2995ds/93Mi)
% 0.61/0.80 % (21270)------------------------------
% 0.61/0.80 % (21270)------------------------------
% 0.61/0.80 % (21262)Instruction limit reached!
% 0.61/0.80 % (21262)------------------------------
% 0.61/0.80 % (21262)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.80 % (21262)Termination reason: Unknown
% 0.61/0.80 % (21262)Termination phase: Saturation
% 0.61/0.80
% 0.61/0.80 % (21262)Memory used [KB]: 2720
% 0.61/0.80 % (21262)Time elapsed: 0.040 s
% 0.61/0.80 % (21262)Instructions burned: 83 (million)
% 0.61/0.80 % (21262)------------------------------
% 0.61/0.80 % (21262)------------------------------
% 0.61/0.80 % (21265)Instruction limit reached!
% 0.61/0.80 % (21265)------------------------------
% 0.61/0.80 % (21265)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.80 % (21265)Termination reason: Unknown
% 0.61/0.80 % (21265)Termination phase: Saturation
% 0.61/0.80
% 0.61/0.80 % (21265)Memory used [KB]: 1604
% 0.61/0.80 % (21265)Time elapsed: 0.024 s
% 0.61/0.80 % (21265)Instructions burned: 51 (million)
% 0.61/0.80 % (21265)------------------------------
% 0.61/0.80 % (21265)------------------------------
% 0.61/0.80 % (21274)lrs+1666_1:1_sil=4000:sp=occurrence:sos=on:urr=on:newcnf=on:i=62:amm=off:ep=R:erd=off:nm=0:plsq=on:plsqr=14,1_0 on theBenchmark for (2995ds/62Mi)
% 0.61/0.81 % (21275)lrs+21_2461:262144_anc=none:drc=off:sil=2000:sp=occurrence:nwc=6.0:updr=off:st=3.0:i=32:sd=2:afp=4000:erml=3:nm=14:afq=2.0:uhcvi=on:ss=included:er=filter:abs=on:nicw=on:ile=on:sims=off:s2a=on:s2agt=50:s2at=-1.0:plsq=on:plsql=on:plsqc=2:plsqr=1,32:newcnf=on:bd=off:to=lpo_0 on theBenchmark for (2995ds/32Mi)
% 0.61/0.81 % (21276)dis+1011_1:1_sil=16000:nwc=7.0:s2agt=64:s2a=on:i=1919:ss=axioms:sgt=8:lsd=50:sd=7_0 on theBenchmark for (2995ds/1919Mi)
% 0.61/0.81 % (21267)Instruction limit reached!
% 0.61/0.81 % (21267)------------------------------
% 0.61/0.81 % (21267)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.81 % (21267)Termination reason: Unknown
% 0.61/0.81 % (21267)Termination phase: Saturation
% 0.61/0.81
% 0.61/0.81 % (21267)Memory used [KB]: 1676
% 0.61/0.81 % (21267)Time elapsed: 0.029 s
% 0.61/0.81 % (21267)Instructions burned: 53 (million)
% 0.61/0.81 % (21267)------------------------------
% 0.61/0.81 % (21267)------------------------------
% 0.61/0.81 % (21278)lrs-1011_1:1_sil=2000:sos=on:urr=on:i=53:sd=1:bd=off:ins=3:av=off:ss=axioms:sgt=16:gsp=on:lsd=10_0 on theBenchmark for (2995ds/53Mi)
% 0.61/0.82 % (21275)Instruction limit reached!
% 0.61/0.82 % (21275)------------------------------
% 0.61/0.82 % (21275)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.82 % (21275)Termination reason: Unknown
% 0.61/0.82 % (21275)Termination phase: Saturation
% 0.61/0.82
% 0.61/0.82 % (21275)Memory used [KB]: 1613
% 0.61/0.82 % (21275)Time elapsed: 0.018 s
% 0.61/0.82 % (21275)Instructions burned: 33 (million)
% 0.61/0.82 % (21275)------------------------------
% 0.61/0.82 % (21275)------------------------------
% 0.61/0.82 % (21277)ott-32_5:1_sil=4000:sp=occurrence:urr=full:rp=on:nwc=5.0:newcnf=on:st=5.0:s2pl=on:i=55:sd=2:ins=2:ss=included:rawr=on:anc=none:sos=on:s2agt=8:spb=intro:ep=RS:avsq=on:avsqr=27,155:lma=on_0 on theBenchmark for (2995ds/55Mi)
% 0.61/0.83 % (21279)lrs+1011_6929:65536_anc=all_dependent:sil=2000:fde=none:plsqc=1:plsq=on:plsqr=19,8:plsql=on:nwc=3.0:i=46:afp=4000:ep=R:nm=3:fsr=off:afr=on:aer=off:gsp=on_0 on theBenchmark for (2995ds/46Mi)
% 0.61/0.83 % (21272)Instruction limit reached!
% 0.61/0.83 % (21272)------------------------------
% 0.61/0.83 % (21272)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.83 % (21272)Termination reason: Unknown
% 0.61/0.83 % (21272)Termination phase: Saturation
% 0.61/0.83
% 0.61/0.83 % (21272)Memory used [KB]: 2087
% 0.61/0.83 % (21272)Time elapsed: 0.038 s
% 0.61/0.83 % (21272)Instructions burned: 147 (million)
% 0.61/0.83 % (21272)------------------------------
% 0.61/0.83 % (21272)------------------------------
% 0.61/0.83 % (21274)Instruction limit reached!
% 0.61/0.83 % (21274)------------------------------
% 0.61/0.83 % (21274)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.83 % (21274)Termination reason: Unknown
% 0.61/0.83 % (21274)Termination phase: Saturation
% 0.61/0.83
% 0.61/0.83 % (21274)Memory used [KB]: 1875
% 0.61/0.83 % (21274)Time elapsed: 0.029 s
% 0.61/0.83 % (21274)Instructions burned: 63 (million)
% 0.61/0.83 % (21274)------------------------------
% 0.61/0.83 % (21274)------------------------------
% 0.61/0.83 % (21280)dis+10_3:31_sil=2000:sp=frequency:abs=on:acc=on:lcm=reverse:nwc=3.0:alpa=random:st=3.0:i=102:sd=1:nm=4:ins=1:aer=off:ss=axioms_0 on theBenchmark for (2995ds/102Mi)
% 0.61/0.83 % (21281)ott+1011_9:29_slsqr=3,2:sil=2000:tgt=ground:lsd=10:lcm=predicate:avsqc=4:slsq=on:avsq=on:i=35:s2at=4.0:add=large:sd=1:avsqr=1,16:aer=off:ss=axioms:sgt=100:rawr=on:s2a=on:sac=on:afp=1:nwc=10.0:nm=64:bd=preordered:abs=on:rnwc=on:er=filter:nicw=on:spb=non_intro:lma=on_0 on theBenchmark for (2995ds/35Mi)
% 0.61/0.84 % (21273)Instruction limit reached!
% 0.61/0.84 % (21273)------------------------------
% 0.61/0.84 % (21273)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.84 % (21273)Termination reason: Unknown
% 0.61/0.84 % (21273)Termination phase: Saturation
% 0.61/0.84
% 0.61/0.84 % (21273)Memory used [KB]: 1698
% 0.61/0.84 % (21273)Time elapsed: 0.038 s
% 0.61/0.84 % (21273)Instructions burned: 94 (million)
% 0.61/0.84 % (21273)------------------------------
% 0.61/0.84 % (21273)------------------------------
% 0.61/0.84 % (21278)Instruction limit reached!
% 0.61/0.84 % (21278)------------------------------
% 0.61/0.84 % (21278)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.84 % (21278)Termination reason: Unknown
% 0.61/0.84 % (21278)Termination phase: Saturation
% 0.61/0.84
% 0.61/0.84 % (21278)Memory used [KB]: 2127
% 0.61/0.84 % (21278)Time elapsed: 0.025 s
% 0.61/0.84 % (21278)Instructions burned: 54 (million)
% 0.61/0.84 % (21278)------------------------------
% 0.61/0.84 % (21278)------------------------------
% 0.61/0.84 % (21283)dis+1010_12107:524288_anc=none:drc=encompass:sil=2000:bsd=on:rp=on:nwc=10.0:alpa=random:i=109:kws=precedence:awrs=decay:awrsf=2:nm=16:ins=3:rawr=on:s2a=on:s2at=4.5:acc=on:flr=on_0 on theBenchmark for (2995ds/109Mi)
% 0.61/0.84 % (21282)dis+1003_1:1024_sil=4000:urr=on:newcnf=on:i=87:av=off:fsr=off:bce=on_0 on theBenchmark for (2995ds/87Mi)
% 0.61/0.85 % (21281)Instruction limit reached!
% 0.61/0.85 % (21281)------------------------------
% 0.61/0.85 % (21281)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.85 % (21281)Termination reason: Unknown
% 0.61/0.85 % (21281)Termination phase: Saturation
% 0.61/0.85
% 0.61/0.85 % (21281)Memory used [KB]: 1481
% 0.61/0.85 % (21281)Time elapsed: 0.013 s
% 0.61/0.85 % (21281)Instructions burned: 36 (million)
% 0.61/0.85 % (21281)------------------------------
% 0.61/0.85 % (21281)------------------------------
% 0.61/0.85 % (21279)Refutation not found, incomplete strategy% (21279)------------------------------
% 0.61/0.85 % (21279)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.85 % (21279)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.85
% 0.61/0.85 % (21279)Memory used [KB]: 1523
% 0.61/0.85 % (21279)Time elapsed: 0.020 s
% 0.61/0.85 % (21279)Instructions burned: 40 (million)
% 0.61/0.85 % (21279)------------------------------
% 0.61/0.85 % (21279)------------------------------
% 0.61/0.85 % (21284)lrs+1002_1:16_sil=2000:sp=occurrence:sos=on:i=161:aac=none:bd=off:ss=included:sd=5:st=2.5:sup=off_0 on theBenchmark for (2995ds/161Mi)
% 0.61/0.85 % (21277)Instruction limit reached!
% 0.61/0.85 % (21277)------------------------------
% 0.61/0.85 % (21277)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.85 % (21277)Termination reason: Unknown
% 0.61/0.85 % (21277)Termination phase: Saturation
% 0.61/0.85
% 0.61/0.85 % (21277)Memory used [KB]: 1757
% 0.61/0.85 % (21277)Time elapsed: 0.059 s
% 0.61/0.85 % (21277)Instructions burned: 56 (million)
% 0.61/0.85 % (21277)------------------------------
% 0.61/0.85 % (21277)------------------------------
% 0.61/0.85 % (21284)Refutation not found, incomplete strategy% (21284)------------------------------
% 0.61/0.85 % (21284)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.85 % (21284)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.85
% 0.61/0.85 % (21284)Memory used [KB]: 1196
% 0.61/0.85 % (21284)Time elapsed: 0.002 s
% 0.61/0.85 % (21284)Instructions burned: 6 (million)
% 0.61/0.85 % (21284)------------------------------
% 0.61/0.85 % (21284)------------------------------
% 0.61/0.85 % (21285)lrs-1002_2:9_anc=none:sil=2000:plsqc=1:plsq=on:avsql=on:plsqr=2859761,1048576:erd=off:rp=on:nwc=21.7107:newcnf=on:avsq=on:i=69:aac=none:avsqr=6317,1048576:ep=RS:fsr=off:rawr=on:afp=50:afq=2.133940627822616:sac=on_0 on theBenchmark for (2994ds/69Mi)
% 0.61/0.85 % (21287)ott+1011_1:3_drc=off:sil=4000:tgt=ground:fde=unused:plsq=on:sp=unary_first:fd=preordered:nwc=10.0:i=360:ins=1:rawr=on:bd=preordered_0 on theBenchmark for (2994ds/360Mi)
% 0.61/0.85 % (21286)lrs+1010_1:512_sil=8000:tgt=ground:spb=units:gs=on:lwlo=on:nicw=on:gsem=on:st=1.5:i=40:nm=21:ss=included:nwc=5.3:afp=4000:afq=1.38:ins=1:bs=unit_only:awrs=converge:awrsf=10:bce=on_0 on theBenchmark for (2994ds/40Mi)
% 0.61/0.86 % (21280)Instruction limit reached!
% 0.61/0.86 % (21280)------------------------------
% 0.61/0.86 % (21280)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.86 % (21280)Termination reason: Unknown
% 0.61/0.86 % (21280)Termination phase: Saturation
% 0.61/0.86
% 0.61/0.86 % (21280)Memory used [KB]: 1824
% 0.61/0.86 % (21280)Time elapsed: 0.026 s
% 0.61/0.86 % (21280)Instructions burned: 102 (million)
% 0.61/0.86 % (21280)------------------------------
% 0.61/0.86 % (21280)------------------------------
% 0.61/0.86 % (21288)dis+10_1:4_to=lpo:sil=2000:sos=on:spb=goal:rp=on:sac=on:newcnf=on:i=161:ss=axioms:aac=none_0 on theBenchmark for (2994ds/161Mi)
% 1.11/0.87 % (21266)Instruction limit reached!
% 1.11/0.87 % (21266)------------------------------
% 1.11/0.87 % (21266)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 1.11/0.87 % (21266)Termination reason: Unknown
% 1.11/0.87 % (21266)Termination phase: Saturation
% 1.11/0.87
% 1.11/0.87 % (21266)Memory used [KB]: 2127
% 1.11/0.87 % (21266)Time elapsed: 0.087 s
% 1.11/0.87 % (21266)Instructions burned: 208 (million)
% 1.11/0.87 % (21266)------------------------------
% 1.11/0.87 % (21266)------------------------------
% 1.11/0.87 % (21286)Instruction limit reached!
% 1.11/0.87 % (21286)------------------------------
% 1.11/0.87 % (21286)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 1.11/0.87 % (21286)Termination reason: Unknown
% 1.11/0.87 % (21286)Termination phase: Saturation
% 1.11/0.87
% 1.11/0.87 % (21286)Memory used [KB]: 1682
% 1.11/0.87 % (21286)Time elapsed: 0.022 s
% 1.11/0.87 % (21286)Instructions burned: 40 (million)
% 1.11/0.87 % (21286)------------------------------
% 1.11/0.87 % (21286)------------------------------
% 1.11/0.88 % (21290)lrs+11_1:2_slsqr=1,2:sil=2000:sp=const_frequency:kmz=on:newcnf=on:slsq=on:i=37:s2at=1.5:awrs=converge:nm=2:uhcvi=on:ss=axioms:sgt=20:afp=10000:fs=off:fsr=off:bd=off:s2agt=5:fd=off:add=off:erd=off:foolp=on:nwc=10.0:rp=on_0 on theBenchmark for (2994ds/37Mi)
% 1.11/0.88 % (21285)Instruction limit reached!
% 1.11/0.88 % (21285)------------------------------
% 1.11/0.88 % (21285)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 1.11/0.88 % (21285)Termination reason: Unknown
% 1.11/0.88 % (21285)Termination phase: Saturation
% 1.11/0.88
% 1.11/0.88 % (21285)Memory used [KB]: 1773
% 1.11/0.88 % (21285)Time elapsed: 0.031 s
% 1.11/0.88 % (21285)Instructions burned: 70 (million)
% 1.11/0.88 % (21285)------------------------------
% 1.11/0.88 % (21285)------------------------------
% 1.11/0.88 % (21282)Instruction limit reached!
% 1.11/0.88 % (21282)------------------------------
% 1.11/0.88 % (21282)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 1.11/0.88 % (21282)Termination reason: Unknown
% 1.11/0.88 % (21282)Termination phase: Saturation
% 1.11/0.88
% 1.11/0.88 % (21282)Memory used [KB]: 1949
% 1.11/0.88 % (21282)Time elapsed: 0.064 s
% 1.11/0.88 % (21282)Instructions burned: 88 (million)
% 1.11/0.88 % (21282)------------------------------
% 1.11/0.88 % (21282)------------------------------
% 1.11/0.88 % (21289)lrs+1011_1:20_sil=4000:tgt=ground:i=80:sd=1:bd=off:nm=32:av=off:ss=axioms:lsd=60_0 on theBenchmark for (2994ds/80Mi)
% 1.11/0.89 % (21291)lrs+1011_1:2_drc=encompass:sil=4000:fde=unused:sos=on:sac=on:newcnf=on:i=55:sd=10:bd=off:ins=1:uhcvi=on:ss=axioms:spb=non_intro:st=3.0:erd=off:s2a=on:nwc=3.0_0 on theBenchmark for (2994ds/55Mi)
% 1.11/0.89 % (21283)Instruction limit reached!
% 1.11/0.89 % (21283)------------------------------
% 1.11/0.89 % (21283)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 1.11/0.89 % (21283)Termination reason: Unknown
% 1.11/0.89 % (21283)Termination phase: Saturation
% 1.11/0.89
% 1.11/0.89 % (21283)Memory used [KB]: 1970
% 1.11/0.89 % (21283)Time elapsed: 0.070 s
% 1.11/0.89 % (21283)Instructions burned: 111 (million)
% 1.11/0.89 % (21283)------------------------------
% 1.11/0.89 % (21283)------------------------------
% 1.11/0.89 % (21293)lrs+10_1:1024_sil=2000:st=2.0:i=32:sd=2:ss=included:ep=R_0 on theBenchmark for (2994ds/32Mi)
% 1.34/0.89 % (21292)dis-1011_1:32_to=lpo:drc=off:sil=2000:sp=reverse_arity:sos=on:foolp=on:lsd=20:nwc=1.49509792053687:s2agt=30:avsq=on:s2a=on:s2pl=no:i=47:s2at=5.0:avsqr=5593,1048576:nm=0:fsr=off:amm=sco:rawr=on:awrs=converge:awrsf=427:ss=included:sd=1:slsq=on:fd=off_0 on theBenchmark for (2994ds/47Mi)
% 1.34/0.90 % (21290)Instruction limit reached!
% 1.34/0.90 % (21290)------------------------------
% 1.34/0.90 % (21290)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 1.34/0.90 % (21290)Termination reason: Unknown
% 1.34/0.90 % (21290)Termination phase: Saturation
% 1.34/0.90
% 1.34/0.90 % (21290)Memory used [KB]: 1943
% 1.34/0.90 % (21290)Time elapsed: 0.021 s
% 1.34/0.90 % (21290)Instructions burned: 38 (million)
% 1.34/0.90 % (21290)------------------------------
% 1.34/0.90 % (21290)------------------------------
% 1.34/0.90 % (21288)Instruction limit reached!
% 1.34/0.90 % (21288)------------------------------
% 1.34/0.90 % (21288)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 1.34/0.90 % (21288)Termination reason: Unknown
% 1.34/0.90 % (21288)Termination phase: Saturation
% 1.34/0.90
% 1.34/0.90 % (21288)Memory used [KB]: 2492
% 1.34/0.90 % (21288)Time elapsed: 0.043 s
% 1.34/0.90 % (21288)Instructions burned: 161 (million)
% 1.34/0.90 % (21288)------------------------------
% 1.34/0.90 % (21288)------------------------------
% 1.34/0.90 % (21294)dis+1011_1:1_sil=4000:s2agt=4:slsqc=3:slsq=on:i=132:bd=off:av=off:sup=off:ss=axioms:st=3.0_0 on theBenchmark for (2994ds/132Mi)
% 1.34/0.90 % (21295)dis-1011_1:1024_sil=2000:fde=unused:sos=on:nwc=10.0:i=54:uhcvi=on:ss=axioms:ep=RS:av=off:sp=occurrence:fsr=off:awrs=decay:awrsf=200_0 on theBenchmark for (2994ds/54Mi)
% 1.34/0.91 % (21293)Instruction limit reached!
% 1.34/0.91 % (21293)------------------------------
% 1.34/0.91 % (21293)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 1.34/0.91 % (21293)Termination reason: Unknown
% 1.34/0.91 % (21293)Termination phase: Saturation
% 1.34/0.91
% 1.34/0.91 % (21293)Memory used [KB]: 1658
% 1.34/0.91 % (21293)Time elapsed: 0.018 s
% 1.34/0.91 % (21293)Instructions burned: 32 (million)
% 1.34/0.91 % (21293)------------------------------
% 1.34/0.91 % (21293)------------------------------
% 1.34/0.91 % (21291)Refutation not found, incomplete strategy% (21291)------------------------------
% 1.34/0.91 % (21291)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 1.34/0.91 % (21291)Termination reason: Refutation not found, incomplete strategy
% 1.34/0.91
% 1.34/0.91 % (21291)Memory used [KB]: 1420
% 1.34/0.91 % (21291)Time elapsed: 0.023 s
% 1.34/0.91 % (21291)Instructions burned: 44 (million)
% 1.34/0.91 % (21291)------------------------------
% 1.34/0.91 % (21291)------------------------------
% 1.34/0.91 % (21295)Refutation not found, incomplete strategy% (21295)------------------------------
% 1.34/0.91 % (21295)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 1.34/0.91 % (21295)Termination reason: Refutation not found, incomplete strategy
% 1.34/0.91
% 1.34/0.91 % (21295)Memory used [KB]: 1249
% 1.34/0.91 % (21295)Time elapsed: 0.005 s
% 1.34/0.91 % (21295)Instructions burned: 15 (million)
% 1.34/0.91 % (21295)------------------------------
% 1.34/0.91 % (21295)------------------------------
% 1.34/0.91 % (21297)lrs+11_1:32_sil=2000:sp=occurrence:lsd=20:rp=on:i=119:sd=1:nm=0:av=off:ss=included:nwc=10.0:flr=on_0 on theBenchmark for (2994ds/119Mi)
% 1.34/0.91 % (21296)lrs+1011_1:2_to=lpo:drc=off:sil=2000:sp=const_min:urr=on:lcm=predicate:nwc=16.7073:updr=off:newcnf=on:i=82:av=off:rawr=on:ss=included:st=5.0:erd=off:flr=on_0 on theBenchmark for (2994ds/82Mi)
% 1.34/0.92 % (21298)ott+1002_2835555:1048576_to=lpo:sil=2000:sos=on:fs=off:nwc=10.3801:avsqc=3:updr=off:avsq=on:st=2:s2a=on:i=177:s2at=3:afp=10000:aac=none:avsqr=13357983,1048576:awrs=converge:awrsf=460:bd=off:nm=13:ins=2:fsr=off:amm=sco:afq=1.16719:ss=axioms:rawr=on:fd=off_0 on theBenchmark for (2994ds/177Mi)
% 1.34/0.92 % (21292)Instruction limit reached!
% 1.34/0.92 % (21292)------------------------------
% 1.34/0.92 % (21292)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 1.34/0.92 % (21292)Termination reason: Unknown
% 1.34/0.92 % (21292)Termination phase: Saturation
% 1.34/0.92
% 1.34/0.92 % (21292)Memory used [KB]: 1671
% 1.34/0.92 % (21292)Time elapsed: 0.025 s
% 1.34/0.92 % (21292)Instructions burned: 47 (million)
% 1.34/0.92 % (21292)------------------------------
% 1.34/0.92 % (21292)------------------------------
% 1.34/0.92 % (21298)Refutation not found, incomplete strategy% (21298)------------------------------
% 1.34/0.92 % (21298)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 1.34/0.92 % (21298)Termination reason: Refutation not found, incomplete strategy
% 1.34/0.92
% 1.34/0.92 % (21298)Memory used [KB]: 1192
% 1.34/0.92 % (21298)Time elapsed: 0.004 s
% 1.34/0.92 % (21298)Instructions burned: 6 (million)
% 1.34/0.92 % (21298)------------------------------
% 1.34/0.92 % (21298)------------------------------
% 1.50/0.92 % (21289)Refutation not found, incomplete strategy% (21289)------------------------------
% 1.50/0.92 % (21289)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 1.50/0.92 % (21289)Termination reason: Refutation not found, incomplete strategy
% 1.50/0.92
% 1.50/0.92 % (21289)Memory used [KB]: 1533
% 1.50/0.92 % (21289)Time elapsed: 0.038 s
% 1.50/0.92 % (21289)Instructions burned: 81 (million)
% 1.50/0.92 % (21289)------------------------------
% 1.50/0.92 % (21289)------------------------------
% 1.54/0.92 % (21299)lrs+1002_263:262144_sfv=off:to=lpo:drc=encompass:sil=2000:tgt=full:fde=none:bsd=on:sp=const_frequency:spb=units:fd=preordered:nwc=12.504039574721643:lwlo=on:i=117:awrs=converge:awrsf=1360:bsdmm=3:bd=off:nm=11:fsd=on:amm=off:uhcvi=on:afr=on:rawr=on:fsdmm=1:updr=off:sac=on:fdi=16_0 on theBenchmark for (2994ds/117Mi)
% 1.54/0.92 % (21301)lrs-1011_8:1_sil=2000:spb=goal:urr=on:sac=on:i=51:afp=10000:fsr=off:ss=axioms:avsq=on:avsqr=17819,524288:bd=off:bsd=on:fd=off:sims=off:rawr=on:alpa=true:bsr=on:aer=off_0 on theBenchmark for (2994ds/51Mi)
% 1.54/0.92 % (21300)dis+1011_1:128_sil=2000:plsq=on:sp=frequency:plsql=on:nicw=on:i=49:kws=precedence:bd=off:fsr=off:ss=axioms:sgt=64:sd=3_0 on theBenchmark for (2994ds/49Mi)
% 1.54/0.93 % (21296)Instruction limit reached!
% 1.54/0.93 % (21296)------------------------------
% 1.54/0.93 % (21296)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 1.54/0.93 % (21296)Termination reason: Unknown
% 1.54/0.93 % (21296)Termination phase: Saturation
% 1.54/0.93
% 1.54/0.93 % (21296)Memory used [KB]: 1763
% 1.54/0.93 % (21296)Time elapsed: 0.022 s
% 1.54/0.93 % (21296)Instructions burned: 82 (million)
% 1.54/0.93 % (21296)------------------------------
% 1.54/0.93 % (21296)------------------------------
% 1.54/0.94 % (21302)lrs+1011_1:1024_sil=8000:sp=unary_first:nwc=10.0:st=3.0:s2a=on:i=149:s2at=5.0:awrs=converge:awrsf=390:ep=R:av=off:ss=axioms:s2agt=32_0 on theBenchmark for (2994ds/149Mi)
% 1.54/0.94 % (21287)Instruction limit reached!
% 1.54/0.94 % (21287)------------------------------
% 1.54/0.94 % (21287)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 1.54/0.94 % (21287)Termination reason: Unknown
% 1.54/0.94 % (21287)Termination phase: Saturation
% 1.54/0.94
% 1.54/0.94 % (21287)Memory used [KB]: 2208
% 1.54/0.94 % (21287)Time elapsed: 0.086 s
% 1.54/0.94 % (21287)Instructions burned: 361 (million)
% 1.54/0.94 % (21287)------------------------------
% 1.54/0.94 % (21287)------------------------------
% 1.54/0.94 % (21303)lrs+11_10:1_to=lpo:drc=off:sil=4000:sp=const_min:fd=preordered:rp=on:st=3.0:s2a=on:i=56:s2at=2.0:ss=axioms:er=known:sup=off:sd=1_0 on theBenchmark for (2994ds/56Mi)
% 1.54/0.94 % (21300)Instruction limit reached!
% 1.54/0.94 % (21300)------------------------------
% 1.54/0.94 % (21300)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 1.54/0.94 % (21300)Termination reason: Unknown
% 1.54/0.94 % (21300)Termination phase: Saturation
% 1.54/0.94
% 1.54/0.94 % (21300)Memory used [KB]: 1498
% 1.54/0.95 % (21300)Time elapsed: 0.022 s
% 1.54/0.95 % (21300)Instructions burned: 51 (million)
% 1.54/0.95 % (21300)------------------------------
% 1.54/0.95 % (21300)------------------------------
% 1.54/0.95 % (21301)Instruction limit reached!
% 1.54/0.95 % (21301)------------------------------
% 1.54/0.95 % (21301)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 1.54/0.95 % (21301)Termination reason: Unknown
% 1.54/0.95 % (21301)Termination phase: Saturation
% 1.54/0.95
% 1.54/0.95 % (21301)Memory used [KB]: 1769
% 1.54/0.95 % (21301)Time elapsed: 0.025 s
% 1.54/0.95 % (21301)Instructions burned: 51 (million)
% 1.54/0.95 % (21301)------------------------------
% 1.54/0.95 % (21301)------------------------------
% 1.54/0.95 % (21294)Instruction limit reached!
% 1.54/0.95 % (21294)------------------------------
% 1.54/0.95 % (21294)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 1.54/0.95 % (21294)Termination reason: Unknown
% 1.54/0.95 % (21294)Termination phase: Saturation
% 1.54/0.95
% 1.54/0.95 % (21294)Memory used [KB]: 1562
% 1.54/0.95 % (21294)Time elapsed: 0.045 s
% 1.54/0.95 % (21294)Instructions burned: 133 (million)
% 1.54/0.95 % (21294)------------------------------
% 1.54/0.95 % (21294)------------------------------
% 1.54/0.95 % (21304)lrs+1011_4:1_bsr=on:sil=32000:sos=all:urr=on:br=off:s2a=on:i=289:s2at=2.0:bd=off:gsp=on:ss=axioms:sgt=8:sd=1:fsr=off_0 on theBenchmark for (2994ds/289Mi)
% 1.54/0.95 % (21305)ott-1011_16:1_sil=2000:sp=const_max:urr=on:lsd=20:st=3.0:i=206:ss=axioms:gsp=on:rp=on:sos=on:fd=off:aac=none_0 on theBenchmark for (2994ds/206Mi)
% 1.54/0.95 % (21306)ott+1004_1:2_bsr=unit_only:slsqr=1,8:to=lpo:sil=2000:plsqc=2:plsq=on:sp=reverse_frequency:acc=on:nwc=6.4:slsq=on:st=2.0:i=50:s2at=3.0:bd=off:ins=4:ss=axioms:sgt=10:plsql=on:rawr=on:aer=off:slsqc=2:afp=4000:afq=2.0:bce=on:gs=on:lma=on:br=off:gsaa=full_model:add=off_0 on theBenchmark for (2994ds/50Mi)
% 1.54/0.96 % (21303)Instruction limit reached!
% 1.54/0.96 % (21303)------------------------------
% 1.54/0.96 % (21303)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 1.54/0.96 % (21303)Termination reason: Unknown
% 1.54/0.96 % (21303)Termination phase: Saturation
% 1.54/0.96
% 1.54/0.96 % (21303)Memory used [KB]: 1764
% 1.54/0.96 % (21303)Time elapsed: 0.018 s
% 1.54/0.96 % (21303)Instructions burned: 59 (million)
% 1.54/0.96 % (21303)------------------------------
% 1.54/0.96 % (21303)------------------------------
% 1.54/0.96 % (21307)lrs+1011_1:1_to=lpo:drc=off:sil=2000:tgt=full:i=1483:fd=preordered_0 on theBenchmark for (2993ds/1483Mi)
% 1.54/0.96 % (21297)Instruction limit reached!
% 1.54/0.96 % (21297)------------------------------
% 1.54/0.96 % (21297)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 1.54/0.96 % (21297)Termination reason: Unknown
% 1.54/0.96 % (21297)Termination phase: Saturation
% 1.54/0.96
% 1.54/0.96 % (21297)Memory used [KB]: 1757
% 1.54/0.96 % (21297)Time elapsed: 0.051 s
% 1.54/0.96 % (21297)Instructions burned: 119 (million)
% 1.54/0.96 % (21297)------------------------------
% 1.54/0.96 % (21297)------------------------------
% 1.54/0.96 % (21302)Instruction limit reached!
% 1.54/0.96 % (21302)------------------------------
% 1.54/0.96 % (21302)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 1.54/0.96 % (21302)Termination reason: Unknown
% 1.54/0.96 % (21302)Termination phase: Saturation
% 1.54/0.96
% 1.54/0.96 % (21302)Memory used [KB]: 1653
% 1.54/0.96 % (21302)Time elapsed: 0.030 s
% 1.54/0.96 % (21302)Instructions burned: 151 (million)
% 1.54/0.96 % (21302)------------------------------
% 1.54/0.96 % (21302)------------------------------
% 1.54/0.96 % (21306)Refutation not found, incomplete strategy% (21306)------------------------------
% 1.54/0.96 % (21306)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 1.54/0.96 % (21306)Termination reason: Refutation not found, incomplete strategy
% 1.54/0.96
% 1.54/0.96 % (21306)Memory used [KB]: 1298
% 1.54/0.96 % (21306)Time elapsed: 0.012 s
% 1.54/0.96 % (21306)Instructions burned: 20 (million)
% 1.54/0.96 % (21306)------------------------------
% 1.54/0.96 % (21306)------------------------------
% 1.54/0.97 % (21308)dis+1010_1:3_sil=2000:tgt=ground:sp=const_max:nwc=5.0:s2a=on:i=67:nm=16:av=off:bd=off_0 on theBenchmark for (2993ds/67Mi)
% 1.54/0.97 % (21309)lrs+1011_1:1_sil=64000:tgt=full:plsqc=1:plsq=on:plsqr=32,1:sp=occurrence:sos=on:lsd=20:st=5.0:i=67:sd=2:nm=4:av=off:fsr=off:ss=axioms:er=tagged:gs=on:sgt=8:nwc=3.0:bd=off_0 on theBenchmark for (2993ds/67Mi)
% 1.54/0.97 % (21310)dis+1002_1:1024_sil=2000:sac=on:slsq=on:i=52:nm=16:sfv=off:slsqc=1:urr=ec_only:bd=off_0 on theBenchmark for (2993ds/52Mi)
% 1.54/0.97 % (21304)Refutation not found, incomplete strategy% (21304)------------------------------
% 1.54/0.97 % (21304)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 1.54/0.97 % (21304)Termination reason: Refutation not found, incomplete strategy
% 1.54/0.97
% 1.54/0.97 % (21304)Memory used [KB]: 1824
% 1.54/0.97 % (21304)Time elapsed: 0.023 s
% 1.54/0.97 % (21304)Instructions burned: 48 (million)
% 1.54/0.97 % (21304)------------------------------
% 1.54/0.97 % (21304)------------------------------
% 1.54/0.98 % (21309)Refutation not found, incomplete strategy% (21309)------------------------------
% 1.54/0.98 % (21309)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 1.54/0.98 % (21309)Termination reason: Refutation not found, incomplete strategy
% 1.54/0.98
% 1.54/0.98 % (21309)Memory used [KB]: 1460
% 1.54/0.98 % (21309)Time elapsed: 0.011 s
% 1.54/0.98 % (21309)Instructions burned: 30 (million)
% 1.54/0.98 % (21311)lrs+1010_1:1_to=lpo:sil=2000:plsq=on:plsqr=32,1:sos=on:i=366:sd=2:ss=axioms_0 on theBenchmark for (2993ds/366Mi)
% 1.54/0.98 % (21299)Instruction limit reached!
% 1.54/0.98 % (21299)------------------------------
% 1.54/0.98 % (21299)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 1.54/0.98 % (21299)Termination reason: Unknown
% 1.54/0.98 % (21299)Termination phase: Saturation
% 1.54/0.98
% 1.54/0.98 % (21299)Memory used [KB]: 2268
% 1.54/0.98 % (21299)Time elapsed: 0.056 s
% 1.54/0.98 % (21299)Instructions burned: 117 (million)
% 1.54/0.98 % (21299)------------------------------
% 1.54/0.98 % (21299)------------------------------
% 1.54/0.98 % (21309)------------------------------
% 1.54/0.98 % (21309)------------------------------
% 1.54/0.98 % (21311)Refutation not found, incomplete strategy% (21311)------------------------------
% 1.54/0.98 % (21311)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 1.54/0.98 % (21311)Termination reason: Refutation not found, incomplete strategy
% 1.54/0.98
% 1.54/0.98 % (21311)Memory used [KB]: 1193
% 1.54/0.98 % (21311)Time elapsed: 0.004 s
% 1.54/0.98 % (21311)Instructions burned: 6 (million)
% 1.54/0.98 % (21312)lrs+1011_4:1_to=lpo:drc=off:sil=8000:sp=frequency:abs=on:urr=on:lsd=10:nwc=5.0:s2agt=4:newcnf=on:st=5.0:s2a=on:i=863:ss=axioms:aac=none:br=off:bd=preordered_0 on theBenchmark for (2993ds/863Mi)
% 1.54/0.98 % (21311)------------------------------
% 1.54/0.98 % (21311)------------------------------
% 1.54/0.98 % (21313)lrs+1011_1:1_sil=16000:fde=unused:plsqc=1:plsq=on:plsqr=32,1:sos=on:nwc=10.0:i=163:kws=frequency:nm=2:lsd=1:bd=off_0 on theBenchmark for (2993ds/163Mi)
% 1.54/0.99 % (21314)lrs+33_1:1_sil=4000:sp=reverse_frequency:sos=all:i=77:sd=2:bd=off:nm=2:av=off:fsr=off:ss=axioms:sgt=10:rawr=on:sup=off:to=lpo:fs=off_0 on theBenchmark for (2993ds/77Mi)
% 1.54/0.99 % (21313)Refutation not found, incomplete strategy% (21313)------------------------------
% 1.54/0.99 % (21313)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 1.54/0.99 % (21313)Termination reason: Refutation not found, incomplete strategy
% 1.54/0.99
% 1.54/0.99 % (21313)Memory used [KB]: 1233
% 1.54/0.99 % (21313)Time elapsed: 0.006 s
% 1.54/0.99 % (21313)Instructions burned: 9 (million)
% 1.54/0.99 % (21313)------------------------------
% 1.54/0.99 % (21313)------------------------------
% 1.54/0.99 % (21312)Refutation not found, incomplete strategy% (21312)------------------------------
% 1.54/0.99 % (21312)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 1.54/0.99 % (21312)Termination reason: Refutation not found, incomplete strategy
% 1.54/0.99
% 1.54/0.99 % (21312)Memory used [KB]: 1332
% 1.54/0.99 % (21312)Time elapsed: 0.011 s
% 1.54/0.99 % (21312)Instructions burned: 37 (million)
% 1.54/0.99 % (21312)------------------------------
% 1.54/0.99 % (21312)------------------------------
% 1.54/0.99 % (21316)lrs+1010_974213:1048576_nwc=9.0:s2a=on:i=76:bd=off:lwlo=on:fd=off:sil=256000:s2agt=10:sims=off:nm=9:sp=const_min:rp=on:er=known:cond=fast:bce=on:abs=on:irw=on:amm=sco:afp=2000:updr=off:add=off:to=lpo:awrs=decay:awrsf=260:rawr=on:afq=2.0:uhcvi=on_0 on theBenchmark for (2993ds/76Mi)
% 1.54/0.99 % (21315)lrs-1010_1:8_sil=2000:sos=on:i=1548:sd=1:ins=3:ss=included_0 on theBenchmark for (2993ds/1548Mi)
% 1.54/0.99 % (21310)Instruction limit reached!
% 1.54/0.99 % (21310)------------------------------
% 1.54/0.99 % (21310)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 1.54/0.99 % (21310)Termination reason: Unknown
% 1.54/0.99 % (21310)Termination phase: Saturation
% 1.54/0.99
% 1.54/0.99 % (21310)Memory used [KB]: 1575
% 1.54/0.99 % (21310)Time elapsed: 0.025 s
% 1.54/0.99 % (21310)Instructions burned: 52 (million)
% 1.54/0.99 % (21310)------------------------------
% 1.54/0.99 % (21310)------------------------------
% 1.54/1.00 % (21315)Refutation not found, incomplete strategy% (21315)------------------------------
% 1.54/1.00 % (21315)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 1.54/1.00 % (21315)Termination reason: Refutation not found, incomplete strategy
% 1.54/1.00
% 1.54/1.00 % (21315)Memory used [KB]: 1196
% 1.54/1.00 % (21315)Time elapsed: 0.004 s
% 1.54/1.00 % (21315)Instructions burned: 6 (million)
% 1.54/1.00 % (21315)------------------------------
% 1.54/1.00 % (21315)------------------------------
% 1.54/1.00 % (21308)Instruction limit reached!
% 1.54/1.00 % (21308)------------------------------
% 1.54/1.00 % (21308)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 1.54/1.00 % (21308)Termination reason: Unknown
% 1.54/1.00 % (21308)Termination phase: Saturation
% 1.54/1.00
% 1.54/1.00 % (21308)Memory used [KB]: 1618
% 1.54/1.00 % (21308)Time elapsed: 0.032 s
% 1.54/1.00 % (21308)Instructions burned: 68 (million)
% 1.54/1.00 % (21308)------------------------------
% 1.54/1.00 % (21308)------------------------------
% 2.06/1.00 % (21317)dis+1010_111129:1048576_sfv=off:drc=encompass:sil=2000:tgt=full:sp=reverse_arity:spb=goal:rnwc=on:fd=preordered:rp=on:nwc=6.5667:i=1376:kws=arity_squared:bd=off:nm=0:uhcvi=on:rawr=on:av=off:erd=off:cond=on:lcm=reverse_0 on theBenchmark for (2993ds/1376Mi)
% 2.06/1.00 % (21319)ott+1011_47:51_anc=all_dependent:slsqr=853,231:sil=4000:sp=reverse_frequency:foolp=on:spb=non_intro:abs=on:s2agt=50:slsqc=1:slsq=on:st=4.0:i=59:s2at=1.5:sd=7:kws=inv_frequency:afp=2000:nm=14:ins=2:afq=1.2:uhcvi=on:afr=on:gsp=on:ss=axioms:sgt=100:rawr=on:tgt=ground:awrs=converge:awrsf=390:bs=unit_only:add=off:flr=on:plsq=on:plsqc=1:plsqr=6705511,1048576:bd=preordered:newcnf=on:nwc=5.0_0 on theBenchmark for (2993ds/59Mi)
% 2.06/1.00 % (21318)lrs-1002_3:2_sil=2000:sos=on:fd=off:nwc=10.0:flr=on:i=117:nm=16:fsr=off:sup=off:ss=axioms:fs=off:bd=off:fde=none:erd=off_0 on theBenchmark for (2993ds/117Mi)
% 2.06/1.00 % (21318)Refutation not found, incomplete strategy% (21318)------------------------------
% 2.06/1.00 % (21318)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 2.06/1.00 % (21318)Termination reason: Refutation not found, incomplete strategy
% 2.06/1.00
% 2.06/1.00 % (21318)Memory used [KB]: 1192
% 2.06/1.00 % (21318)Time elapsed: 0.004 s
% 2.06/1.00 % (21318)Instructions burned: 5 (million)
% 2.06/1.00 % (21318)------------------------------
% 2.06/1.00 % (21318)------------------------------
% 2.06/1.01 % (21320)lrs+1002_1:1_sfv=off:drc=encompass:sil=2000:fde=unused:sp=frequency:nwc=10.0:flr=on:st=1.5:i=151:bd=off:nm=0:ins=4:fsr=off:fsd=on:ss=axioms:s2a=on:s2agt=32:to=lpo:aac=none:sims=off_0 on theBenchmark for (2993ds/151Mi)
% 2.06/1.01 % (21316)Instruction limit reached!
% 2.06/1.01 % (21316)------------------------------
% 2.06/1.01 % (21316)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 2.06/1.01 % (21316)Termination reason: Unknown
% 2.06/1.01 % (21316)Termination phase: Saturation
% 2.06/1.01
% 2.06/1.01 % (21316)Memory used [KB]: 1786
% 2.06/1.01 % (21316)Time elapsed: 0.022 s
% 2.06/1.01 % (21316)Instructions burned: 76 (million)
% 2.06/1.01 % (21316)------------------------------
% 2.06/1.01 % (21316)------------------------------
% 2.06/1.02 % (21321)lrs+11_1:1_sos=on:urr=on:s2a=on:i=260:sd=1:aac=none:ss=axioms:gsp=on:sil=128000:nm=3:bce=on:fd=preordered:alpa=true:etr=on:bd=off:lcm=predicate_0 on theBenchmark for (2993ds/260Mi)
% 2.06/1.02 % (21314)Instruction limit reached!
% 2.06/1.02 % (21314)------------------------------
% 2.06/1.02 % (21314)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 2.06/1.02 % (21314)Termination reason: Unknown
% 2.06/1.02 % (21314)Termination phase: Saturation
% 2.06/1.02
% 2.06/1.02 % (21314)Memory used [KB]: 2206
% 2.06/1.02 % (21314)Time elapsed: 0.038 s
% 2.06/1.02 % (21314)Instructions burned: 77 (million)
% 2.06/1.02 % (21314)------------------------------
% 2.06/1.02 % (21314)------------------------------
% 2.06/1.03 % (21322)dis+1010_1:1_drc=off:sil=32000:rp=on:cond=fast:i=1797:av=off:newcnf=on:bd=off:sfv=off:plsq=on:plsqr=1,32:erd=off_0 on theBenchmark for (2993ds/1797Mi)
% 2.06/1.03 % (21319)Instruction limit reached!
% 2.06/1.03 % (21319)------------------------------
% 2.06/1.03 % (21319)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 2.06/1.03 % (21319)Termination reason: Unknown
% 2.06/1.03 % (21319)Termination phase: Saturation
% 2.06/1.03
% 2.06/1.03 % (21319)Memory used [KB]: 1900
% 2.06/1.03 % (21319)Time elapsed: 0.029 s
% 2.06/1.03 % (21319)Instructions burned: 59 (million)
% 2.06/1.03 % (21319)------------------------------
% 2.06/1.03 % (21319)------------------------------
% 2.06/1.03 % (21323)lrs-1010_1:8_sil=2000:spb=intro:acc=on:rp=on:i=200:sd=1:bd=off:uhcvi=on:ss=axioms:sgt=32:rawr=on:erd=off:alpa=true:anc=none:afp=2000_0 on theBenchmark for (2993ds/200Mi)
% 2.06/1.04 % (21305)Instruction limit reached!
% 2.06/1.04 % (21305)------------------------------
% 2.06/1.04 % (21305)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 2.06/1.04 % (21305)Termination reason: Unknown
% 2.06/1.04 % (21305)Termination phase: Saturation
% 2.06/1.04
% 2.06/1.04 % (21305)Memory used [KB]: 4100
% 2.06/1.04 % (21305)Time elapsed: 0.095 s
% 2.06/1.04 % (21305)Instructions burned: 207 (million)
% 2.06/1.04 % (21305)------------------------------
% 2.06/1.04 % (21305)------------------------------
% 2.06/1.04 % (21321)Refutation not found, incomplete strategy% (21321)------------------------------
% 2.06/1.04 % (21321)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 2.06/1.04 % (21321)Termination reason: Refutation not found, incomplete strategy
% 2.06/1.04
% 2.06/1.04 % (21321)Memory used [KB]: 2082
% 2.06/1.04 % (21321)Time elapsed: 0.030 s
% 2.06/1.04 % (21321)Instructions burned: 100 (million)
% 2.06/1.05 % (21321)------------------------------
% 2.06/1.05 % (21321)------------------------------
% 2.06/1.05 % (21324)lrs+1002_1:8_sil=4000:sos=on:nicw=on:st=2.5:i=356:ss=included:sd=7:ep=RS:erd=off_0 on theBenchmark for (2993ds/356Mi)
% 2.06/1.05 % (21324)Refutation not found, incomplete strategy% (21324)------------------------------
% 2.06/1.05 % (21324)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 2.06/1.05 % (21324)Termination reason: Refutation not found, incomplete strategy
% 2.06/1.05
% 2.06/1.05 % (21324)Memory used [KB]: 1196
% 2.06/1.05 % (21324)Time elapsed: 0.002 s
% 2.06/1.05 % (21324)Instructions burned: 6 (million)
% 2.06/1.05 % (21324)------------------------------
% 2.06/1.05 % (21324)------------------------------
% 2.06/1.05 % (21325)lrs+1011_1:4_bsr=unit_only:to=lpo:sil=2000:plsqc=4:plsq=on:sp=occurrence:plsql=on:alpa=false:i=75:afp=10:afq=2.0:ss=axioms:rawr=on:fd=off_0 on theBenchmark for (2993ds/75Mi)
% 2.06/1.06 % (21326)dis+1011_13623:1048576_drc=off:sil=2000:fde=unused:bsd=on:sp=const_min:br=off:fd=preordered:gs=on:nwc=17.1261:gsem=off:i=578:kws=inv_frequency:nm=4:rawr=on:bd=off:fsr=off:bsdmm=1:av=off_0 on theBenchmark for (2993ds/578Mi)
% 2.06/1.06 % (21326)Refutation not found, incomplete strategy% (21326)------------------------------
% 2.06/1.06 % (21326)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 2.06/1.06 % (21326)Termination reason: Refutation not found, incomplete strategy
% 2.06/1.06
% 2.06/1.06 % (21326)Memory used [KB]: 1197
% 2.06/1.06 % (21326)Time elapsed: 0.029 s
% 2.06/1.06 % (21326)Instructions burned: 10 (million)
% 2.06/1.06 % (21326)------------------------------
% 2.06/1.06 % (21326)------------------------------
% 2.06/1.07 % (21327)ott-1011_3:2_to=lpo:drc=off:sil=2000:sims=off:sos=on:lma=on:spb=goal_then_units:lcm=predicate:fd=preordered:rp=on:newcnf=on:avsq=on:i=251:ins=1:fsr=off:avsqc=4:aac=none:plsq=on:plsqc=1:plsqr=32,1:fs=off_0 on theBenchmark for (2992ds/251Mi)
% 2.06/1.07 % (21320)Instruction limit reached!
% 2.06/1.07 % (21320)------------------------------
% 2.06/1.07 % (21320)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 2.06/1.07 % (21320)Termination reason: Unknown
% 2.06/1.07 % (21320)Termination phase: Saturation
% 2.06/1.07
% 2.06/1.07 % (21320)Memory used [KB]: 2083
% 2.06/1.07 % (21320)Time elapsed: 0.060 s
% 2.06/1.07 % (21320)Instructions burned: 152 (million)
% 2.06/1.07 % (21320)------------------------------
% 2.06/1.07 % (21320)------------------------------
% 2.06/1.07 % (21325)Instruction limit reached!
% 2.06/1.07 % (21325)------------------------------
% 2.06/1.07 % (21325)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 2.06/1.07 % (21325)Termination reason: Unknown
% 2.06/1.07 % (21325)Termination phase: Saturation
% 2.06/1.07
% 2.06/1.07 % (21325)Memory used [KB]: 1670
% 2.06/1.07 % (21325)Time elapsed: 0.043 s
% 2.06/1.07 % (21325)Instructions burned: 77 (million)
% 2.06/1.07 % (21325)------------------------------
% 2.06/1.07 % (21325)------------------------------
% 2.37/1.07 % (21328)dis+1010_1:1_sil=2000:tgt=full:rp=on:gs=on:nwc=5.0:i=93:abs=on:sos=on_0 on theBenchmark for (2992ds/93Mi)
% 2.37/1.07 % (21329)lrs+1010_1:8_sil=4000:sos=on:urr=on:rnwc=on:nwc=10.0:i=37:sup=off:kws=frequency_0 on theBenchmark for (2992ds/37Mi)
% 2.37/1.08 % (21328)Refutation not found, incomplete strategy% (21328)------------------------------
% 2.37/1.08 % (21328)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 2.37/1.08 % (21328)Termination reason: Refutation not found, incomplete strategy
% 2.37/1.08
% 2.37/1.08 % (21328)Memory used [KB]: 1210
% 2.37/1.08 % (21328)Time elapsed: 0.006 s
% 2.37/1.08 % (21328)Instructions burned: 9 (million)
% 2.37/1.08 % (21328)------------------------------
% 2.37/1.08 % (21328)------------------------------
% 2.37/1.08 % (21329)Refutation not found, incomplete strategy% (21329)------------------------------
% 2.37/1.08 % (21329)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 2.37/1.08 % (21329)Termination reason: Refutation not found, incomplete strategy
% 2.37/1.08
% 2.37/1.08 % (21329)Memory used [KB]: 1441
% 2.37/1.08 % (21329)Time elapsed: 0.008 s
% 2.37/1.08 % (21329)Instructions burned: 31 (million)
% 2.37/1.08 % (21329)------------------------------
% 2.37/1.08 % (21329)------------------------------
% 2.37/1.08 % (21330)lrs+1010_1:1_sil=2000:sos=all:kmz=on:cond=fast:i=132:kws=inv_frequency:av=off:gsp=on:rawr=on:s2a=on:s2at=2.0_0 on theBenchmark for (2992ds/132Mi)
% 2.37/1.08 % (21331)dis+1011_1:1024_drc=off:sil=2000:urr=ec_only:br=off:sac=on:i=209:fsr=off_0 on theBenchmark for (2992ds/209Mi)
% 2.37/1.09 % (21331)Refutation not found, incomplete strategy% (21331)------------------------------
% 2.37/1.09 % (21331)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 2.37/1.09 % (21331)Termination reason: Refutation not found, incomplete strategy
% 2.37/1.09
% 2.37/1.09 % (21331)Memory used [KB]: 1200
% 2.37/1.09 % (21331)Time elapsed: 0.003 s
% 2.37/1.09 % (21331)Instructions burned: 9 (million)
% 2.37/1.09 % (21331)------------------------------
% 2.37/1.09 % (21331)------------------------------
% 2.37/1.09 % (21332)lrs+11_7:12_sil=2000:sp=occurrence:sos=on:erd=off:lcm=reverse:gs=on:st=5.0:i=100:awrs=converge:bd=off:ss=axioms:fs=off:fsr=off:rawr=on_0 on theBenchmark for (2992ds/100Mi)
% 2.37/1.11 % (21323)Instruction limit reached!
% 2.37/1.11 % (21323)------------------------------
% 2.37/1.11 % (21323)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 2.37/1.11 % (21323)Termination reason: Unknown
% 2.37/1.11 % (21323)Termination phase: Saturation
% 2.37/1.11
% 2.37/1.11 % (21323)Memory used [KB]: 2210
% 2.37/1.11 % (21323)Time elapsed: 0.102 s
% 2.37/1.11 % (21323)Instructions burned: 201 (million)
% 2.37/1.11 % (21323)------------------------------
% 2.37/1.11 % (21323)------------------------------
% 2.37/1.12 % (21333)dis+10_1:1_sil=2000:nwc=5.0:s2agt=32:s2a=on:i=54:nm=4:alpa=true_0 on theBenchmark for (2992ds/54Mi)
% 2.37/1.12 % (21332)Refutation not found, incomplete strategy% (21332)------------------------------
% 2.37/1.12 % (21332)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 2.37/1.12 % (21332)Termination reason: Refutation not found, incomplete strategy
% 2.37/1.12
% 2.37/1.12 % (21332)Memory used [KB]: 2280
% 2.37/1.12 % (21332)Time elapsed: 0.030 s
% 2.37/1.12 % (21332)Instructions burned: 99 (million)
% 2.37/1.12 % (21332)------------------------------
% 2.37/1.12 % (21332)------------------------------
% 2.37/1.12 % (21334)lrs-1011_1:1_to=lpo:drc=off:sil=2000:sp=const_min:sos=on:lsd=10:sac=on:i=62:br=off:newcnf=on_0 on theBenchmark for (2992ds/62Mi)
% 2.37/1.12 % (21334)Refutation not found, incomplete strategy% (21334)------------------------------
% 2.37/1.12 % (21334)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 2.37/1.12 % (21334)Termination reason: Refutation not found, incomplete strategy
% 2.37/1.12
% 2.37/1.12 % (21334)Memory used [KB]: 1130
% 2.37/1.12 % (21334)Time elapsed: 0.002 s
% 2.37/1.12 % (21334)Instructions burned: 6 (million)
% 2.37/1.12 % (21334)------------------------------
% 2.37/1.12 % (21334)------------------------------
% 2.37/1.12 % (21335)lrs+10_8:1_to=lpo:drc=encompass:sil=4000:sos=on:urr=on:newcnf=on:i=2265:sd=2:nm=2:ss=axioms:sgt=32:sup=off:bd=off_0 on theBenchmark for (2992ds/2265Mi)
% 2.37/1.13 % (21330)Instruction limit reached!
% 2.37/1.13 % (21330)------------------------------
% 2.37/1.13 % (21330)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 2.37/1.13 % (21330)Termination reason: Unknown
% 2.37/1.13 % (21330)Termination phase: Saturation
% 2.37/1.13
% 2.37/1.13 % (21330)Memory used [KB]: 2411
% 2.37/1.13 % (21330)Time elapsed: 0.054 s
% 2.37/1.13 % (21330)Instructions burned: 132 (million)
% 2.37/1.13 % (21330)------------------------------
% 2.37/1.13 % (21330)------------------------------
% 2.37/1.14 % (21336)lrs+1011_1:128_sil=2000:lsd=10:newcnf=on:i=91:bd=off:fsd=on:ss=axioms:plsq=on:plsqr=9200103,131072:sd=1:lma=on_0 on theBenchmark for (2992ds/91Mi)
% 2.37/1.14 % (21333)Instruction limit reached!
% 2.37/1.14 % (21333)------------------------------
% 2.37/1.14 % (21333)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 2.37/1.14 % (21333)Termination reason: Unknown
% 2.37/1.14 % (21333)Termination phase: Saturation
% 2.37/1.14
% 2.37/1.14 % (21333)Memory used [KB]: 1661
% 2.37/1.14 % (21333)Time elapsed: 0.027 s
% 2.37/1.14 % (21333)Instructions burned: 55 (million)
% 2.37/1.14 % (21333)------------------------------
% 2.37/1.14 % (21333)------------------------------
% 2.37/1.15 % (21336)Refutation not found, incomplete strategy% (21336)------------------------------
% 2.37/1.15 % (21336)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 2.37/1.15 % (21336)Termination reason: Refutation not found, incomplete strategy
% 2.37/1.15
% 2.37/1.15 % (21336)Memory used [KB]: 1281
% 2.37/1.15 % (21336)Time elapsed: 0.009 s
% 2.37/1.15 % (21336)Instructions burned: 16 (million)
% 2.37/1.15 % (21336)------------------------------
% 2.37/1.15 % (21336)------------------------------
% 2.37/1.15 % (21335)Refutation not found, incomplete strategy% (21335)------------------------------
% 2.37/1.15 % (21335)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 2.37/1.15 % (21335)Termination reason: Refutation not found, incomplete strategy
% 2.37/1.15
% 2.37/1.15 % (21335)Memory used [KB]: 1880
% 2.37/1.15 % (21335)Time elapsed: 0.023 s
% 2.37/1.15 % (21335)Instructions burned: 85 (million)
% 2.37/1.15 % (21335)------------------------------
% 2.37/1.15 % (21335)------------------------------
% 2.37/1.15 % (21337)ott+1011_7:2_anc=all:to=lpo:sil=2000:tgt=full:plsq=on:sos=on:spb=intro:fd=preordered:rp=on:i=83:uhcvi=on:rawr=on:fs=off:fsr=off:lsd=1:erd=off:aac=none:plsqc=2:newcnf=on:abs=on:bd=off_0 on theBenchmark for (2992ds/83Mi)
% 2.37/1.15 % (21338)dis+1010_1:1_to=lpo:sil=2000:plsq=on:plsqr=32,1:sos=on:spb=goal:rp=on:i=123:bd=off:ins=4:ss=axioms:sgt=32:acc=on:fde=none_0 on theBenchmark for (2991ds/123Mi)
% 2.37/1.15 % (21338)Refutation not found, incomplete strategy% (21338)------------------------------
% 2.37/1.15 % (21338)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 2.37/1.15 % (21338)Termination reason: Refutation not found, incomplete strategy
% 2.37/1.15
% 2.37/1.15 % (21338)Memory used [KB]: 1206
% 2.37/1.15 % (21338)Time elapsed: 0.002 s
% 2.37/1.15 % (21338)Instructions burned: 6 (million)
% 2.37/1.15 % (21338)------------------------------
% 2.37/1.15 % (21338)------------------------------
% 2.37/1.15 % (21339)dis-1003_1:1_drc=off:sil=2000:sos=all:i=84:av=off:irw=on:plsq=on:plsqc=1:plsqr=32,1:sfv=off_0 on theBenchmark for (2991ds/84Mi)
% 2.37/1.15 % (21340)lrs+2_1:1_sil=2000:urr=on:flr=on:s2a=on:i=85:s2at=5.0:sd=1:ss=axioms:sgt=8:gsp=on:br=off_0 on theBenchmark for (2991ds/85Mi)
% 2.37/1.16 % (21337)Refutation not found, incomplete strategy% (21337)------------------------------
% 2.37/1.16 % (21337)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 2.37/1.16 % (21337)Termination reason: Refutation not found, incomplete strategy
% 2.37/1.16
% 2.37/1.16 % (21337)Memory used [KB]: 1426
% 2.37/1.16 % (21337)Time elapsed: 0.016 s
% 2.37/1.16 % (21337)Instructions burned: 28 (million)
% 2.37/1.16 % (21337)------------------------------
% 2.37/1.16 % (21337)------------------------------
% 2.37/1.17 % (21340)Refutation not found, incomplete strategy% (21340)------------------------------
% 2.37/1.17 % (21340)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 2.37/1.17 % (21340)Termination reason: Refutation not found, incomplete strategy
% 2.37/1.17
% 2.37/1.17 % (21340)Memory used [KB]: 1685
% 2.37/1.17 % (21340)Time elapsed: 0.013 s
% 2.37/1.17 % (21340)Instructions burned: 48 (million)
% 2.37/1.17 % (21340)------------------------------
% 2.37/1.17 % (21340)------------------------------
% 2.37/1.17 % (21327)Instruction limit reached!
% 2.37/1.17 % (21327)------------------------------
% 2.37/1.17 % (21327)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 2.37/1.17 % (21327)Termination reason: Unknown
% 2.37/1.17 % (21327)Termination phase: Saturation
% 2.37/1.17
% 2.37/1.17 % (21327)Memory used [KB]: 2878
% 2.37/1.17 % (21327)Time elapsed: 0.127 s
% 2.37/1.17 % (21327)Instructions burned: 251 (million)
% 2.37/1.17 % (21327)------------------------------
% 2.37/1.17 % (21327)------------------------------
% 2.37/1.17 % (21342)lrs+1010_1:1_to=lpo:sil=32000:plsq=on:plsqr=32,1:sp=frequency:sos=on:erd=off:newcnf=on:i=106:bd=off:rawr=on:sup=off_0 on theBenchmark for (2991ds/106Mi)
% 2.37/1.17 % (21341)dis+1002_1:1_sil=2000:tgt=full:spb=goal:avsq=on:i=259:avsqr=19,107:er=known:rawr=on:nwc=3.7:cond=fast:abs=on_0 on theBenchmark for (2991ds/259Mi)
% 2.37/1.17 % (21342)Refutation not found, incomplete strategy% (21342)------------------------------
% 2.37/1.17 % (21342)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 2.37/1.17 % (21342)Termination reason: Refutation not found, incomplete strategy
% 2.37/1.17
% 2.37/1.17 % (21342)Memory used [KB]: 1133
% 2.37/1.17 % (21342)Time elapsed: 0.002 s
% 2.37/1.17 % (21342)Instructions burned: 6 (million)
% 2.37/1.17 % (21342)------------------------------
% 2.37/1.17 % (21342)------------------------------
% 2.37/1.17 % (21343)lrs+1010_1:28_sil=2000:s2agt=16:st=3.0:s2a=on:i=278:sd=3:ss=axioms:av=off:slsq=on_0 on theBenchmark for (2991ds/278Mi)
% 2.37/1.17 % (21344)lrs+1011_1:10_to=lpo:sil=2000:nwc=5.0:st=5.0:i=151:nm=2:av=off:ss=included:bd=preordered:uhcvi=on:irw=on_0 on theBenchmark for (2991ds/151Mi)
% 2.37/1.18 % (21344)Refutation not found, incomplete strategy% (21344)------------------------------
% 2.37/1.18 % (21344)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 2.37/1.18 % (21344)Termination reason: Refutation not found, incomplete strategy
% 2.37/1.18
% 2.37/1.18 % (21344)Memory used [KB]: 1412
% 2.37/1.18 % (21344)Time elapsed: 0.008 s
% 2.37/1.18 % (21344)Instructions burned: 28 (million)
% 2.37/1.18 % (21344)------------------------------
% 2.37/1.18 % (21344)------------------------------
% 3.72/1.18 % (21345)lrs+2_1:28_bsr=unit_only:slsqr=1,2:to=lpo:sil=4000:fde=none:sp=unary_first:spb=goal_then_units:slsqc=1:slsq=on:i=97:s2at=2.0:slsql=off:bd=off:nm=3:av=off:fsd=on:s2agt=32_0 on theBenchmark for (2991ds/97Mi)
% 3.72/1.19 % (21339)Instruction limit reached!
% 3.72/1.19 % (21339)------------------------------
% 3.72/1.19 % (21339)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 3.72/1.19 % (21339)Termination reason: Unknown
% 3.72/1.19 % (21339)Termination phase: Saturation
% 3.72/1.19
% 3.72/1.19 % (21339)Memory used [KB]: 2023
% 3.72/1.19 % (21339)Time elapsed: 0.037 s
% 3.72/1.19 % (21339)Instructions burned: 85 (million)
% 3.72/1.19 % (21339)------------------------------
% 3.72/1.19 % (21339)------------------------------
% 3.72/1.19 % (21346)dis+1011_1:1_sil=2000:sos=on:lsd=100:rp=on:nwc=10.0:s2agt=16:newcnf=on:i=464:bd=off:fsr=off:rawr=on:avsq=on:avsql=on:avsqr=117,449:s2a=on:bs=on_0 on theBenchmark for (2991ds/464Mi)
% 3.72/1.20 % (21346)Refutation not found, incomplete strategy% (21346)------------------------------
% 3.72/1.20 % (21346)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 3.72/1.20 % (21346)Termination reason: Refutation not found, incomplete strategy
% 3.72/1.20
% 3.72/1.20 % (21346)Memory used [KB]: 1209
% 3.72/1.20 % (21346)Time elapsed: 0.005 s
% 3.72/1.20 % (21346)Instructions burned: 8 (million)
% 3.72/1.20 % (21346)------------------------------
% 3.72/1.20 % (21346)------------------------------
% 3.72/1.20 % (21347)dis+666_17:28_sil=4000:sp=const_frequency:lcm=reverse:nwc=15.189:avsqc=3:avsq=on:s2a=on:i=79:s2at=2.5:bs=on:ins=2:fsd=on:rawr=on:to=lpo:s2agt=8:sac=on:bd=off_0 on theBenchmark for (2991ds/79Mi)
% 3.90/1.21 % (21345)Instruction limit reached!
% 3.90/1.21 % (21345)------------------------------
% 3.90/1.21 % (21345)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 3.90/1.21 % (21345)Termination reason: Unknown
% 3.90/1.21 % (21345)Termination phase: Saturation
% 3.90/1.21
% 3.90/1.21 % (21345)Memory used [KB]: 2646
% 3.90/1.21 % (21345)Time elapsed: 0.027 s
% 3.90/1.21 % (21345)Instructions burned: 98 (million)
% 3.90/1.21 % (21345)------------------------------
% 3.90/1.21 % (21345)------------------------------
% 3.90/1.21 % (21348)dis-1011_1:4_sil=2000:tgt=ground:s2a=on:i=1993:ep=RS:fsr=off:s2at=2.0:av=off:ss=axioms:st=1.5_0 on theBenchmark for (2991ds/1993Mi)
% 3.90/1.22 % (21348)Refutation not found, incomplete strategy% (21348)------------------------------
% 3.90/1.22 % (21348)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 3.90/1.22 % (21348)Termination reason: Refutation not found, incomplete strategy
% 3.90/1.22
% 3.90/1.22 % (21348)Memory used [KB]: 1265
% 3.90/1.22 % (21348)Time elapsed: 0.006 s
% 3.90/1.22 % (21348)Instructions burned: 22 (million)
% 3.90/1.22 % (21348)------------------------------
% 3.90/1.22 % (21348)------------------------------
% 3.90/1.22 % (21349)lrs+1011_1:1_sil=64000:i=101:sd=2:ep=R:ss=axioms_0 on theBenchmark for (2991ds/101Mi)
% 3.90/1.23 % (21307)Instruction limit reached!
% 3.90/1.23 % (21307)------------------------------
% 3.90/1.23 % (21307)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 3.90/1.23 % (21307)Termination reason: Unknown
% 3.90/1.23 % (21307)Termination phase: Saturation
% 3.90/1.23
% 3.90/1.23 % (21307)Memory used [KB]: 2354
% 3.90/1.23 % (21307)Time elapsed: 0.260 s
% 3.90/1.23 % (21307)Instructions burned: 1483 (million)
% 3.90/1.23 % (21307)------------------------------
% 3.90/1.23 % (21307)------------------------------
% 4.10/1.23 % (21350)dis-1010_1:1_bsr=unit_only:to=lpo:sil=256000:fde=none:plsq=on:plsqr=205,29:sp=occurrence:sos=on:abs=on:newcnf=on:st=6.0:i=4978:sd=2:bd=off:amm=off:ss=axioms:rawr=on_0 on theBenchmark for (2991ds/4978Mi)
% 4.10/1.23 % (21350)Refutation not found, incomplete strategy% (21350)------------------------------
% 4.10/1.23 % (21350)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 4.10/1.23 % (21350)Termination reason: Refutation not found, incomplete strategy
% 4.10/1.23
% 4.10/1.23 % (21350)Memory used [KB]: 1199
% 4.10/1.23 % (21350)Time elapsed: 0.003 s
% 4.10/1.23 % (21350)Instructions burned: 8 (million)
% 4.10/1.23 % (21350)------------------------------
% 4.10/1.23 % (21350)------------------------------
% 4.10/1.24 % (21351)lrs+1002_14319:131072_to=lpo:drc=encompass:sil=2000:tgt=ground:fde=none:sp=const_max:sos=on:spb=units:lcm=predicate:nwc=7.734471748972603:flr=on:newcnf=on:i=169:add=large:awrs=decay:awrsf=1079:bd=off:nm=2:ins=1:fsr=off:uhcvi=on:rawr=on:anc=all_dependent:aac=none:fs=off_0 on theBenchmark for (2991ds/169Mi)
% 4.10/1.24 % (21349)Instruction limit reached!
% 4.10/1.24 % (21349)------------------------------
% 4.10/1.24 % (21349)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 4.10/1.24 % (21349)Termination reason: Unknown
% 4.10/1.24 % (21349)Termination phase: Saturation
% 4.10/1.24
% 4.10/1.24 % (21349)Memory used [KB]: 1570
% 4.10/1.24 % (21349)Time elapsed: 0.020 s
% 4.10/1.24 % (21349)Instructions burned: 101 (million)
% 4.10/1.24 % (21349)------------------------------
% 4.10/1.24 % (21349)------------------------------
% 4.10/1.24 % (21351)Refutation not found, incomplete strategy% (21351)------------------------------
% 4.10/1.24 % (21351)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 4.10/1.24 % (21351)Termination reason: Refutation not found, incomplete strategy
% 4.10/1.24
% 4.10/1.24 % (21351)Memory used [KB]: 1181
% 4.10/1.24 % (21351)Time elapsed: 0.003 s
% 4.10/1.24 % (21347)Instruction limit reached!
% 4.10/1.24 % (21347)------------------------------
% 4.10/1.24 % (21347)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 4.10/1.24 % (21351)Instructions burned: 8 (million)
% 4.10/1.24 % (21347)Termination reason: Unknown
% 4.10/1.24 % (21347)Termination phase: Saturation
% 4.10/1.24
% 4.10/1.24 % (21347)Memory used [KB]: 1999
% 4.10/1.24 % (21347)Time elapsed: 0.040 s
% 4.10/1.24 % (21347)Instructions burned: 80 (million)
% 4.10/1.24 % (21347)------------------------------
% 4.10/1.24 % (21347)------------------------------
% 4.10/1.24 % (21351)------------------------------
% 4.10/1.24 % (21351)------------------------------
% 4.10/1.24 % (21352)ott+2_27871:262144_drc=encompass:sil=2000:plsqc=1:plsq=on:ile=on:plsqr=9426019,262144:sp=const_frequency:foolp=on:bce=on:rnwc=on:gs=on:nwc=12.5427:i=178:gsaa=from_current:erml=3:bd=off:nm=10:uhcvi=on:gsp=on:er=known:rawr=on:fd=preordered:alpa=true_0 on theBenchmark for (2991ds/178Mi)
% 4.10/1.24 % (21353)dis+21_1:1_to=lpo:drc=off:sil=2000:etr=on:sp=const_frequency:sos=all:fs=off:spb=goal_then_units:s2a=on:i=111:s2at=3.0:fsr=off_0 on theBenchmark for (2991ds/111Mi)
% 4.10/1.24 % (21354)lrs+1011_3:1_slsqr=1,2:sil=2000:tgt=full:plsq=on:plsqr=173,396:spb=goal:bce=on:newcnf=on:slsq=on:st=3.5:i=243:add=off:bs=on:fsr=off:ss=axioms:rawr=on:afp=1:afq=2.9664927043397338_0 on theBenchmark for (2991ds/243Mi)
% 4.10/1.26 % (21354)Refutation not found, incomplete strategy% (21354)------------------------------
% 4.10/1.26 % (21354)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 4.10/1.26 % (21354)Termination reason: Refutation not found, incomplete strategy
% 4.10/1.26
% 4.10/1.26 % (21354)Memory used [KB]: 1412
% 4.10/1.26 % (21354)Time elapsed: 0.019 s
% 4.10/1.26 % (21354)Instructions burned: 35 (million)
% 4.10/1.26 % (21354)------------------------------
% 4.10/1.26 % (21354)------------------------------
% 4.10/1.26 % (21355)lrs+1011_1:32_sil=2000:tgt=ground:acc=model:lsd=10:nwc=1.1:flr=on:s2pl=no:i=229:bd=off:gsp=on:rawr=on_0 on theBenchmark for (2990ds/229Mi)
% 4.10/1.28 % (21343)Instruction limit reached!
% 4.10/1.28 % (21343)------------------------------
% 4.10/1.28 % (21343)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 4.10/1.28 % (21343)Termination reason: Unknown
% 4.10/1.28 % (21343)Termination phase: Saturation
% 4.10/1.28
% 4.10/1.28 % (21343)Memory used [KB]: 2300
% 4.10/1.28 % (21343)Time elapsed: 0.106 s
% 4.10/1.28 % (21343)Instructions burned: 280 (million)
% 4.10/1.28 % (21343)------------------------------
% 4.10/1.28 % (21343)------------------------------
% 4.10/1.28 % (21353)Instruction limit reached!
% 4.10/1.28 % (21353)------------------------------
% 4.10/1.28 % (21353)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 4.10/1.28 % (21353)Termination reason: Unknown
% 4.10/1.28 % (21353)Termination phase: Saturation
% 4.10/1.28
% 4.10/1.28 % (21353)Memory used [KB]: 3321
% 4.10/1.28 % (21353)Time elapsed: 0.039 s
% 4.10/1.28 % (21353)Instructions burned: 112 (million)
% 4.10/1.28 % (21353)------------------------------
% 4.10/1.28 % (21353)------------------------------
% 4.10/1.28 % (21355)Refutation not found, incomplete strategy% (21355)------------------------------
% 4.10/1.28 % (21355)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 4.10/1.28 % (21355)Termination reason: Refutation not found, incomplete strategy
% 4.10/1.28
% 4.10/1.28 % (21355)Memory used [KB]: 1502
% 4.10/1.28 % (21355)Time elapsed: 0.016 s
% 4.10/1.28 % (21355)Instructions burned: 61 (million)
% 4.10/1.28 % (21355)------------------------------
% 4.10/1.28 % (21355)------------------------------
% 4.10/1.28 % (21341)Instruction limit reached!
% 4.10/1.28 % (21341)------------------------------
% 4.10/1.28 % (21341)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 4.10/1.28 % (21341)Termination reason: Unknown
% 4.10/1.28 % (21341)Termination phase: Saturation
% 4.10/1.28
% 4.10/1.28 % (21341)Memory used [KB]: 2606
% 4.10/1.28 % (21341)Time elapsed: 0.115 s
% 4.10/1.28 % (21341)Instructions burned: 260 (million)
% 4.10/1.28 % (21341)------------------------------
% 4.10/1.28 % (21341)------------------------------
% 4.10/1.28 % (21356)lrs+1002_63:8_sil=4000:sp=frequency:urr=on:lcm=reverse:nwc=10.0:flr=on:i=306:fdi=1:fsr=off:br=off_0 on theBenchmark for (2990ds/306Mi)
% 4.10/1.28 % (21358)dis-1011_1:2_to=lpo:sil=2000:plsq=on:plsqr=473,226:etr=on:erd=off:i=85:bd=off:amm=off:ss=axioms:sgt=64:rawr=on:add=large:fd=off_0 on theBenchmark for (2990ds/85Mi)
% 4.10/1.28 % (21359)lrs+11_1:1_drc=off:sil=4000:fde=unused:sp=unary_frequency:sos=on:fs=off:nwc=17.7715:flr=on:avsq=on:i=182:kws=precedence:avsqr=18,127:bd=off:nm=16:fsr=off:uhcvi=on:rawr=on:s2pl=no:s2agt=8:ss=axioms:sd=1:st=3.5:aac=none:afp=50:afq=2.0_0 on theBenchmark for (2990ds/182Mi)
% 4.10/1.29 % (21357)dis+22_1:32_sil=2000:fde=none:nwc=10.0:slsqc=3:slsq=on:i=118:slsql=off:nm=16:fsr=off:fsd=on:ss=axioms_0 on theBenchmark for (2990ds/118Mi)
% 4.10/1.29 % (21352)Instruction limit reached!
% 4.10/1.29 % (21352)------------------------------
% 4.10/1.29 % (21352)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 4.10/1.29 % (21352)Termination reason: Unknown
% 4.10/1.29 % (21352)Termination phase: Saturation
% 4.10/1.29
% 4.10/1.29 % (21352)Memory used [KB]: 3418
% 4.10/1.29 % (21352)Time elapsed: 0.048 s
% 4.10/1.29 % (21352)Instructions burned: 179 (million)
% 4.10/1.29 % (21352)------------------------------
% 4.10/1.29 % (21352)------------------------------
% 4.10/1.29 % (21356)Refutation not found, incomplete strategy% (21356)------------------------------
% 4.10/1.29 % (21356)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 4.10/1.29 % (21356)Termination reason: Refutation not found, incomplete strategy
% 4.10/1.29
% 4.10/1.29 % (21356)Memory used [KB]: 1393
% 4.10/1.29 % (21356)Time elapsed: 0.007 s
% 4.10/1.29 % (21356)Instructions burned: 23 (million)
% 4.10/1.29 % (21356)------------------------------
% 4.10/1.29 % (21356)------------------------------
% 4.10/1.29 % (21360)lrs-32_1:4_to=lpo:drc=off:sil=2000:sp=reverse_arity:spb=goal_then_units:urr=on:nwc=2.0:i=134:ss=included:st=2.0:bd=preordered_0 on theBenchmark for (2990ds/134Mi)
% 4.10/1.29 % (21361)dis+1011_1:1_sil=2000:sos=on:newcnf=on:i=181:sd=2:ep=R:ss=axioms_0 on theBenchmark for (2990ds/181Mi)
% 4.10/1.29 % (21361)Refutation not found, incomplete strategy% (21361)------------------------------
% 4.10/1.29 % (21361)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 4.10/1.29 % (21361)Termination reason: Refutation not found, incomplete strategy
% 4.10/1.29
% 4.10/1.29 % (21361)Memory used [KB]: 1219
% 4.10/1.29 % (21361)Time elapsed: 0.004 s
% 4.10/1.29 % (21361)Instructions burned: 10 (million)
% 4.10/1.29 % (21361)------------------------------
% 4.10/1.29 % (21361)------------------------------
% 4.10/1.30 % (21362)dis-11_4:1_to=lpo:sil=2000:fde=unused:sims=off:sp=occurrence:lma=on:spb=goal_then_units:abs=on:fd=off:flr=on:avsq=on:i=61:avsqr=1137305,524288:bd=off:uhcvi=on:awrs=decay:sos=on:bsd=on:afp=50:afq=1.3:nwc=10.053150171695567_0 on theBenchmark for (2990ds/61Mi)
% 4.10/1.31 % (21362)Instruction limit reached!
% 4.10/1.31 % (21362)------------------------------
% 4.10/1.31 % (21362)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 4.10/1.31 % (21362)Termination reason: Unknown
% 4.10/1.31 % (21362)Termination phase: Saturation
% 4.10/1.31
% 4.10/1.31 % (21362)Memory used [KB]: 1661
% 4.10/1.31 % (21362)Time elapsed: 0.017 s
% 4.10/1.31 % (21362)Instructions burned: 62 (million)
% 4.10/1.31 % (21362)------------------------------
% 4.10/1.31 % (21362)------------------------------
% 4.10/1.32 % (21363)dis+1010_1:1_sil=2000:nwc=5.0:i=135:nm=4:av=off:rp=on:ep=R_0 on theBenchmark for (2990ds/135Mi)
% 4.71/1.32 % (21358)Instruction limit reached!
% 4.71/1.32 % (21358)------------------------------
% 4.71/1.32 % (21358)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 4.71/1.32 % (21358)Termination reason: Unknown
% 4.71/1.32 % (21358)Termination phase: Saturation
% 4.71/1.32
% 4.71/1.32 % (21358)Memory used [KB]: 1592
% 4.71/1.32 % (21358)Time elapsed: 0.041 s
% 4.71/1.32 % (21358)Instructions burned: 86 (million)
% 4.71/1.32 % (21358)------------------------------
% 4.71/1.32 % (21358)------------------------------
% 4.71/1.32 % (21276)Instruction limit reached!
% 4.71/1.32 % (21276)------------------------------
% 4.71/1.32 % (21276)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 4.71/1.32 % (21276)Termination reason: Unknown
% 4.71/1.32 % (21276)Termination phase: Saturation
% 4.71/1.32
% 4.71/1.32 % (21276)Memory used [KB]: 2329
% 4.71/1.32 % (21276)Time elapsed: 0.520 s
% 4.71/1.32 % (21276)Instructions burned: 1919 (million)
% 4.71/1.32 % (21276)------------------------------
% 4.71/1.32 % (21276)------------------------------
% 4.71/1.33 % (21360)Instruction limit reached!
% 4.71/1.33 % (21360)------------------------------
% 4.71/1.33 % (21360)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 4.71/1.33 % (21360)Termination reason: Unknown
% 4.71/1.33 % (21360)Termination phase: Saturation
% 4.71/1.33
% 4.71/1.33 % (21360)Memory used [KB]: 2547
% 4.71/1.33 % (21360)Time elapsed: 0.037 s
% 4.71/1.33 % (21360)Instructions burned: 135 (million)
% 4.71/1.33 % (21360)------------------------------
% 4.71/1.33 % (21360)------------------------------
% 4.71/1.33 % (21364)dis+1010_6843:1048576_to=lpo:sil=4000:bsd=on:sp=unary_frequency:sos=on:spb=non_intro:nwc=1.63121:newcnf=on:s2a=on:i=94:s2at=4.5:awrs=decay:awrsf=1049:bsdmm=1:bd=preordered:nm=2:av=off:gsp=on:s2pl=no_0 on theBenchmark for (2990ds/94Mi)
% 4.71/1.33 % (21366)dis+1011_2:3_sil=2000:tgt=ground:fde=none:sos=on:lsd=1:alpa=random:i=371:kws=inv_arity_squared:gsp=on:bsd=on_0 on theBenchmark for (2990ds/371Mi)
% 4.71/1.33 % (21365)lrs+1_1:1_sil=4000:plsqc=1:plsq=on:plsqr=108,31:sos=on:st=5.0:i=111:sd=2:bd=off:fsr=off:ss=axioms:rawr=on:bce=on:aac=none:afr=on_0 on theBenchmark for (2990ds/111Mi)
% 4.71/1.34 % (21357)Instruction limit reached!
% 4.71/1.34 % (21357)------------------------------
% 4.71/1.34 % (21357)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 4.71/1.34 % (21357)Termination reason: Unknown
% 4.71/1.34 % (21357)Termination phase: Saturation
% 4.71/1.34
% 4.71/1.34 % (21357)Memory used [KB]: 3105
% 4.71/1.34 % (21357)Time elapsed: 0.081 s
% 4.71/1.34 % (21357)Instructions burned: 120 (million)
% 4.71/1.34 % (21357)------------------------------
% 4.71/1.34 % (21357)------------------------------
% 4.71/1.35 % (21363)Instruction limit reached!
% 4.71/1.35 % (21363)------------------------------
% 4.71/1.35 % (21363)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 4.71/1.35 % (21363)Termination reason: Unknown
% 4.71/1.35 % (21363)Termination phase: Saturation
% 4.71/1.35
% 4.71/1.35 % (21363)Memory used [KB]: 2163
% 4.71/1.35 % (21363)Time elapsed: 0.055 s
% 4.71/1.35 % (21363)Instructions burned: 138 (million)
% 4.71/1.35 % (21363)------------------------------
% 4.71/1.35 % (21363)------------------------------
% 4.71/1.35 % (21367)dis+33_1:1_to=lpo:sil=16000:plsq=on:nwc=3.0:s2agt=16:s2a=on:i=1643:s2at=5.5:nm=2:av=off:fsr=off:s2pl=no:ep=RS:erd=off_0 on theBenchmark for (2990ds/1643Mi)
% 4.71/1.35 % (21368)lrs+1010_3:1_slsqr=4009667,65536:sil=4000:slsqc=3:slsq=on:i=143:slsql=off:ep=RST:nm=6:anc=none:avsq=on:plsq=on:plsqr=32,1_0 on theBenchmark for (2989ds/143Mi)
% 4.71/1.35 % (21366)Refutation not found, incomplete strategy% (21366)------------------------------
% 4.71/1.35 % (21366)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 4.71/1.35 % (21366)Termination reason: Refutation not found, incomplete strategy
% 4.71/1.35
% 4.71/1.35 % (21366)Memory used [KB]: 1729
% 4.71/1.35 % (21366)Time elapsed: 0.046 s
% 4.71/1.35 % (21366)Instructions burned: 60 (million)
% 4.71/1.35 % (21366)------------------------------
% 4.71/1.35 % (21366)------------------------------
% 4.71/1.36 % (21369)lrs+1011_1:64_sil=2000:fde=none:sos=on:urr=ec_only:nwc=10.0:i=225:nm=19:gsp=on:ss=axioms:bd=off_0 on theBenchmark for (2989ds/225Mi)
% 4.71/1.36 % (21364)Instruction limit reached!
% 4.71/1.36 % (21364)------------------------------
% 4.71/1.36 % (21364)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 4.71/1.36 % (21364)Termination reason: Unknown
% 4.71/1.36 % (21364)Termination phase: Saturation
% 4.71/1.36
% 4.71/1.36 % (21364)Memory used [KB]: 1739
% 4.71/1.36 % (21364)Time elapsed: 0.060 s
% 4.71/1.36 % (21364)Instructions burned: 95 (million)
% 4.71/1.36 % (21364)------------------------------
% 4.71/1.36 % (21364)------------------------------
% 4.71/1.37 % (21365)Instruction limit reached!
% 4.71/1.37 % (21365)------------------------------
% 4.71/1.37 % (21365)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 4.71/1.37 % (21365)Termination reason: Unknown
% 4.71/1.37 % (21365)Termination phase: Saturation
% 4.71/1.37
% 4.71/1.37 % (21365)Memory used [KB]: 2904
% 4.71/1.37 % (21365)Time elapsed: 0.059 s
% 4.71/1.37 % (21365)Instructions burned: 112 (million)
% 4.71/1.37 % (21365)------------------------------
% 4.71/1.37 % (21365)------------------------------
% 4.71/1.37 % (21359)Instruction limit reached!
% 4.71/1.37 % (21359)------------------------------
% 4.71/1.37 % (21359)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 4.71/1.37 % (21359)Termination reason: Unknown
% 4.71/1.37 % (21359)Termination phase: Saturation
% 4.71/1.37
% 4.71/1.37 % (21359)Memory used [KB]: 4893
% 4.71/1.37 % (21359)Time elapsed: 0.083 s
% 4.71/1.37 % (21359)Instructions burned: 183 (million)
% 4.71/1.37 % (21359)------------------------------
% 4.71/1.37 % (21359)------------------------------
% 4.71/1.37 % (21370)lrs+1002_1:128_to=lpo:sil=2000:plsq=on:plsqr=7,2:sos=on:spb=units:fd=preordered:nwc=5.0:i=89:bd=off:nm=4:av=off:rawr=on:newcnf=on:fs=off:fsr=off_0 on theBenchmark for (2989ds/89Mi)
% 4.71/1.37 % (21370)Refutation not found, incomplete strategy% (21370)------------------------------
% 4.71/1.37 % (21370)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 4.71/1.37 % (21370)Termination reason: Refutation not found, incomplete strategy
% 4.71/1.37
% 4.71/1.37 % (21370)Memory used [KB]: 1132
% 4.71/1.37 % (21370)Time elapsed: 0.002 s
% 4.71/1.37 % (21370)Instructions burned: 6 (million)
% 4.71/1.37 % (21370)------------------------------
% 4.71/1.37 % (21370)------------------------------
% 4.71/1.37 % (21372)dis+1002_50821:131072_drc=encompass:sil=4000:irw=on:fde=unused:etr=on:sp=occurrence:lma=on:spb=intro:urr=ec_only:nwc=14.514:s2agt=20:sac=on:s2a=on:s2pl=no:i=217:kws=precedence:awrs=decay:awrsf=404:nm=4:uhcvi=on:ss=axioms:rawr=on:nicw=on:afp=10:afq=2.1363337302905383:slsq=on:slsqc=1:slsqr=101081,131072:sup=off:amm=off:flr=on_0 on theBenchmark for (2989ds/217Mi)
% 4.71/1.37 % (21373)lrs+1011_1:1_sil=8000:nicw=on:i=1513:sd=1:ss=axioms:sgt=64_0 on theBenchmark for (2989ds/1513Mi)
% 4.71/1.38 % (21369)Refutation not found, incomplete strategy% (21369)------------------------------
% 4.71/1.38 % (21369)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 4.71/1.38 % (21369)Termination reason: Refutation not found, incomplete strategy
% 4.71/1.38
% 4.71/1.38 % (21369)Memory used [KB]: 1605
% 4.71/1.38 % (21369)Time elapsed: 0.019 s
% 4.71/1.38 % (21369)Instructions burned: 41 (million)
% 4.71/1.38 % (21369)------------------------------
% 4.71/1.38 % (21369)------------------------------
% 4.71/1.38 % (21371)lrs+1011_2:3_drc=off:sil=2000:tgt=ground:fde=none:sp=occurrence:urr=ec_only:lsd=100:i=149:bd=off:rawr=on:ins=4:av=off_0 on theBenchmark for (2989ds/149Mi)
% 5.24/1.39 % (21374)lrs+10_1:52_anc=all:bsr=unit_only:to=lpo:sil=2000:sp=frequency:fd=preordered:flr=on:sac=on:i=460:bd=off:alpa=true:plsq=on:plsqr=1,32_0 on theBenchmark for (2989ds/460Mi)
% 5.24/1.40 % (21368)Instruction limit reached!
% 5.24/1.40 % (21368)------------------------------
% 5.24/1.40 % (21368)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 5.24/1.40 % (21368)Termination reason: Unknown
% 5.24/1.40 % (21368)Termination phase: Saturation
% 5.24/1.40
% 5.24/1.40 % (21368)Memory used [KB]: 1998
% 5.24/1.40 % (21368)Time elapsed: 0.035 s
% 5.24/1.40 % (21368)Instructions burned: 145 (million)
% 5.24/1.40 % (21368)------------------------------
% 5.24/1.40 % (21368)------------------------------
% 5.24/1.41 % (21375)lrs+1002_1:8_sil=16000:tgt=ground:fde=none:sp=const_frequency:sos=on:nwc=3.0:i=76_0 on theBenchmark for (2989ds/76Mi)
% 5.24/1.41 % (21375)Refutation not found, incomplete strategy% (21375)------------------------------
% 5.24/1.41 % (21375)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 5.24/1.41 % (21375)Termination reason: Refutation not found, incomplete strategy
% 5.24/1.41
% 5.24/1.41 % (21375)Memory used [KB]: 1201
% 5.24/1.41 % (21375)Time elapsed: 0.003 s
% 5.24/1.41 % (21375)Instructions burned: 9 (million)
% 5.24/1.41 % (21375)------------------------------
% 5.24/1.41 % (21375)------------------------------
% 5.24/1.41 % (21376)lrs-1011_1:64_sil=2000:tgt=full:acc=on:urr=ec_only:sac=on:i=113:nm=2:ss=axioms:sgt=4:er=filter_0 on theBenchmark for (2989ds/113Mi)
% 5.24/1.44 % (21371)Instruction limit reached!
% 5.24/1.44 % (21371)------------------------------
% 5.24/1.44 % (21371)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 5.24/1.44 % (21371)Termination reason: Unknown
% 5.24/1.44 % (21371)Termination phase: Saturation
% 5.24/1.44
% 5.24/1.44 % (21371)Memory used [KB]: 2458
% 5.24/1.44 % (21371)Time elapsed: 0.078 s
% 5.24/1.44 % (21371)Instructions burned: 149 (million)
% 5.24/1.44 % (21371)------------------------------
% 5.24/1.44 % (21371)------------------------------
% 5.24/1.45 % (21376)Instruction limit reached!
% 5.24/1.45 % (21376)------------------------------
% 5.24/1.45 % (21376)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 5.24/1.45 % (21376)Termination reason: Unknown
% 5.24/1.45 % (21376)Termination phase: Saturation
% 5.24/1.45
% 5.24/1.45 % (21376)Memory used [KB]: 2447
% 5.24/1.45 % (21376)Time elapsed: 0.037 s
% 5.24/1.45 % (21376)Instructions burned: 114 (million)
% 5.24/1.45 % (21376)------------------------------
% 5.24/1.45 % (21376)------------------------------
% 5.24/1.45 % (21378)dis+1011_2:3_sil=8000:tgt=ground:fde=none:spb=goal_then_units:acc=on:nwc=4.0:updr=off:i=639:kws=inv_frequency:nm=16:ins=3:rawr=on:amm=sco_0 on theBenchmark for (2988ds/639Mi)
% 5.24/1.45 % (21377)dis-1002_3:1_to=lpo:sil=4000:sp=occurrence:fd=off:nwc=6.0:st=2.0:i=77:sd=1:fsr=off:ss=axioms:sgt=16:fs=off_0 on theBenchmark for (2988ds/77Mi)
% 5.51/1.46 % (21372)Instruction limit reached!
% 5.51/1.46 % (21372)------------------------------
% 5.51/1.46 % (21372)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 5.51/1.46 % (21372)Termination reason: Unknown
% 5.51/1.46 % (21372)Termination phase: Saturation
% 5.51/1.46
% 5.51/1.46 % (21372)Memory used [KB]: 2425
% 5.51/1.46 % (21372)Time elapsed: 0.092 s
% 5.51/1.46 % (21372)Instructions burned: 217 (million)
% 5.51/1.46 % (21372)------------------------------
% 5.51/1.46 % (21372)------------------------------
% 5.62/1.47 % (21379)dis+1011_1:1_sil=2000:fd=off:nwc=10.0:s2a=on:i=851:bd=off:nm=2:sup=off:s2at=4.0_0 on theBenchmark for (2988ds/851Mi)
% 5.62/1.49 % (21377)Instruction limit reached!
% 5.62/1.49 % (21377)------------------------------
% 5.62/1.49 % (21377)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 5.62/1.49 % (21377)Termination reason: Unknown
% 5.62/1.49 % (21377)Termination phase: Saturation
% 5.62/1.49
% 5.62/1.49 % (21377)Memory used [KB]: 2180
% 5.62/1.49 % (21377)Time elapsed: 0.039 s
% 5.62/1.49 % (21377)Instructions burned: 77 (million)
% 5.62/1.49 % (21377)------------------------------
% 5.62/1.49 % (21377)------------------------------
% 5.62/1.50 % (21380)lrs+1011_1:2_sil=2000:fde=unused:nwc=10.0:newcnf=on:i=463:ep=RST:av=off:ins=1_0 on theBenchmark for (2988ds/463Mi)
% 5.80/1.57 % (21317)Instruction limit reached!
% 5.80/1.57 % (21317)------------------------------
% 5.80/1.57 % (21317)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 5.80/1.57 % (21317)Termination reason: Unknown
% 5.80/1.57 % (21317)Termination phase: Saturation
% 5.80/1.57
% 5.80/1.57 % (21317)Memory used [KB]: 4355
% 5.80/1.57 % (21317)Time elapsed: 0.569 s
% 5.80/1.57 % (21317)Instructions burned: 1376 (million)
% 5.80/1.57 % (21317)------------------------------
% 5.80/1.57 % (21317)------------------------------
% 5.80/1.57 % (21380)Refutation not found, incomplete strategy% (21380)------------------------------
% 5.80/1.57 % (21380)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 5.80/1.57 % (21380)Termination reason: Refutation not found, incomplete strategy
% 5.80/1.57
% 5.80/1.57 % (21380)Memory used [KB]: 1879
% 5.80/1.57 % (21380)Time elapsed: 0.076 s
% 5.80/1.57 % (21380)Instructions burned: 316 (million)
% 5.80/1.57 % (21380)------------------------------
% 5.80/1.57 % (21380)------------------------------
% 5.80/1.57 % (21381)lrs+1011_1:95_anc=none:sil=2000:plsq=on:plsqr=7,80:sos=on:lsd=50:plsql=on:fd=off:st=6.0:s2a=on:i=127:nm=16:uhcvi=on:ss=axioms:rawr=on:gsp=on:amm=sco_0 on theBenchmark for (2987ds/127Mi)
% 5.80/1.58 % (21374)Instruction limit reached!
% 5.80/1.58 % (21374)------------------------------
% 5.80/1.58 % (21374)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 5.80/1.58 % (21374)Termination reason: Unknown
% 5.80/1.58 % (21374)Termination phase: Saturation
% 5.80/1.58
% 5.80/1.58 % (21374)Memory used [KB]: 4914
% 5.80/1.58 % (21374)Time elapsed: 0.191 s
% 5.80/1.58 % (21374)Instructions burned: 461 (million)
% 5.80/1.58 % (21374)------------------------------
% 5.80/1.58 % (21374)------------------------------
% 5.80/1.58 % (21383)dis+10_16:63_anc=none:to=lpo:sil=2000:fde=none:sos=on:nwc=10.0:i=140:sd=1:aac=none:ep=RS:fsr=off:ss=axioms:st=5.0_0 on theBenchmark for (2987ds/140Mi)
% 5.80/1.59 % (21382)lrs+1010_1:1_anc=all_dependent:sil=2000:tgt=ground:nwc=5.0:s2agt=20:alpa=false:newcnf=on:avsq=on:s2a=on:i=159:avsqr=1,16:bd=off:sac=on:aac=none:erd=off_0 on theBenchmark for (2987ds/159Mi)
% 5.80/1.59 % (21383)Refutation not found, incomplete strategy% (21383)------------------------------
% 5.80/1.59 % (21383)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 5.80/1.59 % (21383)Termination reason: Refutation not found, incomplete strategy
% 5.80/1.59
% 5.80/1.59 % (21383)Memory used [KB]: 1375
% 5.80/1.59 % (21383)Time elapsed: 0.005 s
% 5.80/1.59 % (21383)Instructions burned: 14 (million)
% 5.80/1.59 % (21383)------------------------------
% 5.80/1.59 % (21383)------------------------------
% 5.80/1.59 % (21384)dis-1002_1:12_to=lpo:sil=2000:sp=const_max:nwc=2.0:sac=on:i=246:nm=16:nicw=on:fsr=off_0 on theBenchmark for (2987ds/246Mi)
% 5.80/1.59 % (21381)Refutation not found, incomplete strategy% (21381)------------------------------
% 5.80/1.59 % (21381)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 5.80/1.59 % (21381)Termination reason: Refutation not found, incomplete strategy
% 5.80/1.59
% 5.80/1.59 % (21381)Memory used [KB]: 1559
% 5.80/1.59 % (21381)Time elapsed: 0.018 s
% 5.80/1.59 % (21381)Instructions burned: 50 (million)
% 5.80/1.59 % (21381)------------------------------
% 5.80/1.59 % (21381)------------------------------
% 5.80/1.59 % (21385)lrs+1011_7141:1048576_sil=2000:plsq=on:plsqr=2328305,1048576:sp=frequency:sos=on:plsql=on:fd=off:nwc=19.7177:cond=fast:st=3:i=275:bd=off:nm=2:ins=2:av=off:uhcvi=on:fdi=16:ss=included:lsd=5_0 on theBenchmark for (2987ds/275Mi)
% 5.80/1.60 % (21385)Refutation not found, incomplete strategy% (21385)------------------------------
% 5.80/1.60 % (21385)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 5.80/1.60 % (21385)Termination reason: Refutation not found, incomplete strategy
% 5.80/1.60
% 5.80/1.60 % (21385)Memory used [KB]: 1272
% 5.80/1.60 % (21385)Time elapsed: 0.009 s
% 5.80/1.60 % (21385)Instructions burned: 16 (million)
% 5.80/1.60 % (21385)------------------------------
% 5.80/1.60 % (21385)------------------------------
% 5.80/1.61 % (21386)lrs+2_1:1_sil=2000:tgt=ground:sos=on:i=1318:sd=1:ss=included:to=lpo:plsq=on:plsqr=32,1_0 on theBenchmark for (2987ds/1318Mi)
% 5.80/1.62 % (21386)Refutation not found, incomplete strategy% (21386)------------------------------
% 5.80/1.62 % (21386)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 5.80/1.62 % (21386)Termination reason: Refutation not found, incomplete strategy
% 5.80/1.62
% 5.80/1.62 % (21386)Memory used [KB]: 1348
% 5.80/1.62 % (21386)Time elapsed: 0.011 s
% 5.80/1.62 % (21386)Instructions burned: 19 (million)
% 5.80/1.62 % (21386)------------------------------
% 5.80/1.62 % (21386)------------------------------
% 5.80/1.62 % (21387)lrs+35_10:1_bsr=unit_only:to=lpo:sil=2000:bsd=on:sp=unary_first:abs=on:urr=on:s2agt=32:newcnf=on:s2a=on:i=286:gsp=on:rawr=on:sac=on:afp=1000:avsq=on:avsqr=63937,1048576:nwc=10.0_0 on theBenchmark for (2987ds/286Mi)
% 6.25/1.63 % (21382)Instruction limit reached!
% 6.25/1.63 % (21382)------------------------------
% 6.25/1.63 % (21382)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 6.25/1.63 % (21382)Termination reason: Unknown
% 6.25/1.63 % (21382)Termination phase: Saturation
% 6.25/1.63
% 6.25/1.63 % (21382)Memory used [KB]: 2086
% 6.25/1.63 % (21382)Time elapsed: 0.063 s
% 6.25/1.63 % (21382)Instructions burned: 160 (million)
% 6.25/1.63 % (21382)------------------------------
% 6.25/1.63 % (21382)------------------------------
% 6.25/1.63 % (21388)dis+1002_5:16_sil=4000:sos=on:sac=on:i=965:ep=RST:fsr=off:erd=off_0 on theBenchmark for (2987ds/965Mi)
% 6.25/1.63 % (21388)Refutation not found, incomplete strategy% (21388)------------------------------
% 6.25/1.63 % (21388)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 6.25/1.63 % (21388)Termination reason: Refutation not found, incomplete strategy
% 6.25/1.63
% 6.25/1.63 % (21388)Memory used [KB]: 1196
% 6.25/1.63 % (21388)Time elapsed: 0.002 s
% 6.25/1.63 % (21388)Instructions burned: 6 (million)
% 6.25/1.63 % (21388)------------------------------
% 6.25/1.63 % (21388)------------------------------
% 6.25/1.63 % (21389)dis+1011_4:1_slsqr=11827605,262144:sil=2000:sp=const_max:spb=non_intro:acc=on:newcnf=on:slsq=on:nicw=on:i=144:kws=precedence:bd=off:rawr=on:alpa=true:bsd=on:bsr=unit_only:urr=ec_only_0 on theBenchmark for (2987ds/144Mi)
% 6.25/1.65 % (21378)Instruction limit reached!
% 6.25/1.65 % (21378)------------------------------
% 6.25/1.65 % (21378)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 6.25/1.65 % (21378)Termination reason: Unknown
% 6.25/1.65 % (21378)Termination phase: Saturation
% 6.25/1.65
% 6.25/1.65 % (21378)Memory used [KB]: 2332
% 6.25/1.65 % (21378)Time elapsed: 0.200 s
% 6.25/1.65 % (21378)Instructions burned: 640 (million)
% 6.25/1.65 % (21378)------------------------------
% 6.25/1.65 % (21378)------------------------------
% 6.25/1.66 % (21390)dis-1002_1:64_sil=2000:sos=on:nwc=10.0:i=145:nm=2:ss=axioms:ep=RST:sd=1_0 on theBenchmark for (2986ds/145Mi)
% 6.25/1.66 % (21390)Refutation not found, incomplete strategy% (21390)------------------------------
% 6.25/1.66 % (21390)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 6.25/1.66 % (21390)Termination reason: Refutation not found, incomplete strategy
% 6.25/1.66
% 6.25/1.66 % (21390)Memory used [KB]: 1172
% 6.25/1.66 % (21390)Time elapsed: 0.004 s
% 6.25/1.66 % (21390)Instructions burned: 5 (million)
% 6.25/1.66 % (21390)------------------------------
% 6.25/1.66 % (21390)------------------------------
% 6.25/1.67 % (21391)lrs-1010_1:4_sil=256000:sp=occurrence:sos=on:s2a=on:i=3921:sd=1:kws=precedence:bd=off:ins=3:ss=included:sfv=off:amm=off_0 on theBenchmark for (2986ds/3921Mi)
% 6.25/1.67 % (21389)Instruction limit reached!
% 6.25/1.67 % (21389)------------------------------
% 6.25/1.67 % (21389)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 6.25/1.67 % (21389)Termination reason: Unknown
% 6.25/1.67 % (21389)Termination phase: Saturation
% 6.25/1.67
% 6.25/1.67 % (21389)Memory used [KB]: 2017
% 6.25/1.67 % (21389)Time elapsed: 0.036 s
% 6.25/1.67 % (21389)Instructions burned: 145 (million)
% 6.25/1.67 % (21389)------------------------------
% 6.25/1.67 % (21389)------------------------------
% 6.25/1.67 % (21391)Refutation not found, incomplete strategy% (21391)------------------------------
% 6.25/1.67 % (21391)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 6.25/1.67 % (21391)Termination reason: Refutation not found, incomplete strategy
% 6.25/1.67
% 6.25/1.67 % (21391)Memory used [KB]: 1197
% 6.25/1.67 % (21391)Time elapsed: 0.004 s
% 6.25/1.67 % (21391)Instructions burned: 6 (million)
% 6.25/1.67 % (21391)------------------------------
% 6.25/1.67 % (21391)------------------------------
% 6.25/1.67 % (21392)dis+1011_8:1_sil=4000:sos=on:acc=on:alpa=true:i=154:fsr=off:sfv=off:gsp=on_0 on theBenchmark for (2986ds/154Mi)
% 6.25/1.67 % (21393)lrs+20_16421289:1048576_drc=encompass:sil=4000:sp=frequency:sos=on:spb=intro:lcm=predicate:gs=on:nwc=19.1506:alpa=random:kmz=on:updr=off:sac=on:gsem=on:i=205:bs=on:gsaa=from_current:sd=3:kws=inv_arity_squared:afp=50:nm=49:afq=1.98965:gsp=on:ss=axioms:er=filter:sgt=20:rawr=on:avsq=on:avsqr=1994651,1048576:sup=off_0 on theBenchmark for (2986ds/205Mi)
% 6.25/1.68 % (21379)Instruction limit reached!
% 6.25/1.68 % (21379)------------------------------
% 6.25/1.68 % (21379)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 6.25/1.68 % (21379)Termination reason: Unknown
% 6.25/1.68 % (21379)Termination phase: Saturation
% 6.25/1.68
% 6.25/1.68 % (21379)Memory used [KB]: 2485
% 6.25/1.68 % (21379)Time elapsed: 0.205 s
% 6.25/1.68 % (21379)Instructions burned: 853 (million)
% 6.25/1.68 % (21379)------------------------------
% 6.25/1.68 % (21379)------------------------------
% 6.25/1.68 % (21393)Refutation not found, incomplete strategy% (21393)------------------------------
% 6.25/1.68 % (21393)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 6.25/1.68 % (21393)Termination reason: Refutation not found, incomplete strategy
% 6.25/1.68
% 6.25/1.68 % (21393)Memory used [KB]: 1319
% 6.25/1.68 % (21373)Instruction limit reached!
% 6.25/1.68 % (21373)------------------------------
% 6.25/1.68 % (21373)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 6.25/1.68 % (21373)Termination reason: Unknown
% 6.25/1.68 % (21373)Termination phase: Saturation
% 6.25/1.68
% 6.25/1.68 % (21373)Memory used [KB]: 2109
% 6.25/1.68 % (21373)Time elapsed: 0.312 s
% 6.25/1.68 % (21373)Instructions burned: 1514 (million)
% 6.25/1.68 % (21373)------------------------------
% 6.25/1.68 % (21373)------------------------------
% 6.25/1.68 % (21393)Time elapsed: 0.010 s
% 6.25/1.68 % (21393)Instructions burned: 16 (million)
% 6.25/1.68 % (21393)------------------------------
% 6.25/1.68 % (21393)------------------------------
% 6.25/1.68 % (21392)Refutation not found, incomplete strategy% (21392)------------------------------
% 6.25/1.68 % (21392)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 6.25/1.68 % (21392)Termination reason: Refutation not found, incomplete strategy
% 6.25/1.68
% 6.25/1.68 % (21392)Memory used [KB]: 1645
% 6.25/1.68 % (21392)Time elapsed: 0.014 s
% 6.25/1.68 % (21392)Instructions burned: 56 (million)
% 6.25/1.68 % (21392)------------------------------
% 6.25/1.68 % (21392)------------------------------
% 6.25/1.68 % (21394)lrs-1002_138645:1048576_sfv=off:slsqr=135371,262144:to=lpo:drc=encompass:sil=4000:tgt=full:bsd=on:sp=const_frequency:spb=goal:urr=ec_only:rp=on:nwc=4.14887:s2agt=50:newcnf=on:slsq=on:i=899:s2at=3:afp=1000:bsdmm=2:bd=preordered:nm=15:afq=4.12266:rawr=on:bsr=unit_only:lwlo=on:irw=on:bce=on_0 on theBenchmark for (2986ds/899Mi)
% 6.25/1.69 % (21397)lrs-1002_6:7_sil=4000:sos=on:nwc=10.0:i=120:ep=R:ins=1:fsr=off:gsp=on:fs=off:fde=none:avsq=on:bce=on_0 on theBenchmark for (2986ds/120Mi)
% 7.17/1.69 % (21396)lrs+1010_1:1_slsqr=430,487:sil=4000:fde=none:plsq=on:plsqr=7,29:erd=off:plsql=on:rp=on:nwc=14.055527276864483:slsqc=3:newcnf=on:slsq=on:i=175:bd=off:av=off:rawr=on_0 on theBenchmark for (2986ds/175Mi)
% 7.17/1.69 % (21384)Instruction limit reached!
% 7.17/1.69 % (21384)------------------------------
% 7.17/1.69 % (21384)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 7.17/1.69 % (21384)Termination reason: Unknown
% 7.17/1.69 % (21384)Termination phase: Saturation
% 7.17/1.69
% 7.17/1.69 % (21384)Memory used [KB]: 2914
% 7.17/1.69 % (21384)Time elapsed: 0.099 s
% 7.17/1.69 % (21384)Instructions burned: 246 (million)
% 7.17/1.69 % (21384)------------------------------
% 7.17/1.69 % (21384)------------------------------
% 7.17/1.69 % (21395)lrs-32_1:1024_sil=8000:sos=on:i=645:nm=4:updr=off_0 on theBenchmark for (2986ds/645Mi)
% 7.17/1.69 % (21387)Instruction limit reached!
% 7.17/1.69 % (21387)------------------------------
% 7.17/1.69 % (21387)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 7.17/1.69 % (21387)Termination reason: Unknown
% 7.17/1.69 % (21387)Termination phase: Saturation
% 7.17/1.69
% 7.17/1.69 % (21387)Memory used [KB]: 5291
% 7.17/1.69 % (21387)Time elapsed: 0.072 s
% 7.17/1.69 % (21387)Instructions burned: 286 (million)
% 7.17/1.69 % (21387)------------------------------
% 7.17/1.69 % (21387)------------------------------
% 7.17/1.69 % (21398)lrs-1011_4:7_sil=2000:tgt=full:bsd=on:spb=goal:nwc=5.0:updr=off:newcnf=on:i=144:kws=arity_squared:rawr=on:bsdmm=2_0 on theBenchmark for (2986ds/144Mi)
% 7.17/1.69 % (21397)Refutation not found, incomplete strategy% (21397)------------------------------
% 7.17/1.69 % (21397)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 7.17/1.69 % (21397)Termination reason: Refutation not found, incomplete strategy
% 7.17/1.69
% 7.17/1.69 % (21397)Memory used [KB]: 1579
% 7.17/1.69 % (21397)Time elapsed: 0.007 s
% 7.17/1.69 % (21397)Instructions burned: 27 (million)
% 7.17/1.69 % (21399)lrs+10_1:1_sil=16000:sp=frequency:nwc=10.0:s2agt=5:s2a=on:i=166:sd=2:nm=2:ss=axioms:sgt=8:bd=off_0 on theBenchmark for (2986ds/166Mi)
% 7.17/1.69 % (21397)------------------------------
% 7.17/1.69 % (21397)------------------------------
% 7.17/1.70 % (21400)lrs+10_1:1_sil=4000:tgt=full:sos=on:st=2.0:i=97:sd=2:kws=inv_frequency:nm=4:ss=axioms:sac=on_0 on theBenchmark for (2986ds/97Mi)
% 7.17/1.70 % (21322)Instruction limit reached!
% 7.17/1.70 % (21322)------------------------------
% 7.17/1.70 % (21322)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 7.17/1.70 % (21322)Termination reason: Unknown
% 7.17/1.70 % (21322)Termination phase: Saturation
% 7.17/1.70
% 7.17/1.70 % (21322)Memory used [KB]: 4961
% 7.17/1.70 % (21322)Time elapsed: 0.678 s
% 7.17/1.70 % (21322)Instructions burned: 1798 (million)
% 7.17/1.70 % (21322)------------------------------
% 7.17/1.70 % (21322)------------------------------
% 7.17/1.71 % (21401)lrs+10_1:14_bsr=on:sil=2000:sp=occurrence:sos=on:bce=on:gs=on:newcnf=on:nicw=on:i=159:gsaa=from_current:amm=off:rawr=on:avsq=on:avsqr=2,7:fsr=off_0 on theBenchmark for (2986ds/159Mi)
% 7.17/1.72 % (21400)Instruction limit reached!
% 7.17/1.72 % (21400)------------------------------
% 7.17/1.72 % (21400)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 7.17/1.72 % (21400)Termination reason: Unknown
% 7.17/1.72 % (21400)Termination phase: Saturation
% 7.17/1.72
% 7.17/1.72 % (21400)Memory used [KB]: 2305
% 7.17/1.72 % (21400)Time elapsed: 0.028 s
% 7.17/1.72 % (21400)Instructions burned: 97 (million)
% 7.17/1.72 % (21400)------------------------------
% 7.17/1.72 % (21400)------------------------------
% 7.17/1.72 % (21402)lrs+1_8:1_bsr=on:sil=2000:abs=on:fd=preordered:nwc=10.0:s2a=on:i=135:bd=off:sup=off:s2pl=on_0 on theBenchmark for (2986ds/135Mi)
% 7.17/1.76 % (21396)Instruction limit reached!
% 7.17/1.76 % (21396)------------------------------
% 7.17/1.76 % (21396)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 7.17/1.76 % (21396)Termination reason: Unknown
% 7.17/1.76 % (21396)Termination phase: Saturation
% 7.17/1.76
% 7.17/1.76 % (21396)Memory used [KB]: 2061
% 7.17/1.76 % (21396)Time elapsed: 0.072 s
% 7.17/1.76 % (21396)Instructions burned: 176 (million)
% 7.17/1.76 % (21396)------------------------------
% 7.17/1.76 % (21396)------------------------------
% 7.17/1.76 % (21398)Instruction limit reached!
% 7.17/1.76 % (21398)------------------------------
% 7.17/1.76 % (21398)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 7.17/1.76 % (21398)Termination reason: Unknown
% 7.17/1.76 % (21398)Termination phase: Saturation
% 7.17/1.76
% 7.17/1.76 % (21398)Memory used [KB]: 2158
% 7.17/1.76 % (21398)Time elapsed: 0.087 s
% 7.17/1.76 % (21398)Instructions burned: 145 (million)
% 7.17/1.76 % (21398)------------------------------
% 7.17/1.76 % (21398)------------------------------
% 7.17/1.76 % (21399)Instruction limit reached!
% 7.17/1.76 % (21399)------------------------------
% 7.17/1.76 % (21399)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 7.17/1.76 % (21399)Termination reason: Unknown
% 7.17/1.76 % (21399)Termination phase: Saturation
% 7.17/1.76
% 7.17/1.76 % (21399)Memory used [KB]: 3398
% 7.17/1.76 % (21399)Time elapsed: 0.067 s
% 7.17/1.76 % (21399)Instructions burned: 167 (million)
% 7.17/1.76 % (21399)------------------------------
% 7.17/1.76 % (21399)------------------------------
% 7.17/1.76 % (21401)Instruction limit reached!
% 7.17/1.76 % (21401)------------------------------
% 7.17/1.76 % (21401)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 7.17/1.76 % (21401)Termination reason: Unknown
% 7.17/1.76 % (21401)Termination phase: Saturation
% 7.17/1.76
% 7.17/1.76 % (21401)Memory used [KB]: 3456
% 7.17/1.76 % (21401)Time elapsed: 0.076 s
% 7.17/1.76 % (21401)Instructions burned: 159 (million)
% 7.17/1.76 % (21401)------------------------------
% 7.17/1.76 % (21401)------------------------------
% 7.17/1.76 % (21404)dis+1002_1:1_sil=8000:fde=none:nwc=5.0:i=119:ep=R:fsr=off:sos=on:mep=off_0 on theBenchmark for (2985ds/119Mi)
% 7.17/1.76 % (21405)ott-1010_16:1_bsr=unit_only:sil=64000:sos=on:urr=on:sac=on:i=4758:sd=2:kws=inv_frequency:ins=4:ss=axioms:br=off_0 on theBenchmark for (2985ds/4758Mi)
% 7.17/1.76 % (21404)Refutation not found, incomplete strategy% (21404)------------------------------
% 7.17/1.76 % (21404)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 7.17/1.76 % (21404)Termination reason: Refutation not found, incomplete strategy
% 7.17/1.76
% 7.17/1.76 % (21404)Memory used [KB]: 1196
% 7.17/1.76 % (21404)Time elapsed: 0.002 s
% 7.17/1.76 % (21404)Instructions burned: 6 (million)
% 7.17/1.76 % (21404)------------------------------
% 7.17/1.76 % (21404)------------------------------
% 7.17/1.77 % (21402)Instruction limit reached!
% 7.17/1.77 % (21402)------------------------------
% 7.17/1.77 % (21402)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 7.17/1.77 % (21402)Termination reason: Unknown
% 7.17/1.77 % (21402)Termination phase: Saturation
% 7.17/1.77
% 7.17/1.77 % (21402)Memory used [KB]: 3287
% 7.17/1.77 % (21402)Time elapsed: 0.063 s
% 7.17/1.77 % (21402)Instructions burned: 137 (million)
% 7.17/1.77 % (21402)------------------------------
% 7.17/1.77 % (21402)------------------------------
% 7.17/1.77 % (21406)dis+1011_3:2_drc=encompass:sil=8000:tgt=full:sp=frequency:nwc=10.0:i=139:nm=2:fde=none:ins=1_0 on theBenchmark for (2985ds/139Mi)
% 7.17/1.77 % (21403)dis+1011_5:1_sil=2000:fde=unused:nwc=10.0:i=450:ep=R:fs=off:fsr=off:awrs=converge_0 on theBenchmark for (2985ds/450Mi)
% 7.17/1.77 % (21407)dis+1011_4:1_sil=2000:nwc=10.0:newcnf=on:i=139:sd=1:nm=2:ss=axioms:fde=unused:sup=off:av=off_0 on theBenchmark for (2985ds/139Mi)
% 7.17/1.77 % (21407)Refutation not found, incomplete strategy% (21407)------------------------------
% 7.17/1.77 % (21407)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 7.17/1.77 % (21407)Termination reason: Refutation not found, incomplete strategy
% 7.17/1.77
% 7.17/1.77 % (21407)Memory used [KB]: 1125
% 7.17/1.77 % (21407)Time elapsed: 0.003 s
% 7.17/1.77 % (21407)Instructions burned: 8 (million)
% 7.17/1.77 % (21407)------------------------------
% 7.17/1.77 % (21407)------------------------------
% 7.17/1.77 % (21409)lrs+1010_1:16_sil=2000:plsq=on:plsqr=32,1:slsq=on:i=53:slsql=off:bd=off:er=filter:erml=3:slsqc=2:cond=on:alpa=false:fsr=off:acc=on_0 on theBenchmark for (2985ds/53Mi)
% 7.17/1.78 % (21405)Refutation not found, incomplete strategy% (21405)------------------------------
% 7.17/1.78 % (21405)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 7.17/1.78 % (21405)Termination reason: Refutation not found, incomplete strategy
% 7.17/1.78
% 7.17/1.78 % (21405)Memory used [KB]: 1372
% 7.17/1.78 % (21405)Time elapsed: 0.013 s
% 7.17/1.78 % (21405)Instructions burned: 26 (million)
% 7.17/1.78 % (21405)------------------------------
% 7.17/1.78 % (21405)------------------------------
% 8.33/1.78 % (21408)lrs+1011_8157881:1048576_to=lpo:drc=off:sil=2000:fde=unused:sos=on:spb=intro:urr=on:nwc=4.0:i=116:add=off:sd=1:nm=19:fsr=off:uhcvi=on:ss=axioms:sgt=100:ins=3:sup=off:afp=1000:s2pl=no:anc=none:acc=model:fs=off:lma=on_0 on theBenchmark for (2985ds/116Mi)
% 8.33/1.78 % (21406)Refutation not found, incomplete strategy% (21406)------------------------------
% 8.33/1.78 % (21406)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 8.33/1.78 % (21406)Termination reason: Refutation not found, incomplete strategy
% 8.33/1.78
% 8.33/1.78 % (21406)Memory used [KB]: 1585
% 8.33/1.78 % (21406)Time elapsed: 0.017 s
% 8.33/1.78 % (21406)Instructions burned: 59 (million)
% 8.33/1.78 % (21406)------------------------------
% 8.33/1.78 % (21406)------------------------------
% 8.33/1.79 % (21411)lrs+11_4:1_sil=2000:tgt=full:sos=on:erd=off:spb=goal_then_units:sac=on:st=6.0:i=96:nm=3:ss=included:sd=1:s2pl=on:awrs=converge:awrsf=20:afp=50:afq=1.2_0 on theBenchmark for (2985ds/96Mi)
% 8.39/1.79 % (21409)Instruction limit reached!
% 8.39/1.79 % (21409)------------------------------
% 8.39/1.79 % (21409)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 8.39/1.79 % (21409)Termination reason: Unknown
% 8.39/1.79 % (21409)Termination phase: Saturation
% 8.39/1.79
% 8.39/1.79 % (21409)Memory used [KB]: 1465
% 8.39/1.79 % (21409)Time elapsed: 0.015 s
% 8.39/1.79 % (21409)Instructions burned: 53 (million)
% 8.39/1.79 % (21409)------------------------------
% 8.39/1.79 % (21409)------------------------------
% 8.39/1.79 % (21412)lrs+1011_4345945:1048576_bsr=unit_only:sil=8000:tgt=full:irw=on:fde=none:sos=on:lma=on:spb=intro:abs=on:urr=on:br=off:fd=preordered:rp=on:nwc=14.3155:s2agt=50:alpa=random:kmz=on:updr=off:s2a=on:i=223:add=off:bs=on:kws=inv_arity_squared:afp=100000:aac=none:awrs=decay:awrsf=1366:nm=2:ins=2:afq=4.07453:uhcvi=on:afr=on:rawr=on:sp=unary_first:bd=off:fsd=on:fsdmm=1:s2at=5.0:sup=off_0 on theBenchmark for (2985ds/223Mi)
% 8.39/1.79 % (21410)dis-1002_1:1024_sil=2000:tgt=ground:sos=on:acc=model:s2agt=64:sac=on:newcnf=on:s2a=on:i=159:fsr=off:ss=axioms:ins=1_0 on theBenchmark for (2985ds/159Mi)
% 8.39/1.79 % (21410)Refutation not found, incomplete strategy% (21410)------------------------------
% 8.39/1.79 % (21410)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 8.39/1.79 % (21410)Termination reason: Refutation not found, incomplete strategy
% 8.39/1.79
% 8.39/1.79 % (21410)Memory used [KB]: 1115
% 8.39/1.79 % (21410)Time elapsed: 0.006 s
% 8.39/1.79 % (21410)Instructions burned: 9 (million)
% 8.39/1.79 % (21410)------------------------------
% 8.39/1.79 % (21410)------------------------------
% 8.39/1.80 % (21412)Refutation not found, incomplete strategy% (21412)------------------------------
% 8.39/1.80 % (21412)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 8.39/1.80 % (21412)Termination reason: Refutation not found, incomplete strategy
% 8.39/1.80
% 8.39/1.80 % (21412)Memory used [KB]: 1478
% 8.39/1.80 % (21412)Time elapsed: 0.010 s
% 8.39/1.80 % (21412)Instructions burned: 37 (million)
% 8.39/1.80 % (21412)------------------------------
% 8.39/1.80 % (21412)------------------------------
% 8.39/1.80 % (21413)dis+1011_16:1_anc=all_dependent:sil=4000:tgt=ground:fde=unused:sos=on:acc=model:newcnf=on:avsq=on:i=116:bs=on:avsqr=32,501:uhcvi=on:rawr=on:nwc=10.0:alpa=true:slsq=on:slsqr=5,16_0 on theBenchmark for (2985ds/116Mi)
% 8.39/1.80 % (21414)lrs-1011_1:1_bsr=unit_only:sil=2000:sp=occurrence:sac=on:i=149:sd=3:ss=axioms:sgt=30:newcnf=on_0 on theBenchmark for (2985ds/149Mi)
% 8.39/1.81 % (21413)Refutation not found, incomplete strategy% (21413)------------------------------
% 8.39/1.81 % (21413)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 8.39/1.81 % (21413)Termination reason: Refutation not found, incomplete strategy
% 8.39/1.81
% 8.39/1.81 % (21413)Memory used [KB]: 1332
% 8.39/1.81 % (21413)Time elapsed: 0.011 s
% 8.39/1.81 % (21413)Instructions burned: 20 (million)
% 8.39/1.81 % (21413)------------------------------
% 8.39/1.81 % (21413)------------------------------
% 8.39/1.81 % (21411)Instruction limit reached!
% 8.39/1.81 % (21411)------------------------------
% 8.39/1.81 % (21411)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 8.39/1.81 % (21411)Termination reason: Unknown
% 8.39/1.81 % (21411)Termination phase: Saturation
% 8.39/1.81
% 8.39/1.81 % (21411)Memory used [KB]: 2227
% 8.39/1.81 % (21411)Time elapsed: 0.029 s
% 8.39/1.81 % (21411)Instructions burned: 96 (million)
% 8.39/1.81 % (21411)------------------------------
% 8.39/1.81 % (21411)------------------------------
% 8.39/1.82 % (21416)lrs+1011_10195:1048576_to=lpo:sil=2000:fde=none:ile=on:sp=const_frequency:lma=on:lcm=reverse:nwc=22.1777:flr=on:st=1.5:i=420:bs=on:sd=2:awrs=converge:awrsf=457:bd=preordered:nm=5:fsd=on:ss=axioms:sgt=20:rawr=on:etr=on:bsd=on:afp=10:afq=2.1644398980198307_0 on theBenchmark for (2985ds/420Mi)
% 8.62/1.82 % (21415)lrs+1002_1:1024_sil=2000:plsq=on:plsqr=1,1:gs=on:gsem=off:i=416:nm=0:fsr=off:fs=off_0 on theBenchmark for (2985ds/416Mi)
% 8.65/1.83 % (21408)Instruction limit reached!
% 8.65/1.83 % (21408)------------------------------
% 8.65/1.83 % (21408)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 8.65/1.83 % (21408)Termination reason: Unknown
% 8.65/1.83 % (21408)Termination phase: Saturation
% 8.65/1.83
% 8.65/1.83 % (21408)Memory used [KB]: 2237
% 8.65/1.83 % (21408)Time elapsed: 0.055 s
% 8.65/1.83 % (21408)Instructions burned: 117 (million)
% 8.65/1.83 % (21408)------------------------------
% 8.65/1.83 % (21408)------------------------------
% 8.65/1.84 % (21417)lrs-1010_1:3_sil=4000:tgt=ground:sos=on:i=179:nm=3:ss=axioms:nwc=2.0_0 on theBenchmark for (2985ds/179Mi)
% 8.65/1.84 % (21417)Refutation not found, incomplete strategy% (21417)------------------------------
% 8.65/1.84 % (21417)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 8.65/1.84 % (21417)Termination reason: Refutation not found, incomplete strategy
% 8.65/1.84
% 8.65/1.84 % (21417)Memory used [KB]: 1198
% 8.65/1.84 % (21417)Time elapsed: 0.005 s
% 8.65/1.84 % (21417)Instructions burned: 8 (million)
% 8.65/1.84 % (21417)------------------------------
% 8.65/1.84 % (21417)------------------------------
% 8.65/1.85 % (21418)dis+21_1:64_sil=8000:sp=frequency:lcm=predicate:gs=on:slsqc=3:slsq=on:st=2.0:i=680:s2at=5.5:av=off:ss=included:s2a=on:rawr=on:ep=R_0 on theBenchmark for (2985ds/680Mi)
% 8.65/1.86 % (21414)Instruction limit reached!
% 8.65/1.86 % (21414)------------------------------
% 8.65/1.86 % (21414)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 8.65/1.86 % (21414)Termination reason: Unknown
% 8.65/1.86 % (21414)Termination phase: Saturation
% 8.65/1.86
% 8.65/1.86 % (21414)Memory used [KB]: 1995
% 8.65/1.86 % (21414)Time elapsed: 0.051 s
% 8.65/1.86 % (21414)Instructions burned: 150 (million)
% 8.65/1.86 % (21414)------------------------------
% 8.65/1.86 % (21414)------------------------------
% 8.65/1.86 % (21419)lrs+11_5:2_to=lpo:drc=encompass:sil=8000:tgt=full:sp=const_frequency:sos=all:lma=on:spb=goal_then_units:nwc=10.0:i=165:fsr=off:rawr=on:fdi=5_0 on theBenchmark for (2984ds/165Mi)
% 8.65/1.89 % (21416)Instruction limit reached!
% 8.65/1.89 % (21416)------------------------------
% 8.65/1.89 % (21416)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 8.65/1.89 % (21416)Termination reason: Unknown
% 8.65/1.89 % (21416)Termination phase: Saturation
% 8.65/1.89
% 8.65/1.89 % (21416)Memory used [KB]: 2061
% 8.65/1.89 % (21416)Time elapsed: 0.074 s
% 8.65/1.89 % (21416)Instructions burned: 424 (million)
% 8.65/1.89 % (21416)------------------------------
% 8.65/1.89 % (21416)------------------------------
% 8.65/1.89 % (21420)lrs+21_16:1_bsr=unit_only:to=lpo:sp=const_frequency:sos=on:urr=on:newcnf=on:i=191:fsr=off:ss=axioms:alpa=true:ep=RST:sil=8000:sac=on:spb=non_intro_0 on theBenchmark for (2984ds/191Mi)
% 9.13/1.92 % (21395)Instruction limit reached!
% 9.13/1.92 % (21395)------------------------------
% 9.13/1.92 % (21395)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 9.13/1.92 % (21395)Termination reason: Unknown
% 9.13/1.92 % (21395)Termination phase: Saturation
% 9.13/1.92
% 9.13/1.92 % (21395)Memory used [KB]: 2807
% 9.13/1.92 % (21395)Time elapsed: 0.230 s
% 9.13/1.92 % (21395)Instructions burned: 645 (million)
% 9.13/1.92 % (21395)------------------------------
% 9.13/1.92 % (21395)------------------------------
% 9.13/1.92 % (21421)dis+1002_1:1_sil=16000:tgt=ground:sac=on:i=260:sd=2:aac=none:ss=axioms:nwc=10.0_0 on theBenchmark for (2984ds/260Mi)
% 9.13/1.93 % (21420)Instruction limit reached!
% 9.13/1.93 % (21420)------------------------------
% 9.13/1.93 % (21420)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 9.13/1.93 % (21420)Termination reason: Unknown
% 9.13/1.93 % (21420)Termination phase: Saturation
% 9.13/1.93
% 9.13/1.93 % (21420)Memory used [KB]: 2415
% 9.13/1.93 % (21420)Time elapsed: 0.043 s
% 9.13/1.93 % (21420)Instructions burned: 194 (million)
% 9.13/1.93 % (21420)------------------------------
% 9.13/1.93 % (21420)------------------------------
% 9.13/1.94 % (21422)dis+1011_3:8_bsr=unit_only:slsqr=1,16:sil=2000:plsq=on:plsqr=296,127:sp=reverse_frequency:lsd=5:nwc=10.0:slsqc=3:slsq=on:st=3.0:i=192:s2at=4.5:sd=4:slsql=off:nm=16:ins=5:ss=axioms:sgt=20:rawr=on:urr=ec_only:to=lpo_0 on theBenchmark for (2984ds/192Mi)
% 9.13/1.94 % (21415)Instruction limit reached!
% 9.13/1.94 % (21415)------------------------------
% 9.13/1.94 % (21415)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 9.13/1.94 % (21415)Termination reason: Unknown
% 9.13/1.94 % (21415)Termination phase: Saturation
% 9.13/1.94
% 9.13/1.94 % (21415)Memory used [KB]: 6082
% 9.13/1.94 % (21415)Time elapsed: 0.119 s
% 9.13/1.94 % (21415)Instructions burned: 416 (million)
% 9.13/1.94 % (21415)------------------------------
% 9.13/1.94 % (21415)------------------------------
% 9.13/1.94 % (21419)Instruction limit reached!
% 9.13/1.94 % (21419)------------------------------
% 9.13/1.94 % (21419)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 9.13/1.94 % (21419)Termination reason: Unknown
% 9.13/1.94 % (21419)Termination phase: Saturation
% 9.13/1.95
% 9.13/1.95 % (21419)Memory used [KB]: 2876
% 9.13/1.95 % (21423)dis-1010_64191:1048576_slsqr=356311,1048576:drc=off:sil=2000:tgt=full:sp=weighted_frequency:sos=all:spb=goal:fd=preordered:rp=on:nwc=13.7836:s2agt=5:slsqc=2:sac=on:slsq=on:st=3:s2a=on:i=140:sd=2:kws=precedence:afp=10:erml=2:slsql=off:nm=5:amm=sco:afq=1.96219:ss=axioms:er=known:rawr=on:avsq=on:avsqc=3:avsqr=23111,524288:aac=none:rnwc=on_0 on theBenchmark for (2984ds/140Mi)
% 9.13/1.95 % (21419)Time elapsed: 0.084 s
% 9.13/1.95 % (21419)Instructions burned: 165 (million)
% 9.13/1.95 % (21419)------------------------------
% 9.13/1.95 % (21419)------------------------------
% 9.13/1.95 % (21422)Refutation not found, incomplete strategy% (21422)------------------------------
% 9.13/1.95 % (21422)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 9.13/1.95 % (21422)Termination reason: Refutation not found, incomplete strategy
% 9.13/1.95
% 9.13/1.95 % (21422)Memory used [KB]: 1380
% 9.13/1.95 % (21422)Time elapsed: 0.009 s
% 9.13/1.95 % (21422)Instructions burned: 31 (million)
% 9.13/1.95 % (21422)------------------------------
% 9.13/1.95 % (21422)------------------------------
% 9.13/1.95 % (21425)ott+1011_170061:1048576_to=lpo:drc=encompass:sil=4000:tgt=full:fde=unused:sims=off:sp=unary_frequency:lma=on:gs=on:nwc=3.05078:sac=on:nicw=on:gsem=off:s2a=on:i=307:bs=on:nm=16:ins=7:fsr=off:amm=sco:uhcvi=on:fdi=4:rawr=on_0 on theBenchmark for (2984ds/307Mi)
% 9.13/1.95 % (21424)lrs-1010_1:128_tgt=ground:si=on:plsq=on:plsqr=2087559,524288:sos=on:st=1.5:i=653:sd=2:rtra=on:ss=included:sil=128000:ins=1:gsp=on:anc=all_dependent_0 on theBenchmark for (2984ds/653Mi)
% 9.13/1.96 % (21424)Refutation not found, incomplete strategy% (21424)------------------------------
% 9.13/1.96 % (21424)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 9.13/1.96 % (21424)Termination reason: Refutation not found, incomplete strategy
% 9.13/1.96
% 9.13/1.96 % (21424)Memory used [KB]: 1320
% 9.13/1.96 % (21424)Time elapsed: 0.009 s
% 9.13/1.96 % (21424)Instructions burned: 16 (million)
% 9.13/1.96 % (21424)------------------------------
% 9.13/1.96 % (21424)------------------------------
% 9.13/1.96 % (21426)dis-1011_1:32_to=lpo:sil=2000:fde=none:sos=on:nwc=5.0:flr=on:st=3.0:i=216:nm=3:ss=axioms:aac=none:fsr=off_0 on theBenchmark for (2983ds/216Mi)
% 9.13/1.97 % (21403)Instruction limit reached!
% 9.13/1.97 % (21403)------------------------------
% 9.13/1.97 % (21403)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 9.13/1.97 % (21403)Termination reason: Unknown
% 9.13/1.97 % (21403)Termination phase: Saturation
% 9.13/1.97
% 9.13/1.97 % (21403)Memory used [KB]: 11833
% 9.13/1.97 % (21403)Time elapsed: 0.201 s
% 9.13/1.97 % (21403)Instructions burned: 452 (million)
% 9.13/1.97 % (21403)------------------------------
% 9.13/1.97 % (21403)------------------------------
% 9.63/1.97 % (21427)dis+1011_1:4_bsr=on:to=lpo:sil=2000:tgt=ground:plsqc=1:plsq=on:plsqr=4477983,65536:sp=frequency:erd=off:spb=goal:nwc=2.0:sac=on:newcnf=on:cond=fast:st=5.0:i=176:nm=16:ss=axioms:rawr=on:lsd=100:awrs=converge_0 on theBenchmark for (2983ds/176Mi)
% 9.63/1.98 % (21426)Refutation not found, incomplete strategy% (21426)------------------------------
% 9.63/1.98 % (21426)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 9.63/1.98 % (21426)Termination reason: Refutation not found, incomplete strategy
% 9.63/1.98
% 9.63/1.98 % (21426)Memory used [KB]: 1404
% 9.63/1.98 % (21426)Time elapsed: 0.012 s
% 9.63/1.98 % (21426)Instructions burned: 20 (million)
% 9.63/1.98 % (21426)------------------------------
% 9.63/1.98 % (21426)------------------------------
% 9.63/1.98 % (21423)Instruction limit reached!
% 9.63/1.98 % (21423)------------------------------
% 9.63/1.98 % (21423)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 9.63/1.98 % (21423)Termination reason: Unknown
% 9.63/1.98 % (21423)Termination phase: Saturation
% 9.63/1.98
% 9.63/1.98 % (21423)Memory used [KB]: 2434
% 9.63/1.98 % (21423)Time elapsed: 0.034 s
% 9.63/1.98 % (21423)Instructions burned: 143 (million)
% 9.63/1.98 % (21423)------------------------------
% 9.63/1.98 % (21423)------------------------------
% 9.63/1.98 % (21429)dis+1011_1:1_bsr=unit_only:slsqr=1,2:sil=2000:plsqc=1:plsq=on:plsqr=32,1:lsd=20:plsql=on:slsqc=1:slsq=on:i=592:slsql=off:nm=2:uhcvi=on:rawr=on:fsr=off:avsq=on:avsqr=9387,262144_0 on theBenchmark for (2983ds/592Mi)
% 9.63/1.98 % (21428)lrs-1010_2:1_sil=4000:tgt=ground:sos=on:erd=off:bce=on:st=4.5:i=206:sd=1:kws=inv_frequency:ss=axioms:sgt=100:rawr=on:avsq=on:avsqr=17,12:plsq=on:plsqr=25,62:anc=all_dependent_0 on theBenchmark for (2983ds/206Mi)
% 9.63/1.99 % (21428)Refutation not found, incomplete strategy% (21428)------------------------------
% 9.63/1.99 % (21428)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 9.63/1.99 % (21428)Termination reason: Refutation not found, incomplete strategy
% 9.63/1.99
% 9.63/1.99 % (21428)Memory used [KB]: 1210
% 9.63/1.99 % (21428)Time elapsed: 0.008 s
% 9.63/1.99 % (21428)Instructions burned: 14 (million)
% 9.63/1.99 % (21428)------------------------------
% 9.63/1.99 % (21428)------------------------------
% 9.63/1.99 % (21429)Refutation not found, incomplete strategy% (21429)------------------------------
% 9.63/1.99 % (21429)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 9.63/1.99 % (21429)Termination reason: Refutation not found, incomplete strategy
% 9.63/1.99
% 9.63/1.99 % (21429)Memory used [KB]: 1460
% 9.63/1.99 % (21429)Time elapsed: 0.008 s
% 9.63/1.99 % (21429)Instructions burned: 27 (million)
% 9.63/1.99 % (21429)------------------------------
% 9.63/1.99 % (21429)------------------------------
% 9.63/1.99 % (21431)dis+11_4:7_sil=2000:sp=unary_first:i=118:afp=50:ep=RST:afq=2.0:rawr=on:add=large:alpa=false:to=lpo:fsr=off:anc=none:nicw=on_0 on theBenchmark for (2983ds/118Mi)
% 9.63/2.00 % (21430)ott+33_191939:1048576_drc=encompass:sil=4000:tgt=ground:sp=const_frequency:lma=on:spb=goal:gs=on:nwc=17.8226:gsem=off:cond=fast:i=266:kws=inv_arity:bd=preordered:nm=35:av=off:fsr=off:uhcvi=on:rawr=on:bs=unit_only:urr=ec_only:ins=1_0 on theBenchmark for (2983ds/266Mi)
% 9.63/2.01 % (21425)Instruction limit reached!
% 9.63/2.01 % (21425)------------------------------
% 9.63/2.01 % (21425)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 9.63/2.01 % (21425)Termination reason: Unknown
% 9.63/2.01 % (21425)Termination phase: Saturation
% 9.63/2.01
% 9.63/2.01 % (21425)Memory used [KB]: 2548
% 9.63/2.01 % (21425)Time elapsed: 0.067 s
% 9.63/2.01 % (21425)Instructions burned: 307 (million)
% 9.63/2.01 % (21425)------------------------------
% 9.63/2.01 % (21425)------------------------------
% 9.63/2.02 % (21432)lrs-34_1:1_sil=4000:erd=off:urr=on:nwc=3.0:s2agt=16:s2a=on:i=119:br=off:ep=R:ins=1_0 on theBenchmark for (2983ds/119Mi)
% 9.63/2.02 % (21427)Refutation not found, incomplete strategy% (21427)------------------------------
% 9.63/2.02 % (21427)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 9.63/2.02 % (21427)Termination reason: Refutation not found, incomplete strategy
% 9.63/2.02
% 9.63/2.02 % (21427)Memory used [KB]: 1818
% 9.63/2.02 % (21427)Time elapsed: 0.050 s
% 9.63/2.02 % (21427)Instructions burned: 99 (million)
% 9.63/2.02 % (21427)------------------------------
% 9.63/2.02 % (21427)------------------------------
% 9.63/2.04 % (21431)Instruction limit reached!
% 9.63/2.04 % (21431)------------------------------
% 9.63/2.04 % (21431)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 9.63/2.04 % (21431)Termination reason: Unknown
% 9.63/2.04 % (21431)Termination phase: Saturation
% 9.63/2.04
% 9.63/2.04 % (21431)Memory used [KB]: 2058
% 9.63/2.04 % (21431)Time elapsed: 0.061 s
% 9.63/2.04 % (21431)Instructions burned: 121 (million)
% 9.63/2.04 % (21431)------------------------------
% 9.63/2.04 % (21431)------------------------------
% 9.63/2.04 % (21421)Instruction limit reached!
% 9.63/2.04 % (21421)------------------------------
% 9.63/2.04 % (21421)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 9.63/2.04 % (21421)Termination reason: Unknown
% 9.63/2.04 % (21421)Termination phase: Saturation
% 9.63/2.04
% 9.63/2.04 % (21421)Memory used [KB]: 2735
% 9.63/2.04 % (21421)Time elapsed: 0.117 s
% 9.63/2.04 % (21421)Instructions burned: 262 (million)
% 9.63/2.04 % (21421)------------------------------
% 9.63/2.04 % (21421)------------------------------
% 9.63/2.04 % (21434)dis+1011_5:2_to=lpo:drc=off:sil=2000:fde=unused:spb=goal_then_units:acc=on:nwc=10.0:nicw=on:i=211:fsr=off:fsd=on:rawr=on:fsdmm=1:plsq=on:plsql=on:plsqc=2:plsqr=57,62:amm=sco_0 on theBenchmark for (2983ds/211Mi)
% 9.63/2.04 % (21435)dis+1011_1:4_sil=8000:tgt=full:st=1.5:s2a=on:i=201:s2at=1.2:sd=5:ss=axioms:ep=RS:av=off_0 on theBenchmark for (2983ds/201Mi)
% 9.63/2.04 % (21433)lrs+1011_1:1_sil=16000:sp=occurrence:st=5.0:i=167:sd=2:ss=axioms:sgt=16_0 on theBenchmark for (2983ds/167Mi)
% 9.63/2.05 % (21435)Refutation not found, incomplete strategy% (21435)------------------------------
% 9.63/2.05 % (21435)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 9.63/2.05 % (21435)Termination reason: Refutation not found, incomplete strategy
% 9.63/2.05
% 9.63/2.05 % (21435)Memory used [KB]: 1223
% 9.63/2.05 % (21435)Time elapsed: 0.007 s
% 9.63/2.05 % (21435)Instructions burned: 13 (million)
% 9.63/2.05 % (21435)------------------------------
% 9.63/2.05 % (21435)------------------------------
% 9.63/2.05 % (21432)Instruction limit reached!
% 9.63/2.05 % (21432)------------------------------
% 9.63/2.05 % (21432)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 9.63/2.05 % (21432)Termination reason: Unknown
% 9.63/2.05 % (21432)Termination phase: Saturation
% 9.63/2.05
% 9.63/2.05 % (21432)Memory used [KB]: 1902
% 9.63/2.05 % (21432)Time elapsed: 0.034 s
% 9.63/2.05 % (21432)Instructions burned: 119 (million)
% 9.63/2.05 % (21432)------------------------------
% 9.63/2.05 % (21432)------------------------------
% 9.63/2.05 % (21436)lrs+33_8:7_anc=all:sil=4000:urr=full:br=off:st=3.0:i=230:sd=2:afp=10:afq=2.0:ss=axioms:rawr=on:fsr=off:gsp=on:nwc=0.9918136297139506_0 on theBenchmark for (2983ds/230Mi)
% 9.63/2.06 % (21437)lrs+1010_1:128_sil=8000:sims=off:sos=on:newcnf=on:i=215:kws=frequency:bd=off:alpa=random:fd=off:sac=on_0 on theBenchmark for (2983ds/215Mi)
% 9.63/2.06 % (21437)Refutation not found, incomplete strategy% (21437)------------------------------
% 9.63/2.06 % (21437)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 9.63/2.06 % (21437)Termination reason: Refutation not found, incomplete strategy
% 9.63/2.06
% 9.63/2.06 % (21437)Memory used [KB]: 1134
% 9.63/2.06 % (21437)Time elapsed: 0.004 s
% 9.63/2.06 % (21437)Instructions burned: 6 (million)
% 9.63/2.06 % (21437)------------------------------
% 9.63/2.06 % (21437)------------------------------
% 10.20/2.07 % (21438)dis+1011_2:1_sil=2000:fde=unused:plsqc=1:plsq=on:plsqr=36971,524288:nwc=5.0:i=265:ep=RS:nm=7_0 on theBenchmark for (2982ds/265Mi)
% 10.20/2.07 % (21433)Instruction limit reached!
% 10.20/2.07 % (21433)------------------------------
% 10.20/2.07 % (21433)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 10.20/2.07 % (21433)Termination reason: Unknown
% 10.20/2.07 % (21433)Termination phase: Saturation
% 10.20/2.07
% 10.20/2.07 % (21433)Memory used [KB]: 1832
% 10.20/2.07 % (21433)Time elapsed: 0.060 s
% 10.20/2.07 % (21433)Instructions burned: 167 (million)
% 10.20/2.07 % (21433)------------------------------
% 10.20/2.07 % (21433)------------------------------
% 10.20/2.08 % (21367)Instruction limit reached!
% 10.20/2.08 % (21367)------------------------------
% 10.20/2.08 % (21367)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 10.20/2.08 % (21367)Termination reason: Unknown
% 10.20/2.08 % (21367)Termination phase: Saturation
% 10.20/2.08
% 10.20/2.08 % (21367)Memory used [KB]: 11180
% 10.20/2.08 % (21367)Time elapsed: 0.752 s
% 10.20/2.08 % (21367)Instructions burned: 1644 (million)
% 10.20/2.08 % (21367)------------------------------
% 10.20/2.08 % (21367)------------------------------
% 10.20/2.08 % (21439)dis+1011_1:17_to=lpo:sil=2000:fde=unused:spb=units:lsd=20:nwc=8.0:alpa=random:cond=on:st=1.5:s2a=on:i=1040:s2at=1.5:sd=3:nm=22:fsr=off:ss=axioms:rawr=on:afp=1000:afq=1.56_0 on theBenchmark for (2982ds/1040Mi)
% 10.20/2.08 % (21440)dis-1011_2:3_slsqr=879,448:irw=on:sp=reverse_frequency:slsqc=2:slsq=on:cond=fast:i=443:s2at=4.0:bs=unit_only:sup=off:ss=axioms:sgt=15:rawr=on:lsd=5:sil=8000:nicw=on_0 on theBenchmark for (2982ds/443Mi)
% 10.20/2.09 % (21434)Instruction limit reached!
% 10.20/2.09 % (21434)------------------------------
% 10.20/2.09 % (21434)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 10.20/2.09 % (21434)Termination reason: Unknown
% 10.20/2.09 % (21434)Termination phase: Saturation
% 10.20/2.09
% 10.20/2.09 % (21434)Memory used [KB]: 2164
% 10.20/2.09 % (21434)Time elapsed: 0.047 s
% 10.20/2.09 % (21434)Instructions burned: 216 (million)
% 10.20/2.09 % (21434)------------------------------
% 10.20/2.09 % (21434)------------------------------
% 10.34/2.09 % (21441)lrs-1011_3:1_sil=2000:tgt=ground:sos=on:flr=on:i=192:bce=on:kws=inv_frequency_0 on theBenchmark for (2982ds/192Mi)
% 10.34/2.09 % (21394)Instruction limit reached!
% 10.34/2.09 % (21394)------------------------------
% 10.34/2.09 % (21394)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 10.34/2.09 % (21394)Termination reason: Unknown
% 10.34/2.09 % (21394)Termination phase: Saturation
% 10.34/2.09
% 10.34/2.09 % (21394)Memory used [KB]: 8912
% 10.34/2.09 % (21394)Time elapsed: 0.410 s
% 10.34/2.09 % (21394)Instructions burned: 900 (million)
% 10.34/2.09 % (21394)------------------------------
% 10.34/2.09 % (21394)------------------------------
% 10.34/2.10 % (21441)Refutation not found, incomplete strategy% (21441)------------------------------
% 10.34/2.10 % (21441)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 10.34/2.10 % (21441)Termination reason: Refutation not found, incomplete strategy
% 10.34/2.10
% 10.34/2.10 % (21441)Memory used [KB]: 1399
% 10.34/2.10 % (21441)Time elapsed: 0.009 s
% 10.34/2.10 % (21441)Instructions burned: 28 (million)
% 10.34/2.10 % (21441)------------------------------
% 10.34/2.10 % (21441)------------------------------
% 10.34/2.10 % (21443)lrs+666_2:89_bsr=unit_only:to=lpo:sil=2000:sos=on:spb=goal_then_units:sac=on:i=171:bd=off:uhcvi=on:nicw=on:fd=off_0 on theBenchmark for (2982ds/171Mi)
% 10.34/2.10 % (21442)dis+1011_5:2_to=lpo:sil=8000:tgt=ground:plsq=on:plsqr=65749,1048576:spb=goal:nwc=10.0:newcnf=on:i=1218:rawr=on:av=off:nm=5:awrs=converge:awrsf=340:bsd=on:s2a=on:fdi=1_0 on theBenchmark for (2982ds/1218Mi)
% 10.34/2.10 % (21436)Refutation not found, incomplete strategy% (21436)------------------------------
% 10.34/2.10 % (21436)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 10.34/2.10 % (21436)Termination reason: Refutation not found, incomplete strategy
% 10.34/2.10
% 10.34/2.10 % (21436)Memory used [KB]: 3604
% 10.34/2.10 % (21436)Time elapsed: 0.054 s
% 10.34/2.10 % (21436)Instructions burned: 113 (million)
% 10.34/2.10 % (21436)------------------------------
% 10.34/2.10 % (21436)------------------------------
% 10.34/2.11 % (21444)lrs+1010_1:28_plsqc=4:si=on:plsq=on:plsqr=22387283,262144:i=283:sd=2:rtra=on:ss=included:sgt=8:sil=2000:slsq=on:slsqc=1:nm=32:acc=model:aer=off:alpa=false:spb=intro:nicw=on:bd=off:sp=reverse_arity:kws=arity_0 on theBenchmark for (2982ds/283Mi)
% 10.42/2.15 % (21443)Instruction limit reached!
% 10.42/2.15 % (21443)------------------------------
% 10.42/2.15 % (21443)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 10.42/2.15 % (21443)Termination reason: Unknown
% 10.42/2.15 % (21443)Termination phase: Saturation
% 10.42/2.15
% 10.42/2.15 % (21443)Memory used [KB]: 3134
% 10.42/2.15 % (21443)Time elapsed: 0.049 s
% 10.42/2.15 % (21443)Instructions burned: 171 (million)
% 10.42/2.15 % (21443)------------------------------
% 10.42/2.15 % (21443)------------------------------
% 10.42/2.15 % (21430)Instruction limit reached!
% 10.42/2.15 % (21430)------------------------------
% 10.42/2.15 % (21430)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 10.42/2.15 % (21430)Termination reason: Unknown
% 10.42/2.15 % (21430)Termination phase: Saturation
% 10.42/2.15
% 10.42/2.15 % (21430)Memory used [KB]: 5701
% 10.42/2.15 % (21430)Time elapsed: 0.163 s
% 10.42/2.15 % (21430)Instructions burned: 266 (million)
% 10.42/2.15 % (21430)------------------------------
% 10.42/2.15 % (21430)------------------------------
% 10.42/2.15 % (21445)lrs+1010_1:1_sil=8000:fde=none:sos=on:rp=on:st=3.0:i=590:bd=off:nm=16:fsr=off:ss=included:sgt=8:acc=on:aac=none:s2a=on:fs=off_0 on theBenchmark for (2981ds/590Mi)
% 10.42/2.15 % (21445)Refutation not found, incomplete strategy% (21445)------------------------------
% 10.42/2.15 % (21445)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 10.42/2.15 % (21445)Termination reason: Refutation not found, incomplete strategy
% 10.42/2.15
% 10.42/2.15 % (21445)Memory used [KB]: 1209
% 10.42/2.15 % (21445)Time elapsed: 0.002 s
% 10.42/2.15 % (21445)Instructions burned: 6 (million)
% 10.42/2.15 % (21445)------------------------------
% 10.42/2.15 % (21445)------------------------------
% 10.42/2.15 % (21447)ott+10_107421:1048576_to=lpo:drc=off:sil=4000:fde=none:sos=on:lma=on:spb=intro:gs=on:nwc=24.2524:gsem=off:i=1636:sd=3:afp=40000:awrs=decay:awrsf=1166:nm=6:afq=1.99252:uhcvi=on:ss=axioms:rawr=on:sp=const_max:add=off_0 on theBenchmark for (2981ds/1636Mi)
% 10.42/2.15 % (21438)Instruction limit reached!
% 10.42/2.15 % (21438)------------------------------
% 10.42/2.15 % (21438)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 10.42/2.15 % (21438)Termination reason: Unknown
% 10.42/2.15 % (21438)Termination phase: Saturation
% 10.42/2.15
% 10.42/2.15 % (21438)Memory used [KB]: 1849
% 10.42/2.15 % (21438)Time elapsed: 0.090 s
% 10.42/2.15 % (21438)Instructions burned: 265 (million)
% 10.42/2.15 % (21438)------------------------------
% 10.42/2.15 % (21438)------------------------------
% 10.42/2.16 % (21446)lrs+1011_16:1_to=lpo:sil=2000:spb=goal_then_units:urr=on:lsd=1:i=227:bd=off:ss=axioms:gsp=on:sac=on_0 on theBenchmark for (2981ds/227Mi)
% 10.42/2.16 % (21418)Instruction limit reached!
% 10.42/2.16 % (21418)------------------------------
% 10.42/2.16 % (21418)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 10.42/2.16 % (21418)Termination reason: Unknown
% 10.42/2.16 % (21418)Termination phase: Saturation
% 10.42/2.16
% 10.42/2.16 % (21418)Memory used [KB]: 7256
% 10.42/2.16 % (21418)Time elapsed: 0.312 s
% 10.42/2.16 % (21418)Instructions burned: 681 (million)
% 10.42/2.16 % (21418)------------------------------
% 10.42/2.16 % (21418)------------------------------
% 10.42/2.16 % (21447)Refutation not found, incomplete strategy% (21447)------------------------------
% 10.42/2.16 % (21447)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 10.42/2.16 % (21447)Termination reason: Refutation not found, incomplete strategy
% 10.42/2.16
% 10.42/2.16 % (21447)Memory used [KB]: 1289
% 10.42/2.16 % (21447)Time elapsed: 0.005 s
% 10.42/2.16 % (21447)Instructions burned: 11 (million)
% 10.42/2.16 % (21447)------------------------------
% 10.42/2.16 % (21447)------------------------------
% 10.42/2.16 % (21448)lrs+1011_5:1_sil=2000:plsq=on:plsqr=25,172:sos=on:erd=off:rnwc=on:nwc=10.0:avsq=on:i=229:avsqr=35,118:awrs=converge:awrsf=240:ins=1:amm=sco:uhcvi=on:afr=on:rawr=on:add=large:afp=300_0 on theBenchmark for (2981ds/229Mi)
% 10.42/2.16 % (21449)lrs+1666_1:8_to=lpo:sil=4000:tgt=full:sp=frequency:sos=on:urr=on:i=265:bd=off:nm=4:amm=off:rawr=on_0 on theBenchmark for (2981ds/265Mi)
% 10.42/2.17 % (21450)lrs+2_1:1_sil=2000:nwc=20.1361:i=230:ss=axioms:sd=12:sgt=8_0 on theBenchmark for (2981ds/230Mi)
% 10.42/2.17 % (21448)Refutation not found, incomplete strategy% (21448)------------------------------
% 10.42/2.17 % (21448)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 10.42/2.17 % (21448)Termination reason: Refutation not found, incomplete strategy
% 10.42/2.17
% 10.42/2.17 % (21448)Memory used [KB]: 1276
% 10.42/2.17 % (21448)Time elapsed: 0.008 s
% 10.42/2.17 % (21448)Instructions burned: 14 (million)
% 10.42/2.17 % (21448)------------------------------
% 10.42/2.17 % (21448)------------------------------
% 10.42/2.17 % (21451)dis+10_19609:262144_slsqr=2099875,262144:to=lpo:drc=encompass:sil=2000:irw=on:plsqc=4:plsq=on:plsqr=2618345,1048576:rnwc=on:plsql=on:rp=on:nwc=3.01662:s2agt=30:slsqc=2:slsq=on:s2a=on:i=324:nm=6:ins=2:gsp=on:rawr=on:amm=off:flr=on:s2pl=no:erd=off_0 on theBenchmark for (2981ds/324Mi)
% 10.42/2.20 % (21446)Refutation not found, incomplete strategy% (21446)------------------------------
% 10.42/2.20 % (21446)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 10.42/2.20 % (21446)Termination reason: Refutation not found, incomplete strategy
% 10.42/2.20
% 10.42/2.20 % (21446)Memory used [KB]: 2264
% 10.42/2.20 % (21446)Time elapsed: 0.049 s
% 10.42/2.20 % (21446)Instructions burned: 100 (million)
% 10.42/2.20 % (21446)------------------------------
% 10.42/2.20 % (21446)------------------------------
% 11.09/2.21 % (21452)lrs+32_1:4_sil=2000:sos=on:rp=on:i=251:bd=off:nm=16:awrs=decay:awrsf=500_0 on theBenchmark for (2981ds/251Mi)
% 11.09/2.21 % (21439)Refutation not found, incomplete strategy% (21439)------------------------------
% 11.09/2.21 % (21439)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 11.09/2.21 % (21439)Termination reason: Refutation not found, incomplete strategy
% 11.09/2.21
% 11.09/2.21 % (21439)Memory used [KB]: 2335
% 11.09/2.21 % (21439)Time elapsed: 0.136 s
% 11.09/2.21 % (21439)Instructions burned: 589 (million)
% 11.09/2.21 % (21439)------------------------------
% 11.09/2.21 % (21439)------------------------------
% 11.09/2.22 % (21453)dis+1011_16:1_sil=16000:tgt=full:nwc=10.0:alpa=random:sac=on:avsq=on:i=2747:sd=1:kws=inv_frequency:ss=included_0 on theBenchmark for (2981ds/2747Mi)
% 11.09/2.23 % (21444)Instruction limit reached!
% 11.09/2.23 % (21444)------------------------------
% 11.09/2.23 % (21444)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 11.09/2.23 % (21444)Termination reason: Unknown
% 11.09/2.23 % (21444)Termination phase: Saturation
% 11.09/2.23
% 11.09/2.23 % (21444)Memory used [KB]: 2525
% 11.09/2.23 % (21444)Time elapsed: 0.140 s
% 11.09/2.23 % (21444)Instructions burned: 283 (million)
% 11.09/2.23 % (21444)------------------------------
% 11.09/2.23 % (21444)------------------------------
% 11.09/2.23 % (21449)Instruction limit reached!
% 11.09/2.23 % (21449)------------------------------
% 11.09/2.23 % (21449)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 11.09/2.23 % (21449)Termination reason: Unknown
% 11.09/2.23 % (21449)Termination phase: Saturation
% 11.09/2.23
% 11.09/2.23 % (21449)Memory used [KB]: 3477
% 11.09/2.23 % (21449)Time elapsed: 0.073 s
% 11.09/2.23 % (21449)Instructions burned: 267 (million)
% 11.09/2.23 % (21449)------------------------------
% 11.09/2.23 % (21449)------------------------------
% 11.09/2.23 % (21454)lrs+1002_1:1024_drc=encompass:sil=2000:tgt=full:rp=on:i=195:nm=16:ss=axioms:sd=1:st=2.0_0 on theBenchmark for (2981ds/195Mi)
% 11.09/2.23 % (21455)lrs-11_4:1_anc=all_dependent:slsqr=1,5:sil=2000:sos=all:spb=goal:br=off:alpa=true:newcnf=on:slsq=on:st=1.5:i=247:aac=none:nm=16:ins=1:ss=axioms:bs=unit_only:drc=off_0 on theBenchmark for (2981ds/247Mi)
% 11.09/2.24 % (21455)Refutation not found, incomplete strategy% (21455)------------------------------
% 11.09/2.24 % (21455)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 11.09/2.24 % (21455)Termination reason: Refutation not found, incomplete strategy
% 11.09/2.24
% 11.09/2.24 % (21455)Memory used [KB]: 1168
% 11.09/2.24 % (21455)Time elapsed: 0.002 s
% 11.09/2.24 % (21455)Instructions burned: 7 (million)
% 11.09/2.24 % (21455)------------------------------
% 11.09/2.24 % (21455)------------------------------
% 11.09/2.24 % (21456)lrs-21_1:28_sil=4000:tgt=full:sp=frequency:lma=on:urr=ec_only:nwc=3.0:sac=on:i=178:sd=1:bd=off:ss=axioms:sgt=4:rawr=on_0 on theBenchmark for (2981ds/178Mi)
% 11.09/2.26 % (21440)Instruction limit reached!
% 11.09/2.26 % (21440)------------------------------
% 11.09/2.26 % (21440)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 11.09/2.26 % (21440)Termination reason: Unknown
% 11.09/2.26 % (21440)Termination phase: Saturation
% 11.09/2.26
% 11.09/2.26 % (21440)Memory used [KB]: 2748
% 11.09/2.26 % (21440)Time elapsed: 0.204 s
% 11.09/2.26 % (21440)Instructions burned: 443 (million)
% 11.09/2.26 % (21440)------------------------------
% 11.09/2.26 % (21440)------------------------------
% 11.09/2.27 % (21457)dis+21_16:1_to=lpo:sil=2000:sp=frequency:urr=on:nwc=10.0:s2a=on:i=1747:sd=1:nm=6:ss=included:fsr=off:gsp=on_0 on theBenchmark for (2980ds/1747Mi)
% 11.09/2.27 % (21450)Instruction limit reached!
% 11.09/2.27 % (21450)------------------------------
% 11.09/2.27 % (21450)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 11.09/2.27 % (21450)Termination reason: Unknown
% 11.09/2.27 % (21450)Termination phase: Saturation
% 11.09/2.27
% 11.09/2.27 % (21450)Memory used [KB]: 3649
% 11.09/2.27 % (21450)Time elapsed: 0.110 s
% 11.09/2.27 % (21450)Instructions burned: 230 (million)
% 11.09/2.27 % (21450)------------------------------
% 11.09/2.27 % (21450)------------------------------
% 11.09/2.28 % (21458)dis+1011_109733:262144_bsr=unit_only:sil=2000:fde=none:etr=on:sp=occurrence:rnwc=on:rp=on:nwc=23.4039:s2agt=15:avsqc=3:newcnf=on:avsq=on:st=3:s2a=on:i=406:s2at=1.5:aac=none:avsqr=211983,524288:nm=4:ins=3:fsr=off:amm=off:sup=off:ss=axioms:sgt=30:gsp=on:fd=off:bd=off_0 on theBenchmark for (2980ds/406Mi)
% 11.09/2.28 % (21456)Instruction limit reached!
% 11.09/2.28 % (21456)------------------------------
% 11.09/2.28 % (21456)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 12.21/2.28 % (21456)Termination reason: Unknown
% 12.21/2.28 % (21456)Termination phase: Saturation
% 12.21/2.28
% 12.21/2.28 % (21456)Memory used [KB]: 1660
% 12.21/2.28 % (21456)Time elapsed: 0.042 s
% 12.21/2.28 % (21456)Instructions burned: 180 (million)
% 12.21/2.28 % (21456)------------------------------
% 12.21/2.28 % (21456)------------------------------
% 12.21/2.28 % (21459)lrs+2_5:1_to=lpo:sil=2000:plsqc=1:plsq=on:plsqr=32,1:sp=occurrence:sos=all:lma=on:i=237:gsp=on:ss=axioms:rawr=on:sup=off:s2a=on:s2at=3.0_0 on theBenchmark for (2980ds/237Mi)
% 12.21/2.29 % (21459)Refutation not found, incomplete strategy% (21459)------------------------------
% 12.21/2.29 % (21459)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 12.21/2.29 % (21459)Termination reason: Refutation not found, incomplete strategy
% 12.21/2.29
% 12.21/2.29 % (21459)Memory used [KB]: 1394
% 12.21/2.29 % (21459)Time elapsed: 0.006 s
% 12.21/2.29 % (21459)Instructions burned: 20 (million)
% 12.21/2.29 % (21459)------------------------------
% 12.21/2.29 % (21459)------------------------------
% 12.21/2.29 % (21460)dis-1002_468471:1048576_to=lpo:drc=off:sil=2000:tgt=full:sp=frequency:bce=on:nwc=23.5997:newcnf=on:i=548:bs=unit_only:sd=4:nm=10:av=off:uhcvi=on:ss=axioms:sos=on:rp=on_0 on theBenchmark for (2980ds/548Mi)
% 12.21/2.29 % (21452)Instruction limit reached!
% 12.21/2.29 % (21452)------------------------------
% 12.21/2.29 % (21452)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 12.21/2.29 % (21452)Termination reason: Unknown
% 12.21/2.29 % (21452)Termination phase: Saturation
% 12.21/2.29
% 12.21/2.29 % (21452)Memory used [KB]: 2921
% 12.21/2.29 % (21452)Time elapsed: 0.073 s
% 12.21/2.29 % (21452)Instructions burned: 252 (million)
% 12.21/2.29 % (21452)------------------------------
% 12.21/2.29 % (21452)------------------------------
% 12.21/2.29 % (21461)lrs+1011_1:1024_sil=4000:br=off:i=275:bd=off:fd=preordered:slsq=on:slsql=off:slsqc=2:slsqr=1,4:s2at=4.0_0 on theBenchmark for (2980ds/275Mi)
% 12.21/2.29 % (21460)Refutation not found, incomplete strategy% (21460)------------------------------
% 12.21/2.29 % (21460)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 12.21/2.29 % (21460)Termination reason: Refutation not found, incomplete strategy
% 12.21/2.29
% 12.21/2.29 % (21460)Memory used [KB]: 1216
% 12.21/2.29 % (21460)Time elapsed: 0.004 s
% 12.21/2.29 % (21460)Instructions burned: 14 (million)
% 12.21/2.29 % (21460)------------------------------
% 12.21/2.29 % (21460)------------------------------
% 12.21/2.29 % (21461)Refutation not found, incomplete strategy% (21461)------------------------------
% 12.21/2.29 % (21461)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 12.21/2.29 % (21461)Termination reason: Refutation not found, incomplete strategy
% 12.21/2.29
% 12.21/2.29 % (21461)Memory used [KB]: 1195
% 12.21/2.29 % (21461)Time elapsed: 0.003 s
% 12.21/2.29 % (21461)Instructions burned: 8 (million)
% 12.21/2.30 % (21461)------------------------------
% 12.21/2.30 % (21461)------------------------------
% 12.21/2.30 % (21462)lrs+1002_1:16_sil=4000:sos=on:sac=on:i=735:bs=unit_only:gsp=on:ss=included:sgt=16:fsr=off:sfv=off:bd=off_0 on theBenchmark for (2980ds/735Mi)
% 12.21/2.30 % (21463)dis-1011_7:24_to=lpo:sil=64000:sos=on:rnwc=on:gs=on:nwc=1.65:alpa=random:flr=on:nicw=on:i=435:sd=1:bd=off:fsr=off:fsd=on:uhcvi=on:fdi=1:ss=axioms:sgt=16:rawr=on:sp=const_min_0 on theBenchmark for (2980ds/435Mi)
% 12.21/2.30 % (21462)Refutation not found, incomplete strategy% (21462)------------------------------
% 12.21/2.30 % (21462)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 12.21/2.30 % (21462)Termination reason: Refutation not found, incomplete strategy
% 12.21/2.30
% 12.21/2.30 % (21462)Memory used [KB]: 1319
% 12.21/2.30 % (21462)Time elapsed: 0.004 s
% 12.21/2.30 % (21462)Instructions burned: 16 (million)
% 12.21/2.30 % (21462)------------------------------
% 12.21/2.30 % (21462)------------------------------
% 12.21/2.30 % (21463)Refutation not found, incomplete strategy% (21463)------------------------------
% 12.21/2.30 % (21463)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 12.21/2.30 % (21463)Termination reason: Refutation not found, incomplete strategy
% 12.21/2.30
% 12.21/2.30 % (21463)Memory used [KB]: 1242
% 12.21/2.30 % (21463)Time elapsed: 0.005 s
% 12.21/2.30 % (21463)Instructions burned: 11 (million)
% 12.21/2.30 % (21463)------------------------------
% 12.21/2.30 % (21463)------------------------------
% 12.21/2.30 % (21464)lrs+4_1:8_sil=32000:abs=on:nwc=5.0:updr=off:i=822:nm=6:plsq=on:plsql=on:plsqc=1:plsqr=2,1_0 on theBenchmark for (2980ds/822Mi)
% 12.21/2.30 % (21465)lrs+10_23:15_sil=2000:plsqc=1:plsq=on:plsqr=4106395,32768:plsql=on:nwc=3.0:flr=on:newcnf=on:i=554:kws=precedence:fsr=off:ss=included_0 on theBenchmark for (2980ds/554Mi)
% 12.21/2.31 % (21451)Instruction limit reached!
% 12.21/2.31 % (21451)------------------------------
% 12.21/2.31 % (21451)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 12.21/2.31 % (21451)Termination reason: Unknown
% 12.21/2.31 % (21451)Termination phase: Saturation
% 12.21/2.31
% 12.21/2.31 % (21451)Memory used [KB]: 3905
% 12.21/2.31 % (21451)Time elapsed: 0.140 s
% 12.21/2.31 % (21451)Instructions burned: 325 (million)
% 12.21/2.31 % (21451)------------------------------
% 12.21/2.31 % (21451)------------------------------
% 12.21/2.32 % (21466)lrs+11_1:1_to=lpo:sil=64000:sp=occurrence:nwc=2.0:st=6.0:s2a=on:i=285:s2at=5.0:sd=1:nm=3:gsp=on:ss=axioms:fsr=off_0 on theBenchmark for (2980ds/285Mi)
% 12.21/2.32 % (21454)Instruction limit reached!
% 12.21/2.32 % (21454)------------------------------
% 12.21/2.32 % (21454)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 12.21/2.32 % (21454)Termination reason: Unknown
% 12.21/2.32 % (21454)Termination phase: Saturation
% 12.21/2.32
% 12.21/2.32 % (21454)Memory used [KB]: 2832
% 12.21/2.32 % (21454)Time elapsed: 0.091 s
% 12.21/2.32 % (21454)Instructions burned: 196 (million)
% 12.21/2.32 % (21454)------------------------------
% 12.21/2.32 % (21454)------------------------------
% 12.21/2.33 % (21467)lrs+1004_1:1_anc=none:sil=16000:tgt=ground:rnwc=on:nwc=10.0:i=263:nm=6:ins=1:afr=on:ss=axioms:sgt=32:rawr=on:newcnf=on_0 on theBenchmark for (2980ds/263Mi)
% 12.21/2.37 % (21464)First to succeed.
% 12.63/2.38 % (21464)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-21255"
% 12.63/2.38 % SZS status CounterSatisfiable for theBenchmark
% 12.63/2.38 % (21464)# SZS output start Saturation.
% See solution above
% 12.63/2.39 % (21464)------------------------------
% 12.63/2.39 % (21464)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 12.63/2.39 % (21464)Termination reason: Satisfiable
% 12.63/2.39
% 12.63/2.39 % (21464)Memory used [KB]: 3325
% 12.63/2.39 % (21464)Time elapsed: 0.081 s
% 12.63/2.39 % (21464)Instructions burned: 294 (million)
% 12.63/2.39 % (21255)Success in time 2.042 s
% 12.63/2.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------