%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NLP266_23 : 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 : n007.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:36:01 PM UTC 2026
% Result : Theorem 0.10s 0.43s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 33 ( 11 unt; 0 typ; 0 def)
% Number of atoms : 206 ( 0 equ)
% Maximal formula atoms : 57 ( 6 avg)
% Number of connectives : 295 ( 122 ~; 119 |; 33 &)
% ( 0 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 8 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-4 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-4 aty)
% Number of variables : 107 ( 0 sgn 96 !; 11 ?; 45 :)
% 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,
u: $i ).
tff(decl_26,type,
one: $i ).
tff(decl_27,type,
number: ( $i * ( $i * '$ki_world' ) ) > $o ).
tff(decl_28,type,
string: ( $i * '$ki_world' ) > $o ).
tff(decl_29,type,
in: ( $i * ( $i * ( $i * '$ki_world' ) ) ) > $o ).
tff(decl_30,type,
do: ( $i * ( $i * ( $i * '$ki_world' ) ) ) > $o ).
tff(decl_31,type,
entry_box: ( $i * '$ki_world' ) > $o ).
tff(decl_32,type,
userid: ( $i * ( $i * '$ki_world' ) ) > $o ).
tff(decl_33,type,
'$ki_exists_in_world_$i': ( $i * '$ki_world' ) > $o ).
tff(decl_34,type,
esk1_0: '$ki_world' ).
tff(decl_35,type,
esk2_4: ( $i * ( $i * ( $i * $i ) ) ) > '$ki_world' ).
tff(decl_36,type,
esk3_4: ( $i * ( $i * ( $i * $i ) ) ) > '$ki_world' ).
tff(decl_37,type,
esk4_4: ( $i * ( $i * ( $i * $i ) ) ) > $i ).
tff(decl_38,type,
esk5_4: ( $i * ( $i * ( $i * '$ki_world' ) ) ) > $i ).
tff(decl_40,type,
esk7_0: $i ).
tff(decl_41,type,
esk8_1: '$ki_world' > $i ).
tff(verify,conjecture,
! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ? [X4] :
( ? [X6] :
( ? [X8] :
( ? [X7] :
( ! [X5: '$ki_world'] :
( '$ki_accessible'(X1,X5)
=> ! [X9] :
( '$ki_exists_in_world_$i'(X5,X9)
=> ( do(X5,X7,X8,X9)
=> in(X5,X4,X6,X9) ) ) )
& ! [X5: '$ki_world'] :
( '$ki_accessible'(X1,X5)
=> ( number(X5,X6,one)
& entry_box(X5,X6)
& userid(X5,u,X4) ) )
& '$ki_exists_in_world_$i'(X1,X7) )
& '$ki_exists_in_world_$i'(X1,X8) )
& '$ki_exists_in_world_$i'(X1,X6) )
& '$ki_exists_in_world_$i'(X1,X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',verify) ).
tff(ax3,axiom,
! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ! [X7] :
( '$ki_exists_in_world_$i'(X1,X7)
=> ! [X4] :
( '$ki_exists_in_world_$i'(X1,X4)
=> ! [X6] :
( '$ki_exists_in_world_$i'(X1,X6)
=> ( ( entry_box(X1,X6)
& string(X1,X4) )
=> ? [X8] :
( ! [X5: '$ki_world'] :
( '$ki_accessible'(X1,X5)
=> ! [X9] :
( '$ki_exists_in_world_$i'(X5,X9)
=> ( do(X5,X7,X8,X9)
=> in(X5,X4,X6,X9) ) ) )
& '$ki_exists_in_world_$i'(X1,X8) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax3) ).
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(ax1,axiom,
! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ? [X4] :
( ! [X5: '$ki_world'] :
( '$ki_accessible'(X1,X5)
=> ( string(X5,X4)
& userid(X5,u,X4) ) )
& '$ki_exists_in_world_$i'(X1,X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax1) ).
tff(ax2,axiom,
? [X6] :
( ! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ( number(X1,X6,one)
& entry_box(X1,X6) ) )
& '$ki_exists_in_world_$i'('$ki_local_world',X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax2) ).
tff(c_0_6,negated_conjecture,
~ ! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ? [X4] :
( ? [X6] :
( ? [X8] :
( ? [X7] :
( ! [X5: '$ki_world'] :
( '$ki_accessible'(X1,X5)
=> ! [X9] :
( '$ki_exists_in_world_$i'(X5,X9)
=> ( do(X5,X7,X8,X9)
=> in(X5,X4,X6,X9) ) ) )
& ! [X5: '$ki_world'] :
( '$ki_accessible'(X1,X5)
=> ( number(X5,X6,one)
& entry_box(X5,X6)
& userid(X5,u,X4) ) )
& '$ki_exists_in_world_$i'(X1,X7) )
& '$ki_exists_in_world_$i'(X1,X8) )
& '$ki_exists_in_world_$i'(X1,X6) )
& '$ki_exists_in_world_$i'(X1,X4) ) ),
inference(assume_negation,[status(cth)],[verify]) ).
tff(c_0_7,plain,
! [X18: '$ki_world',X19,X20,X21,X23: '$ki_world',X24] :
( ( ~ '$ki_accessible'('$ki_local_world',X18)
| ~ '$ki_exists_in_world_$i'(X18,X19)
| ~ '$ki_exists_in_world_$i'(X18,X20)
| ~ '$ki_exists_in_world_$i'(X18,X21)
| ~ entry_box(X18,X21)
| ~ string(X18,X20)
| in(X23,X20,X21,X24)
| ~ do(X23,X19,esk5_4(X18,X19,X20,X21),X24)
| ~ '$ki_exists_in_world_$i'(X23,X24)
| ~ '$ki_accessible'(X18,X23) )
& ( ~ '$ki_accessible'('$ki_local_world',X18)
| ~ '$ki_exists_in_world_$i'(X18,X19)
| ~ '$ki_exists_in_world_$i'(X18,X20)
| ~ '$ki_exists_in_world_$i'(X18,X21)
| ~ entry_box(X18,X21)
| ~ string(X18,X20)
| '$ki_exists_in_world_$i'(X18,esk5_4(X18,X19,X20,X21)) ) ),
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)],[ax3])])])])])]) ).
tff(c_0_8,plain,
! [X25: '$ki_world',X26] : '$ki_exists_in_world_$i'(X25,X26),
inference(variable_rename,[status(thm)],['$ki_exists_in_world_$i_const']) ).
tff(c_0_9,plain,
! [X29: '$ki_world',X30: '$ki_world'] : '$ki_accessible'(X29,X30),
inference(variable_rename,[status(thm)],[mrel_universal]) ).
tff(c_0_10,negated_conjecture,
! [X11,X12,X13,X14] :
( ( ~ '$ki_exists_in_world_$i'(esk1_0,X11)
| ~ '$ki_exists_in_world_$i'(esk1_0,X12)
| ~ '$ki_exists_in_world_$i'(esk1_0,X13)
| ~ '$ki_exists_in_world_$i'(esk1_0,X14)
| ~ number(esk2_4(X11,X12,X13,X14),X12,one)
| ~ entry_box(esk2_4(X11,X12,X13,X14),X12)
| ~ userid(esk2_4(X11,X12,X13,X14),u,X11)
| ~ in(esk3_4(X11,X12,X13,X14),X11,X12,esk4_4(X11,X12,X13,X14)) )
& ( ~ '$ki_exists_in_world_$i'(esk1_0,X11)
| ~ '$ki_exists_in_world_$i'(esk1_0,X12)
| ~ '$ki_exists_in_world_$i'(esk1_0,X13)
| ~ '$ki_exists_in_world_$i'(esk1_0,X14)
| ~ number(esk2_4(X11,X12,X13,X14),X12,one)
| ~ entry_box(esk2_4(X11,X12,X13,X14),X12)
| ~ userid(esk2_4(X11,X12,X13,X14),u,X11)
| do(esk3_4(X11,X12,X13,X14),X14,X13,esk4_4(X11,X12,X13,X14)) )
& ( ~ '$ki_exists_in_world_$i'(esk1_0,X11)
| ~ '$ki_exists_in_world_$i'(esk1_0,X12)
| ~ '$ki_exists_in_world_$i'(esk1_0,X13)
| ~ '$ki_exists_in_world_$i'(esk1_0,X14)
| ~ number(esk2_4(X11,X12,X13,X14),X12,one)
| ~ entry_box(esk2_4(X11,X12,X13,X14),X12)
| ~ userid(esk2_4(X11,X12,X13,X14),u,X11)
| '$ki_exists_in_world_$i'(esk3_4(X11,X12,X13,X14),esk4_4(X11,X12,X13,X14)) )
& ( ~ '$ki_exists_in_world_$i'(esk1_0,X11)
| ~ '$ki_exists_in_world_$i'(esk1_0,X12)
| ~ '$ki_exists_in_world_$i'(esk1_0,X13)
| ~ '$ki_exists_in_world_$i'(esk1_0,X14)
| ~ number(esk2_4(X11,X12,X13,X14),X12,one)
| ~ entry_box(esk2_4(X11,X12,X13,X14),X12)
| ~ userid(esk2_4(X11,X12,X13,X14),u,X11)
| '$ki_accessible'(esk1_0,esk3_4(X11,X12,X13,X14)) )
& ( ~ '$ki_exists_in_world_$i'(esk1_0,X11)
| ~ '$ki_exists_in_world_$i'(esk1_0,X12)
| ~ '$ki_exists_in_world_$i'(esk1_0,X13)
| ~ '$ki_exists_in_world_$i'(esk1_0,X14)
| '$ki_accessible'(esk1_0,esk2_4(X11,X12,X13,X14))
| ~ in(esk3_4(X11,X12,X13,X14),X11,X12,esk4_4(X11,X12,X13,X14)) )
& ( ~ '$ki_exists_in_world_$i'(esk1_0,X11)
| ~ '$ki_exists_in_world_$i'(esk1_0,X12)
| ~ '$ki_exists_in_world_$i'(esk1_0,X13)
| ~ '$ki_exists_in_world_$i'(esk1_0,X14)
| '$ki_accessible'(esk1_0,esk2_4(X11,X12,X13,X14))
| do(esk3_4(X11,X12,X13,X14),X14,X13,esk4_4(X11,X12,X13,X14)) )
& ( ~ '$ki_exists_in_world_$i'(esk1_0,X11)
| ~ '$ki_exists_in_world_$i'(esk1_0,X12)
| ~ '$ki_exists_in_world_$i'(esk1_0,X13)
| ~ '$ki_exists_in_world_$i'(esk1_0,X14)
| '$ki_accessible'(esk1_0,esk2_4(X11,X12,X13,X14))
| '$ki_exists_in_world_$i'(esk3_4(X11,X12,X13,X14),esk4_4(X11,X12,X13,X14)) )
& ( ~ '$ki_exists_in_world_$i'(esk1_0,X11)
| ~ '$ki_exists_in_world_$i'(esk1_0,X12)
| ~ '$ki_exists_in_world_$i'(esk1_0,X13)
| ~ '$ki_exists_in_world_$i'(esk1_0,X14)
| '$ki_accessible'(esk1_0,esk2_4(X11,X12,X13,X14))
| '$ki_accessible'(esk1_0,esk3_4(X11,X12,X13,X14)) )
& '$ki_accessible'('$ki_local_world',esk1_0) ),
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_6])])])])])]) ).
tcf(c_0_11,plain,
! [X2: '$ki_world',X7,X6,X4,X3,X1: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X1)
| ~ '$ki_exists_in_world_$i'(X1,X4)
| ~ '$ki_exists_in_world_$i'(X1,X6)
| ~ '$ki_exists_in_world_$i'(X1,X7)
| ~ entry_box(X1,X7)
| ~ string(X1,X6)
| ~ do(X2,X4,esk5_4(X1,X4,X6,X7),X3)
| ~ '$ki_exists_in_world_$i'(X2,X3)
| ~ '$ki_accessible'(X1,X2)
| in(X2,X6,X7,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
tcf(c_0_12,plain,
! [X1: '$ki_world',X3] : '$ki_exists_in_world_$i'(X1,X3),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
tcf(c_0_13,plain,
! [X1: '$ki_world',X2: '$ki_world'] : '$ki_accessible'(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
tcf(c_0_14,negated_conjecture,
! [X7,X6,X4,X3] :
( ~ '$ki_exists_in_world_$i'(esk1_0,X3)
| ~ '$ki_exists_in_world_$i'(esk1_0,X4)
| ~ '$ki_exists_in_world_$i'(esk1_0,X6)
| ~ '$ki_exists_in_world_$i'(esk1_0,X7)
| ~ number(esk2_4(X3,X4,X6,X7),X4,one)
| ~ entry_box(esk2_4(X3,X4,X6,X7),X4)
| ~ userid(esk2_4(X3,X4,X6,X7),u,X3)
| do(esk3_4(X3,X4,X6,X7),X7,X6,esk4_4(X3,X4,X6,X7)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
tcf(c_0_15,negated_conjecture,
! [X7,X6,X4,X3] :
( ~ '$ki_exists_in_world_$i'(esk1_0,X3)
| ~ '$ki_exists_in_world_$i'(esk1_0,X4)
| ~ '$ki_exists_in_world_$i'(esk1_0,X6)
| ~ '$ki_exists_in_world_$i'(esk1_0,X7)
| ~ number(esk2_4(X3,X4,X6,X7),X4,one)
| ~ entry_box(esk2_4(X3,X4,X6,X7),X4)
| ~ userid(esk2_4(X3,X4,X6,X7),u,X3)
| ~ in(esk3_4(X3,X4,X6,X7),X3,X4,esk4_4(X3,X4,X6,X7)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
tcf(c_0_16,plain,
! [X1: '$ki_world',X2: '$ki_world',X7,X6,X4,X3] :
( ~ string(X2,X3)
| ~ do(X1,X7,esk5_4(X2,X7,X3,X4),X6)
| ~ entry_box(X2,X4)
| in(X1,X3,X4,X6) ),
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_11,c_0_12]),c_0_12]),c_0_12]),c_0_12]),c_0_13]),c_0_13])]) ).
tcf(c_0_17,negated_conjecture,
! [X3,X7,X6,X4] :
( ~ number(esk2_4(X3,X4,X6,X7),X4,one)
| ~ entry_box(esk2_4(X3,X4,X6,X7),X4)
| ~ userid(esk2_4(X3,X4,X6,X7),u,X3)
| do(esk3_4(X3,X4,X6,X7),X7,X6,esk4_4(X3,X4,X6,X7)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_12]),c_0_12]),c_0_12]),c_0_12])]) ).
tff(c_0_18,plain,
! [X33: '$ki_world',X35: '$ki_world'] :
( ( ~ '$ki_accessible'('$ki_local_world',X33)
| ~ '$ki_accessible'(X33,X35)
| string(X35,esk8_1(X33)) )
& ( ~ '$ki_accessible'('$ki_local_world',X33)
| ~ '$ki_accessible'(X33,X35)
| userid(X35,u,esk8_1(X33)) )
& ( ~ '$ki_accessible'('$ki_local_world',X33)
| '$ki_exists_in_world_$i'(X33,esk8_1(X33)) ) ),
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)],[ax1])])])])])]) ).
tcf(c_0_19,negated_conjecture,
! [X3,X7,X6,X4] :
( ~ number(esk2_4(X3,X4,X6,X7),X4,one)
| ~ in(esk3_4(X3,X4,X6,X7),X3,X4,esk4_4(X3,X4,X6,X7))
| ~ entry_box(esk2_4(X3,X4,X6,X7),X4)
| ~ userid(esk2_4(X3,X4,X6,X7),u,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_12]),c_0_12]),c_0_12]),c_0_12])]) ).
tcf(c_0_20,negated_conjecture,
! [X1: '$ki_world',X3,X8,X7,X6,X4] :
( ~ number(esk2_4(X3,X4,esk5_4(X1,X6,X7,X8),X6),X4,one)
| ~ string(X1,X7)
| ~ entry_box(X1,X8)
| ~ entry_box(esk2_4(X3,X4,esk5_4(X1,X6,X7,X8),X6),X4)
| ~ userid(esk2_4(X3,X4,esk5_4(X1,X6,X7,X8),X6),u,X3)
| in(esk3_4(X3,X4,esk5_4(X1,X6,X7,X8),X6),X7,X8,esk4_4(X3,X4,esk5_4(X1,X6,X7,X8),X6)) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
tcf(c_0_21,plain,
! [X1: '$ki_world',X2: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X2)
| ~ '$ki_accessible'(X2,X1)
| userid(X1,u,esk8_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
tcf(c_0_22,plain,
! [X1: '$ki_world',X2: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X2)
| ~ '$ki_accessible'(X2,X1)
| string(X1,esk8_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
tff(c_0_23,plain,
! [X32: '$ki_world'] :
( ( ~ '$ki_accessible'('$ki_local_world',X32)
| number(X32,esk7_0,one) )
& ( ~ '$ki_accessible'('$ki_local_world',X32)
| entry_box(X32,esk7_0) )
& '$ki_exists_in_world_$i'('$ki_local_world',esk7_0) ),
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)],[ax2])])])])])]) ).
tcf(c_0_24,negated_conjecture,
! [X1: '$ki_world',X3,X6,X4] :
( ~ number(esk2_4(X3,X4,esk5_4(X1,X6,X3,X4),X6),X4,one)
| ~ string(X1,X3)
| ~ entry_box(X1,X4)
| ~ entry_box(esk2_4(X3,X4,esk5_4(X1,X6,X3,X4),X6),X4)
| ~ userid(esk2_4(X3,X4,esk5_4(X1,X6,X3,X4),X6),u,X3) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
tcf(c_0_25,plain,
! [X1: '$ki_world',X2: '$ki_world'] : userid(X1,u,esk8_1(X2)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_13]),c_0_13])]) ).
tcf(c_0_26,plain,
! [X1: '$ki_world',X2: '$ki_world'] : string(X1,esk8_1(X2)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_13]),c_0_13])]) ).
tcf(c_0_27,plain,
! [X1: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X1)
| number(X1,esk7_0,one) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
tcf(c_0_28,plain,
! [X1: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X1)
| entry_box(X1,esk7_0) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
tcf(c_0_29,negated_conjecture,
! [X2: '$ki_world',X1: '$ki_world',X4,X3] :
( ~ number(esk2_4(esk8_1(X1),X3,esk5_4(X2,X4,esk8_1(X1),X3),X4),X3,one)
| ~ entry_box(X2,X3)
| ~ entry_box(esk2_4(esk8_1(X1),X3,esk5_4(X2,X4,esk8_1(X1),X3),X4),X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
tcf(c_0_30,plain,
! [X1: '$ki_world'] : number(X1,esk7_0,one),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_13])]) ).
tcf(c_0_31,plain,
! [X1: '$ki_world'] : entry_box(X1,esk7_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_13])]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NLP266_23 : TPTP v9.3.1. Released v8.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n007.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 01:54:50 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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.10/0.43 % Version: 3.5.1
% 0.10/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.43 % Starting sh5l with 300s (1) cores
% 0.10/0.43 % new_bool_3 with pid 4121834 completed with status 0
% 0.10/0.43 % Result found by new_bool_3
% 0.10/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.43 % Search class: FGHNS-FFMF33-SFFFFFNN
% 0.10/0.43 % partial match(1): FGHSS-FFMF33-SFFFFFNN
% 0.10/0.43 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.43 % SubtermCWHack with pid 4121840 completed with status 0
% 0.10/0.43 % Result found by SubtermCWHack
% 0.10/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.43 % Search class: FGHNS-FFMF33-SFFFFFNN
% 0.10/0.43 % partial match(1): FGHSS-FFMF33-SFFFFFNN
% 0.10/0.43 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.43 % Preprocessing time : 0.001 s
% 0.10/0.43
% 0.10/0.43 % Proof found!
% 0.10/0.43 % SZS status Theorem
% 0.10/0.43 % SZS output start CNFRefutation
% See solution above
% 0.10/0.43 % Parsed axioms : 19
% 0.10/0.43 % Removed by relevancy pruning/SinE : 12
% 0.10/0.43 % Initial clauses : 20
% 0.10/0.43 % Removed in clause preprocessing : 0
% 0.10/0.43 % Initial clauses in saturation : 20
% 0.10/0.43 % Processed clauses : 23
% 0.10/0.43 % ...of these trivial : 9
% 0.10/0.43 % ...subsumed : 0
% 0.10/0.43 % ...remaining for further processing : 14
% 0.10/0.43 % Other redundant clauses eliminated : 0
% 0.10/0.43 % Clauses deleted for lack of memory : 0
% 0.10/0.43 % Backward-subsumed : 0
% 0.10/0.43 % Backward-rewritten : 2
% 0.10/0.43 % Generated clauses : 4
% 0.10/0.43 % ...of the previous two non-redundant : 3
% 0.10/0.43 % ...aggressively subsumed : 0
% 0.10/0.43 % Contextual simplify-reflections : 0
% 0.10/0.43 % Paramodulations : 4
% 0.10/0.43 % Factorizations : 0
% 0.10/0.43 % NegExts : 0
% 0.10/0.43 % Equation resolutions : 0
% 0.10/0.43 % Disequality decompositions : 0
% 0.10/0.43 % Total rewrite steps : 65
% 0.10/0.43 % ...of those cached : 41
% 0.10/0.43 % Propositional unsat checks : 0
% 0.10/0.43 % Propositional check models : 0
% 0.10/0.43 % Propositional check unsatisfiable : 0
% 0.10/0.43 % Propositional clauses : 0
% 0.10/0.43 % Propositional clauses after purity: 0
% 0.10/0.43 % Propositional unsat core size : 0
% 0.10/0.43 % Propositional preprocessing time : 0.000
% 0.10/0.43 % Propositional encoding time : 0.000
% 0.10/0.43 % Propositional solver time : 0.000
% 0.10/0.43 % Success case prop preproc time : 0.000
% 0.10/0.43 % Success case prop encoding time : 0.000
% 0.10/0.43 % Success case prop solver time : 0.000
% 0.10/0.43 % Current number of processed clauses : 12
% 0.10/0.43 % Positive orientable unit clauses : 6
% 0.10/0.43 % Positive unorientable unit clauses: 0
% 0.10/0.43 % Negative unit clauses : 0
% 0.10/0.43 % Non-unit-clauses : 6
% 0.10/0.43 % Current number of unprocessed clauses: 0
% 0.10/0.43 % ...number of literals in the above : 0
% 0.10/0.43 % Current number of archived formulas : 0
% 0.10/0.43 % Current number of archived clauses : 2
% 0.10/0.43 % Clause-clause subsumption calls (NU) : 28
% 0.10/0.43 % Rec. Clause-clause subsumption calls : 0
% 0.10/0.43 % Non-unit clause-clause subsumptions : 0
% 0.10/0.43 % Unit Clause-clause subsumption calls : 0
% 0.10/0.43 % Rewrite failures with RHS unbound : 0
% 0.10/0.43 % BW rewrite match attempts : 2
% 0.10/0.43 % BW rewrite match successes : 2
% 0.10/0.43 % Condensation attempts : 0
% 0.10/0.43 % Condensation successes : 0
% 0.10/0.43 % Termbank termtop insertions : 2177
% 0.10/0.43 % Search garbage collected termcells : 493
% 0.10/0.43
% 0.10/0.43 % -------------------------------------------------
% 0.10/0.43 % User time : 0.004 s
% 0.10/0.43 % System time : 0.003 s
% 0.10/0.43 % Total time : 0.007 s
% 0.10/0.43 % Maximum resident set size: 3644 pages
% 0.10/0.43
% 0.10/0.43 % -------------------------------------------------
% 0.10/0.43 % User time : 0.005 s
% 0.10/0.43 % System time : 0.007 s
% 0.10/0.43 % Total time : 0.012 s
% 0.10/0.43 % Maximum resident set size: 4864 pages
% 0.10/0.43 % E exiting
%------------------------------------------------------------------------------