%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SYO902_8 : TPTP v9.3.1. Released v8.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n013.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:52:32 PM UTC 2026
% Result : Theorem 0.13s 0.42s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of formulae : 13 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 38 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 40 ( 15 ~; 10 |; 11 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 22 ( 0 sgn 14 !; 8 ?; 22 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
'$ki_world': $tType ).
tff(decl_23,type,
'$ki_local_world': '$ki_world' ).
tff(decl_24,type,
'$ki_accessible': ( '$ki_world' * '$ki_world' ) > $o ).
tff(decl_25,type,
p: '$ki_world' > $o ).
tff(decl_26,type,
esk1_0: '$ki_world' ).
tff(decl_27,type,
esk2_1: '$ki_world' > '$ki_world' ).
tff(verify,conjecture,
( ? [X1: '$ki_world'] :
( ! [X2: '$ki_world'] :
( '$ki_accessible'(X1,X2)
=> ? [X3: '$ki_world'] :
( p(X3)
& '$ki_accessible'(X2,X3) ) )
& '$ki_accessible'('$ki_local_world',X1) )
=> ? [X1: '$ki_world'] :
( ? [X2: '$ki_world'] :
( p(X2)
& '$ki_accessible'(X1,X2) )
& '$ki_accessible'('$ki_local_world',X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).
tff(mrel_reflexive,axiom,
! [X1: '$ki_world'] : '$ki_accessible'(X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mrel_reflexive) ).
tff(c_0_2,negated_conjecture,
~ ( ? [X1: '$ki_world'] :
( ! [X2: '$ki_world'] :
( '$ki_accessible'(X1,X2)
=> ? [X3: '$ki_world'] :
( p(X3)
& '$ki_accessible'(X2,X3) ) )
& '$ki_accessible'('$ki_local_world',X1) )
=> ? [X1: '$ki_world'] :
( ? [X2: '$ki_world'] :
( p(X2)
& '$ki_accessible'(X1,X2) )
& '$ki_accessible'('$ki_local_world',X1) ) ),
inference(assume_negation,[status(cth)],[verify]) ).
tff(c_0_3,negated_conjecture,
! [X5: '$ki_world',X7: '$ki_world',X8: '$ki_world'] :
( ( ~ p(X8)
| ~ '$ki_accessible'(X7,X8)
| ~ '$ki_accessible'('$ki_local_world',X7) )
& ( ~ '$ki_accessible'(esk1_0,X5)
| p(esk2_1(X5)) )
& ( ~ '$ki_accessible'(esk1_0,X5)
| '$ki_accessible'(X5,esk2_1(X5)) )
& '$ki_accessible'('$ki_local_world',esk1_0) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])])]) ).
tcf(c_0_4,negated_conjecture,
! [X1: '$ki_world',X2: '$ki_world'] :
( ~ p(X2)
| ~ '$ki_accessible'(X1,X2)
| ~ '$ki_accessible'('$ki_local_world',X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
tcf(c_0_5,negated_conjecture,
'$ki_accessible'('$ki_local_world',esk1_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
tcf(c_0_6,negated_conjecture,
! [X1: '$ki_world'] :
( ~ '$ki_accessible'(esk1_0,X1)
| ~ p(X1) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
tcf(c_0_7,negated_conjecture,
! [X1: '$ki_world'] :
( ~ '$ki_accessible'(esk1_0,X1)
| p(esk2_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
tff(c_0_8,plain,
! [X9: '$ki_world'] : '$ki_accessible'(X9,X9),
inference(variable_rename,[status(thm)],[mrel_reflexive]) ).
tcf(c_0_9,negated_conjecture,
! [X1: '$ki_world'] :
( ~ '$ki_accessible'(esk1_0,X1)
| ~ '$ki_accessible'(esk1_0,esk2_1(X1)) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
tcf(c_0_10,negated_conjecture,
! [X1: '$ki_world'] :
( ~ '$ki_accessible'(esk1_0,X1)
| '$ki_accessible'(X1,esk2_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
tcf(c_0_11,plain,
! [X1: '$ki_world'] : '$ki_accessible'(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO902_8 : TPTP v9.3.1. Released v8.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n013.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 12:30:36 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.13/0.42 % Version: 3.5.1
% 0.13/0.42 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.13/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.13/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.42 % Starting sh5l with 300s (1) cores
% 0.13/0.42 % new_bool_3 with pid 753737 completed with status 0
% 0.13/0.42 % Result found by new_bool_3
% 0.13/0.42 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.13/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.13/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.42 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.42 % Search class: FHHNF-FFSF11-SFFFFFNN
% 0.13/0.42 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.42 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.42 % SubtermCWHack with pid 753745 completed with status 0
% 0.13/0.42 % Result found by SubtermCWHack
% 0.13/0.42 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.13/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.13/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.42 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.42 % Search class: FHHNF-FFSF11-SFFFFFNN
% 0.13/0.42 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.42 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.42 % Preprocessing time : 0.001 s
% 0.13/0.42
% 0.13/0.42 % Proof found!
% 0.13/0.42 % SZS status Theorem
% 0.13/0.42 % SZS output start CNFRefutation
% See solution above
% 0.13/0.42 % Parsed axioms : 6
% 0.13/0.42 % Removed by relevancy pruning/SinE : 4
% 0.13/0.42 % Initial clauses : 5
% 0.13/0.42 % Removed in clause preprocessing : 0
% 0.13/0.42 % Initial clauses in saturation : 5
% 0.13/0.42 % Processed clauses : 10
% 0.13/0.42 % ...of these trivial : 0
% 0.13/0.42 % ...subsumed : 0
% 0.13/0.42 % ...remaining for further processing : 10
% 0.13/0.42 % Other redundant clauses eliminated : 0
% 0.13/0.42 % Clauses deleted for lack of memory : 0
% 0.13/0.42 % Backward-subsumed : 0
% 0.13/0.42 % Backward-rewritten : 0
% 0.13/0.42 % Generated clauses : 7
% 0.13/0.42 % ...of the previous two non-redundant : 6
% 0.13/0.42 % ...aggressively subsumed : 0
% 0.13/0.42 % Contextual simplify-reflections : 0
% 0.13/0.42 % Paramodulations : 7
% 0.13/0.42 % Factorizations : 0
% 0.13/0.42 % NegExts : 0
% 0.13/0.42 % Equation resolutions : 0
% 0.13/0.42 % Disequality decompositions : 0
% 0.13/0.42 % Total rewrite steps : 1
% 0.13/0.42 % ...of those cached : 0
% 0.13/0.42 % Propositional unsat checks : 0
% 0.13/0.42 % Propositional check models : 0
% 0.13/0.42 % Propositional check unsatisfiable : 0
% 0.13/0.42 % Propositional clauses : 0
% 0.13/0.42 % Propositional clauses after purity: 0
% 0.13/0.42 % Propositional unsat core size : 0
% 0.13/0.42 % Propositional preprocessing time : 0.000
% 0.13/0.42 % Propositional encoding time : 0.000
% 0.13/0.42 % Propositional solver time : 0.000
% 0.13/0.42 % Success case prop preproc time : 0.000
% 0.13/0.42 % Success case prop encoding time : 0.000
% 0.13/0.42 % Success case prop solver time : 0.000
% 0.13/0.42 % Current number of processed clauses : 10
% 0.13/0.42 % Positive orientable unit clauses : 2
% 0.13/0.42 % Positive unorientable unit clauses: 0
% 0.13/0.42 % Negative unit clauses : 1
% 0.13/0.42 % Non-unit-clauses : 7
% 0.13/0.42 % Current number of unprocessed clauses: 1
% 0.13/0.42 % ...number of literals in the above : 3
% 0.13/0.42 % Current number of archived formulas : 0
% 0.13/0.42 % Current number of archived clauses : 0
% 0.13/0.42 % Clause-clause subsumption calls (NU) : 3
% 0.13/0.42 % Rec. Clause-clause subsumption calls : 3
% 0.13/0.42 % Non-unit clause-clause subsumptions : 0
% 0.13/0.42 % Unit Clause-clause subsumption calls : 1
% 0.13/0.42 % Rewrite failures with RHS unbound : 0
% 0.13/0.42 % BW rewrite match attempts : 1
% 0.13/0.42 % BW rewrite match successes : 0
% 0.13/0.42 % Condensation attempts : 0
% 0.13/0.42 % Condensation successes : 0
% 0.13/0.42 % Termbank termtop insertions : 464
% 0.13/0.42 % Search garbage collected termcells : 112
% 0.13/0.42
% 0.13/0.42 % -------------------------------------------------
% 0.13/0.42 % User time : 0.001 s
% 0.13/0.42 % System time : 0.003 s
% 0.13/0.42 % Total time : 0.004 s
% 0.13/0.42 % Maximum resident set size: 3628 pages
% 0.13/0.42
% 0.13/0.42 % -------------------------------------------------
% 0.13/0.42 % User time : 0.003 s
% 0.13/0.42 % System time : 0.008 s
% 0.13/0.42 % Total time : 0.010 s
% 0.13/0.42 % Maximum resident set size: 4864 pages
% 0.13/0.42 % E exiting
%------------------------------------------------------------------------------