TSTP Solution File: LCL947_10 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : LCL947_10 : TPTP v8.2.0. Released v8.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% 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 : Fri May 3 02:40:20 EDT 2024
% Result : Theorem 4.38s 1.22s
% Output : CNFRefutation 4.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 8
% Syntax : Number of formulae : 59 ( 16 unt; 0 typ; 0 def)
% Number of atoms : 353 ( 0 equ)
% Maximal formula atoms : 9 ( 5 avg)
% Number of connectives : 387 ( 178 ~; 150 |; 24 &)
% ( 0 <=>; 35 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 85 ( 85 fml; 0 var)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 12 ( 11 usr; 6 prp; 0-3 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 154 ( 0 sgn 76 !; 16 ?; 68 :)
% Comments :
%------------------------------------------------------------------------------
tff(f1,axiom,
! [X0: '$ki_world'] : '$ki_accessible'(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mrel_reflexive) ).
tff(f13,axiom,
! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ! [X11] :
( '$ki_exists_in_world_$i'(X0,X11)
=> ! [X4: '$ki_world'] :
( '$ki_accessible'(X0,X4)
=> ! [X12] :
( '$ki_exists_in_world_$i'(X4,X12)
=> ! [X6: '$ki_world'] :
( '$ki_accessible'(X4,X6)
=> ( ! [X7: '$ki_world'] :
( '$ki_accessible'(X6,X7)
=> subset(X7,X11,X12) )
=> ! [X7: '$ki_world'] :
( '$ki_accessible'(X6,X7)
=> qmltpeq(X7,union(X11,X12),X12) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset_union) ).
tff(f18,axiom,
! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ! [X11] :
( '$ki_exists_in_world_$i'(X0,X11)
=> ! [X4: '$ki_world'] :
( '$ki_accessible'(X0,X4)
=> subset(X4,X11,X11) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_of_subset) ).
tff(f20,conjecture,
! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ! [X11] :
( '$ki_exists_in_world_$i'(X0,X11)
=> ! [X4: '$ki_world'] :
( '$ki_accessible'(X0,X4)
=> qmltpeq(X4,union(X11,X11),X11) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',verify) ).
tff(f21,negated_conjecture,
~ ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ! [X11] :
( '$ki_exists_in_world_$i'(X0,X11)
=> ! [X4: '$ki_world'] :
( '$ki_accessible'(X0,X4)
=> qmltpeq(X4,union(X11,X11),X11) ) ) ),
inference(negated_conjecture,[],[f20]) ).
tff(f32,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)
=> subset(X5,X1,X3) )
=> ! [X6: '$ki_world'] :
( '$ki_accessible'(X4,X6)
=> qmltpeq(X6,union(X1,X3),X3) ) ) ) ) ) ) ),
inference(rectify,[],[f13]) ).
tff(f37,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)
=> subset(X2,X1,X1) ) ) ),
inference(rectify,[],[f18]) ).
tff(f39,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)
=> qmltpeq(X2,union(X1,X1),X1) ) ) ),
inference(rectify,[],[f21]) ).
tff(f59,plain,
! [X0: '$ki_world'] :
( ! [X1] :
( ! [X2: '$ki_world'] :
( ! [X3] :
( ! [X4: '$ki_world'] :
( ! [X6: '$ki_world'] :
( qmltpeq(X6,union(X1,X3),X3)
| ~ '$ki_accessible'(X4,X6) )
| ? [X5: '$ki_world'] :
( ~ subset(X5,X1,X3)
& '$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,[],[f32]) ).
tff(f60,plain,
! [X0: '$ki_world'] :
( ! [X1] :
( ! [X2: '$ki_world'] :
( ! [X3] :
( ! [X4: '$ki_world'] :
( ! [X6: '$ki_world'] :
( qmltpeq(X6,union(X1,X3),X3)
| ~ '$ki_accessible'(X4,X6) )
| ? [X5: '$ki_world'] :
( ~ subset(X5,X1,X3)
& '$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,[],[f59]) ).
tff(f68,plain,
! [X0: '$ki_world'] :
( ! [X1] :
( ! [X2: '$ki_world'] :
( subset(X2,X1,X1)
| ~ '$ki_accessible'(X0,X2) )
| ~ '$ki_exists_in_world_$i'(X0,X1) )
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(ennf_transformation,[],[f37]) ).
tff(f71,plain,
? [X0: '$ki_world'] :
( ? [X1] :
( ? [X2: '$ki_world'] :
( ~ qmltpeq(X2,union(X1,X1),X1)
& '$ki_accessible'(X0,X2) )
& '$ki_exists_in_world_$i'(X0,X1) )
& '$ki_accessible'('$ki_local_world',X0) ),
inference(ennf_transformation,[],[f39]) ).
tff(f108,plain,
! [X0: '$ki_world'] :
( ! [X1] :
( ! [X2: '$ki_world'] :
( ! [X3] :
( ! [X4: '$ki_world'] :
( ! [X5: '$ki_world'] :
( qmltpeq(X5,union(X1,X3),X3)
| ~ '$ki_accessible'(X4,X5) )
| ? [X6: '$ki_world'] :
( ~ subset(X6,X1,X3)
& '$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,[],[f60]) ).
tff(f109,plain,
! [X1,X3,X4: '$ki_world'] :
( ? [X6: '$ki_world'] :
( ~ subset(X6,X1,X3)
& '$ki_accessible'(X4,X6) )
=> ( ~ subset(sK17(X1,X3,X4),X1,X3)
& '$ki_accessible'(X4,sK17(X1,X3,X4)) ) ),
introduced(choice_axiom,[]) ).
tff(f110,plain,
! [X0: '$ki_world'] :
( ! [X1] :
( ! [X2: '$ki_world'] :
( ! [X3] :
( ! [X4: '$ki_world'] :
( ! [X5: '$ki_world'] :
( qmltpeq(X5,union(X1,X3),X3)
| ~ '$ki_accessible'(X4,X5) )
| ( ~ subset(sK17(X1,X3,X4),X1,X3)
& '$ki_accessible'(X4,sK17(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,[sK17])],[f108,f109]) ).
tff(f149,plain,
( ? [X0: '$ki_world'] :
( ? [X1] :
( ? [X2: '$ki_world'] :
( ~ qmltpeq(X2,union(X1,X1),X1)
& '$ki_accessible'(X0,X2) )
& '$ki_exists_in_world_$i'(X0,X1) )
& '$ki_accessible'('$ki_local_world',X0) )
=> ( ? [X1] :
( ? [X2: '$ki_world'] :
( ~ qmltpeq(X2,union(X1,X1),X1)
& '$ki_accessible'(sK39,X2) )
& '$ki_exists_in_world_$i'(sK39,X1) )
& '$ki_accessible'('$ki_local_world',sK39) ) ),
introduced(choice_axiom,[]) ).
tff(f150,plain,
( ? [X1] :
( ? [X2: '$ki_world'] :
( ~ qmltpeq(X2,union(X1,X1),X1)
& '$ki_accessible'(sK39,X2) )
& '$ki_exists_in_world_$i'(sK39,X1) )
=> ( ? [X2: '$ki_world'] :
( ~ qmltpeq(X2,union(sK40,sK40),sK40)
& '$ki_accessible'(sK39,X2) )
& '$ki_exists_in_world_$i'(sK39,sK40) ) ),
introduced(choice_axiom,[]) ).
tff(f151,plain,
( ? [X2: '$ki_world'] :
( ~ qmltpeq(X2,union(sK40,sK40),sK40)
& '$ki_accessible'(sK39,X2) )
=> ( ~ qmltpeq(sK41,union(sK40,sK40),sK40)
& '$ki_accessible'(sK39,sK41) ) ),
introduced(choice_axiom,[]) ).
tff(f152,plain,
( ~ qmltpeq(sK41,union(sK40,sK40),sK40)
& '$ki_accessible'(sK39,sK41)
& '$ki_exists_in_world_$i'(sK39,sK40)
& '$ki_accessible'('$ki_local_world',sK39) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK39,sK40,sK41])],[f71,f151,f150,f149]) ).
tff(f153,plain,
! [X0: '$ki_world'] : '$ki_accessible'(X0,X0),
inference(cnf_transformation,[],[f1]) ).
tff(f183,plain,
! [X2: '$ki_world',X3: $i,X0: '$ki_world',X1: $i,X4: '$ki_world',X5: '$ki_world'] :
( qmltpeq(X5,union(X1,X3),X3)
| ~ '$ki_accessible'(X4,X5)
| '$ki_accessible'(X4,sK17(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,[],[f110]) ).
tff(f184,plain,
! [X2: '$ki_world',X3: $i,X0: '$ki_world',X1: $i,X4: '$ki_world',X5: '$ki_world'] :
( qmltpeq(X5,union(X1,X3),X3)
| ~ '$ki_accessible'(X4,X5)
| ~ subset(sK17(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'('$ki_local_world',X0) ),
inference(cnf_transformation,[],[f110]) ).
tff(f211,plain,
! [X2: '$ki_world',X0: '$ki_world',X1: $i] :
( subset(X2,X1,X1)
| ~ '$ki_accessible'(X0,X2)
| ~ '$ki_exists_in_world_$i'(X0,X1)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(cnf_transformation,[],[f68]) ).
tff(f231,plain,
'$ki_accessible'('$ki_local_world',sK39),
inference(cnf_transformation,[],[f152]) ).
tff(f232,plain,
'$ki_exists_in_world_$i'(sK39,sK40),
inference(cnf_transformation,[],[f152]) ).
tff(f233,plain,
'$ki_accessible'(sK39,sK41),
inference(cnf_transformation,[],[f152]) ).
tff(f234,plain,
~ qmltpeq(sK41,union(sK40,sK40),sK40),
inference(cnf_transformation,[],[f152]) ).
cnf(c_49,plain,
'$ki_accessible'(X0_13,X0_13),
inference(cnf_transformation,[],[f153]) ).
cnf(c_79,plain,
( ~ subset(sK17(X0,X1,X0_13),X0,X1)
| ~ '$ki_accessible'(X0_13,X2_13)
| ~ '$ki_accessible'(X1_13,X0_13)
| ~ '$ki_accessible'(X3_13,X1_13)
| ~ '$ki_exists_in_world_$i'(X1_13,X1)
| ~ '$ki_exists_in_world_$i'(X3_13,X0)
| ~ '$ki_accessible'('$ki_local_world',X3_13)
| qmltpeq(X2_13,union(X0,X1),X1) ),
inference(cnf_transformation,[],[f184]) ).
cnf(c_80,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,sK17(X1,X0,X1_13))
| qmltpeq(X2_13,union(X1,X0),X0) ),
inference(cnf_transformation,[],[f183]) ).
cnf(c_107,plain,
( ~ '$ki_accessible'(X0_13,X1_13)
| ~ '$ki_exists_in_world_$i'(X0_13,X0)
| ~ '$ki_accessible'('$ki_local_world',X0_13)
| subset(X1_13,X0,X0) ),
inference(cnf_transformation,[],[f211]) ).
cnf(c_127,negated_conjecture,
~ qmltpeq(sK41,union(sK40,sK40),sK40),
inference(cnf_transformation,[],[f234]) ).
cnf(c_128,negated_conjecture,
'$ki_accessible'(sK39,sK41),
inference(cnf_transformation,[],[f233]) ).
cnf(c_129,negated_conjecture,
'$ki_exists_in_world_$i'(sK39,sK40),
inference(cnf_transformation,[],[f232]) ).
cnf(c_130,negated_conjecture,
'$ki_accessible'('$ki_local_world',sK39),
inference(cnf_transformation,[],[f231]) ).
cnf(c_2636,negated_conjecture,
'$ki_exists_in_world_$i'(sK39,sK40),
inference(subtyping,[status(esa)],[c_129]) ).
cnf(c_2638,negated_conjecture,
~ qmltpeq(sK41,union(sK40,sK40),sK40),
inference(subtyping,[status(esa)],[c_127]) ).
cnf(c_2658,plain,
( ~ '$ki_accessible'(X0_14,X1_14)
| ~ '$ki_exists_in_world_$i'(X0_14,X0_15)
| ~ '$ki_accessible'('$ki_local_world',X0_14)
| subset(X1_14,X0_15,X0_15) ),
inference(subtyping,[status(esa)],[c_107]) ).
cnf(c_2685,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,sK17(X1_15,X0_15,X1_14))
| qmltpeq(X3_14,union(X1_15,X0_15),X0_15) ),
inference(subtyping,[status(esa)],[c_80]) ).
cnf(c_2686,plain,
( ~ subset(sK17(X0_15,X1_15,X0_14),X0_15,X1_15)
| ~ '$ki_accessible'(X0_14,X1_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)
| qmltpeq(X1_14,union(X0_15,X1_15),X1_15) ),
inference(subtyping,[status(esa)],[c_79]) ).
cnf(c_2716,plain,
'$ki_accessible'(X0_14,X0_14),
inference(subtyping,[status(esa)],[c_49]) ).
cnf(c_2846,plain,
( ~ '$ki_accessible'(X0_14,X1_14)
| ~ '$ki_accessible'(X2_14,X0_14)
| ~ '$ki_accessible'(X1_14,sK41)
| ~ '$ki_accessible'('$ki_local_world',X2_14)
| ~ '$ki_exists_in_world_$i'(X0_14,sK40)
| ~ '$ki_exists_in_world_$i'(X2_14,sK40)
| '$ki_accessible'(X1_14,sK17(sK40,sK40,X1_14)) ),
inference(resolution,[status(thm)],[c_2685,c_2638]) ).
cnf(c_2863,plain,
( ~ subset(sK17(sK40,sK40,X0_14),sK40,sK40)
| ~ '$ki_accessible'(X1_14,X0_14)
| ~ '$ki_accessible'(X2_14,X1_14)
| ~ '$ki_accessible'(X0_14,sK41)
| ~ '$ki_accessible'('$ki_local_world',X2_14)
| ~ '$ki_exists_in_world_$i'(X1_14,sK40)
| ~ '$ki_exists_in_world_$i'(X2_14,sK40) ),
inference(resolution,[status(thm)],[c_2686,c_2638]) ).
cnf(c_2872,plain,
( ~ '$ki_accessible'(X0_14,sK17(sK40,sK40,X1_14))
| ~ '$ki_accessible'(X2_14,X1_14)
| ~ '$ki_accessible'(X3_14,X2_14)
| ~ '$ki_accessible'(X1_14,sK41)
| ~ '$ki_accessible'('$ki_local_world',X0_14)
| ~ '$ki_accessible'('$ki_local_world',X3_14)
| ~ '$ki_exists_in_world_$i'(X0_14,sK40)
| ~ '$ki_exists_in_world_$i'(X2_14,sK40)
| ~ '$ki_exists_in_world_$i'(X3_14,sK40) ),
inference(resolution,[status(thm)],[c_2863,c_2658]) ).
cnf(c_2916,plain,
( ~ '$ki_accessible'(X0_14,sK17(sK40,sK40,X1_14))
| ~ '$ki_accessible'(X0_14,X2_14)
| ~ '$ki_accessible'(X2_14,X1_14)
| ~ '$ki_accessible'(X1_14,sK41)
| ~ '$ki_accessible'('$ki_local_world',X0_14)
| ~ '$ki_exists_in_world_$i'(X0_14,sK40)
| ~ '$ki_exists_in_world_$i'(X2_14,sK40) ),
inference(factoring,[status(thm)],[c_2872]) ).
cnf(c_2934,plain,
( ~ '$ki_accessible'(X0_14,sK17(sK40,sK40,X1_14))
| ~ '$ki_accessible'(X0_14,X0_14)
| ~ '$ki_accessible'(X0_14,X1_14)
| ~ '$ki_accessible'(X1_14,sK41)
| ~ '$ki_accessible'('$ki_local_world',X0_14)
| ~ '$ki_exists_in_world_$i'(X0_14,sK40) ),
inference(factoring,[status(thm)],[c_2916]) ).
cnf(c_2935,plain,
( ~ '$ki_accessible'(X0_14,sK17(sK40,sK40,X1_14))
| ~ '$ki_accessible'(X0_14,X1_14)
| ~ '$ki_accessible'(X1_14,sK41)
| ~ '$ki_accessible'('$ki_local_world',X0_14)
| ~ '$ki_exists_in_world_$i'(X0_14,sK40) ),
inference(global_subsumption_just,[status(thm)],[c_2934,c_2716,c_2934]) ).
cnf(c_2948,plain,
( ~ '$ki_accessible'(sK39,sK17(sK40,sK40,X0_14))
| ~ '$ki_accessible'(X0_14,sK41)
| ~ '$ki_accessible'(sK39,X0_14)
| ~ '$ki_accessible'('$ki_local_world',sK39) ),
inference(resolution,[status(thm)],[c_2935,c_2636]) ).
cnf(c_2950,plain,
( ~ '$ki_accessible'(sK39,X0_14)
| ~ '$ki_accessible'(X0_14,sK41)
| ~ '$ki_accessible'(sK39,sK17(sK40,sK40,X0_14)) ),
inference(global_subsumption_just,[status(thm)],[c_2948,c_130,c_2948]) ).
cnf(c_2951,plain,
( ~ '$ki_accessible'(sK39,sK17(sK40,sK40,X0_14))
| ~ '$ki_accessible'(X0_14,sK41)
| ~ '$ki_accessible'(sK39,X0_14) ),
inference(renaming,[status(thm)],[c_2950]) ).
cnf(c_2958,plain,
( ~ '$ki_accessible'(X0_14,X1_14)
| ~ '$ki_accessible'(X1_14,sK39)
| ~ '$ki_accessible'('$ki_local_world',X0_14)
| ~ '$ki_exists_in_world_$i'(X0_14,sK40)
| ~ '$ki_exists_in_world_$i'(X1_14,sK40)
| ~ '$ki_accessible'(sK39,sK39)
| ~ '$ki_accessible'(sK39,sK41) ),
inference(resolution,[status(thm)],[c_2951,c_2846]) ).
cnf(c_2960,plain,
( ~ '$ki_accessible'(sK39,sK39)
| ~ '$ki_exists_in_world_$i'(X1_14,sK40)
| ~ '$ki_exists_in_world_$i'(X0_14,sK40)
| ~ '$ki_accessible'('$ki_local_world',X0_14)
| ~ '$ki_accessible'(X1_14,sK39)
| ~ '$ki_accessible'(X0_14,X1_14) ),
inference(global_subsumption_just,[status(thm)],[c_2958,c_128,c_2958]) ).
cnf(c_2961,plain,
( ~ '$ki_accessible'(X0_14,X1_14)
| ~ '$ki_accessible'(X1_14,sK39)
| ~ '$ki_accessible'('$ki_local_world',X0_14)
| ~ '$ki_exists_in_world_$i'(X0_14,sK40)
| ~ '$ki_exists_in_world_$i'(X1_14,sK40)
| ~ '$ki_accessible'(sK39,sK39) ),
inference(renaming,[status(thm)],[c_2960]) ).
cnf(c_3156,plain,
( ~ '$ki_accessible'(X0_14,X1_14)
| ~ '$ki_accessible'(X1_14,sK39)
| ~ '$ki_accessible'('$ki_local_world',X0_14)
| ~ '$ki_exists_in_world_$i'(X0_14,sK40)
| ~ '$ki_exists_in_world_$i'(X1_14,sK40) ),
inference(forward_subsumption_resolution,[status(thm)],[c_2961,c_2716]) ).
cnf(c_3168,plain,
( ~ '$ki_accessible'(X0_14,X0_14)
| ~ '$ki_accessible'(X0_14,sK39)
| ~ '$ki_accessible'('$ki_local_world',X0_14)
| ~ '$ki_exists_in_world_$i'(X0_14,sK40) ),
inference(factoring,[status(thm)],[c_3156]) ).
cnf(c_3169,plain,
( ~ '$ki_accessible'(X0_14,sK39)
| ~ '$ki_accessible'('$ki_local_world',X0_14)
| ~ '$ki_exists_in_world_$i'(X0_14,sK40) ),
inference(global_subsumption_just,[status(thm)],[c_3168,c_2716,c_3168]) ).
cnf(c_3179,plain,
( ~ '$ki_accessible'('$ki_local_world',sK39)
| ~ '$ki_accessible'(sK39,sK39) ),
inference(resolution,[status(thm)],[c_3169,c_2636]) ).
cnf(c_3180,plain,
~ '$ki_accessible'(sK39,sK39),
inference(global_subsumption_just,[status(thm)],[c_3179,c_130,c_3179]) ).
cnf(c_3186,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_3180,c_2716]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : LCL947_10 : TPTP v8.2.0. Released v8.2.0.
% 0.08/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n003.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu May 2 19:08:50 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 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
% 4.38/1.22 % SZS status Started for theBenchmark.p
% 4.38/1.22 % SZS status Theorem for theBenchmark.p
% 4.38/1.22
% 4.38/1.22 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 4.38/1.22
% 4.38/1.22 ------ iProver source info
% 4.38/1.22
% 4.38/1.22 git: date: 2024-05-02 19:28:25 +0000
% 4.38/1.22 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 4.38/1.22 git: non_committed_changes: false
% 4.38/1.22
% 4.38/1.22 ------ Parsing...
% 4.38/1.22 ------ Clausification by vclausify_rel & Parsing by iProver...
% 4.38/1.22
% 4.38/1.22 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 4.38/1.22
% 4.38/1.22 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 4.38/1.22 ------ Proving...
% 4.38/1.22 ------ Problem Properties
% 4.38/1.22
% 4.38/1.22
% 4.38/1.22 clauses 82
% 4.38/1.22 conjectures 4
% 4.38/1.22 EPR 9
% 4.38/1.22 Horn 34
% 4.38/1.22 unary 6
% 4.38/1.22 binary 3
% 4.38/1.22 lits 670
% 4.38/1.22 lits eq 0
% 4.38/1.22 fd_pure 0
% 4.38/1.22 fd_pseudo 0
% 4.38/1.22 fd_cond 0
% 4.38/1.22 fd_pseudo_cond 0
% 4.38/1.22 AC symbols 0
% 4.38/1.22
% 4.38/1.22 ------ Input Options Time Limit: Unbounded
% 4.38/1.22
% 4.38/1.22
% 4.38/1.22 ------
% 4.38/1.22 Current options:
% 4.38/1.22 ------
% 4.38/1.22
% 4.38/1.22
% 4.38/1.22
% 4.38/1.22
% 4.38/1.22 ------ Proving...
% 4.38/1.22
% 4.38/1.22
% 4.38/1.22 % SZS status Theorem for theBenchmark.p
% 4.38/1.22
% 4.38/1.22 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.38/1.22
% 4.38/1.22
%------------------------------------------------------------------------------