%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NLP266_3 : 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 : n010.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 : CounterSatisfiable 0.11s 0.43s
% Output : Saturation 0.11s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_17ERROR: Could not build tree for root c_0_37ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
tcf(c_0_15,plain,
! [X2: '$ki_world',X1: '$ki_world',X4,X7,X6,X3] :
( ~ do(X2,X4,esk5_4(X1,X4,X6,X7),X3)
| ~ '$ki_accessible'('$ki_local_world',X1)
| ~ '$ki_accessible'(X1,X2)
| ~ entry_box(X1,X7)
| ~ string(X1,X6)
| in(X2,X6,X7,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_11]),c_0_11]),c_0_11])]),
[final] ).
tcf(c_0_16,negated_conjecture,
! [X4,X7,X6,X3] :
( ~ userid(esk7_4(X3,X4,X6,X7),u,X3)
| ~ number(esk7_4(X3,X4,X6,X7),X4,one)
| ~ entry_box(esk7_4(X3,X4,X6,X7),X4)
| do(esk8_4(X3,X4,X6,X7),X7,X6,esk9_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_12,c_0_11]),c_0_11]),c_0_11]),c_0_11])]),
[final] ).
tcf(c_0_20,negated_conjecture,
! [X3,X4,X6,X7] :
( do(esk8_4(X3,X4,X6,X7),X7,X6,esk9_4(X3,X4,X6,X7))
| '$ki_accessible'(esk6_0,esk7_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_13,c_0_11]),c_0_11]),c_0_11]),c_0_11])]),
[final] ).
tcf(c_0_21,negated_conjecture,
! [X3,X4,X6,X7] :
( ~ in(esk8_4(X3,X4,X6,X7),X3,X4,esk9_4(X3,X4,X6,X7))
| ~ userid(esk7_4(X3,X4,X6,X7),u,X3)
| ~ number(esk7_4(X3,X4,X6,X7),X4,one)
| ~ entry_box(esk7_4(X3,X4,X6,X7),X4) ),
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_11]),c_0_11]),c_0_11]),c_0_11])]),
[final] ).
tcf(c_0_22,negated_conjecture,
! [X4,X8,X7,X6,X3,X1: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X1)
| ~ '$ki_accessible'(X1,esk8_4(X3,X4,esk5_4(X1,X6,X7,X8),X6))
| ~ number(esk7_4(X3,X4,esk5_4(X1,X6,X7,X8),X6),X4,one)
| ~ string(X1,X7)
| ~ entry_box(X1,X8)
| ~ entry_box(esk7_4(X3,X4,esk5_4(X1,X6,X7,X8),X6),X4)
| ~ userid(esk7_4(X3,X4,esk5_4(X1,X6,X7,X8),X6),u,X3)
| in(esk8_4(X3,X4,esk5_4(X1,X6,X7,X8),X6),X7,X8,esk9_4(X3,X4,esk5_4(X1,X6,X7,X8),X6)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]),
[final] ).
tcf(c_0_23,negated_conjecture,
! [X4,X7,X6,X3] :
( ~ userid(esk7_4(X3,X4,X6,X7),u,X3)
| ~ number(esk7_4(X3,X4,X6,X7),X4,one)
| ~ entry_box(esk7_4(X3,X4,X6,X7),X4)
| '$ki_accessible'(esk6_0,esk8_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_17,c_0_11]),c_0_11]),c_0_11]),c_0_11])]),
[final] ).
tcf(c_0_24,plain,
! [X1: '$ki_world',X2: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X2)
| ~ '$ki_accessible'(X2,X1)
| userid(X1,u,esk3_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_18]),
[final] ).
tcf(c_0_26,negated_conjecture,
! [X3,X4,X6,X7] :
( ~ in(esk8_4(X3,X4,X6,X7),X3,X4,esk9_4(X3,X4,X6,X7))
| '$ki_accessible'(esk6_0,esk7_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_19,c_0_11]),c_0_11]),c_0_11]),c_0_11])]),
[final] ).
tcf(c_0_27,negated_conjecture,
! [X4,X8,X7,X6,X3,X1: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X1)
| ~ '$ki_accessible'(X1,esk8_4(X3,X4,esk5_4(X1,X6,X7,X8),X6))
| ~ string(X1,X7)
| ~ entry_box(X1,X8)
| '$ki_accessible'(esk6_0,esk7_4(X3,X4,esk5_4(X1,X6,X7,X8),X6))
| in(esk8_4(X3,X4,esk5_4(X1,X6,X7,X8),X6),X7,X8,esk9_4(X3,X4,esk5_4(X1,X6,X7,X8),X6)) ),
inference(spm,[status(thm)],[c_0_15,c_0_20]),
[final] ).
tcf(c_0_29,negated_conjecture,
! [X3,X6,X4,X1: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X1)
| ~ '$ki_accessible'(X1,esk8_4(X3,X4,esk5_4(X1,X6,X3,X4),X6))
| ~ number(esk7_4(X3,X4,esk5_4(X1,X6,X3,X4),X6),X4,one)
| ~ string(X1,X3)
| ~ entry_box(X1,X4)
| ~ entry_box(esk7_4(X3,X4,esk5_4(X1,X6,X3,X4),X6),X4)
| ~ userid(esk7_4(X3,X4,esk5_4(X1,X6,X3,X4),X6),u,X3) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]),
[final] ).
tcf(c_0_30,negated_conjecture,
! [X3,X6,X4,X1: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X1)
| ~ '$ki_accessible'(X1,esk7_4(esk3_1(X1),X3,X4,X6))
| ~ number(esk7_4(esk3_1(X1),X3,X4,X6),X3,one)
| ~ entry_box(esk7_4(esk3_1(X1),X3,X4,X6),X3)
| '$ki_accessible'(esk6_0,esk8_4(esk3_1(X1),X3,X4,X6)) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]),
[final] ).
tcf(c_0_31,plain,
! [X1: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X1)
| number(X1,esk4_0,one) ),
inference(split_conjunct,[status(thm)],[c_0_25]),
[final] ).
tcf(c_0_32,plain,
! [X1: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X1)
| entry_box(X1,esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_25]),
[final] ).
tcf(c_0_33,negated_conjecture,
! [X3,X6,X4,X1: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X1)
| ~ '$ki_accessible'(X1,esk8_4(X3,X4,esk5_4(X1,X6,X3,X4),X6))
| ~ string(X1,X3)
| ~ entry_box(X1,X4)
| '$ki_accessible'(esk6_0,esk7_4(X3,X4,esk5_4(X1,X6,X3,X4),X6)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]),
[final] ).
tcf(c_0_34,negated_conjecture,
! [X3,X4,X6,X7] :
( '$ki_accessible'(esk6_0,esk8_4(X3,X4,X6,X7))
| '$ki_accessible'(esk6_0,esk7_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_28,c_0_11]),c_0_11]),c_0_11]),c_0_11])]),
[final] ).
tcf(c_0_35,negated_conjecture,
'$ki_accessible'('$ki_local_world',esk6_0),
inference(split_conjunct,[status(thm)],[c_0_9]),
[final] ).
tcf(c_0_36,negated_conjecture,
! [X4,X3,X2: '$ki_world',X1: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X1)
| ~ '$ki_accessible'('$ki_local_world',X2)
| ~ '$ki_accessible'(X1,esk7_4(esk3_1(X1),X3,esk5_4(X2,X4,esk3_1(X1),X3),X4))
| ~ '$ki_accessible'(X2,esk8_4(esk3_1(X1),X3,esk5_4(X2,X4,esk3_1(X1),X3),X4))
| ~ number(esk7_4(esk3_1(X1),X3,esk5_4(X2,X4,esk3_1(X1),X3),X4),X3,one)
| ~ string(X2,esk3_1(X1))
| ~ entry_box(X2,X3)
| ~ entry_box(esk7_4(esk3_1(X1),X3,esk5_4(X2,X4,esk3_1(X1),X3),X4),X3) ),
inference(spm,[status(thm)],[c_0_29,c_0_24]),
[final] ).
tcf(c_0_37,negated_conjecture,
! [X4,X3,X1: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X1)
| ~ '$ki_accessible'(X1,esk7_4(esk3_1(X1),esk4_0,X3,X4))
| ~ '$ki_accessible'('$ki_local_world',esk7_4(esk3_1(X1),esk4_0,X3,X4))
| '$ki_accessible'(esk6_0,esk8_4(esk3_1(X1),esk4_0,X3,X4)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),
[final] ).
tcf(c_0_38,negated_conjecture,
! [X6,X4,X3] :
( ~ string(esk6_0,X3)
| ~ entry_box(esk6_0,X4)
| '$ki_accessible'(esk6_0,esk7_4(X3,X4,esk5_4(esk6_0,X6,X3,X4),X6)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]),
[final] ).
tcf(c_0_39,negated_conjecture,
! [X1: '$ki_world',X3,X2: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X2)
| ~ '$ki_accessible'('$ki_local_world',X1)
| ~ '$ki_accessible'(X2,esk7_4(esk3_1(X2),esk4_0,esk5_4(X1,X3,esk3_1(X2),esk4_0),X3))
| ~ '$ki_accessible'(X1,esk8_4(esk3_1(X2),esk4_0,esk5_4(X1,X3,esk3_1(X2),esk4_0),X3))
| ~ '$ki_accessible'('$ki_local_world',esk7_4(esk3_1(X2),esk4_0,esk5_4(X1,X3,esk3_1(X2),esk4_0),X3))
| ~ string(X1,esk3_1(X2)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_31]),c_0_32]),c_0_32]),
[final] ).
tcf(c_0_42,negated_conjecture,
! [X3,X1: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X1)
| ~ '$ki_accessible'(X1,esk7_4(esk3_1(X1),esk4_0,esk5_4(esk6_0,X3,esk3_1(X1),esk4_0),X3))
| ~ '$ki_accessible'('$ki_local_world',esk7_4(esk3_1(X1),esk4_0,esk5_4(esk6_0,X3,esk3_1(X1),esk4_0),X3))
| ~ string(esk6_0,esk3_1(X1))
| '$ki_accessible'(esk6_0,esk7_4(esk3_1(X1),esk4_0,esk5_4(esk6_0,X3,esk3_1(X1),esk4_0),X3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_34]),c_0_35])]),
[final] ).
tcf(c_0_43,negated_conjecture,
! [X3] :
( ~ '$ki_accessible'('$ki_local_world',esk7_4(esk3_1(esk6_0),esk4_0,esk5_4(esk6_0,X3,esk3_1(esk6_0),esk4_0),X3))
| ~ string(esk6_0,esk3_1(esk6_0))
| ~ entry_box(esk6_0,esk4_0) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_35])]),c_0_38]),
[final] ).
tcf(c_0_44,plain,
! [X1: '$ki_world',X2: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X2)
| ~ '$ki_accessible'(X2,X1)
| string(X1,esk3_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_18]),
[final] ).
tcf(c_0_45,plain,
! [X1: '$ki_world'] : '$ki_accessible'(X1,esk1_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_41]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NLP266_3 : TPTP v9.3.1. Released v8.2.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n010.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 21 01:57:25 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/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.11/0.43 % Version: 3.5.1
% 0.11/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.43 % Starting sh5l with 300s (1) cores
% 0.11/0.43 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 4004276 completed with status 1
% 0.11/0.43 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.11/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.43 % No SInE strategy applied
% 0.11/0.43 % Search class: FGHNF-FFMF33-SFFFFFNN
% 0.11/0.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.11/0.43 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.11/0.43 % Starting new_bool_3 with 136s (1) cores
% 0.11/0.43 % Starting new_bool_1 with 136s (1) cores
% 0.11/0.43 % SubtermCWHack with pid 4004281 completed with status 1
% 0.11/0.43 % Result found by SubtermCWHack
% 0.11/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.43 % No SInE strategy applied
% 0.11/0.43 % Search class: FGHNF-FFMF33-SFFFFFNN
% 0.11/0.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.43 % Preprocessing time : 0.001 s
% 0.11/0.43
% 0.11/0.43 % No proof found!
% 0.11/0.43 % SZS status CounterSatisfiable
% 0.11/0.43 % SZS output start Saturation
% See solution above
% 0.11/0.43 % Parsed axioms : 19
% 0.11/0.43 % Removed by relevancy pruning/SinE : 0
% 0.11/0.43 % Initial clauses : 32
% 0.11/0.43 % Removed in clause preprocessing : 19
% 0.11/0.43 % Initial clauses in saturation : 13
% 0.11/0.43 % Processed clauses : 29
% 0.11/0.43 % ...of these trivial : 0
% 0.11/0.43 % ...subsumed : 4
% 0.11/0.43 % ...remaining for further processing : 25
% 0.11/0.43 % Other redundant clauses eliminated : 0
% 0.11/0.43 % Clauses deleted for lack of memory : 0
% 0.11/0.43 % Backward-subsumed : 1
% 0.11/0.43 % Backward-rewritten : 0
% 0.11/0.43 % Generated clauses : 16
% 0.11/0.43 % ...of the previous two non-redundant : 16
% 0.11/0.43 % ...aggressively subsumed : 0
% 0.11/0.43 % Contextual simplify-reflections : 4
% 0.11/0.43 % Paramodulations : 16
% 0.11/0.43 % Factorizations : 0
% 0.11/0.43 % NegExts : 0
% 0.11/0.43 % Equation resolutions : 0
% 0.11/0.43 % Disequality decompositions : 0
% 0.11/0.43 % Total rewrite steps : 6
% 0.11/0.43 % ...of those cached : 5
% 0.11/0.43 % Propositional unsat checks : 0
% 0.11/0.43 % Propositional check models : 0
% 0.11/0.43 % Propositional check unsatisfiable : 0
% 0.11/0.43 % Propositional clauses : 0
% 0.11/0.43 % Propositional clauses after purity: 0
% 0.11/0.43 % Propositional unsat core size : 0
% 0.11/0.43 % Propositional preprocessing time : 0.000
% 0.11/0.43 % Propositional encoding time : 0.000
% 0.11/0.43 % Propositional solver time : 0.000
% 0.11/0.43 % Success case prop preproc time : 0.000
% 0.11/0.43 % Success case prop encoding time : 0.000
% 0.11/0.43 % Success case prop solver time : 0.000
% 0.11/0.43 % Current number of processed clauses : 24
% 0.11/0.43 % Positive orientable unit clauses : 2
% 0.11/0.43 % Positive unorientable unit clauses: 0
% 0.11/0.43 % Negative unit clauses : 0
% 0.11/0.43 % Non-unit-clauses : 22
% 0.11/0.43 % Current number of unprocessed clauses: 0
% 0.11/0.43 % ...number of literals in the above : 0
% 0.11/0.43 % Current number of archived formulas : 0
% 0.11/0.43 % Current number of archived clauses : 2
% 0.11/0.43 % Clause-clause subsumption calls (NU) : 130
% 0.11/0.43 % Rec. Clause-clause subsumption calls : 25
% 0.11/0.43 % Non-unit clause-clause subsumptions : 9
% 0.11/0.43 % Unit Clause-clause subsumption calls : 0
% 0.11/0.43 % Rewrite failures with RHS unbound : 0
% 0.11/0.43 % BW rewrite match attempts : 0
% 0.11/0.43 % BW rewrite match successes : 0
% 0.11/0.43 % Condensation attempts : 0
% 0.11/0.43 % Condensation successes : 0
% 0.11/0.43 % Termbank termtop insertions : 3170
% 0.11/0.43 % Search garbage collected termcells : 496
% 0.11/0.43
% 0.11/0.43 % -------------------------------------------------
% 0.11/0.43 % User time : 0.006 s
% 0.11/0.43 % System time : 0.006 s
% 0.11/0.43 % Total time : 0.012 s
% 0.11/0.43 % Maximum resident set size: 3644 pages
% 0.11/0.43
% 0.11/0.43 % -------------------------------------------------
% 0.11/0.43 % User time : 0.025 s
% 0.11/0.43 % System time : 0.018 s
% 0.11/0.43 % Total time : 0.043 s
% 0.11/0.43 % Maximum resident set size: 4864 pages
% 0.11/0.43 % E exiting
%------------------------------------------------------------------------------