%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWW971_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 : n009.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:11:29 PM UTC 2026
% Result : CounterSatisfiable 0.11s 0.42s
% Output : Saturation 0.11s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_9ERROR: Could not build tree for root c_0_25ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
tcf(c_0_12,plain,
( ~ p('$ki_local_world',a)
| p('$ki_local_world',b) ),
inference(split_conjunct,[status(thm)],[c_0_8]),
[final] ).
tcf(c_0_16,plain,
! [X1: '$ki_world',X3,X2: '$ki_world'] :
( ~ '$ki_accessible'(X1,X2)
| ~ '$ki_exists_in_world_$i'(X1,X3)
| '$ki_exists_in_world_$i'(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]),
[final] ).
tcf(c_0_17,plain,
( ~ r('$ki_local_world',a)
| '$ki_accessible'('$ki_local_world',esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_10]),
[final] ).
tcf(c_0_18,plain,
( r('$ki_local_world',a)
| '$ki_accessible'('$ki_local_world',esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_10]),
[final] ).
tcf(c_0_19,plain,
( ~ p('$ki_local_world',a)
| '$ki_accessible'('$ki_local_world',esk5_0) ),
inference(csr,[status(thm)],[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_13]),
[final] ).
tcf(c_0_22,plain,
! [X3] :
( ~ '$ki_exists_in_world_$i'('$ki_local_world',X3)
| ~ p('$ki_local_world',X3)
| r('$ki_local_world',X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]),
[final] ).
tcf(c_0_23,plain,
! [X1: '$ki_world'] : '$ki_exists_in_world_$i'(X1,esk2_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_15]),
[final] ).
tcf(c_0_24,plain,
! [X3] :
( ~ '$ki_exists_in_world_$i'('$ki_local_world',X3)
| ~ r('$ki_local_world',X3)
| p('$ki_local_world',X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]),
[final] ).
tcf(c_0_25,plain,
! [X3] :
( ~ r('$ki_local_world',a)
| ~ '$ki_exists_in_world_$i'('$ki_local_world',X3)
| '$ki_exists_in_world_$i'(esk3_0,X3) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]),
[final] ).
tcf(c_0_26,plain,
! [X3] :
( ~ '$ki_exists_in_world_$i'('$ki_local_world',X3)
| r('$ki_local_world',a)
| '$ki_exists_in_world_$i'(esk4_0,X3) ),
inference(spm,[status(thm)],[c_0_16,c_0_18]),
[final] ).
tcf(c_0_27,plain,
! [X3] :
( ~ p('$ki_local_world',a)
| ~ '$ki_exists_in_world_$i'('$ki_local_world',X3)
| '$ki_exists_in_world_$i'(esk5_0,X3) ),
inference(spm,[status(thm)],[c_0_16,c_0_19]),
[final] ).
tcf(c_0_28,plain,
! [X1: '$ki_world',X3] :
( ~ '$ki_exists_in_world_$i'(X1,X3)
| '$ki_exists_in_world_$i'(esk1_1(X1),X3) ),
inference(spm,[status(thm)],[c_0_16,c_0_20]),
[final] ).
tcf(c_0_29,plain,
( ~ p(esk5_0,b)
| ~ p('$ki_local_world',a) ),
inference(csr,[status(thm)],[c_0_21,c_0_12]),
[final] ).
tcf(c_0_30,plain,
( ~ p('$ki_local_world',esk2_1('$ki_local_world'))
| r('$ki_local_world',esk2_1('$ki_local_world')) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]),
[final] ).
tcf(c_0_31,plain,
( ~ r('$ki_local_world',esk2_1('$ki_local_world'))
| p('$ki_local_world',esk2_1('$ki_local_world')) ),
inference(spm,[status(thm)],[c_0_24,c_0_23]),
[final] ).
tcf(c_0_32,plain,
( ~ r('$ki_local_world',a)
| r(esk3_0,b) ),
inference(split_conjunct,[status(thm)],[c_0_10]),
[final] ).
tcf(c_0_33,plain,
( ~ r('$ki_local_world',a)
| r('$ki_local_world',c) ),
inference(split_conjunct,[status(thm)],[c_0_10]),
[final] ).
tcf(c_0_34,plain,
( ~ r('$ki_local_world',a)
| r('$ki_local_world',b) ),
inference(split_conjunct,[status(thm)],[c_0_10]),
[final] ).
tcf(c_0_35,plain,
( ~ r(esk4_0,c)
| r('$ki_local_world',a) ),
inference(split_conjunct,[status(thm)],[c_0_10]),
[final] ).
tcf(c_0_36,plain,
( ~ r(esk4_0,b)
| r('$ki_local_world',a) ),
inference(split_conjunct,[status(thm)],[c_0_10]),
[final] ).
tcf(c_0_37,plain,
( ~ r('$ki_local_world',c)
| r('$ki_local_world',a) ),
inference(split_conjunct,[status(thm)],[c_0_10]),
[final] ).
tcf(c_0_38,plain,
( ~ p('$ki_local_world',b)
| p('$ki_local_world',c) ),
inference(split_conjunct,[status(thm)],[c_0_8]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWW971_15 : 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 : n009.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 10:21:13 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.40 Running first-order theorem proving
% 0.11/0.40 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.42 % Version: 3.5.1
% 0.11/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.42 % Starting sh5l with 300s (1) cores
% 0.11/0.42 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1507473 completed with status 1
% 0.11/0.42 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.11/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.42 % No SInE strategy applied
% 0.11/0.42 % Search class: FGHNS-FFSF11-SFFFFFNN
% 0.11/0.42 % partial match(1): FGHNF-FFSF11-SFFFFFNN
% 0.11/0.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.42 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.11/0.42 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.11/0.42 % Starting new_bool_3 with 136s (1) cores
% 0.11/0.42 % Starting new_bool_1 with 136s (1) cores
% 0.11/0.42 % SubtermCWHack with pid 1507480 completed with status 1
% 0.11/0.42 % Result found by SubtermCWHack
% 0.11/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.42 % No SInE strategy applied
% 0.11/0.42 % Search class: FGHNS-FFSF11-SFFFFFNN
% 0.11/0.42 % partial match(1): FGHNF-FFSF11-SFFFFFNN
% 0.11/0.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.42 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.42 % Preprocessing time : 0.001 s
% 0.11/0.42
% 0.11/0.42 % No proof found!
% 0.11/0.42 % SZS status CounterSatisfiable
% 0.11/0.42 % SZS output start Saturation
% See solution above
% 0.11/0.42 % Parsed axioms : 16
% 0.11/0.42 % Removed by relevancy pruning/SinE : 0
% 0.11/0.42 % Initial clauses : 27
% 0.11/0.42 % Removed in clause preprocessing : 10
% 0.11/0.42 % Initial clauses in saturation : 17
% 0.11/0.42 % Processed clauses : 23
% 0.11/0.42 % ...of these trivial : 0
% 0.11/0.42 % ...subsumed : 0
% 0.11/0.42 % ...remaining for further processing : 23
% 0.11/0.42 % Other redundant clauses eliminated : 0
% 0.11/0.42 % Clauses deleted for lack of memory : 0
% 0.11/0.42 % Backward-subsumed : 0
% 0.11/0.42 % Backward-rewritten : 0
% 0.11/0.42 % Generated clauses : 8
% 0.11/0.42 % ...of the previous two non-redundant : 6
% 0.11/0.42 % ...aggressively subsumed : 0
% 0.11/0.42 % Contextual simplify-reflections : 2
% 0.11/0.42 % Paramodulations : 8
% 0.11/0.42 % Factorizations : 0
% 0.11/0.42 % NegExts : 0
% 0.11/0.42 % Equation resolutions : 0
% 0.11/0.42 % Disequality decompositions : 0
% 0.11/0.42 % Total rewrite steps : 0
% 0.11/0.42 % ...of those cached : 0
% 0.11/0.42 % Propositional unsat checks : 0
% 0.11/0.42 % Propositional check models : 0
% 0.11/0.42 % Propositional check unsatisfiable : 0
% 0.11/0.42 % Propositional clauses : 0
% 0.11/0.42 % Propositional clauses after purity: 0
% 0.11/0.42 % Propositional unsat core size : 0
% 0.11/0.42 % Propositional preprocessing time : 0.000
% 0.11/0.42 % Propositional encoding time : 0.000
% 0.11/0.42 % Propositional solver time : 0.000
% 0.11/0.42 % Success case prop preproc time : 0.000
% 0.11/0.42 % Success case prop encoding time : 0.000
% 0.11/0.42 % Success case prop solver time : 0.000
% 0.11/0.42 % Current number of processed clauses : 23
% 0.11/0.42 % Positive orientable unit clauses : 2
% 0.11/0.42 % Positive unorientable unit clauses: 0
% 0.11/0.42 % Negative unit clauses : 0
% 0.11/0.42 % Non-unit-clauses : 21
% 0.11/0.42 % Current number of unprocessed clauses: 0
% 0.11/0.42 % ...number of literals in the above : 0
% 0.11/0.42 % Current number of archived formulas : 0
% 0.11/0.42 % Current number of archived clauses : 0
% 0.11/0.42 % Clause-clause subsumption calls (NU) : 23
% 0.11/0.42 % Rec. Clause-clause subsumption calls : 23
% 0.11/0.42 % Non-unit clause-clause subsumptions : 2
% 0.11/0.42 % Unit Clause-clause subsumption calls : 0
% 0.11/0.42 % Rewrite failures with RHS unbound : 0
% 0.11/0.42 % BW rewrite match attempts : 0
% 0.11/0.42 % BW rewrite match successes : 0
% 0.11/0.42 % Condensation attempts : 0
% 0.11/0.42 % Condensation successes : 0
% 0.11/0.42 % Termbank termtop insertions : 1325
% 0.11/0.42 % Search garbage collected termcells : 136
% 0.11/0.42
% 0.11/0.42 % -------------------------------------------------
% 0.11/0.42 % User time : 0.006 s
% 0.11/0.42 % System time : 0.003 s
% 0.11/0.42 % Total time : 0.009 s
% 0.11/0.42 % Maximum resident set size: 3640 pages
% 0.11/0.42
% 0.11/0.42 % -------------------------------------------------
% 0.11/0.42 % User time : 0.022 s
% 0.11/0.42 % System time : 0.010 s
% 0.11/0.42 % Total time : 0.032 s
% 0.11/0.42 % Maximum resident set size: 4864 pages
% 0.11/0.42 % E exiting
%------------------------------------------------------------------------------