%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL969_9 : TPTP v9.3.1. Released v8.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n019.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:11 PM UTC 2026
% Result : CounterSatisfiable 0.10s 0.45s
% Output : Saturation 0.10s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_3ERROR: Could not build tree for root c_0_44ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
tcf(c_0_5,negated_conjecture,
! [X1: '$ki_world',X2: '$ki_world',X4: '$ki_world',X3: '$ki_world'] :
( ~ '$ki_accessible'(esk2_0,X3)
| ~ '$ki_accessible'(X3,X4)
| ~ '$ki_accessible'(esk6_0,X2)
| ~ '$ki_accessible'(esk6_0,X1)
| q(X4)
| '$ki_accessible'(X3,esk3_1(X3))
| q(X2)
| '$ki_accessible'(X1,esk7_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_6,plain,
! [X1: '$ki_world'] : '$ki_accessible'(X1,esk1_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_4]),
[final] ).
tcf(c_0_7,negated_conjecture,
! [X1: '$ki_world',X2: '$ki_world',X3: '$ki_world'] :
( ~ '$ki_accessible'(esk6_0,X3)
| ~ '$ki_accessible'(esk6_0,X2)
| ~ '$ki_accessible'(esk2_0,X1)
| '$ki_accessible'(X1,esk3_1(X1))
| '$ki_accessible'(X3,esk7_1(X3))
| q(X2)
| q(esk1_1(X1)) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]),
[final] ).
tcf(c_0_8,negated_conjecture,
! [X1: '$ki_world',X3: '$ki_world',X2: '$ki_world'] :
( ~ '$ki_accessible'(esk2_0,X2)
| ~ '$ki_accessible'(X2,X3)
| ~ '$ki_accessible'(esk8_0,X1)
| q(X3)
| '$ki_accessible'(X2,esk3_1(X2))
| p(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_9,negated_conjecture,
! [X1: '$ki_world',X2: '$ki_world',X3: '$ki_world'] :
( ~ '$ki_accessible'(esk4_0,X3)
| ~ '$ki_accessible'(esk6_0,X2)
| ~ '$ki_accessible'(esk6_0,X1)
| p(X3)
| q(X2)
| '$ki_accessible'(X1,esk7_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_10,negated_conjecture,
! [X1: '$ki_world',X2: '$ki_world'] :
( ~ '$ki_accessible'(esk6_0,X2)
| ~ '$ki_accessible'(esk6_0,X1)
| '$ki_accessible'(X2,esk7_1(X2))
| '$ki_accessible'(esk1_1(esk2_0),esk3_1(esk1_1(esk2_0)))
| q(X1)
| q(esk1_1(esk1_1(esk2_0))) ),
inference(spm,[status(thm)],[c_0_7,c_0_6]),
[final] ).
tcf(c_0_11,negated_conjecture,
! [X1: '$ki_world',X2: '$ki_world'] :
( ~ '$ki_accessible'(esk8_0,X2)
| ~ '$ki_accessible'(esk2_0,X1)
| '$ki_accessible'(X1,esk3_1(X1))
| p(X2)
| q(esk1_1(X1)) ),
inference(spm,[status(thm)],[c_0_8,c_0_6]),
[final] ).
tcf(c_0_12,negated_conjecture,
! [X2: '$ki_world',X1: '$ki_world'] :
( ~ '$ki_accessible'(esk2_0,X1)
| ~ '$ki_accessible'(X1,X2)
| q(X2)
| '$ki_accessible'(X1,esk3_1(X1))
| '$ki_accessible'(esk8_0,esk9_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_13,negated_conjecture,
! [X2: '$ki_world',X1: '$ki_world'] :
( ~ '$ki_accessible'(esk2_0,X1)
| ~ '$ki_accessible'(X1,X2)
| q(X2)
| '$ki_accessible'(X1,esk3_1(X1))
| '$ki_accessible'(esk6_0,esk8_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_14,negated_conjecture,
! [X2: '$ki_world',X1: '$ki_world'] :
( ~ '$ki_accessible'(esk2_0,X1)
| ~ '$ki_accessible'(X1,X2)
| q(X2)
| '$ki_accessible'(X1,esk3_1(X1))
| '$ki_accessible'('$ki_local_world',esk6_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_15,negated_conjecture,
! [X1: '$ki_world',X2: '$ki_world'] :
( ~ '$ki_accessible'(esk6_0,X2)
| ~ '$ki_accessible'(esk6_0,X1)
| '$ki_accessible'(X2,esk7_1(X2))
| p(esk1_1(esk4_0))
| q(X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_6]),
[final] ).
tcf(c_0_16,negated_conjecture,
! [X1: '$ki_world',X2: '$ki_world'] :
( ~ '$ki_accessible'(esk6_0,X2)
| ~ '$ki_accessible'(esk6_0,X1)
| '$ki_accessible'(esk2_0,esk5_0)
| q(X2)
| '$ki_accessible'(X1,esk7_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_17,negated_conjecture,
! [X1: '$ki_world',X2: '$ki_world'] :
( ~ '$ki_accessible'(esk6_0,X2)
| ~ '$ki_accessible'(esk6_0,X1)
| '$ki_accessible'(esk2_0,esk4_0)
| q(X2)
| '$ki_accessible'(X1,esk7_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_18,negated_conjecture,
! [X1: '$ki_world',X2: '$ki_world'] :
( ~ '$ki_accessible'(esk6_0,X2)
| ~ '$ki_accessible'(esk6_0,X1)
| '$ki_accessible'('$ki_local_world',esk2_0)
| q(X2)
| '$ki_accessible'(X1,esk7_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_19,negated_conjecture,
! [X1: '$ki_world',X2: '$ki_world'] :
( ~ '$ki_accessible'(esk4_0,X2)
| ~ '$ki_accessible'(esk8_0,X1)
| p(X2)
| p(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_20,negated_conjecture,
! [X1: '$ki_world'] :
( ~ '$ki_accessible'(esk6_0,X1)
| '$ki_accessible'(X1,esk7_1(X1))
| '$ki_accessible'(esk1_1(esk2_0),esk3_1(esk1_1(esk2_0)))
| q(esk1_1(esk6_0))
| q(esk1_1(esk1_1(esk2_0))) ),
inference(spm,[status(thm)],[c_0_10,c_0_6]),
[final] ).
tcf(c_0_21,negated_conjecture,
! [X1: '$ki_world'] :
( ~ '$ki_accessible'(esk8_0,X1)
| '$ki_accessible'(esk1_1(esk2_0),esk3_1(esk1_1(esk2_0)))
| p(X1)
| q(esk1_1(esk1_1(esk2_0))) ),
inference(spm,[status(thm)],[c_0_11,c_0_6]),
[final] ).
tcf(c_0_22,negated_conjecture,
! [X1: '$ki_world'] :
( ~ '$ki_accessible'(esk2_0,X1)
| '$ki_accessible'(X1,esk3_1(X1))
| '$ki_accessible'(esk8_0,esk9_0)
| q(esk1_1(X1)) ),
inference(spm,[status(thm)],[c_0_12,c_0_6]),
[final] ).
tcf(c_0_23,negated_conjecture,
! [X1: '$ki_world'] :
( ~ '$ki_accessible'(esk2_0,X1)
| '$ki_accessible'(X1,esk3_1(X1))
| '$ki_accessible'(esk6_0,esk8_0)
| q(esk1_1(X1)) ),
inference(spm,[status(thm)],[c_0_13,c_0_6]),
[final] ).
tcf(c_0_24,negated_conjecture,
! [X1: '$ki_world'] :
( ~ '$ki_accessible'(esk2_0,X1)
| '$ki_accessible'(X1,esk3_1(X1))
| '$ki_accessible'('$ki_local_world',esk6_0)
| q(esk1_1(X1)) ),
inference(spm,[status(thm)],[c_0_14,c_0_6]),
[final] ).
tcf(c_0_25,negated_conjecture,
! [X1: '$ki_world'] :
( ~ '$ki_accessible'(esk6_0,X1)
| '$ki_accessible'(X1,esk7_1(X1))
| p(esk1_1(esk4_0))
| q(esk1_1(esk6_0)) ),
inference(spm,[status(thm)],[c_0_15,c_0_6]),
[final] ).
tcf(c_0_26,negated_conjecture,
! [X1: '$ki_world'] :
( ~ '$ki_accessible'(esk6_0,X1)
| '$ki_accessible'(X1,esk7_1(X1))
| '$ki_accessible'(esk2_0,esk5_0)
| q(esk1_1(esk6_0)) ),
inference(spm,[status(thm)],[c_0_16,c_0_6]),
[final] ).
tcf(c_0_27,negated_conjecture,
! [X1: '$ki_world'] :
( ~ '$ki_accessible'(esk6_0,X1)
| '$ki_accessible'(X1,esk7_1(X1))
| '$ki_accessible'(esk2_0,esk4_0)
| q(esk1_1(esk6_0)) ),
inference(spm,[status(thm)],[c_0_17,c_0_6]),
[final] ).
tcf(c_0_28,negated_conjecture,
! [X1: '$ki_world'] :
( ~ '$ki_accessible'(esk6_0,X1)
| '$ki_accessible'(X1,esk7_1(X1))
| '$ki_accessible'('$ki_local_world',esk2_0)
| q(esk1_1(esk6_0)) ),
inference(spm,[status(thm)],[c_0_18,c_0_6]),
[final] ).
tcf(c_0_29,negated_conjecture,
( '$ki_accessible'(esk2_0,esk4_0)
| '$ki_accessible'(esk6_0,esk8_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_30,negated_conjecture,
( '$ki_accessible'(esk2_0,esk5_0)
| '$ki_accessible'(esk6_0,esk8_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_31,negated_conjecture,
( '$ki_accessible'('$ki_local_world',esk2_0)
| '$ki_accessible'(esk8_0,esk9_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_32,negated_conjecture,
( '$ki_accessible'('$ki_local_world',esk2_0)
| '$ki_accessible'(esk6_0,esk8_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_33,negated_conjecture,
( ~ q(esk5_0)
| '$ki_accessible'(esk6_0,esk8_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_34,negated_conjecture,
( '$ki_accessible'('$ki_local_world',esk2_0)
| '$ki_accessible'('$ki_local_world',esk6_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_35,negated_conjecture,
! [X1: '$ki_world'] :
( ~ '$ki_accessible'(esk8_0,X1)
| p(X1)
| p(esk1_1(esk4_0)) ),
inference(spm,[status(thm)],[c_0_19,c_0_6]),
[final] ).
tcf(c_0_36,negated_conjecture,
! [X1: '$ki_world'] :
( ~ '$ki_accessible'(esk4_0,X1)
| p(X1)
| '$ki_accessible'(esk8_0,esk9_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_37,negated_conjecture,
! [X1: '$ki_world'] :
( ~ '$ki_accessible'(esk4_0,X1)
| p(X1)
| '$ki_accessible'(esk6_0,esk8_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_38,negated_conjecture,
! [X1: '$ki_world'] :
( ~ '$ki_accessible'(esk8_0,X1)
| '$ki_accessible'(esk2_0,esk5_0)
| p(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_39,negated_conjecture,
! [X1: '$ki_world'] :
( ~ '$ki_accessible'(esk8_0,X1)
| '$ki_accessible'(esk2_0,esk4_0)
| p(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_40,negated_conjecture,
! [X1: '$ki_world'] :
( ~ '$ki_accessible'(esk4_0,X1)
| p(X1)
| '$ki_accessible'('$ki_local_world',esk6_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_41,negated_conjecture,
! [X1: '$ki_world'] :
( ~ '$ki_accessible'(esk8_0,X1)
| '$ki_accessible'('$ki_local_world',esk2_0)
| p(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_42,negated_conjecture,
( '$ki_accessible'(esk2_0,esk5_0)
| '$ki_accessible'(esk8_0,esk9_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_43,negated_conjecture,
( '$ki_accessible'(esk2_0,esk4_0)
| '$ki_accessible'(esk8_0,esk9_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_44,negated_conjecture,
( '$ki_accessible'(esk1_1(esk2_0),esk3_1(esk1_1(esk2_0)))
| '$ki_accessible'(esk1_1(esk6_0),esk7_1(esk1_1(esk6_0)))
| q(esk1_1(esk6_0))
| q(esk1_1(esk1_1(esk2_0))) ),
inference(spm,[status(thm)],[c_0_20,c_0_6]),
[final] ).
tcf(c_0_45,negated_conjecture,
( '$ki_accessible'(esk1_1(esk2_0),esk3_1(esk1_1(esk2_0)))
| p(esk1_1(esk8_0))
| q(esk1_1(esk1_1(esk2_0))) ),
inference(spm,[status(thm)],[c_0_21,c_0_6]),
[final] ).
tcf(c_0_46,negated_conjecture,
( '$ki_accessible'(esk8_0,esk9_0)
| '$ki_accessible'(esk1_1(esk2_0),esk3_1(esk1_1(esk2_0)))
| q(esk1_1(esk1_1(esk2_0))) ),
inference(spm,[status(thm)],[c_0_22,c_0_6]),
[final] ).
tcf(c_0_47,negated_conjecture,
( '$ki_accessible'(esk6_0,esk8_0)
| '$ki_accessible'(esk1_1(esk2_0),esk3_1(esk1_1(esk2_0)))
| q(esk1_1(esk1_1(esk2_0))) ),
inference(spm,[status(thm)],[c_0_23,c_0_6]),
[final] ).
tcf(c_0_48,negated_conjecture,
( '$ki_accessible'('$ki_local_world',esk6_0)
| '$ki_accessible'(esk1_1(esk2_0),esk3_1(esk1_1(esk2_0)))
| q(esk1_1(esk1_1(esk2_0))) ),
inference(spm,[status(thm)],[c_0_24,c_0_6]),
[final] ).
tcf(c_0_49,negated_conjecture,
( '$ki_accessible'(esk1_1(esk6_0),esk7_1(esk1_1(esk6_0)))
| p(esk1_1(esk4_0))
| q(esk1_1(esk6_0)) ),
inference(spm,[status(thm)],[c_0_25,c_0_6]),
[final] ).
tcf(c_0_50,negated_conjecture,
( '$ki_accessible'(esk2_0,esk5_0)
| '$ki_accessible'(esk1_1(esk6_0),esk7_1(esk1_1(esk6_0)))
| q(esk1_1(esk6_0)) ),
inference(spm,[status(thm)],[c_0_26,c_0_6]),
[final] ).
tcf(c_0_51,negated_conjecture,
( '$ki_accessible'(esk2_0,esk4_0)
| '$ki_accessible'(esk1_1(esk6_0),esk7_1(esk1_1(esk6_0)))
| q(esk1_1(esk6_0)) ),
inference(spm,[status(thm)],[c_0_27,c_0_6]),
[final] ).
tcf(c_0_52,negated_conjecture,
( '$ki_accessible'('$ki_local_world',esk2_0)
| '$ki_accessible'(esk1_1(esk6_0),esk7_1(esk1_1(esk6_0)))
| q(esk1_1(esk6_0)) ),
inference(spm,[status(thm)],[c_0_28,c_0_6]),
[final] ).
tcf(c_0_53,negated_conjecture,
( '$ki_accessible'(esk6_0,esk8_0)
| '$ki_accessible'(esk4_0,esk3_1(esk4_0))
| q(esk1_1(esk4_0)) ),
inference(spm,[status(thm)],[c_0_23,c_0_29]),
[final] ).
tcf(c_0_54,negated_conjecture,
( '$ki_accessible'(esk6_0,esk8_0)
| '$ki_accessible'(esk5_0,esk3_1(esk5_0))
| q(esk1_1(esk5_0)) ),
inference(spm,[status(thm)],[c_0_23,c_0_30]),
[final] ).
tcf(c_0_55,negated_conjecture,
! [X1: '$ki_world',X2: '$ki_world',X4: '$ki_world',X3: '$ki_world'] :
( ~ '$ki_accessible'(esk2_0,X3)
| ~ '$ki_accessible'(X3,X4)
| ~ p(esk3_1(X3))
| ~ '$ki_accessible'(esk6_0,X2)
| ~ '$ki_accessible'(esk6_0,X1)
| q(X4)
| q(X2)
| '$ki_accessible'(X1,esk7_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_56,negated_conjecture,
! [X1: '$ki_world',X2: '$ki_world',X4: '$ki_world',X3: '$ki_world'] :
( ~ '$ki_accessible'(esk2_0,X3)
| ~ '$ki_accessible'(X3,X4)
| ~ '$ki_accessible'(esk6_0,X2)
| ~ '$ki_accessible'(esk6_0,X1)
| ~ p(esk7_1(X1))
| q(X4)
| '$ki_accessible'(X3,esk3_1(X3))
| q(X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_57,negated_conjecture,
( ~ '$ki_accessible'(esk2_0,'$ki_local_world')
| '$ki_accessible'(esk8_0,esk9_0)
| '$ki_accessible'('$ki_local_world',esk3_1('$ki_local_world'))
| q(esk2_0) ),
inference(spm,[status(thm)],[c_0_12,c_0_31]),
[final] ).
tcf(c_0_58,negated_conjecture,
! [X1: '$ki_world',X2: '$ki_world',X4: '$ki_world',X3: '$ki_world'] :
( ~ '$ki_accessible'(esk2_0,X3)
| ~ '$ki_accessible'(X3,X4)
| ~ p(esk3_1(X3))
| ~ '$ki_accessible'(esk6_0,X2)
| ~ '$ki_accessible'(esk6_0,X1)
| ~ p(esk7_1(X1))
| q(X4)
| q(X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_59,negated_conjecture,
( ~ '$ki_accessible'(esk2_0,'$ki_local_world')
| '$ki_accessible'(esk6_0,esk8_0)
| '$ki_accessible'('$ki_local_world',esk3_1('$ki_local_world'))
| q(esk2_0) ),
inference(spm,[status(thm)],[c_0_13,c_0_32]),
[final] ).
tcf(c_0_60,negated_conjecture,
( ~ '$ki_accessible'(esk2_0,esk2_0)
| '$ki_accessible'(esk6_0,esk8_0)
| '$ki_accessible'(esk2_0,esk3_1(esk2_0)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_30]),c_0_33]),
[final] ).
tcf(c_0_61,negated_conjecture,
( ~ '$ki_accessible'(esk2_0,'$ki_local_world')
| '$ki_accessible'('$ki_local_world',esk6_0)
| '$ki_accessible'('$ki_local_world',esk3_1('$ki_local_world'))
| q(esk2_0) ),
inference(spm,[status(thm)],[c_0_14,c_0_34]),
[final] ).
tcf(c_0_62,negated_conjecture,
( p(esk1_1(esk4_0))
| p(esk1_1(esk8_0)) ),
inference(spm,[status(thm)],[c_0_35,c_0_6]),
[final] ).
tcf(c_0_63,negated_conjecture,
( '$ki_accessible'(esk8_0,esk9_0)
| p(esk1_1(esk4_0)) ),
inference(spm,[status(thm)],[c_0_36,c_0_6]),
[final] ).
tcf(c_0_64,negated_conjecture,
! [X2: '$ki_world',X1: '$ki_world'] :
( ~ '$ki_accessible'(esk2_0,X1)
| ~ '$ki_accessible'(X1,X2)
| ~ q(esk9_0)
| q(X2)
| '$ki_accessible'(X1,esk3_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_65,negated_conjecture,
! [X1: '$ki_world',X3: '$ki_world',X2: '$ki_world'] :
( ~ '$ki_accessible'(esk2_0,X2)
| ~ '$ki_accessible'(X2,X3)
| ~ p(esk3_1(X2))
| ~ '$ki_accessible'(esk8_0,X1)
| q(X3)
| p(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_66,negated_conjecture,
! [X1: '$ki_world',X2: '$ki_world',X3: '$ki_world'] :
( ~ '$ki_accessible'(esk4_0,X3)
| ~ '$ki_accessible'(esk6_0,X2)
| ~ '$ki_accessible'(esk6_0,X1)
| ~ p(esk7_1(X1))
| p(X3)
| q(X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_67,negated_conjecture,
! [X2: '$ki_world',X1: '$ki_world'] :
( ~ '$ki_accessible'(esk2_0,X1)
| ~ '$ki_accessible'(X1,X2)
| ~ p(esk3_1(X1))
| q(X2)
| '$ki_accessible'(esk8_0,esk9_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_68,negated_conjecture,
( '$ki_accessible'(esk6_0,esk8_0)
| p(esk1_1(esk4_0)) ),
inference(spm,[status(thm)],[c_0_37,c_0_6]),
[final] ).
tcf(c_0_69,negated_conjecture,
! [X2: '$ki_world',X1: '$ki_world'] :
( ~ '$ki_accessible'(esk2_0,X1)
| ~ '$ki_accessible'(X1,X2)
| ~ p(esk3_1(X1))
| q(X2)
| '$ki_accessible'(esk6_0,esk8_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_70,negated_conjecture,
( '$ki_accessible'(esk2_0,esk5_0)
| p(esk1_1(esk8_0)) ),
inference(spm,[status(thm)],[c_0_38,c_0_6]),
[final] ).
tcf(c_0_71,negated_conjecture,
( '$ki_accessible'(esk2_0,esk4_0)
| p(esk1_1(esk8_0)) ),
inference(spm,[status(thm)],[c_0_39,c_0_6]),
[final] ).
tcf(c_0_72,negated_conjecture,
( '$ki_accessible'('$ki_local_world',esk6_0)
| p(esk1_1(esk4_0)) ),
inference(spm,[status(thm)],[c_0_40,c_0_6]),
[final] ).
tcf(c_0_73,negated_conjecture,
! [X1: '$ki_world',X2: '$ki_world'] :
( ~ q(esk5_0)
| ~ '$ki_accessible'(esk6_0,X2)
| ~ '$ki_accessible'(esk6_0,X1)
| q(X2)
| '$ki_accessible'(X1,esk7_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_74,negated_conjecture,
! [X2: '$ki_world',X1: '$ki_world'] :
( ~ '$ki_accessible'(esk2_0,X1)
| ~ '$ki_accessible'(X1,X2)
| ~ p(esk3_1(X1))
| q(X2)
| '$ki_accessible'('$ki_local_world',esk6_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_75,negated_conjecture,
! [X1: '$ki_world',X2: '$ki_world'] :
( ~ '$ki_accessible'(esk6_0,X2)
| ~ '$ki_accessible'(esk6_0,X1)
| ~ p(esk7_1(X1))
| '$ki_accessible'(esk2_0,esk5_0)
| q(X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_76,negated_conjecture,
! [X1: '$ki_world',X2: '$ki_world'] :
( ~ '$ki_accessible'(esk6_0,X2)
| ~ '$ki_accessible'(esk6_0,X1)
| ~ p(esk7_1(X1))
| '$ki_accessible'(esk2_0,esk4_0)
| q(X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_77,negated_conjecture,
! [X2: '$ki_world',X1: '$ki_world'] :
( ~ '$ki_accessible'(esk2_0,X1)
| ~ '$ki_accessible'(X1,X2)
| ~ p(esk3_1(X1))
| ~ q(esk9_0)
| q(X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_78,negated_conjecture,
( '$ki_accessible'('$ki_local_world',esk2_0)
| p(esk1_1(esk8_0)) ),
inference(spm,[status(thm)],[c_0_41,c_0_6]),
[final] ).
tcf(c_0_79,negated_conjecture,
! [X1: '$ki_world',X2: '$ki_world'] :
( ~ '$ki_accessible'(esk6_0,X2)
| ~ '$ki_accessible'(esk6_0,X1)
| ~ p(esk7_1(X1))
| '$ki_accessible'('$ki_local_world',esk2_0)
| q(X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_80,negated_conjecture,
( '$ki_accessible'(esk2_0,esk5_0)
| p(esk9_0) ),
inference(spm,[status(thm)],[c_0_38,c_0_42]),
[final] ).
tcf(c_0_81,negated_conjecture,
! [X1: '$ki_world',X2: '$ki_world'] :
( ~ q(esk5_0)
| ~ '$ki_accessible'(esk6_0,X2)
| ~ '$ki_accessible'(esk6_0,X1)
| ~ p(esk7_1(X1))
| q(X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_82,negated_conjecture,
( '$ki_accessible'(esk2_0,esk4_0)
| p(esk9_0) ),
inference(spm,[status(thm)],[c_0_39,c_0_43]),
[final] ).
tcf(c_0_83,negated_conjecture,
( '$ki_accessible'(esk2_0,esk5_0)
| '$ki_accessible'('$ki_local_world',esk6_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_84,negated_conjecture,
! [X1: '$ki_world'] :
( ~ '$ki_accessible'(esk4_0,X1)
| ~ q(esk9_0)
| p(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_85,negated_conjecture,
! [X1: '$ki_world'] :
( ~ q(esk5_0)
| ~ '$ki_accessible'(esk8_0,X1)
| p(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_86,negated_conjecture,
( '$ki_accessible'(esk2_0,esk4_0)
| '$ki_accessible'('$ki_local_world',esk6_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_87,negated_conjecture,
( ~ q(esk5_0)
| '$ki_accessible'(esk8_0,esk9_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_88,negated_conjecture,
( ~ q(esk9_0)
| '$ki_accessible'(esk2_0,esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_89,negated_conjecture,
( ~ q(esk9_0)
| '$ki_accessible'(esk2_0,esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_90,negated_conjecture,
( ~ q(esk5_0)
| '$ki_accessible'('$ki_local_world',esk6_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_91,negated_conjecture,
( ~ q(esk5_0)
| ~ q(esk9_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_92,negated_conjecture,
( ~ q(esk9_0)
| '$ki_accessible'('$ki_local_world',esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL969_9 : TPTP v9.3.1. Released v8.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n019.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 01:15:04 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.10/0.45 % Version: 3.5.1
% 0.10/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.45 % Starting sh5l with 300s (1) cores
% 0.10/0.45 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1378768 completed with status 1
% 0.10/0.45 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.10/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.45 % No SInE strategy applied
% 0.10/0.45 % Search class: FGHNF-FFMM11-SFFFFFNN
% 0.10/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.10/0.45 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.10/0.45 % Starting new_bool_3 with 136s (1) cores
% 0.10/0.45 % Starting new_bool_1 with 136s (1) cores
% 0.10/0.45 % new_bool_1 with pid 1378777 completed with status 1
% 0.10/0.45 % Result found by new_bool_1
% 0.10/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.45 % No SInE strategy applied
% 0.10/0.45 % Search class: FGHNF-FFMM11-SFFFFFNN
% 0.10/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.10/0.45 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.10/0.45 % Starting new_bool_3 with 136s (1) cores
% 0.10/0.45 % Starting new_bool_1 with 136s (1) cores
% 0.10/0.45 % Preprocessing time : 0.001 s
% 0.10/0.45 % Presaturation interreduction done
% 0.10/0.45
% 0.10/0.45 % No proof found!
% 0.10/0.45 % SZS status CounterSatisfiable
% 0.10/0.45 % SZS output start Saturation
% See solution above
% 0.10/0.45 % Parsed axioms : 7
% 0.10/0.45 % Removed by relevancy pruning/SinE : 0
% 0.10/0.45 % Initial clauses : 55
% 0.10/0.45 % Removed in clause preprocessing : 5
% 0.10/0.45 % Initial clauses in saturation : 50
% 0.10/0.45 % Processed clauses : 240
% 0.10/0.45 % ...of these trivial : 0
% 0.10/0.45 % ...subsumed : 102
% 0.10/0.45 % ...remaining for further processing : 138
% 0.10/0.45 % Other redundant clauses eliminated : 0
% 0.10/0.45 % Clauses deleted for lack of memory : 0
% 0.10/0.45 % Backward-subsumed : 0
% 0.10/0.45 % Backward-rewritten : 0
% 0.10/0.45 % Generated clauses : 140
% 0.10/0.45 % ...of the previous two non-redundant : 140
% 0.10/0.45 % ...aggressively subsumed : 0
% 0.10/0.45 % Contextual simplify-reflections : 1
% 0.10/0.45 % Paramodulations : 140
% 0.10/0.45 % Factorizations : 0
% 0.10/0.45 % NegExts : 0
% 0.10/0.45 % Equation resolutions : 0
% 0.10/0.45 % Disequality decompositions : 0
% 0.10/0.45 % Total rewrite steps : 25
% 0.10/0.45 % ...of those cached : 24
% 0.10/0.45 % Propositional unsat checks : 0
% 0.10/0.45 % Propositional check models : 0
% 0.10/0.45 % Propositional check unsatisfiable : 0
% 0.10/0.45 % Propositional clauses : 0
% 0.10/0.45 % Propositional clauses after purity: 0
% 0.10/0.45 % Propositional unsat core size : 0
% 0.10/0.45 % Propositional preprocessing time : 0.000
% 0.10/0.45 % Propositional encoding time : 0.000
% 0.10/0.45 % Propositional solver time : 0.000
% 0.10/0.45 % Success case prop preproc time : 0.000
% 0.10/0.45 % Success case prop encoding time : 0.000
% 0.10/0.45 % Success case prop solver time : 0.000
% 0.10/0.45 % Current number of processed clauses : 88
% 0.10/0.45 % Positive orientable unit clauses : 1
% 0.10/0.45 % Positive unorientable unit clauses: 0
% 0.10/0.45 % Negative unit clauses : 0
% 0.10/0.45 % Non-unit-clauses : 87
% 0.10/0.45 % Current number of unprocessed clauses: 0
% 0.10/0.45 % ...number of literals in the above : 0
% 0.10/0.45 % Current number of archived formulas : 0
% 0.10/0.45 % Current number of archived clauses : 50
% 0.10/0.45 % Clause-clause subsumption calls (NU) : 1241
% 0.10/0.45 % Rec. Clause-clause subsumption calls : 216
% 0.10/0.45 % Non-unit clause-clause subsumptions : 103
% 0.10/0.45 % Unit Clause-clause subsumption calls : 15
% 0.10/0.45 % Rewrite failures with RHS unbound : 0
% 0.10/0.45 % BW rewrite match attempts : 0
% 0.10/0.45 % BW rewrite match successes : 0
% 0.10/0.45 % Condensation attempts : 0
% 0.10/0.45 % Condensation successes : 0
% 0.10/0.45 % Termbank termtop insertions : 7187
% 0.10/0.45 % Search garbage collected termcells : 390
% 0.10/0.45
% 0.10/0.45 % -------------------------------------------------
% 0.10/0.45 % User time : 0.010 s
% 0.10/0.45 % System time : 0.001 s
% 0.10/0.45 % Total time : 0.011 s
% 0.10/0.45 % Maximum resident set size: 3632 pages
% 0.10/0.45
% 0.10/0.45 % -------------------------------------------------
% 0.10/0.45 % User time : 0.046 s
% 0.10/0.45 % System time : 0.012 s
% 0.10/0.45 % Total time : 0.057 s
% 0.10/0.45 % Maximum resident set size: 4608 pages
% 0.10/0.45 % E exiting
%------------------------------------------------------------------------------