TSTP Solution File: LCL953_8 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : LCL953_8 : TPTP v8.2.0. Released v8.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n011.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 : Fri May 3 02:40:22 EDT 2024
% Result : Theorem 0.49s 1.16s
% Output : CNFRefutation 0.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 10
% Syntax : Number of formulae : 69 ( 18 unt; 0 typ; 0 def)
% Number of atoms : 548 ( 0 equ)
% Maximal formula atoms : 20 ( 7 avg)
% Number of connectives : 557 ( 226 ~; 176 |; 102 &)
% ( 0 <=>; 53 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 8 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 148 ( 148 fml; 0 var)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 16 ( 15 usr; 9 prp; 0-3 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 244 ( 0 sgn 103 !; 72 ?; 139 :)
% Comments :
%------------------------------------------------------------------------------
tff(f7,axiom,
! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ! [X2] :
( '$ki_exists_in_world_$i'(X0,X2)
=> ! [X3: '$ki_world'] :
( '$ki_accessible'(X0,X3)
=> ! [X4] :
( '$ki_exists_in_world_$i'(X3,X4)
=> ! [X5: '$ki_world'] :
( '$ki_accessible'(X3,X5)
=> ( ! [X6: '$ki_world'] :
( '$ki_accessible'(X5,X6)
=> ~ ! [X7: '$ki_world'] :
( '$ki_accessible'(X6,X7)
=> in(X7,X2,X4) ) )
=> ! [X6: '$ki_world'] :
( '$ki_accessible'(X5,X6)
=> disjoint(X6,singleton(X2),X4) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l28_zfmisc_1) ).
tff(f8,conjecture,
! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ! [X2] :
( '$ki_exists_in_world_$i'(X0,X2)
=> ! [X3: '$ki_world'] :
( '$ki_accessible'(X0,X3)
=> ! [X4] :
( '$ki_exists_in_world_$i'(X3,X4)
=> ! [X5: '$ki_world'] :
( '$ki_accessible'(X3,X5)
=> ( ! [X6: '$ki_world'] :
( '$ki_accessible'(X5,X6)
=> ~ ! [X7: '$ki_world'] :
( '$ki_accessible'(X6,X7)
=> in(X7,X2,X4) ) )
=> ! [X6: '$ki_world'] :
( '$ki_accessible'(X5,X6)
=> disjoint(X6,singleton(X2),X4) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',verify) ).
tff(f9,negated_conjecture,
~ ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ! [X2] :
( '$ki_exists_in_world_$i'(X0,X2)
=> ! [X3: '$ki_world'] :
( '$ki_accessible'(X0,X3)
=> ! [X4] :
( '$ki_exists_in_world_$i'(X3,X4)
=> ! [X5: '$ki_world'] :
( '$ki_accessible'(X3,X5)
=> ( ! [X6: '$ki_world'] :
( '$ki_accessible'(X5,X6)
=> ~ ! [X7: '$ki_world'] :
( '$ki_accessible'(X6,X7)
=> in(X7,X2,X4) ) )
=> ! [X6: '$ki_world'] :
( '$ki_accessible'(X5,X6)
=> disjoint(X6,singleton(X2),X4) ) ) ) ) ) ) ),
inference(negated_conjecture,[],[f8]) ).
tff(f14,plain,
! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ! [X1] :
( '$ki_exists_in_world_$i'(X0,X1)
=> ! [X2: '$ki_world'] :
( '$ki_accessible'(X0,X2)
=> ! [X3] :
( '$ki_exists_in_world_$i'(X2,X3)
=> ! [X4: '$ki_world'] :
( '$ki_accessible'(X2,X4)
=> ( ! [X5: '$ki_world'] :
( '$ki_accessible'(X4,X5)
=> ~ ! [X6: '$ki_world'] :
( '$ki_accessible'(X5,X6)
=> in(X6,X1,X3) ) )
=> ! [X7: '$ki_world'] :
( '$ki_accessible'(X4,X7)
=> disjoint(X7,singleton(X1),X3) ) ) ) ) ) ) ),
inference(rectify,[],[f7]) ).
tff(f15,plain,
~ ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ! [X1] :
( '$ki_exists_in_world_$i'(X0,X1)
=> ! [X2: '$ki_world'] :
( '$ki_accessible'(X0,X2)
=> ! [X3] :
( '$ki_exists_in_world_$i'(X2,X3)
=> ! [X4: '$ki_world'] :
( '$ki_accessible'(X2,X4)
=> ( ! [X5: '$ki_world'] :
( '$ki_accessible'(X4,X5)
=> ~ ! [X6: '$ki_world'] :
( '$ki_accessible'(X5,X6)
=> in(X6,X1,X3) ) )
=> ! [X7: '$ki_world'] :
( '$ki_accessible'(X4,X7)
=> disjoint(X7,singleton(X1),X3) ) ) ) ) ) ) ),
inference(rectify,[],[f9]) ).
tff(f22,plain,
! [X0: '$ki_world'] :
( ! [X1] :
( ! [X2: '$ki_world'] :
( ! [X3] :
( ! [X4: '$ki_world'] :
( ! [X7: '$ki_world'] :
( disjoint(X7,singleton(X1),X3)
| ~ '$ki_accessible'(X4,X7) )
| ? [X5: '$ki_world'] :
( ! [X6: '$ki_world'] :
( in(X6,X1,X3)
| ~ '$ki_accessible'(X5,X6) )
& '$ki_accessible'(X4,X5) )
| ~ '$ki_accessible'(X2,X4) )
| ~ '$ki_exists_in_world_$i'(X2,X3) )
| ~ '$ki_accessible'(X0,X2) )
| ~ '$ki_exists_in_world_$i'(X0,X1) )
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(ennf_transformation,[],[f14]) ).
tff(f23,plain,
! [X0: '$ki_world'] :
( ! [X1] :
( ! [X2: '$ki_world'] :
( ! [X3] :
( ! [X4: '$ki_world'] :
( ! [X7: '$ki_world'] :
( disjoint(X7,singleton(X1),X3)
| ~ '$ki_accessible'(X4,X7) )
| ? [X5: '$ki_world'] :
( ! [X6: '$ki_world'] :
( in(X6,X1,X3)
| ~ '$ki_accessible'(X5,X6) )
& '$ki_accessible'(X4,X5) )
| ~ '$ki_accessible'(X2,X4) )
| ~ '$ki_exists_in_world_$i'(X2,X3) )
| ~ '$ki_accessible'(X0,X2) )
| ~ '$ki_exists_in_world_$i'(X0,X1) )
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(flattening,[],[f22]) ).
tff(f24,plain,
? [X0: '$ki_world'] :
( ? [X1] :
( ? [X2: '$ki_world'] :
( ? [X3] :
( ? [X4: '$ki_world'] :
( ? [X7: '$ki_world'] :
( ~ disjoint(X7,singleton(X1),X3)
& '$ki_accessible'(X4,X7) )
& ! [X5: '$ki_world'] :
( ? [X6: '$ki_world'] :
( ~ in(X6,X1,X3)
& '$ki_accessible'(X5,X6) )
| ~ '$ki_accessible'(X4,X5) )
& '$ki_accessible'(X2,X4) )
& '$ki_exists_in_world_$i'(X2,X3) )
& '$ki_accessible'(X0,X2) )
& '$ki_exists_in_world_$i'(X0,X1) )
& '$ki_accessible'('$ki_local_world',X0) ),
inference(ennf_transformation,[],[f15]) ).
tff(f25,plain,
? [X0: '$ki_world'] :
( ? [X1] :
( ? [X2: '$ki_world'] :
( ? [X3] :
( ? [X4: '$ki_world'] :
( ? [X7: '$ki_world'] :
( ~ disjoint(X7,singleton(X1),X3)
& '$ki_accessible'(X4,X7) )
& ! [X5: '$ki_world'] :
( ? [X6: '$ki_world'] :
( ~ in(X6,X1,X3)
& '$ki_accessible'(X5,X6) )
| ~ '$ki_accessible'(X4,X5) )
& '$ki_accessible'(X2,X4) )
& '$ki_exists_in_world_$i'(X2,X3) )
& '$ki_accessible'(X0,X2) )
& '$ki_exists_in_world_$i'(X0,X1) )
& '$ki_accessible'('$ki_local_world',X0) ),
inference(flattening,[],[f24]) ).
tff(f40,plain,
! [X0: '$ki_world'] :
( ! [X1] :
( ! [X2: '$ki_world'] :
( ! [X3] :
( ! [X4: '$ki_world'] :
( ! [X5: '$ki_world'] :
( disjoint(X5,singleton(X1),X3)
| ~ '$ki_accessible'(X4,X5) )
| ? [X6: '$ki_world'] :
( ! [X7: '$ki_world'] :
( in(X7,X1,X3)
| ~ '$ki_accessible'(X6,X7) )
& '$ki_accessible'(X4,X6) )
| ~ '$ki_accessible'(X2,X4) )
| ~ '$ki_exists_in_world_$i'(X2,X3) )
| ~ '$ki_accessible'(X0,X2) )
| ~ '$ki_exists_in_world_$i'(X0,X1) )
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(rectify,[],[f23]) ).
tff(f41,plain,
! [X1,X3,X4: '$ki_world'] :
( ? [X6: '$ki_world'] :
( ! [X7: '$ki_world'] :
( in(X7,X1,X3)
| ~ '$ki_accessible'(X6,X7) )
& '$ki_accessible'(X4,X6) )
=> ( ! [X7: '$ki_world'] :
( in(X7,X1,X3)
| ~ '$ki_accessible'(sK7(X1,X3,X4),X7) )
& '$ki_accessible'(X4,sK7(X1,X3,X4)) ) ),
introduced(choice_axiom,[]) ).
tff(f42,plain,
! [X0: '$ki_world'] :
( ! [X1] :
( ! [X2: '$ki_world'] :
( ! [X3] :
( ! [X4: '$ki_world'] :
( ! [X5: '$ki_world'] :
( disjoint(X5,singleton(X1),X3)
| ~ '$ki_accessible'(X4,X5) )
| ( ! [X7: '$ki_world'] :
( in(X7,X1,X3)
| ~ '$ki_accessible'(sK7(X1,X3,X4),X7) )
& '$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) )
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK7])],[f40,f41]) ).
tff(f43,plain,
? [X0: '$ki_world'] :
( ? [X1] :
( ? [X2: '$ki_world'] :
( ? [X3] :
( ? [X4: '$ki_world'] :
( ? [X5: '$ki_world'] :
( ~ disjoint(X5,singleton(X1),X3)
& '$ki_accessible'(X4,X5) )
& ! [X6: '$ki_world'] :
( ? [X7: '$ki_world'] :
( ~ in(X7,X1,X3)
& '$ki_accessible'(X6,X7) )
| ~ '$ki_accessible'(X4,X6) )
& '$ki_accessible'(X2,X4) )
& '$ki_exists_in_world_$i'(X2,X3) )
& '$ki_accessible'(X0,X2) )
& '$ki_exists_in_world_$i'(X0,X1) )
& '$ki_accessible'('$ki_local_world',X0) ),
inference(rectify,[],[f25]) ).
tff(f44,plain,
( ? [X0: '$ki_world'] :
( ? [X1] :
( ? [X2: '$ki_world'] :
( ? [X3] :
( ? [X4: '$ki_world'] :
( ? [X5: '$ki_world'] :
( ~ disjoint(X5,singleton(X1),X3)
& '$ki_accessible'(X4,X5) )
& ! [X6: '$ki_world'] :
( ? [X7: '$ki_world'] :
( ~ in(X7,X1,X3)
& '$ki_accessible'(X6,X7) )
| ~ '$ki_accessible'(X4,X6) )
& '$ki_accessible'(X2,X4) )
& '$ki_exists_in_world_$i'(X2,X3) )
& '$ki_accessible'(X0,X2) )
& '$ki_exists_in_world_$i'(X0,X1) )
& '$ki_accessible'('$ki_local_world',X0) )
=> ( ? [X1] :
( ? [X2: '$ki_world'] :
( ? [X3] :
( ? [X4: '$ki_world'] :
( ? [X5: '$ki_world'] :
( ~ disjoint(X5,singleton(X1),X3)
& '$ki_accessible'(X4,X5) )
& ! [X6: '$ki_world'] :
( ? [X7: '$ki_world'] :
( ~ in(X7,X1,X3)
& '$ki_accessible'(X6,X7) )
| ~ '$ki_accessible'(X4,X6) )
& '$ki_accessible'(X2,X4) )
& '$ki_exists_in_world_$i'(X2,X3) )
& '$ki_accessible'(sK8,X2) )
& '$ki_exists_in_world_$i'(sK8,X1) )
& '$ki_accessible'('$ki_local_world',sK8) ) ),
introduced(choice_axiom,[]) ).
tff(f45,plain,
( ? [X1] :
( ? [X2: '$ki_world'] :
( ? [X3] :
( ? [X4: '$ki_world'] :
( ? [X5: '$ki_world'] :
( ~ disjoint(X5,singleton(X1),X3)
& '$ki_accessible'(X4,X5) )
& ! [X6: '$ki_world'] :
( ? [X7: '$ki_world'] :
( ~ in(X7,X1,X3)
& '$ki_accessible'(X6,X7) )
| ~ '$ki_accessible'(X4,X6) )
& '$ki_accessible'(X2,X4) )
& '$ki_exists_in_world_$i'(X2,X3) )
& '$ki_accessible'(sK8,X2) )
& '$ki_exists_in_world_$i'(sK8,X1) )
=> ( ? [X2: '$ki_world'] :
( ? [X3] :
( ? [X4: '$ki_world'] :
( ? [X5: '$ki_world'] :
( ~ disjoint(X5,singleton(sK9),X3)
& '$ki_accessible'(X4,X5) )
& ! [X6: '$ki_world'] :
( ? [X7: '$ki_world'] :
( ~ in(X7,sK9,X3)
& '$ki_accessible'(X6,X7) )
| ~ '$ki_accessible'(X4,X6) )
& '$ki_accessible'(X2,X4) )
& '$ki_exists_in_world_$i'(X2,X3) )
& '$ki_accessible'(sK8,X2) )
& '$ki_exists_in_world_$i'(sK8,sK9) ) ),
introduced(choice_axiom,[]) ).
tff(f46,plain,
( ? [X2: '$ki_world'] :
( ? [X3] :
( ? [X4: '$ki_world'] :
( ? [X5: '$ki_world'] :
( ~ disjoint(X5,singleton(sK9),X3)
& '$ki_accessible'(X4,X5) )
& ! [X6: '$ki_world'] :
( ? [X7: '$ki_world'] :
( ~ in(X7,sK9,X3)
& '$ki_accessible'(X6,X7) )
| ~ '$ki_accessible'(X4,X6) )
& '$ki_accessible'(X2,X4) )
& '$ki_exists_in_world_$i'(X2,X3) )
& '$ki_accessible'(sK8,X2) )
=> ( ? [X3] :
( ? [X4: '$ki_world'] :
( ? [X5: '$ki_world'] :
( ~ disjoint(X5,singleton(sK9),X3)
& '$ki_accessible'(X4,X5) )
& ! [X6: '$ki_world'] :
( ? [X7: '$ki_world'] :
( ~ in(X7,sK9,X3)
& '$ki_accessible'(X6,X7) )
| ~ '$ki_accessible'(X4,X6) )
& '$ki_accessible'(sK10,X4) )
& '$ki_exists_in_world_$i'(sK10,X3) )
& '$ki_accessible'(sK8,sK10) ) ),
introduced(choice_axiom,[]) ).
tff(f47,plain,
( ? [X3] :
( ? [X4: '$ki_world'] :
( ? [X5: '$ki_world'] :
( ~ disjoint(X5,singleton(sK9),X3)
& '$ki_accessible'(X4,X5) )
& ! [X6: '$ki_world'] :
( ? [X7: '$ki_world'] :
( ~ in(X7,sK9,X3)
& '$ki_accessible'(X6,X7) )
| ~ '$ki_accessible'(X4,X6) )
& '$ki_accessible'(sK10,X4) )
& '$ki_exists_in_world_$i'(sK10,X3) )
=> ( ? [X4: '$ki_world'] :
( ? [X5: '$ki_world'] :
( ~ disjoint(X5,singleton(sK9),sK11)
& '$ki_accessible'(X4,X5) )
& ! [X6: '$ki_world'] :
( ? [X7: '$ki_world'] :
( ~ in(X7,sK9,sK11)
& '$ki_accessible'(X6,X7) )
| ~ '$ki_accessible'(X4,X6) )
& '$ki_accessible'(sK10,X4) )
& '$ki_exists_in_world_$i'(sK10,sK11) ) ),
introduced(choice_axiom,[]) ).
tff(f48,plain,
( ? [X4: '$ki_world'] :
( ? [X5: '$ki_world'] :
( ~ disjoint(X5,singleton(sK9),sK11)
& '$ki_accessible'(X4,X5) )
& ! [X6: '$ki_world'] :
( ? [X7: '$ki_world'] :
( ~ in(X7,sK9,sK11)
& '$ki_accessible'(X6,X7) )
| ~ '$ki_accessible'(X4,X6) )
& '$ki_accessible'(sK10,X4) )
=> ( ? [X5: '$ki_world'] :
( ~ disjoint(X5,singleton(sK9),sK11)
& '$ki_accessible'(sK12,X5) )
& ! [X6: '$ki_world'] :
( ? [X7: '$ki_world'] :
( ~ in(X7,sK9,sK11)
& '$ki_accessible'(X6,X7) )
| ~ '$ki_accessible'(sK12,X6) )
& '$ki_accessible'(sK10,sK12) ) ),
introduced(choice_axiom,[]) ).
tff(f49,plain,
( ? [X5: '$ki_world'] :
( ~ disjoint(X5,singleton(sK9),sK11)
& '$ki_accessible'(sK12,X5) )
=> ( ~ disjoint(sK13,singleton(sK9),sK11)
& '$ki_accessible'(sK12,sK13) ) ),
introduced(choice_axiom,[]) ).
tff(f50,plain,
! [X6: '$ki_world'] :
( ? [X7: '$ki_world'] :
( ~ in(X7,sK9,sK11)
& '$ki_accessible'(X6,X7) )
=> ( ~ in(sK14(X6),sK9,sK11)
& '$ki_accessible'(X6,sK14(X6)) ) ),
introduced(choice_axiom,[]) ).
tff(f51,plain,
( ~ disjoint(sK13,singleton(sK9),sK11)
& '$ki_accessible'(sK12,sK13)
& ! [X6: '$ki_world'] :
( ( ~ in(sK14(X6),sK9,sK11)
& '$ki_accessible'(X6,sK14(X6)) )
| ~ '$ki_accessible'(sK12,X6) )
& '$ki_accessible'(sK10,sK12)
& '$ki_exists_in_world_$i'(sK10,sK11)
& '$ki_accessible'(sK8,sK10)
& '$ki_exists_in_world_$i'(sK8,sK9)
& '$ki_accessible'('$ki_local_world',sK8) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK8,sK9,sK10,sK11,sK12,sK13,sK14])],[f43,f50,f49,f48,f47,f46,f45,f44]) ).
tff(f65,plain,
! [X2: '$ki_world',X3: $i,X0: '$ki_world',X1: $i,X4: '$ki_world',X5: '$ki_world'] :
( disjoint(X5,singleton(X1),X3)
| ~ '$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)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(cnf_transformation,[],[f42]) ).
tff(f66,plain,
! [X2: '$ki_world',X3: $i,X0: '$ki_world',X1: $i,X7: '$ki_world',X4: '$ki_world',X5: '$ki_world'] :
( disjoint(X5,singleton(X1),X3)
| ~ '$ki_accessible'(X4,X5)
| in(X7,X1,X3)
| ~ '$ki_accessible'(sK7(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)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(cnf_transformation,[],[f42]) ).
tff(f67,plain,
'$ki_accessible'('$ki_local_world',sK8),
inference(cnf_transformation,[],[f51]) ).
tff(f68,plain,
'$ki_exists_in_world_$i'(sK8,sK9),
inference(cnf_transformation,[],[f51]) ).
tff(f69,plain,
'$ki_accessible'(sK8,sK10),
inference(cnf_transformation,[],[f51]) ).
tff(f70,plain,
'$ki_exists_in_world_$i'(sK10,sK11),
inference(cnf_transformation,[],[f51]) ).
tff(f71,plain,
'$ki_accessible'(sK10,sK12),
inference(cnf_transformation,[],[f51]) ).
tff(f72,plain,
! [X6: '$ki_world'] :
( '$ki_accessible'(X6,sK14(X6))
| ~ '$ki_accessible'(sK12,X6) ),
inference(cnf_transformation,[],[f51]) ).
tff(f73,plain,
! [X6: '$ki_world'] :
( ~ in(sK14(X6),sK9,sK11)
| ~ '$ki_accessible'(sK12,X6) ),
inference(cnf_transformation,[],[f51]) ).
tff(f74,plain,
'$ki_accessible'(sK12,sK13),
inference(cnf_transformation,[],[f51]) ).
tff(f75,plain,
~ disjoint(sK13,singleton(sK9),sK11),
inference(cnf_transformation,[],[f51]) ).
cnf(c_62,plain,
( ~ '$ki_accessible'(sK7(X0,X1,X0_13),X1_13)
| ~ '$ki_accessible'(X0_13,X3_13)
| ~ '$ki_accessible'(X2_13,X0_13)
| ~ '$ki_accessible'(X4_13,X2_13)
| ~ '$ki_exists_in_world_$i'(X2_13,X1)
| ~ '$ki_exists_in_world_$i'(X4_13,X0)
| ~ '$ki_accessible'('$ki_local_world',X4_13)
| disjoint(X3_13,singleton(X0),X1)
| in(X1_13,X0,X1) ),
inference(cnf_transformation,[],[f66]) ).
cnf(c_63,plain,
( ~ '$ki_accessible'(X0_13,X1_13)
| ~ '$ki_accessible'(X1_13,X2_13)
| ~ '$ki_accessible'(X3_13,X0_13)
| ~ '$ki_exists_in_world_$i'(X0_13,X0)
| ~ '$ki_exists_in_world_$i'(X3_13,X1)
| ~ '$ki_accessible'('$ki_local_world',X3_13)
| '$ki_accessible'(X1_13,sK7(X1,X0,X1_13))
| disjoint(X2_13,singleton(X1),X0) ),
inference(cnf_transformation,[],[f65]) ).
cnf(c_64,negated_conjecture,
~ disjoint(sK13,singleton(sK9),sK11),
inference(cnf_transformation,[],[f75]) ).
cnf(c_65,negated_conjecture,
'$ki_accessible'(sK12,sK13),
inference(cnf_transformation,[],[f74]) ).
cnf(c_66,negated_conjecture,
( ~ in(sK14(X0_13),sK9,sK11)
| ~ '$ki_accessible'(sK12,X0_13) ),
inference(cnf_transformation,[],[f73]) ).
cnf(c_67,negated_conjecture,
( ~ '$ki_accessible'(sK12,X0_13)
| '$ki_accessible'(X0_13,sK14(X0_13)) ),
inference(cnf_transformation,[],[f72]) ).
cnf(c_68,negated_conjecture,
'$ki_accessible'(sK10,sK12),
inference(cnf_transformation,[],[f71]) ).
cnf(c_69,negated_conjecture,
'$ki_exists_in_world_$i'(sK10,sK11),
inference(cnf_transformation,[],[f70]) ).
cnf(c_70,negated_conjecture,
'$ki_accessible'(sK8,sK10),
inference(cnf_transformation,[],[f69]) ).
cnf(c_71,negated_conjecture,
'$ki_exists_in_world_$i'(sK8,sK9),
inference(cnf_transformation,[],[f68]) ).
cnf(c_72,negated_conjecture,
'$ki_accessible'('$ki_local_world',sK8),
inference(cnf_transformation,[],[f67]) ).
cnf(c_425,negated_conjecture,
'$ki_exists_in_world_$i'(sK8,sK9),
inference(subtyping,[status(esa)],[c_71]) ).
cnf(c_427,negated_conjecture,
'$ki_exists_in_world_$i'(sK10,sK11),
inference(subtyping,[status(esa)],[c_69]) ).
cnf(c_429,negated_conjecture,
( ~ '$ki_accessible'(sK12,X0_14)
| '$ki_accessible'(X0_14,sK14(X0_14)) ),
inference(subtyping,[status(esa)],[c_67]) ).
cnf(c_430,negated_conjecture,
( ~ in(sK14(X0_14),sK9,sK11)
| ~ '$ki_accessible'(sK12,X0_14) ),
inference(subtyping,[status(esa)],[c_66]) ).
cnf(c_432,negated_conjecture,
~ disjoint(sK13,singleton(sK9),sK11),
inference(subtyping,[status(esa)],[c_64]) ).
cnf(c_433,plain,
( ~ '$ki_accessible'(X0_14,X1_14)
| ~ '$ki_accessible'(X1_14,X3_14)
| ~ '$ki_accessible'(X2_14,X0_14)
| ~ '$ki_exists_in_world_$i'(X0_14,X0_15)
| ~ '$ki_exists_in_world_$i'(X2_14,X1_15)
| ~ '$ki_accessible'('$ki_local_world',X2_14)
| '$ki_accessible'(X1_14,sK7(X1_15,X0_15,X1_14))
| disjoint(X3_14,singleton(X1_15),X0_15) ),
inference(subtyping,[status(esa)],[c_63]) ).
cnf(c_434,plain,
( ~ '$ki_accessible'(sK7(X0_15,X1_15,X0_14),X1_14)
| ~ '$ki_accessible'(X0_14,X4_14)
| ~ '$ki_accessible'(X2_14,X0_14)
| ~ '$ki_accessible'(X3_14,X2_14)
| ~ '$ki_exists_in_world_$i'(X2_14,X1_15)
| ~ '$ki_exists_in_world_$i'(X3_14,X0_15)
| ~ '$ki_accessible'('$ki_local_world',X3_14)
| disjoint(X4_14,singleton(X0_15),X1_15)
| in(X1_14,X0_15,X1_15) ),
inference(subtyping,[status(esa)],[c_62]) ).
cnf(c_539,plain,
( ~ '$ki_accessible'(sK7(sK9,sK11,X0_14),X1_14)
| ~ '$ki_accessible'(X2_14,X0_14)
| ~ '$ki_accessible'(X3_14,X2_14)
| ~ '$ki_accessible'(X0_14,sK13)
| ~ '$ki_accessible'('$ki_local_world',X3_14)
| ~ '$ki_exists_in_world_$i'(X2_14,sK11)
| ~ '$ki_exists_in_world_$i'(X3_14,sK9)
| in(X1_14,sK9,sK11) ),
inference(resolution,[status(thm)],[c_434,c_432]) ).
cnf(c_549,plain,
( ~ '$ki_accessible'(sK7(sK9,sK11,X0_14),sK14(X1_14))
| ~ '$ki_accessible'(X2_14,X0_14)
| ~ '$ki_accessible'(X3_14,X2_14)
| ~ '$ki_accessible'(X0_14,sK13)
| ~ '$ki_accessible'('$ki_local_world',X3_14)
| ~ '$ki_accessible'(sK12,X1_14)
| ~ '$ki_exists_in_world_$i'(X2_14,sK11)
| ~ '$ki_exists_in_world_$i'(X3_14,sK9) ),
inference(resolution,[status(thm)],[c_539,c_430]) ).
cnf(c_563,plain,
( ~ '$ki_accessible'(sK7(sK9,sK11,X0_14),sK14(X1_14))
| ~ '$ki_accessible'(X2_14,X0_14)
| ~ '$ki_accessible'(X0_14,sK13)
| ~ '$ki_accessible'(sK8,X2_14)
| ~ '$ki_accessible'(sK12,X1_14)
| ~ '$ki_exists_in_world_$i'(X2_14,sK11)
| ~ '$ki_accessible'('$ki_local_world',sK8) ),
inference(resolution,[status(thm)],[c_549,c_425]) ).
cnf(c_565,plain,
( ~ '$ki_exists_in_world_$i'(X2_14,sK11)
| ~ '$ki_accessible'(sK12,X1_14)
| ~ '$ki_accessible'(sK8,X2_14)
| ~ '$ki_accessible'(X0_14,sK13)
| ~ '$ki_accessible'(X2_14,X0_14)
| ~ '$ki_accessible'(sK7(sK9,sK11,X0_14),sK14(X1_14)) ),
inference(global_subsumption_just,[status(thm)],[c_563,c_72,c_563]) ).
cnf(c_566,plain,
( ~ '$ki_accessible'(sK7(sK9,sK11,X0_14),sK14(X1_14))
| ~ '$ki_accessible'(X2_14,X0_14)
| ~ '$ki_accessible'(X0_14,sK13)
| ~ '$ki_accessible'(sK8,X2_14)
| ~ '$ki_accessible'(sK12,X1_14)
| ~ '$ki_exists_in_world_$i'(X2_14,sK11) ),
inference(renaming,[status(thm)],[c_565]) ).
cnf(c_576,plain,
( ~ '$ki_accessible'(sK7(sK9,sK11,X0_14),sK14(X1_14))
| ~ '$ki_accessible'(X0_14,sK13)
| ~ '$ki_accessible'(sK10,X0_14)
| ~ '$ki_accessible'(sK12,X1_14)
| ~ '$ki_accessible'(sK8,sK10) ),
inference(resolution,[status(thm)],[c_566,c_427]) ).
cnf(c_578,plain,
( ~ '$ki_accessible'(sK12,X1_14)
| ~ '$ki_accessible'(sK10,X0_14)
| ~ '$ki_accessible'(X0_14,sK13)
| ~ '$ki_accessible'(sK7(sK9,sK11,X0_14),sK14(X1_14)) ),
inference(global_subsumption_just,[status(thm)],[c_576,c_70,c_576]) ).
cnf(c_579,plain,
( ~ '$ki_accessible'(sK7(sK9,sK11,X0_14),sK14(X1_14))
| ~ '$ki_accessible'(X0_14,sK13)
| ~ '$ki_accessible'(sK10,X0_14)
| ~ '$ki_accessible'(sK12,X1_14) ),
inference(renaming,[status(thm)],[c_578]) ).
cnf(c_586,plain,
( ~ '$ki_accessible'(sK12,sK7(sK9,sK11,X0_14))
| ~ '$ki_accessible'(X0_14,sK13)
| ~ '$ki_accessible'(sK10,X0_14) ),
inference(resolution,[status(thm)],[c_579,c_429]) ).
cnf(c_591,plain,
( ~ '$ki_accessible'(X0_14,X1_14)
| ~ '$ki_accessible'(X1_14,sK12)
| ~ '$ki_accessible'('$ki_local_world',X0_14)
| ~ '$ki_accessible'(sK12,X2_14)
| ~ '$ki_exists_in_world_$i'(X0_14,sK9)
| ~ '$ki_exists_in_world_$i'(X1_14,sK11)
| ~ '$ki_accessible'(sK10,sK12)
| ~ '$ki_accessible'(sK12,sK13)
| disjoint(X2_14,singleton(sK9),sK11) ),
inference(resolution,[status(thm)],[c_586,c_433]) ).
cnf(c_593,plain,
( ~ '$ki_accessible'(X0_14,X1_14)
| ~ '$ki_accessible'(X1_14,sK12)
| ~ '$ki_accessible'('$ki_local_world',X0_14)
| ~ '$ki_accessible'(sK12,X2_14)
| ~ '$ki_exists_in_world_$i'(X0_14,sK9)
| ~ '$ki_exists_in_world_$i'(X1_14,sK11)
| disjoint(X2_14,singleton(sK9),sK11) ),
inference(global_subsumption_just,[status(thm)],[c_591,c_68,c_65,c_591]) ).
cnf(c_603,plain,
( ~ '$ki_accessible'(X0_14,X1_14)
| ~ '$ki_accessible'(X1_14,sK12)
| ~ '$ki_accessible'('$ki_local_world',X0_14)
| ~ '$ki_exists_in_world_$i'(X0_14,sK9)
| ~ '$ki_exists_in_world_$i'(X1_14,sK11)
| ~ '$ki_accessible'(sK12,sK13) ),
inference(resolution,[status(thm)],[c_593,c_432]) ).
cnf(c_605,plain,
( ~ '$ki_exists_in_world_$i'(X1_14,sK11)
| ~ '$ki_exists_in_world_$i'(X0_14,sK9)
| ~ '$ki_accessible'('$ki_local_world',X0_14)
| ~ '$ki_accessible'(X1_14,sK12)
| ~ '$ki_accessible'(X0_14,X1_14) ),
inference(global_subsumption_just,[status(thm)],[c_603,c_65,c_603]) ).
cnf(c_606,plain,
( ~ '$ki_accessible'(X0_14,X1_14)
| ~ '$ki_accessible'(X1_14,sK12)
| ~ '$ki_accessible'('$ki_local_world',X0_14)
| ~ '$ki_exists_in_world_$i'(X0_14,sK9)
| ~ '$ki_exists_in_world_$i'(X1_14,sK11) ),
inference(renaming,[status(thm)],[c_605]) ).
cnf(c_615,plain,
( ~ '$ki_accessible'(X0_14,sK10)
| ~ '$ki_accessible'('$ki_local_world',X0_14)
| ~ '$ki_exists_in_world_$i'(X0_14,sK9)
| ~ '$ki_accessible'(sK10,sK12) ),
inference(resolution,[status(thm)],[c_606,c_427]) ).
cnf(c_617,plain,
( ~ '$ki_exists_in_world_$i'(X0_14,sK9)
| ~ '$ki_accessible'('$ki_local_world',X0_14)
| ~ '$ki_accessible'(X0_14,sK10) ),
inference(global_subsumption_just,[status(thm)],[c_615,c_68,c_615]) ).
cnf(c_618,plain,
( ~ '$ki_accessible'(X0_14,sK10)
| ~ '$ki_accessible'('$ki_local_world',X0_14)
| ~ '$ki_exists_in_world_$i'(X0_14,sK9) ),
inference(renaming,[status(thm)],[c_617]) ).
cnf(c_628,plain,
( ~ '$ki_accessible'('$ki_local_world',sK8)
| ~ '$ki_accessible'(sK8,sK10) ),
inference(resolution,[status(thm)],[c_618,c_425]) ).
cnf(c_629,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_628,c_70,c_72]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL953_8 : TPTP v8.2.0. Released v8.2.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.14/0.34 % Computer : n011.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Thu May 2 19:11:33 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.21/0.47 Running first-order theorem proving
% 0.21/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.49/1.16 % SZS status Started for theBenchmark.p
% 0.49/1.16 % SZS status Theorem for theBenchmark.p
% 0.49/1.16
% 0.49/1.16 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.49/1.16
% 0.49/1.16 ------ iProver source info
% 0.49/1.16
% 0.49/1.16 git: date: 2024-05-02 19:28:25 +0000
% 0.49/1.16 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.49/1.16 git: non_committed_changes: false
% 0.49/1.16
% 0.49/1.16 ------ Parsing...
% 0.49/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.49/1.16
% 0.49/1.16 ------ Preprocessing... sf_s rm: 2 0s sf_e pe_s pe_e sf_s rm: 0 0s sf_e pe_s pe_e
% 0.49/1.16
% 0.49/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.49/1.16 ------ Proving...
% 0.49/1.16 ------ Problem Properties
% 0.49/1.16
% 0.49/1.16
% 0.49/1.16 clauses 22
% 0.49/1.16 conjectures 9
% 0.49/1.16 EPR 9
% 0.49/1.16 Horn 18
% 0.49/1.16 unary 11
% 0.49/1.16 binary 3
% 0.49/1.16 lits 82
% 0.49/1.16 lits eq 0
% 0.49/1.16 fd_pure 0
% 0.49/1.16 fd_pseudo 0
% 0.49/1.16 fd_cond 0
% 0.49/1.16 fd_pseudo_cond 0
% 0.49/1.16 AC symbols 0
% 0.49/1.16
% 0.49/1.16 ------ Input Options Time Limit: Unbounded
% 0.49/1.16
% 0.49/1.16
% 0.49/1.16 ------
% 0.49/1.16 Current options:
% 0.49/1.16 ------
% 0.49/1.16
% 0.49/1.16
% 0.49/1.16
% 0.49/1.16
% 0.49/1.16 ------ Proving...
% 0.49/1.16
% 0.49/1.16
% 0.49/1.16 % SZS status Theorem for theBenchmark.p
% 0.49/1.16
% 0.49/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.49/1.16
% 0.49/1.17
%------------------------------------------------------------------------------