%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SYO892_15 : 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 : n004.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:30 PM UTC 2026
% Result : Theorem 0.13s 0.42s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 2
% Syntax : Number of formulae : 13 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 37 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 37 ( 13 ~; 9 |; 8 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 22 ( 0 sgn 18 !; 4 ?; 12 :)
% 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,
f: ( $i * '$ki_world' ) > $o ).
tff(decl_26,type,
'$ki_exists_in_world_$i': ( $i * '$ki_world' ) > $o ).
tff(decl_29,type,
esk3_0: '$ki_world' ).
tff(decl_30,type,
esk4_0: $i ).
tff(verify,conjecture,
( ? [X1: '$ki_world'] :
( ! [X3] :
( '$ki_exists_in_world_$i'(X1,X3)
=> f(X1,X3) )
& '$ki_accessible'('$ki_local_world',X1) )
=> ! [X3] :
( '$ki_exists_in_world_$i'('$ki_local_world',X3)
=> ? [X1: '$ki_world'] :
( f(X1,X3)
& '$ki_accessible'('$ki_local_world',X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).
tff('$ki_exists_in_world_$i_cumul',axiom,
! [X1: '$ki_world',X2: '$ki_world',X3] :
( ( '$ki_accessible'(X1,X2)
& '$ki_exists_in_world_$i'(X1,X3) )
=> '$ki_exists_in_world_$i'(X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','$ki_exists_in_world_$i_cumul') ).
tff(c_0_2,negated_conjecture,
~ ( ? [X1: '$ki_world'] :
( ! [X3] :
( '$ki_exists_in_world_$i'(X1,X3)
=> f(X1,X3) )
& '$ki_accessible'('$ki_local_world',X1) )
=> ! [X3] :
( '$ki_exists_in_world_$i'('$ki_local_world',X3)
=> ? [X1: '$ki_world'] :
( f(X1,X3)
& '$ki_accessible'('$ki_local_world',X1) ) ) ),
inference(assume_negation,[status(cth)],[verify]) ).
tff(c_0_3,negated_conjecture,
! [X12,X14: '$ki_world'] :
( ( ~ f(X14,esk4_0)
| ~ '$ki_accessible'('$ki_local_world',X14) )
& '$ki_exists_in_world_$i'('$ki_local_world',esk4_0)
& ( f(esk3_0,X12)
| ~ '$ki_exists_in_world_$i'(esk3_0,X12) )
& '$ki_accessible'('$ki_local_world',esk3_0) ),
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])])])])]) ).
tff(c_0_4,plain,
! [X6: '$ki_world',X7: '$ki_world',X8] :
( '$ki_exists_in_world_$i'(X7,X8)
| ~ '$ki_accessible'(X6,X7)
| ~ '$ki_exists_in_world_$i'(X6,X8) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['$ki_exists_in_world_$i_cumul'])])]) ).
tcf(c_0_5,negated_conjecture,
! [X1: '$ki_world'] :
( ~ f(X1,esk4_0)
| ~ '$ki_accessible'('$ki_local_world',X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
tcf(c_0_6,negated_conjecture,
! [X3] :
( ~ '$ki_exists_in_world_$i'(esk3_0,X3)
| f(esk3_0,X3) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
tcf(c_0_7,negated_conjecture,
'$ki_accessible'('$ki_local_world',esk3_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
tcf(c_0_8,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_4]) ).
tcf(c_0_9,negated_conjecture,
~ '$ki_exists_in_world_$i'(esk3_0,esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7])]) ).
tcf(c_0_10,negated_conjecture,
! [X3] :
( ~ '$ki_exists_in_world_$i'('$ki_local_world',X3)
| '$ki_exists_in_world_$i'(esk3_0,X3) ),
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
tcf(c_0_11,negated_conjecture,
'$ki_exists_in_world_$i'('$ki_local_world',esk4_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
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.02 % Problem : SYO892_15 : TPTP v9.3.1. Released v8.2.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.35 % Computer : n004.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % 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:34 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 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3111770 completed with status 0
% 0.13/0.42 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 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 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.42 % No SInE strategy applied
% 0.13/0.42 % Search class: FHHNS-FFSF11-SFFFFFNN
% 0.13/0.42 % partial match(1): FHHNF-FFSF11-SFFFFFNN
% 0.13/0.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.42 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.42 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.13/0.42 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.13/0.42 % Starting new_bool_3 with 136s (1) cores
% 0.13/0.42 % Starting new_bool_1 with 136s (1) cores
% 0.13/0.42 % SubtermCWHack with pid 3111774 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 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.42 % No SInE strategy applied
% 0.13/0.42 % Search class: FHHNS-FFSF11-SFFFFFNN
% 0.13/0.42 % partial match(1): FHHNF-FFSF11-SFFFFFNN
% 0.13/0.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.42 % Starting SubtermCWHack with 136s (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 : 9
% 0.13/0.42 % Removed by relevancy pruning/SinE : 0
% 0.13/0.42 % Initial clauses : 12
% 0.13/0.42 % Removed in clause preprocessing : 5
% 0.13/0.42 % Initial clauses in saturation : 7
% 0.13/0.42 % Processed clauses : 9
% 0.13/0.42 % ...of these trivial : 0
% 0.13/0.42 % ...subsumed : 0
% 0.13/0.42 % ...remaining for further processing : 9
% 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 : 4
% 0.13/0.42 % ...of the previous two non-redundant : 3
% 0.13/0.42 % ...aggressively subsumed : 0
% 0.13/0.42 % Contextual simplify-reflections : 0
% 0.13/0.42 % Paramodulations : 4
% 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 : 2
% 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 : 9
% 0.13/0.42 % Positive orientable unit clauses : 4
% 0.13/0.42 % Positive unorientable unit clauses: 0
% 0.13/0.42 % Negative unit clauses : 1
% 0.13/0.42 % Non-unit-clauses : 4
% 0.13/0.42 % Current number of unprocessed clauses: 1
% 0.13/0.42 % ...number of literals in the above : 2
% 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) : 0
% 0.13/0.42 % Rec. Clause-clause subsumption calls : 0
% 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 : 0
% 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 : 538
% 0.13/0.42 % Search garbage collected termcells : 124
% 0.13/0.42
% 0.13/0.42 % -------------------------------------------------
% 0.13/0.42 % User time : 0.004 s
% 0.13/0.42 % System time : 0.002 s
% 0.13/0.42 % Total time : 0.005 s
% 0.13/0.42 % Maximum resident set size: 3376 pages
% 0.13/0.42
% 0.13/0.42 % -------------------------------------------------
% 0.13/0.42 % User time : 0.008 s
% 0.13/0.42 % System time : 0.010 s
% 0.13/0.42 % Total time : 0.018 s
% 0.13/0.42 % Maximum resident set size: 4608 pages
% 0.13/0.42 % E exiting
%------------------------------------------------------------------------------