%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYO911_15 : 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 : n008.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 03:49:00 PM UTC 2026
% Result : CounterSatisfiable 0.14s 0.63s
% Output : Saturation 0.14s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_3ERROR: Could not build tree for root c_0_14ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
tcf(c_0_4,negated_conjecture,
! [X1: '$ki_world',X2: '$ki_world',X3: '$ki_world',X4: '$ki_world'] :
( ~ q(X4)
| ~ '$ki_accessible'('$ki_local_world',X4)
| ~ p(X3)
| ~ '$ki_accessible'('$ki_local_world',X3)
| ~ q(X2)
| ~ '$ki_accessible'(X1,X2)
| ~ p(X1)
| ~ '$ki_accessible'('$ki_local_world',X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_5,negated_conjecture,
( '$ki_accessible'(esk2_0,esk3_0)
| '$ki_accessible'('$ki_local_world',esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_6,negated_conjecture,
( '$ki_accessible'('$ki_local_world',esk2_0)
| '$ki_accessible'('$ki_local_world',esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_7,negated_conjecture,
( p(esk2_0)
| '$ki_accessible'('$ki_local_world',esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_8,negated_conjecture,
( q(esk3_0)
| '$ki_accessible'('$ki_local_world',esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_9,negated_conjecture,
( '$ki_accessible'(esk2_0,esk3_0)
| '$ki_accessible'('$ki_local_world',esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_10,negated_conjecture,
( '$ki_accessible'('$ki_local_world',esk2_0)
| '$ki_accessible'('$ki_local_world',esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_11,negated_conjecture,
( p(esk2_0)
| '$ki_accessible'('$ki_local_world',esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_12,negated_conjecture,
( q(esk3_0)
| '$ki_accessible'('$ki_local_world',esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_13,negated_conjecture,
( '$ki_accessible'('$ki_local_world',esk2_0)
| q(esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_14,negated_conjecture,
! [X1: '$ki_world',X2: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X2)
| ~ '$ki_accessible'('$ki_local_world',X1)
| ~ p(X2)
| ~ q(X1)
| '$ki_accessible'('$ki_local_world',esk5_0) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_5]),c_0_6]),c_0_7]),c_0_8]),
[final] ).
tcf(c_0_15,negated_conjecture,
! [X1: '$ki_world',X2: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X2)
| ~ '$ki_accessible'('$ki_local_world',X1)
| ~ p(X2)
| ~ q(X1)
| '$ki_accessible'('$ki_local_world',esk4_0) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_9]),c_0_10]),c_0_11]),c_0_12]),
[final] ).
tcf(c_0_20,plain,
! [X1: '$ki_world'] : '$ki_accessible'(X1,esk1_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_16]),
[final] ).
tcf(c_0_21,negated_conjecture,
! [X1: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X1)
| ~ '$ki_accessible'('$ki_local_world','$ki_local_world')
| ~ p(X1)
| ~ p('$ki_local_world')
| '$ki_accessible'('$ki_local_world',esk2_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_13]),c_0_6]),
[final] ).
tcf(c_0_22,negated_conjecture,
( ~ '$ki_accessible'('$ki_local_world',esk3_0)
| '$ki_accessible'('$ki_local_world',esk5_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_7]),c_0_6]),
[final] ).
tcf(c_0_23,negated_conjecture,
( ~ '$ki_accessible'('$ki_local_world',esk3_0)
| '$ki_accessible'('$ki_local_world',esk4_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_11]),c_0_10]),
[final] ).
tcf(c_0_24,negated_conjecture,
! [X3: '$ki_world',X2: '$ki_world',X1: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X1)
| ~ '$ki_accessible'('$ki_local_world',X3)
| ~ '$ki_accessible'('$ki_local_world',X2)
| ~ p(X1)
| ~ p(X3)
| ~ q(X2)
| ~ q(esk1_1(X1)) ),
inference(spm,[status(thm)],[c_0_4,c_0_20]),
[final] ).
tcf(c_0_25,negated_conjecture,
( '$ki_accessible'(esk2_0,esk3_0)
| q(esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_26,negated_conjecture,
( '$ki_accessible'(esk2_0,esk3_0)
| p(esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_27,negated_conjecture,
( '$ki_accessible'('$ki_local_world',esk2_0)
| p(esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_28,negated_conjecture,
( q(esk3_0)
| q(esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_29,negated_conjecture,
( q(esk3_0)
| p(esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_30,negated_conjecture,
( p(esk2_0)
| q(esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_31,negated_conjecture,
( p(esk2_0)
| p(esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO911_15 : 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.56 % Computer : n008.cluster.edu
% 0.10/0.56 % Model : x86_64 x86_64
% 0.10/0.56 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.56 % Memory : 8046.5625MB
% 0.10/0.56 % OS : Linux 6.8.0-71-generic
% 0.10/0.56 % CPULimit : 300
% 0.10/0.56 % WCLimit : 300
% 0.10/0.56 % DateTime : Mon Sep 21 12:32:10 UTC 2026
% 0.10/0.56 % CPUTime :
% 0.10/0.56 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.60 Running first-order theorem proving
% 0.10/0.60 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.14/0.63 % Version: 3.5.1
% 0.14/0.63 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.63 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.63 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.63 % Starting sh5l with 300s (1) cores
% 0.14/0.63 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 963899 completed with status 1
% 0.14/0.63 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.14/0.63 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.63 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.63 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.63 % No SInE strategy applied
% 0.14/0.63 % Search class: FGHNF-FFSM11-SFFFFFNN
% 0.14/0.63 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.63 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.63 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.14/0.63 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.14/0.63 % Starting new_bool_3 with 136s (1) cores
% 0.14/0.63 % Starting new_bool_1 with 136s (1) cores
% 0.14/0.63 % SubtermCWHack with pid 963903 completed with status 1
% 0.14/0.63 % Result found by SubtermCWHack
% 0.14/0.63 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.63 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.63 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.63 % No SInE strategy applied
% 0.14/0.63 % Search class: FGHNF-FFSM11-SFFFFFNN
% 0.14/0.63 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.63 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.63 % Preprocessing time : 0.001 s
% 0.14/0.63
% 0.14/0.63 % No proof found!
% 0.14/0.63 % SZS status CounterSatisfiable
% 0.14/0.63 % SZS output start Saturation
% See solution above
% 0.14/0.63 % Parsed axioms : 7
% 0.14/0.63 % Removed by relevancy pruning/SinE : 0
% 0.14/0.63 % Initial clauses : 23
% 0.14/0.63 % Removed in clause preprocessing : 5
% 0.14/0.63 % Initial clauses in saturation : 18
% 0.14/0.63 % Processed clauses : 37
% 0.14/0.63 % ...of these trivial : 0
% 0.14/0.63 % ...subsumed : 10
% 0.14/0.63 % ...remaining for further processing : 27
% 0.14/0.63 % Other redundant clauses eliminated : 0
% 0.14/0.63 % Clauses deleted for lack of memory : 0
% 0.14/0.63 % Backward-subsumed : 3
% 0.14/0.63 % Backward-rewritten : 0
% 0.14/0.63 % Generated clauses : 36
% 0.14/0.63 % ...of the previous two non-redundant : 30
% 0.14/0.63 % ...aggressively subsumed : 0
% 0.14/0.63 % Contextual simplify-reflections : 10
% 0.14/0.63 % Paramodulations : 36
% 0.14/0.63 % Factorizations : 0
% 0.14/0.63 % NegExts : 0
% 0.14/0.63 % Equation resolutions : 0
% 0.14/0.63 % Disequality decompositions : 0
% 0.14/0.63 % Total rewrite steps : 0
% 0.14/0.63 % ...of those cached : 0
% 0.14/0.63 % Propositional unsat checks : 0
% 0.14/0.63 % Propositional check models : 0
% 0.14/0.63 % Propositional check unsatisfiable : 0
% 0.14/0.63 % Propositional clauses : 0
% 0.14/0.63 % Propositional clauses after purity: 0
% 0.14/0.63 % Propositional unsat core size : 0
% 0.14/0.63 % Propositional preprocessing time : 0.000
% 0.14/0.63 % Propositional encoding time : 0.000
% 0.14/0.63 % Propositional solver time : 0.000
% 0.14/0.63 % Success case prop preproc time : 0.000
% 0.14/0.63 % Success case prop encoding time : 0.000
% 0.14/0.63 % Success case prop solver time : 0.000
% 0.14/0.63 % Current number of processed clauses : 24
% 0.14/0.63 % Positive orientable unit clauses : 1
% 0.14/0.63 % Positive unorientable unit clauses: 0
% 0.14/0.63 % Negative unit clauses : 0
% 0.14/0.63 % Non-unit-clauses : 23
% 0.14/0.63 % Current number of unprocessed clauses: 0
% 0.14/0.63 % ...number of literals in the above : 0
% 0.14/0.63 % Current number of archived formulas : 0
% 0.14/0.63 % Current number of archived clauses : 3
% 0.14/0.63 % Clause-clause subsumption calls (NU) : 43
% 0.14/0.63 % Rec. Clause-clause subsumption calls : 25
% 0.14/0.63 % Non-unit clause-clause subsumptions : 23
% 0.14/0.63 % Unit Clause-clause subsumption calls : 0
% 0.14/0.63 % Rewrite failures with RHS unbound : 0
% 0.14/0.63 % BW rewrite match attempts : 0
% 0.14/0.63 % BW rewrite match successes : 0
% 0.14/0.63 % Condensation attempts : 0
% 0.14/0.63 % Condensation successes : 0
% 0.14/0.63 % Termbank termtop insertions : 1753
% 0.14/0.63 % Search garbage collected termcells : 175
% 0.14/0.63
% 0.14/0.63 % -------------------------------------------------
% 0.14/0.63 % User time : 0.004 s
% 0.14/0.63 % System time : 0.003 s
% 0.14/0.63 % Total time : 0.008 s
% 0.14/0.63 % Maximum resident set size: 3628 pages
% 0.14/0.63
% 0.14/0.63 % -------------------------------------------------
% 0.14/0.63 % User time : 0.017 s
% 0.14/0.63 % System time : 0.015 s
% 0.14/0.63 % Total time : 0.032 s
% 0.14/0.63 % Maximum resident set size: 4864 pages
% 0.14/0.63 % E exiting
%------------------------------------------------------------------------------