%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL950_17 : TPTP v9.3.1. Released v8.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n014.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 01:18:08 PM UTC 2026
% Result : Theorem 0.16s 0.65s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 32 ( 13 unt; 0 typ; 0 def)
% Number of atoms : 228 ( 0 equ)
% Maximal formula atoms : 56 ( 7 avg)
% Number of connectives : 280 ( 84 ~; 89 |; 37 &)
% ( 1 <=>; 69 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 9 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 9 con; 0-5 aty)
% Number of variables : 145 ( 0 sgn 139 !; 6 ?; 98 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
'$ki_world': $tType ).
tff(decl_23,type,
'$ki_local_world': '$ki_world' ).
tff(decl_24,type,
'$ki_accessible': ( '$ki_world' * '$ki_world' ) > $o ).
tff(decl_25,type,
intersect: ( $i * ( $i * '$ki_world' ) ) > $o ).
tff(decl_26,type,
member: ( $i * ( $i * '$ki_world' ) ) > $o ).
tff(decl_27,type,
'$ki_exists_in_world_$i': ( $i * '$ki_world' ) > $o ).
tff(decl_28,type,
epred1_3: ( $i * ( '$ki_world' * $i ) ) > $o ).
tff(decl_29,type,
esk1_0: '$ki_world' ).
tff(decl_30,type,
esk2_0: $i ).
tff(decl_31,type,
esk3_0: '$ki_world' ).
tff(decl_32,type,
esk4_0: $i ).
tff(decl_33,type,
esk5_0: '$ki_world' ).
tff(decl_34,type,
esk6_0: $i ).
tff(decl_35,type,
esk7_0: '$ki_world' ).
tff(decl_36,type,
esk8_0: '$ki_world' ).
tff(decl_37,type,
esk9_5: ( '$ki_world' * ( $i * ( '$ki_world' * ( $i * '$ki_world' ) ) ) ) > '$ki_world' ).
tff(decl_39,type,
esk11_4: ( '$ki_world' * ( $i * ( '$ki_world' * $i ) ) ) > '$ki_world' ).
tff(decl_40,type,
esk12_4: ( '$ki_world' * ( $i * ( '$ki_world' * $i ) ) ) > $i ).
tff(decl_41,type,
esk13_5: ( $i * ( '$ki_world' * ( $i * ( '$ki_world' * $i ) ) ) ) > '$ki_world' ).
tff(decl_42,type,
esk14_5: ( $i * ( '$ki_world' * ( $i * ( '$ki_world' * $i ) ) ) ) > '$ki_world' ).
tff(intersect_defn,axiom,
! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ! [X4] :
( '$ki_exists_in_world_$i'(X1,X4)
=> ! [X5: '$ki_world'] :
( '$ki_accessible'(X1,X5)
=> ! [X6] :
( '$ki_exists_in_world_$i'(X5,X6)
=> ( ! [X7: '$ki_world'] :
( '$ki_accessible'(X5,X7)
=> ( ? [X9] :
( ! [X8: '$ki_world'] :
( '$ki_accessible'(X7,X8)
=> member(X8,X9,X6) )
& ! [X8: '$ki_world'] :
( '$ki_accessible'(X7,X8)
=> member(X8,X9,X4) )
& '$ki_exists_in_world_$i'(X7,X9) )
=> ! [X8: '$ki_world'] :
( '$ki_accessible'(X7,X8)
=> intersect(X8,X4,X6) ) ) )
& ! [X7: '$ki_world'] :
( '$ki_accessible'(X5,X7)
=> ( ! [X8: '$ki_world'] :
( '$ki_accessible'(X7,X8)
=> intersect(X8,X4,X6) )
=> ? [X9] :
( ! [X8: '$ki_world'] :
( '$ki_accessible'(X7,X8)
=> member(X8,X9,X6) )
& ! [X8: '$ki_world'] :
( '$ki_accessible'(X7,X8)
=> member(X8,X9,X4) )
& '$ki_exists_in_world_$i'(X7,X9) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersect_defn) ).
tff('$ki_exists_in_world_$i_const',axiom,
! [X1: '$ki_world',X3] : '$ki_exists_in_world_$i'(X1,X3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','$ki_exists_in_world_$i_const') ).
tff(mrel_universal,axiom,
! [X1: '$ki_world',X2: '$ki_world'] : '$ki_accessible'(X1,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mrel_universal) ).
tff(verify,conjecture,
! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ! [X4] :
( '$ki_exists_in_world_$i'(X1,X4)
=> ! [X5: '$ki_world'] :
( '$ki_accessible'(X1,X5)
=> ! [X6] :
( '$ki_exists_in_world_$i'(X5,X6)
=> ! [X7: '$ki_world'] :
( '$ki_accessible'(X5,X7)
=> ! [X9] :
( '$ki_exists_in_world_$i'(X7,X9)
=> ! [X8: '$ki_world'] :
( '$ki_accessible'(X7,X8)
=> ( ( ! [X10: '$ki_world'] :
( '$ki_accessible'(X8,X10)
=> member(X10,X4,X9) )
& ! [X10: '$ki_world'] :
( '$ki_accessible'(X8,X10)
=> member(X10,X4,X6) ) )
=> ! [X10: '$ki_world'] :
( '$ki_accessible'(X8,X10)
=> intersect(X10,X6,X9) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',verify) ).
tff(symmetry_of_intersect,axiom,
! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ! [X4] :
( '$ki_exists_in_world_$i'(X1,X4)
=> ! [X5: '$ki_world'] :
( '$ki_accessible'(X1,X5)
=> ! [X6] :
( '$ki_exists_in_world_$i'(X5,X6)
=> ! [X7: '$ki_world'] :
( '$ki_accessible'(X5,X7)
=> ( ! [X8: '$ki_world'] :
( '$ki_accessible'(X7,X8)
=> intersect(X8,X4,X6) )
=> ! [X8: '$ki_world'] :
( '$ki_accessible'(X7,X8)
=> intersect(X8,X6,X4) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_of_intersect) ).
tff(c_0_5,plain,
! [X4,X5: '$ki_world',X6] :
( epred1_3(X6,X5,X4)
<=> ( ! [X7: '$ki_world'] :
( '$ki_accessible'(X5,X7)
=> ( ? [X9] :
( ! [X8: '$ki_world'] :
( '$ki_accessible'(X7,X8)
=> member(X8,X9,X6) )
& ! [X8: '$ki_world'] :
( '$ki_accessible'(X7,X8)
=> member(X8,X9,X4) )
& '$ki_exists_in_world_$i'(X7,X9) )
=> ! [X8: '$ki_world'] :
( '$ki_accessible'(X7,X8)
=> intersect(X8,X4,X6) ) ) )
& ! [X7: '$ki_world'] :
( '$ki_accessible'(X5,X7)
=> ( ! [X8: '$ki_world'] :
( '$ki_accessible'(X7,X8)
=> intersect(X8,X4,X6) )
=> ? [X9] :
( ! [X8: '$ki_world'] :
( '$ki_accessible'(X7,X8)
=> member(X8,X9,X6) )
& ! [X8: '$ki_world'] :
( '$ki_accessible'(X7,X8)
=> member(X8,X9,X4) )
& '$ki_exists_in_world_$i'(X7,X9) ) ) ) ) ),
introduced(definition) ).
tff(c_0_6,axiom,
! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ! [X4] :
( '$ki_exists_in_world_$i'(X1,X4)
=> ! [X5: '$ki_world'] :
( '$ki_accessible'(X1,X5)
=> ! [X6] :
( '$ki_exists_in_world_$i'(X5,X6)
=> epred1_3(X6,X5,X4) ) ) ) ),
inference(apply_def,[status(thm)],[intersect_defn,c_0_5]) ).
tff(c_0_7,plain,
! [X4,X5: '$ki_world',X6] :
( epred1_3(X6,X5,X4)
=> ( ! [X7: '$ki_world'] :
( '$ki_accessible'(X5,X7)
=> ( ? [X9] :
( ! [X8: '$ki_world'] :
( '$ki_accessible'(X7,X8)
=> member(X8,X9,X6) )
& ! [X8: '$ki_world'] :
( '$ki_accessible'(X7,X8)
=> member(X8,X9,X4) )
& '$ki_exists_in_world_$i'(X7,X9) )
=> ! [X8: '$ki_world'] :
( '$ki_accessible'(X7,X8)
=> intersect(X8,X4,X6) ) ) )
& ! [X7: '$ki_world'] :
( '$ki_accessible'(X5,X7)
=> ( ! [X8: '$ki_world'] :
( '$ki_accessible'(X7,X8)
=> intersect(X8,X4,X6) )
=> ? [X9] :
( ! [X8: '$ki_world'] :
( '$ki_accessible'(X7,X8)
=> member(X8,X9,X6) )
& ! [X8: '$ki_world'] :
( '$ki_accessible'(X7,X8)
=> member(X8,X9,X4) )
& '$ki_exists_in_world_$i'(X7,X9) ) ) ) ) ),
inference(split_equiv,[status(thm)],[c_0_5]) ).
tff(c_0_8,plain,
! [X21: '$ki_world',X22,X23: '$ki_world',X24] :
( epred1_3(X24,X23,X22)
| ~ '$ki_exists_in_world_$i'(X23,X24)
| ~ '$ki_accessible'(X21,X23)
| ~ '$ki_exists_in_world_$i'(X21,X22)
| ~ '$ki_accessible'('$ki_local_world',X21) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
tff(c_0_9,plain,
! [X34: '$ki_world',X35] : '$ki_exists_in_world_$i'(X34,X35),
inference(variable_rename,[status(thm)],['$ki_exists_in_world_$i_const']) ).
tff(c_0_10,plain,
! [X32: '$ki_world',X33: '$ki_world'] : '$ki_accessible'(X32,X33),
inference(variable_rename,[status(thm)],[mrel_universal]) ).
tff(c_0_11,negated_conjecture,
~ ! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ! [X4] :
( '$ki_exists_in_world_$i'(X1,X4)
=> ! [X5: '$ki_world'] :
( '$ki_accessible'(X1,X5)
=> ! [X6] :
( '$ki_exists_in_world_$i'(X5,X6)
=> ! [X7: '$ki_world'] :
( '$ki_accessible'(X5,X7)
=> ! [X9] :
( '$ki_exists_in_world_$i'(X7,X9)
=> ! [X8: '$ki_world'] :
( '$ki_accessible'(X7,X8)
=> ( ( ! [X10: '$ki_world'] :
( '$ki_accessible'(X8,X10)
=> member(X10,X4,X9) )
& ! [X10: '$ki_world'] :
( '$ki_accessible'(X8,X10)
=> member(X10,X4,X6) ) )
=> ! [X10: '$ki_world'] :
( '$ki_accessible'(X8,X10)
=> intersect(X10,X6,X9) ) ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[verify]) ).
tff(c_0_12,plain,
! [X38,X39: '$ki_world',X40,X41: '$ki_world',X44: '$ki_world',X45: '$ki_world',X46: '$ki_world',X47,X50: '$ki_world'] :
( ( ~ epred1_3(X40,X39,X38)
| ~ '$ki_accessible'(X39,X46)
| intersect(X50,X38,X40)
| ~ '$ki_accessible'(X46,X50)
| ~ '$ki_exists_in_world_$i'(X46,X47)
| ~ member(esk13_5(X38,X39,X40,X46,X47),X47,X38)
| ~ member(esk14_5(X38,X39,X40,X46,X47),X47,X40) )
& ( ~ epred1_3(X40,X39,X38)
| ~ '$ki_accessible'(X39,X46)
| intersect(X50,X38,X40)
| ~ '$ki_accessible'(X46,X50)
| ~ '$ki_exists_in_world_$i'(X46,X47)
| ~ member(esk13_5(X38,X39,X40,X46,X47),X47,X38)
| '$ki_accessible'(X46,esk14_5(X38,X39,X40,X46,X47)) )
& ( ~ epred1_3(X40,X39,X38)
| ~ '$ki_accessible'(X39,X46)
| intersect(X50,X38,X40)
| ~ '$ki_accessible'(X46,X50)
| ~ '$ki_exists_in_world_$i'(X46,X47)
| '$ki_accessible'(X46,esk13_5(X38,X39,X40,X46,X47))
| ~ member(esk14_5(X38,X39,X40,X46,X47),X47,X40) )
& ( ~ epred1_3(X40,X39,X38)
| ~ '$ki_accessible'(X39,X46)
| intersect(X50,X38,X40)
| ~ '$ki_accessible'(X46,X50)
| ~ '$ki_exists_in_world_$i'(X46,X47)
| '$ki_accessible'(X46,esk13_5(X38,X39,X40,X46,X47))
| '$ki_accessible'(X46,esk14_5(X38,X39,X40,X46,X47)) )
& ( ~ epred1_3(X40,X39,X38)
| ~ '$ki_accessible'(X39,X41)
| ~ intersect(esk11_4(X38,X39,X40,X41),X38,X40)
| member(X45,esk12_4(X38,X39,X40,X41),X40)
| ~ '$ki_accessible'(X41,X45) )
& ( ~ epred1_3(X40,X39,X38)
| ~ '$ki_accessible'(X39,X41)
| ~ intersect(esk11_4(X38,X39,X40,X41),X38,X40)
| member(X44,esk12_4(X38,X39,X40,X41),X38)
| ~ '$ki_accessible'(X41,X44) )
& ( ~ epred1_3(X40,X39,X38)
| ~ '$ki_accessible'(X39,X41)
| ~ intersect(esk11_4(X38,X39,X40,X41),X38,X40)
| '$ki_exists_in_world_$i'(X41,esk12_4(X38,X39,X40,X41)) )
& ( ~ epred1_3(X40,X39,X38)
| ~ '$ki_accessible'(X39,X41)
| '$ki_accessible'(X41,esk11_4(X38,X39,X40,X41))
| member(X45,esk12_4(X38,X39,X40,X41),X40)
| ~ '$ki_accessible'(X41,X45) )
& ( ~ epred1_3(X40,X39,X38)
| ~ '$ki_accessible'(X39,X41)
| '$ki_accessible'(X41,esk11_4(X38,X39,X40,X41))
| member(X44,esk12_4(X38,X39,X40,X41),X38)
| ~ '$ki_accessible'(X41,X44) )
& ( ~ epred1_3(X40,X39,X38)
| ~ '$ki_accessible'(X39,X41)
| '$ki_accessible'(X41,esk11_4(X38,X39,X40,X41))
| '$ki_exists_in_world_$i'(X41,esk12_4(X38,X39,X40,X41)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])])])]) ).
tcf(c_0_13,plain,
! [X1: '$ki_world',X2: '$ki_world',X3,X4] :
( ~ '$ki_exists_in_world_$i'(X2,X4)
| ~ '$ki_accessible'(X1,X2)
| ~ '$ki_exists_in_world_$i'(X1,X3)
| ~ '$ki_accessible'('$ki_local_world',X1)
| epred1_3(X4,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
tcf(c_0_14,plain,
! [X1: '$ki_world',X3] : '$ki_exists_in_world_$i'(X1,X3),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
tcf(c_0_15,plain,
! [X1: '$ki_world',X2: '$ki_world'] : '$ki_accessible'(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
tff(c_0_16,negated_conjecture,
! [X18: '$ki_world',X19: '$ki_world'] :
( ~ intersect(esk8_0,esk4_0,esk6_0)
& '$ki_accessible'(esk7_0,esk8_0)
& ( member(X19,esk2_0,esk6_0)
| ~ '$ki_accessible'(esk7_0,X19) )
& ( member(X18,esk2_0,esk4_0)
| ~ '$ki_accessible'(esk7_0,X18) )
& '$ki_accessible'(esk5_0,esk7_0)
& '$ki_exists_in_world_$i'(esk5_0,esk6_0)
& '$ki_accessible'(esk3_0,esk5_0)
& '$ki_exists_in_world_$i'(esk3_0,esk4_0)
& '$ki_accessible'(esk1_0,esk3_0)
& '$ki_exists_in_world_$i'(esk1_0,esk2_0)
& '$ki_accessible'('$ki_local_world',esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])])]) ).
tcf(c_0_17,plain,
! [X2: '$ki_world',X1: '$ki_world',X6,X5: '$ki_world',X4,X3] :
( ~ epred1_3(X4,X1,X3)
| ~ '$ki_accessible'(X1,X2)
| ~ '$ki_accessible'(X2,X5)
| ~ '$ki_exists_in_world_$i'(X2,X6)
| ~ member(esk13_5(X3,X1,X4,X2,X6),X6,X3)
| ~ member(esk14_5(X3,X1,X4,X2,X6),X6,X4)
| intersect(X5,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
tcf(c_0_18,plain,
! [X1: '$ki_world',X3,X4] : epred1_3(X3,X1,X4),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14]),c_0_14]),c_0_15]),c_0_15])]) ).
tcf(c_0_19,negated_conjecture,
! [X1: '$ki_world'] :
( ~ '$ki_accessible'(esk7_0,X1)
| member(X1,esk2_0,esk6_0) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
tff(c_0_20,plain,
! [X25: '$ki_world',X26,X27: '$ki_world',X28,X29: '$ki_world',X31: '$ki_world'] :
( ( ~ '$ki_accessible'('$ki_local_world',X25)
| ~ '$ki_exists_in_world_$i'(X25,X26)
| ~ '$ki_accessible'(X25,X27)
| ~ '$ki_exists_in_world_$i'(X27,X28)
| ~ '$ki_accessible'(X27,X29)
| intersect(X31,X28,X26)
| ~ '$ki_accessible'(X29,X31)
| ~ intersect(esk9_5(X25,X26,X27,X28,X29),X26,X28) )
& ( ~ '$ki_accessible'('$ki_local_world',X25)
| ~ '$ki_exists_in_world_$i'(X25,X26)
| ~ '$ki_accessible'(X25,X27)
| ~ '$ki_exists_in_world_$i'(X27,X28)
| ~ '$ki_accessible'(X27,X29)
| intersect(X31,X28,X26)
| ~ '$ki_accessible'(X29,X31)
| '$ki_accessible'(X29,esk9_5(X25,X26,X27,X28,X29)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[symmetry_of_intersect])])])])])]) ).
tcf(c_0_21,plain,
! [X1: '$ki_world',X2: '$ki_world',X3,X6,X5: '$ki_world',X4] :
( ~ member(esk14_5(X3,X2,X4,X5,X6),X6,X4)
| ~ member(esk13_5(X3,X2,X4,X5,X6),X6,X3)
| intersect(X1,X3,X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_14]),c_0_15]),c_0_15]),c_0_18])]) ).
tcf(c_0_22,negated_conjecture,
! [X1: '$ki_world'] : member(X1,esk2_0,esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_15])]) ).
tcf(c_0_23,negated_conjecture,
! [X1: '$ki_world'] :
( ~ '$ki_accessible'(esk7_0,X1)
| member(X1,esk2_0,esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
tcf(c_0_24,plain,
! [X7: '$ki_world',X5: '$ki_world',X4,X3,X2: '$ki_world',X1: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X1)
| ~ '$ki_exists_in_world_$i'(X1,X3)
| ~ '$ki_accessible'(X1,X2)
| ~ '$ki_exists_in_world_$i'(X2,X4)
| ~ '$ki_accessible'(X2,X5)
| ~ '$ki_accessible'(X5,X7)
| ~ intersect(esk9_5(X1,X3,X2,X4,X5),X3,X4)
| intersect(X7,X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
tcf(c_0_25,negated_conjecture,
! [X1: '$ki_world',X2: '$ki_world',X5: '$ki_world',X3] :
( ~ member(esk14_5(esk6_0,X2,X3,X5,esk2_0),esk2_0,X3)
| intersect(X1,esk6_0,X3) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
tcf(c_0_26,negated_conjecture,
! [X1: '$ki_world'] : member(X1,esk2_0,esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_15])]) ).
tcf(c_0_27,plain,
! [X1: '$ki_world',X2: '$ki_world',X7: '$ki_world',X5: '$ki_world',X4,X3] :
( ~ intersect(esk9_5(X2,X4,X5,X3,X7),X4,X3)
| intersect(X1,X3,X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_14]),c_0_14]),c_0_15]),c_0_15]),c_0_15]),c_0_15])]) ).
tcf(c_0_28,negated_conjecture,
! [X1: '$ki_world'] : intersect(X1,esk6_0,esk4_0),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
tcf(c_0_29,negated_conjecture,
~ intersect(esk8_0,esk4_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
tcf(c_0_30,negated_conjecture,
! [X1: '$ki_world'] : intersect(X1,esk4_0,esk6_0),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL950_17 : TPTP v9.3.1. Released v8.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.58 % Computer : n014.cluster.edu
% 0.12/0.58 % Model : x86_64 x86_64
% 0.12/0.58 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.58 % Memory : 8046.5625MB
% 0.12/0.58 % OS : Linux 6.8.0-71-generic
% 0.12/0.58 % CPULimit : 300
% 0.12/0.58 % WCLimit : 300
% 0.12/0.58 % DateTime : Mon Sep 21 01:13:50 UTC 2026
% 0.12/0.58 % CPUTime :
% 0.12/0.58 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.62 Running first-order theorem proving
% 0.12/0.62 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/0.65 % Version: 3.5.1
% 0.16/0.65 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.65 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.65 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.65 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.65 % Starting sh5l with 300s (1) cores
% 0.16/0.65 % new_bool_1 with pid 2838934 completed with status 0
% 0.16/0.65 % Result found by new_bool_1
% 0.16/0.65 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.65 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.65 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.65 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.65 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/0.65 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.65 % Search class: FGUNS-FFMM33-SFFFFFNN
% 0.16/0.65 % partial match(1): FGUSS-FFMM33-SFFFFFNN
% 0.16/0.65 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.65 % Starting SubtermCWHack with 31s (1) cores
% 0.16/0.65 % SubtermCWHack with pid 2838936 completed with status 0
% 0.16/0.65 % Result found by SubtermCWHack
% 0.16/0.65 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.65 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.65 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.65 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.65 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/0.65 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.65 % Search class: FGUNS-FFMM33-SFFFFFNN
% 0.16/0.65 % partial match(1): FGUSS-FFMM33-SFFFFFNN
% 0.16/0.65 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.65 % Starting SubtermCWHack with 31s (1) cores
% 0.16/0.65 % Preprocessing time : 0.002 s
% 0.16/0.65
% 0.16/0.65 % Proof found!
% 0.16/0.65 % SZS status Theorem
% 0.16/0.65 % SZS output start CNFRefutation
% See solution above
% 0.16/0.65 % Parsed axioms : 12
% 0.16/0.65 % Removed by relevancy pruning/SinE : 6
% 0.16/0.65 % Initial clauses : 27
% 0.16/0.65 % Removed in clause preprocessing : 0
% 0.16/0.65 % Initial clauses in saturation : 27
% 0.16/0.65 % Processed clauses : 31
% 0.16/0.65 % ...of these trivial : 9
% 0.16/0.65 % ...subsumed : 0
% 0.16/0.65 % ...remaining for further processing : 22
% 0.16/0.65 % Other redundant clauses eliminated : 0
% 0.16/0.65 % Clauses deleted for lack of memory : 0
% 0.16/0.65 % Backward-subsumed : 0
% 0.16/0.65 % Backward-rewritten : 9
% 0.16/0.65 % Generated clauses : 13
% 0.16/0.65 % ...of the previous two non-redundant : 9
% 0.16/0.65 % ...aggressively subsumed : 0
% 0.16/0.65 % Contextual simplify-reflections : 0
% 0.16/0.65 % Paramodulations : 13
% 0.16/0.65 % Factorizations : 0
% 0.16/0.65 % NegExts : 0
% 0.16/0.65 % Equation resolutions : 0
% 0.16/0.65 % Disequality decompositions : 0
% 0.16/0.65 % Total rewrite steps : 71
% 0.16/0.65 % ...of those cached : 34
% 0.16/0.65 % Propositional unsat checks : 0
% 0.16/0.65 % Propositional check models : 0
% 0.16/0.65 % Propositional check unsatisfiable : 0
% 0.16/0.65 % Propositional clauses : 0
% 0.16/0.65 % Propositional clauses after purity: 0
% 0.16/0.65 % Propositional unsat core size : 0
% 0.16/0.65 % Propositional preprocessing time : 0.000
% 0.16/0.65 % Propositional encoding time : 0.000
% 0.16/0.65 % Propositional solver time : 0.000
% 0.16/0.65 % Success case prop preproc time : 0.000
% 0.16/0.65 % Success case prop encoding time : 0.000
% 0.16/0.65 % Success case prop solver time : 0.000
% 0.16/0.65 % Current number of processed clauses : 13
% 0.16/0.65 % Positive orientable unit clauses : 8
% 0.16/0.65 % Positive unorientable unit clauses: 0
% 0.16/0.65 % Negative unit clauses : 0
% 0.16/0.65 % Non-unit-clauses : 5
% 0.16/0.65 % Current number of unprocessed clauses: 5
% 0.16/0.65 % ...number of literals in the above : 6
% 0.16/0.65 % Current number of archived formulas : 0
% 0.16/0.65 % Current number of archived clauses : 9
% 0.16/0.65 % Clause-clause subsumption calls (NU) : 6
% 0.16/0.65 % Rec. Clause-clause subsumption calls : 6
% 0.16/0.65 % Non-unit clause-clause subsumptions : 0
% 0.16/0.65 % Unit Clause-clause subsumption calls : 9
% 0.16/0.65 % Rewrite failures with RHS unbound : 0
% 0.16/0.65 % BW rewrite match attempts : 13
% 0.16/0.65 % BW rewrite match successes : 9
% 0.16/0.65 % Condensation attempts : 0
% 0.16/0.65 % Condensation successes : 0
% 0.16/0.65 % Termbank termtop insertions : 2357
% 0.16/0.65 % Search garbage collected termcells : 649
% 0.16/0.65
% 0.16/0.65 % -------------------------------------------------
% 0.16/0.65 % User time : 0.003 s
% 0.16/0.65 % System time : 0.004 s
% 0.16/0.65 % Total time : 0.007 s
% 0.16/0.65 % Maximum resident set size: 3644 pages
% 0.16/0.65
% 0.16/0.65 % -------------------------------------------------
% 0.16/0.65 % User time : 0.004 s
% 0.16/0.65 % System time : 0.009 s
% 0.16/0.65 % Total time : 0.013 s
% 0.16/0.65 % Maximum resident set size: 4864 pages
% 0.16/0.65 % E exiting
%------------------------------------------------------------------------------