%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : LCL970_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 : 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:24:36 PM UTC 2026
% Result : CounterSatisfiable 0.22s 5.56s
% Output : Saturation 0.22s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_5ERROR: Could not build tree for root c_0_22ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
tcf(c_0_7,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_5]),
[final] ).
tcf(c_0_8,negated_conjecture,
! [X3] :
( ~ '$ki_exists_in_world_$i'('$ki_local_world',X3)
| '$ki_accessible'(esk3_1(X3),esk5_1(X3)) ),
inference(split_conjunct,[status(thm)],[c_0_6]),
[final] ).
tcf(c_0_9,negated_conjecture,
! [X3] :
( ~ '$ki_exists_in_world_$i'('$ki_local_world',X3)
| '$ki_accessible'('$ki_local_world',esk3_1(X3)) ),
inference(split_conjunct,[status(thm)],[c_0_6]),
[final] ).
tcf(c_0_12,negated_conjecture,
! [X4,X3] :
( ~ '$ki_exists_in_world_$i'('$ki_local_world',X3)
| ~ '$ki_exists_in_world_$i'(esk3_1(X3),X4)
| '$ki_exists_in_world_$i'(esk5_1(X3),X4) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]),
[final] ).
tcf(c_0_13,negated_conjecture,
! [X4,X3] :
( ~ '$ki_exists_in_world_$i'('$ki_local_world',X3)
| ~ '$ki_exists_in_world_$i'('$ki_local_world',X4)
| '$ki_exists_in_world_$i'(esk3_1(X3),X4) ),
inference(spm,[status(thm)],[c_0_7,c_0_9]),
[final] ).
tcf(c_0_14,plain,
! [X1: '$ki_world'] : '$ki_exists_in_world_$i'(X1,esk2_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_10]),
[final] ).
tcf(c_0_15,negated_conjecture,
! [X3] :
( ~ '$ki_exists_in_world_$i'('$ki_local_world',X3)
| ~ big_q(esk6_1(X3),X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]),
[final] ).
tcf(c_0_16,negated_conjecture,
! [X1: '$ki_world',X3] :
( ~ '$ki_exists_in_world_$i'('$ki_local_world',X3)
| ~ '$ki_accessible'(esk5_1(X3),X1)
| big_q(X1,esk4_1(X3)) ),
inference(split_conjunct,[status(thm)],[c_0_6]),
[final] ).
tcf(c_0_17,negated_conjecture,
! [X3] :
( ~ '$ki_exists_in_world_$i'('$ki_local_world',X3)
| '$ki_exists_in_world_$i'(esk3_1(X3),esk4_1(X3)) ),
inference(split_conjunct,[status(thm)],[c_0_6]),
[final] ).
tcf(c_0_18,negated_conjecture,
! [X3] :
( ~ '$ki_exists_in_world_$i'('$ki_local_world',X3)
| '$ki_accessible'(esk5_1(X3),esk6_1(X3)) ),
inference(split_conjunct,[status(thm)],[c_0_6]),
[final] ).
tcf(c_0_19,negated_conjecture,
! [X3] :
( ~ '$ki_exists_in_world_$i'('$ki_local_world',X3)
| '$ki_accessible'(esk5_1(X3),esk7_1(X3)) ),
inference(split_conjunct,[status(thm)],[c_0_6]),
[final] ).
tcf(c_0_20,negated_conjecture,
! [X1: '$ki_world',X3] :
( ~ '$ki_exists_in_world_$i'('$ki_local_world',X3)
| ~ '$ki_accessible'(esk5_1(X3),X1)
| big_p(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]),
[final] ).
tcf(c_0_21,plain,
! [X1: '$ki_world'] : '$ki_accessible'(X1,esk1_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_11]),
[final] ).
tcf(c_0_22,negated_conjecture,
! [X3,X4] :
( ~ '$ki_exists_in_world_$i'('$ki_local_world',X4)
| ~ '$ki_exists_in_world_$i'('$ki_local_world',X3)
| '$ki_exists_in_world_$i'(esk5_1(X3),X4) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]),
[final] ).
tcf(c_0_23,negated_conjecture,
! [X3] :
( ~ '$ki_exists_in_world_$i'('$ki_local_world',X3)
| '$ki_exists_in_world_$i'(esk5_1(X3),esk2_1(esk3_1(X3))) ),
inference(spm,[status(thm)],[c_0_12,c_0_14]),
[final] ).
tcf(c_0_24,negated_conjecture,
! [X3] :
( ~ '$ki_accessible'(esk5_1(X3),esk6_1(esk4_1(X3)))
| ~ '$ki_exists_in_world_$i'('$ki_local_world',X3)
| ~ '$ki_exists_in_world_$i'('$ki_local_world',esk4_1(X3)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]),
[final] ).
tcf(c_0_25,negated_conjecture,
! [X3] :
( ~ '$ki_exists_in_world_$i'('$ki_local_world',X3)
| '$ki_exists_in_world_$i'(esk5_1(X3),esk4_1(X3)) ),
inference(spm,[status(thm)],[c_0_12,c_0_17]),
[final] ).
tcf(c_0_26,negated_conjecture,
! [X4,X3] :
( ~ '$ki_exists_in_world_$i'('$ki_local_world',X3)
| ~ '$ki_exists_in_world_$i'(esk5_1(X3),X4)
| '$ki_exists_in_world_$i'(esk6_1(X3),X4) ),
inference(spm,[status(thm)],[c_0_7,c_0_18]),
[final] ).
tcf(c_0_27,negated_conjecture,
! [X4,X3] :
( ~ '$ki_exists_in_world_$i'('$ki_local_world',X3)
| ~ '$ki_exists_in_world_$i'(esk5_1(X3),X4)
| '$ki_exists_in_world_$i'(esk7_1(X3),X4) ),
inference(spm,[status(thm)],[c_0_7,c_0_19]),
[final] ).
tcf(c_0_28,negated_conjecture,
! [X3] :
( ~ '$ki_exists_in_world_$i'('$ki_local_world',X3)
| big_p(esk1_1(esk5_1(X3)),X3) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]),
[final] ).
tcf(c_0_29,negated_conjecture,
! [X3] :
( ~ '$ki_exists_in_world_$i'('$ki_local_world',X3)
| big_p(esk6_1(X3),X3) ),
inference(spm,[status(thm)],[c_0_20,c_0_18]),
[final] ).
tcf(c_0_30,negated_conjecture,
! [X3] :
( ~ '$ki_exists_in_world_$i'('$ki_local_world',X3)
| big_p(esk7_1(X3),X3) ),
inference(spm,[status(thm)],[c_0_20,c_0_19]),
[final] ).
tcf(c_0_31,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_7,c_0_21]),
[final] ).
tcf(c_0_32,negated_conjecture,
! [X3] :
( ~ '$ki_exists_in_world_$i'('$ki_local_world',X3)
| ~ big_p(esk7_1(X3),esk4_1(X3)) ),
inference(split_conjunct,[status(thm)],[c_0_6]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL970_15 : TPTP v9.3.1. Released v8.2.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/5.46 % Computer : n010.cluster.edu
% 0.18/5.46 % Model : x86_64 x86_64
% 0.18/5.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/5.46 % Memory : 8046.5625MB
% 0.18/5.46 % OS : Linux 6.8.0-71-generic
% 0.18/5.46 % CPULimit : 300
% 0.18/5.46 % WCLimit : 300
% 0.18/5.46 % DateTime : Mon Sep 21 01:15:30 UTC 2026
% 0.18/5.46 % CPUTime :
% 0.18/5.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.22/5.53 Running first-order theorem proving
% 0.22/5.53 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.22/5.56 % Version: 3.5.1
% 0.22/5.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/5.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/5.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/5.56 % Starting new_bool_3 with 300s (1) cores
% 0.22/5.56 % Starting new_bool_1 with 300s (1) cores
% 0.22/5.56 % Starting sh5l with 300s (1) cores
% 0.22/5.56 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3937794 completed with status 1
% 0.22/5.56 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.22/5.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/5.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/5.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/5.56 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/5.56 % No SInE strategy applied
% 0.22/5.56 % Search class: FHHNS-FFSF11-SFFFFFNN
% 0.22/5.56 % partial match(1): FHHNF-FFSF11-SFFFFFNN
% 0.22/5.56 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/5.56 % Starting SubtermCWHack with 136s (1) cores
% 0.22/5.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.22/5.56 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.22/5.56 % Starting new_bool_3 with 136s (1) cores
% 0.22/5.56 % Starting new_bool_1 with 136s (1) cores
% 0.22/5.56 % SubtermCWHack with pid 3937799 completed with status 1
% 0.22/5.56 % Result found by SubtermCWHack
% 0.22/5.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/5.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/5.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/5.56 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/5.56 % No SInE strategy applied
% 0.22/5.56 % Search class: FHHNS-FFSF11-SFFFFFNN
% 0.22/5.56 % partial match(1): FHHNF-FFSF11-SFFFFFNN
% 0.22/5.56 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/5.56 % Starting SubtermCWHack with 136s (1) cores
% 0.22/5.56 % Preprocessing time : 0.002 s
% 0.22/5.56
% 0.22/5.56 % No proof found!
% 0.22/5.56 % SZS status CounterSatisfiable
% 0.22/5.56 % SZS output start Saturation
% See solution above
% 0.22/5.56 % Parsed axioms : 10
% 0.22/5.56 % Removed by relevancy pruning/SinE : 0
% 0.22/5.56 % Initial clauses : 18
% 0.22/5.56 % Removed in clause preprocessing : 6
% 0.22/5.56 % Initial clauses in saturation : 12
% 0.22/5.56 % Processed clauses : 24
% 0.22/5.56 % ...of these trivial : 0
% 0.22/5.56 % ...subsumed : 0
% 0.22/5.56 % ...remaining for further processing : 24
% 0.22/5.56 % Other redundant clauses eliminated : 0
% 0.22/5.56 % Clauses deleted for lack of memory : 0
% 0.22/5.56 % Backward-subsumed : 0
% 0.22/5.56 % Backward-rewritten : 0
% 0.22/5.56 % Generated clauses : 12
% 0.22/5.56 % ...of the previous two non-redundant : 12
% 0.22/5.56 % ...aggressively subsumed : 0
% 0.22/5.56 % Contextual simplify-reflections : 0
% 0.22/5.56 % Paramodulations : 12
% 0.22/5.56 % Factorizations : 0
% 0.22/5.56 % NegExts : 0
% 0.22/5.56 % Equation resolutions : 0
% 0.22/5.56 % Disequality decompositions : 0
% 0.22/5.56 % Total rewrite steps : 0
% 0.22/5.56 % ...of those cached : 0
% 0.22/5.56 % Propositional unsat checks : 0
% 0.22/5.56 % Propositional check models : 0
% 0.22/5.56 % Propositional check unsatisfiable : 0
% 0.22/5.56 % Propositional clauses : 0
% 0.22/5.56 % Propositional clauses after purity: 0
% 0.22/5.56 % Propositional unsat core size : 0
% 0.22/5.56 % Propositional preprocessing time : 0.000
% 0.22/5.56 % Propositional encoding time : 0.000
% 0.22/5.56 % Propositional solver time : 0.000
% 0.22/5.56 % Success case prop preproc time : 0.000
% 0.22/5.56 % Success case prop encoding time : 0.000
% 0.22/5.56 % Success case prop solver time : 0.000
% 0.22/5.56 % Current number of processed clauses : 24
% 0.22/5.56 % Positive orientable unit clauses : 2
% 0.22/5.56 % Positive unorientable unit clauses: 0
% 0.22/5.56 % Negative unit clauses : 0
% 0.22/5.56 % Non-unit-clauses : 22
% 0.22/5.56 % Current number of unprocessed clauses: 0
% 0.22/5.56 % ...number of literals in the above : 0
% 0.22/5.56 % Current number of archived formulas : 0
% 0.22/5.56 % Current number of archived clauses : 0
% 0.22/5.56 % Clause-clause subsumption calls (NU) : 85
% 0.22/5.56 % Rec. Clause-clause subsumption calls : 65
% 0.22/5.56 % Non-unit clause-clause subsumptions : 0
% 0.22/5.56 % Unit Clause-clause subsumption calls : 0
% 0.22/5.56 % Rewrite failures with RHS unbound : 0
% 0.22/5.56 % BW rewrite match attempts : 0
% 0.22/5.56 % BW rewrite match successes : 0
% 0.22/5.56 % Condensation attempts : 0
% 0.22/5.56 % Condensation successes : 0
% 0.22/5.56 % Termbank termtop insertions : 1283
% 0.22/5.56 % Search garbage collected termcells : 242
% 0.22/5.56
% 0.22/5.56 % -------------------------------------------------
% 0.22/5.56 % User time : 0.008 s
% 0.22/5.56 % System time : 0.003 s
% 0.22/5.56 % Total time : 0.011 s
% 0.22/5.56 % Maximum resident set size: 3636 pages
% 0.22/5.56
% 0.22/5.56 % -------------------------------------------------
% 0.22/5.56 % User time : 0.030 s
% 0.22/5.56 % System time : 0.014 s
% 0.22/5.56 % Total time : 0.044 s
% 0.22/5.56 % Maximum resident set size: 4608 pages
% 0.22/5.56 % E exiting
%------------------------------------------------------------------------------