%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYO906_7 : 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 : n017.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:48:59 PM UTC 2026
% Result : CounterSatisfiable 0.26s 0.54s
% Output : Saturation 0.26s
% 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_5,negated_conjecture,
! [X1: '$ki_world',X2,X4] :
( ~ g(X1,X4)
| ~ '$ki_exists_in_world_$i'(X1,X4)
| ~ '$ki_accessible'('$ki_local_world',X1)
| ~ '$ki_exists_in_world_$i'('$ki_local_world',X2)
| ~ g(esk5_1(X2),X2)
| f(X1,X4)
| f(esk6_1(X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_6,negated_conjecture,
! [X1: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X1)
| '$ki_exists_in_world_$i'(esk2_0,esk3_0)
| g(X1,esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_7,negated_conjecture,
! [X1: '$ki_world',X2,X4] :
( ~ g(X1,X4)
| ~ '$ki_exists_in_world_$i'(X1,X4)
| ~ '$ki_accessible'('$ki_local_world',X1)
| ~ '$ki_exists_in_world_$i'('$ki_local_world',X2)
| f(X1,X4)
| '$ki_accessible'('$ki_local_world',esk5_1(X2))
| f(esk6_1(X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_8,negated_conjecture,
( '$ki_exists_in_world_$i'(esk2_0,esk3_0)
| '$ki_exists_in_world_$i'('$ki_local_world',esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_9,negated_conjecture,
! [X1: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X1)
| '$ki_accessible'('$ki_local_world',esk2_0)
| g(X1,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_exists_in_world_$i'('$ki_local_world',esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_11,negated_conjecture,
! [X1: '$ki_world',X2,X4] :
( ~ g(X1,X4)
| ~ '$ki_exists_in_world_$i'(X1,X4)
| ~ '$ki_accessible'('$ki_local_world',X1)
| ~ '$ki_exists_in_world_$i'('$ki_local_world',X2)
| ~ g(esk5_1(X2),X2)
| f(X1,X4)
| '$ki_accessible'('$ki_local_world',esk6_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_12,negated_conjecture,
! [X1: '$ki_world',X2,X4] :
( ~ g(X1,X4)
| ~ '$ki_exists_in_world_$i'(X1,X4)
| ~ '$ki_accessible'('$ki_local_world',X1)
| ~ '$ki_exists_in_world_$i'('$ki_local_world',X2)
| f(X1,X4)
| '$ki_accessible'('$ki_local_world',esk5_1(X2))
| '$ki_accessible'('$ki_local_world',esk6_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_13,plain,
! [X1: '$ki_world'] : '$ki_exists_in_world_$i'(X1,esk1_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_4]),
[final] ).
tcf(c_0_14,negated_conjecture,
! [X2,X1: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X1)
| ~ g(X1,X2)
| ~ '$ki_exists_in_world_$i'(X1,X2)
| f(X1,X2)
| f(esk6_1(esk4_0),esk4_0)
| '$ki_exists_in_world_$i'(esk2_0,esk3_0) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7]),c_0_8]),
[final] ).
tcf(c_0_15,negated_conjecture,
! [X2,X1: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X1)
| ~ g(X1,X2)
| ~ '$ki_exists_in_world_$i'(X1,X2)
| '$ki_accessible'('$ki_local_world',esk2_0)
| f(X1,X2)
| f(esk6_1(esk4_0),esk4_0) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_9]),c_0_7]),c_0_10]),
[final] ).
tcf(c_0_16,negated_conjecture,
! [X2,X1: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X1)
| ~ g(X1,X2)
| ~ '$ki_exists_in_world_$i'(X1,X2)
| '$ki_accessible'('$ki_local_world',esk6_1(esk4_0))
| f(X1,X2)
| '$ki_exists_in_world_$i'(esk2_0,esk3_0) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_6]),c_0_12]),c_0_8]),
[final] ).
tcf(c_0_17,negated_conjecture,
! [X2,X1: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X1)
| ~ g(X1,X2)
| ~ '$ki_exists_in_world_$i'(X1,X2)
| '$ki_accessible'('$ki_local_world',esk2_0)
| '$ki_accessible'('$ki_local_world',esk6_1(esk4_0))
| f(X1,X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_9]),c_0_12]),c_0_10]),
[final] ).
tcf(c_0_18,negated_conjecture,
! [X2,X1: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X1)
| ~ g(X1,X2)
| ~ '$ki_exists_in_world_$i'(X1,X2)
| '$ki_accessible'('$ki_local_world',esk5_1(esk1_1('$ki_local_world')))
| f(X1,X2)
| f(esk6_1(esk1_1('$ki_local_world')),esk1_1('$ki_local_world')) ),
inference(spm,[status(thm)],[c_0_7,c_0_13]),
[final] ).
tcf(c_0_19,negated_conjecture,
! [X2,X1: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X1)
| ~ g(X1,X2)
| ~ '$ki_exists_in_world_$i'(X1,X2)
| '$ki_accessible'('$ki_local_world',esk6_1(esk1_1('$ki_local_world')))
| '$ki_accessible'('$ki_local_world',esk5_1(esk1_1('$ki_local_world')))
| f(X1,X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]),
[final] ).
tcf(c_0_20,negated_conjecture,
! [X1: '$ki_world'] :
( ~ f(esk2_0,esk3_0)
| ~ f(X1,esk4_0)
| ~ '$ki_accessible'('$ki_local_world',X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_21,negated_conjecture,
! [X1: '$ki_world'] :
( ~ f(X1,esk4_0)
| ~ '$ki_accessible'('$ki_local_world',X1)
| '$ki_exists_in_world_$i'(esk2_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_22,negated_conjecture,
! [X1: '$ki_world'] :
( ~ f(X1,esk4_0)
| ~ '$ki_accessible'('$ki_local_world',X1)
| g(esk2_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_23,negated_conjecture,
! [X1: '$ki_world'] :
( ~ f(X1,esk4_0)
| ~ '$ki_accessible'('$ki_local_world',X1)
| '$ki_accessible'('$ki_local_world',esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_24,negated_conjecture,
! [X1: '$ki_world'] :
( ~ f(esk2_0,esk3_0)
| ~ '$ki_accessible'('$ki_local_world',X1)
| g(X1,esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_25,negated_conjecture,
! [X1: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X1)
| g(esk2_0,esk3_0)
| g(X1,esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_26,negated_conjecture,
( ~ f(esk2_0,esk3_0)
| '$ki_exists_in_world_$i'('$ki_local_world',esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
tcf(c_0_27,negated_conjecture,
( g(esk2_0,esk3_0)
| '$ki_exists_in_world_$i'('$ki_local_world',esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SYO906_7 : TPTP v9.3.1. Released v8.2.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.44 % Computer : n017.cluster.edu
% 0.17/0.44 % Model : x86_64 x86_64
% 0.17/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.44 % Memory : 8046.5625MB
% 0.17/0.44 % OS : Linux 6.8.0-71-generic
% 0.17/0.44 % CPULimit : 300
% 0.17/0.44 % WCLimit : 300
% 0.17/0.44 % DateTime : Mon Sep 21 12:26:27 UTC 2026
% 0.17/0.44 % CPUTime :
% 0.17/0.44 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.26/0.51 Running first-order theorem proving
% 0.26/0.51 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.26/0.54 % Version: 3.5.1
% 0.26/0.54 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.26/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.54 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.26/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.54 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.54 % Starting sh5l with 300s (1) cores
% 0.26/0.54 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 2300197 completed with status 1
% 0.26/0.54 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.26/0.54 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.26/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.54 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.26/0.54 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.26/0.54 % No SInE strategy applied
% 0.26/0.54 % Search class: FGHNF-FFSS11-SFFFFFNN
% 0.26/0.54 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.26/0.54 % Starting SubtermCWHack with 136s (1) cores
% 0.26/0.54 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.26/0.54 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.26/0.54 % Starting new_bool_3 with 136s (1) cores
% 0.26/0.54 % Starting new_bool_1 with 136s (1) cores
% 0.26/0.54 % SubtermCWHack with pid 2300202 completed with status 1
% 0.26/0.54 % Result found by SubtermCWHack
% 0.26/0.54 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.26/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.54 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.26/0.54 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.26/0.54 % No SInE strategy applied
% 0.26/0.54 % Search class: FGHNF-FFSS11-SFFFFFNN
% 0.26/0.54 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.26/0.54 % Starting SubtermCWHack with 136s (1) cores
% 0.26/0.54 % Preprocessing time : 0.002 s
% 0.26/0.54
% 0.26/0.54 % No proof found!
% 0.26/0.54 % SZS status CounterSatisfiable
% 0.26/0.54 % SZS output start Saturation
% See solution above
% 0.26/0.54 % Parsed axioms : 8
% 0.26/0.54 % Removed by relevancy pruning/SinE : 0
% 0.26/0.54 % Initial clauses : 23
% 0.26/0.54 % Removed in clause preprocessing : 6
% 0.26/0.54 % Initial clauses in saturation : 17
% 0.26/0.54 % Processed clauses : 25
% 0.26/0.54 % ...of these trivial : 0
% 0.26/0.54 % ...subsumed : 0
% 0.26/0.54 % ...remaining for further processing : 25
% 0.26/0.54 % Other redundant clauses eliminated : 0
% 0.26/0.54 % Clauses deleted for lack of memory : 0
% 0.26/0.54 % Backward-subsumed : 2
% 0.26/0.54 % Backward-rewritten : 0
% 0.26/0.54 % Generated clauses : 8
% 0.26/0.54 % ...of the previous two non-redundant : 8
% 0.26/0.54 % ...aggressively subsumed : 0
% 0.26/0.54 % Contextual simplify-reflections : 8
% 0.26/0.54 % Paramodulations : 8
% 0.26/0.54 % Factorizations : 0
% 0.26/0.54 % NegExts : 0
% 0.26/0.54 % Equation resolutions : 0
% 0.26/0.54 % Disequality decompositions : 0
% 0.26/0.54 % Total rewrite steps : 0
% 0.26/0.54 % ...of those cached : 0
% 0.26/0.54 % Propositional unsat checks : 0
% 0.26/0.54 % Propositional check models : 0
% 0.26/0.54 % Propositional check unsatisfiable : 0
% 0.26/0.54 % Propositional clauses : 0
% 0.26/0.54 % Propositional clauses after purity: 0
% 0.26/0.54 % Propositional unsat core size : 0
% 0.26/0.54 % Propositional preprocessing time : 0.000
% 0.26/0.54 % Propositional encoding time : 0.000
% 0.26/0.54 % Propositional solver time : 0.000
% 0.26/0.54 % Success case prop preproc time : 0.000
% 0.26/0.54 % Success case prop encoding time : 0.000
% 0.26/0.54 % Success case prop solver time : 0.000
% 0.26/0.54 % Current number of processed clauses : 23
% 0.26/0.54 % Positive orientable unit clauses : 1
% 0.26/0.54 % Positive unorientable unit clauses: 0
% 0.26/0.54 % Negative unit clauses : 0
% 0.26/0.54 % Non-unit-clauses : 22
% 0.26/0.54 % Current number of unprocessed clauses: 0
% 0.26/0.54 % ...number of literals in the above : 0
% 0.26/0.54 % Current number of archived formulas : 0
% 0.26/0.54 % Current number of archived clauses : 2
% 0.26/0.54 % Clause-clause subsumption calls (NU) : 49
% 0.26/0.54 % Rec. Clause-clause subsumption calls : 13
% 0.26/0.54 % Non-unit clause-clause subsumptions : 10
% 0.26/0.54 % Unit Clause-clause subsumption calls : 0
% 0.26/0.54 % Rewrite failures with RHS unbound : 0
% 0.26/0.54 % BW rewrite match attempts : 0
% 0.26/0.54 % BW rewrite match successes : 0
% 0.26/0.54 % Condensation attempts : 0
% 0.26/0.54 % Condensation successes : 0
% 0.26/0.54 % Termbank termtop insertions : 1915
% 0.26/0.54 % Search garbage collected termcells : 264
% 0.26/0.54
% 0.26/0.54 % -------------------------------------------------
% 0.26/0.54 % User time : 0.007 s
% 0.26/0.54 % System time : 0.005 s
% 0.26/0.54 % Total time : 0.012 s
% 0.26/0.54 % Maximum resident set size: 3376 pages
% 0.26/0.54
% 0.26/0.54 % -------------------------------------------------
% 0.26/0.54 % User time : 0.025 s
% 0.26/0.54 % System time : 0.025 s
% 0.26/0.54 % Total time : 0.050 s
% 0.26/0.54 % Maximum resident set size: 4352 pages
% 0.26/0.54 % E exiting
%------------------------------------------------------------------------------