%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYO888_10 : 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 : n016.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:55 PM UTC 2026
% Result : Theorem 0.12s 0.44s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 2
% Syntax : Number of formulae : 14 ( 9 unt; 0 typ; 0 def)
% Number of atoms : 53 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 55 ( 16 ~; 12 |; 7 &)
% ( 0 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 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 : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 23 ( 0 sgn 23 !; 0 ?; 13 :)
% 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,
g: ( $i * '$ki_world' ) > $o ).
tff(decl_27,type,
h: ( $i * '$ki_world' ) > $o ).
tff(decl_28,type,
'$ki_exists_in_world_$i': ( $i * '$ki_world' ) > $o ).
tff(decl_29,type,
esk1_0: $i ).
tff(decl_30,type,
esk2_0: '$ki_world' ).
tff(verify,conjecture,
( ( ! [X4] :
( '$ki_exists_in_world_$i'('$ki_local_world',X4)
=> ( g('$ki_local_world',X4)
=> ! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> h(X1,X4) ) ) )
& ! [X4] :
( '$ki_exists_in_world_$i'('$ki_local_world',X4)
=> ( f('$ki_local_world',X4)
=> ! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> g(X1,X4) ) ) ) )
=> ! [X4] :
( '$ki_exists_in_world_$i'('$ki_local_world',X4)
=> ( f('$ki_local_world',X4)
=> ! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> h(X1,X4) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',verify) ).
tff(mrel_reflexive,axiom,
! [X1: '$ki_world'] : '$ki_accessible'(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mrel_reflexive) ).
tff(c_0_2,negated_conjecture,
~ ( ( ! [X4] :
( '$ki_exists_in_world_$i'('$ki_local_world',X4)
=> ( g('$ki_local_world',X4)
=> ! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> h(X1,X4) ) ) )
& ! [X4] :
( '$ki_exists_in_world_$i'('$ki_local_world',X4)
=> ( f('$ki_local_world',X4)
=> ! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> g(X1,X4) ) ) ) )
=> ! [X4] :
( '$ki_exists_in_world_$i'('$ki_local_world',X4)
=> ( f('$ki_local_world',X4)
=> ! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> h(X1,X4) ) ) ) ),
inference(assume_negation,[status(cth)],[verify]) ).
tff(c_0_3,negated_conjecture,
! [X5,X6: '$ki_world',X7,X8: '$ki_world'] :
( ~ h(esk2_0,esk1_0)
& '$ki_accessible'('$ki_local_world',esk2_0)
& f('$ki_local_world',esk1_0)
& '$ki_exists_in_world_$i'('$ki_local_world',esk1_0)
& ( h(X8,X7)
| ~ '$ki_accessible'('$ki_local_world',X8)
| ~ g('$ki_local_world',X7)
| ~ '$ki_exists_in_world_$i'('$ki_local_world',X7) )
& ( g(X6,X5)
| ~ '$ki_accessible'('$ki_local_world',X6)
| ~ f('$ki_local_world',X5)
| ~ '$ki_exists_in_world_$i'('$ki_local_world',X5) ) ),
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,
~ h(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
tcf(c_0_5,negated_conjecture,
! [X4,X1: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X1)
| ~ g('$ki_local_world',X4)
| ~ '$ki_exists_in_world_$i'('$ki_local_world',X4)
| h(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
tcf(c_0_6,negated_conjecture,
'$ki_exists_in_world_$i'('$ki_local_world',esk1_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
tcf(c_0_7,negated_conjecture,
'$ki_accessible'('$ki_local_world',esk2_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
tff(c_0_8,plain,
! [X11: '$ki_world'] : '$ki_accessible'(X11,X11),
inference(variable_rename,[status(thm)],[mrel_reflexive]) ).
tcf(c_0_9,negated_conjecture,
~ g('$ki_local_world',esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_5]),c_0_6]),c_0_7])]) ).
tcf(c_0_10,negated_conjecture,
! [X4,X1: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X1)
| ~ f('$ki_local_world',X4)
| ~ '$ki_exists_in_world_$i'('$ki_local_world',X4)
| g(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
tcf(c_0_11,negated_conjecture,
f('$ki_local_world',esk1_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
tcf(c_0_12,plain,
! [X1: '$ki_world'] : '$ki_accessible'(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_6]),c_0_11]),c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO888_10 : TPTP v9.3.1. Released v8.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.38 % Computer : n016.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Mon Sep 21 12:35:08 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.42 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.12/0.44 % Version: 3.5.1
% 0.12/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.44 % Starting sh5l with 300s (1) cores
% 0.12/0.44 % new_bool_3 with pid 2404640 completed with status 0
% 0.12/0.44 % Result found by new_bool_3
% 0.12/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.44 % Search class: FHUNS-FFSS11-SFFFFFNN
% 0.12/0.44 % partial match(1): FHUNS-FFSF11-SFFFFFNN
% 0.12/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.44 % SubtermCWHack with pid 2404644 completed with status 0
% 0.12/0.44 % Result found by SubtermCWHack
% 0.12/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.44 % Search class: FHUNS-FFSS11-SFFFFFNN
% 0.12/0.44 % partial match(1): FHUNS-FFSF11-SFFFFFNN
% 0.12/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.44 % Preprocessing time : 0.001 s
% 0.12/0.44
% 0.12/0.44 % Proof found!
% 0.12/0.44 % SZS status Theorem
% 0.12/0.44 % SZS output start CNFRefutation
% See solution above
% 0.12/0.44 % Parsed axioms : 11
% 0.12/0.44 % Removed by relevancy pruning/SinE : 7
% 0.12/0.44 % Initial clauses : 9
% 0.12/0.44 % Removed in clause preprocessing : 0
% 0.12/0.44 % Initial clauses in saturation : 9
% 0.12/0.44 % Processed clauses : 13
% 0.12/0.44 % ...of these trivial : 0
% 0.12/0.44 % ...subsumed : 1
% 0.12/0.44 % ...remaining for further processing : 12
% 0.12/0.44 % Other redundant clauses eliminated : 0
% 0.12/0.44 % Clauses deleted for lack of memory : 0
% 0.12/0.44 % Backward-subsumed : 0
% 0.12/0.44 % Backward-rewritten : 0
% 0.12/0.44 % Generated clauses : 6
% 0.12/0.44 % ...of the previous two non-redundant : 4
% 0.12/0.44 % ...aggressively subsumed : 0
% 0.12/0.44 % Contextual simplify-reflections : 0
% 0.12/0.44 % Paramodulations : 6
% 0.12/0.44 % Factorizations : 0
% 0.12/0.44 % NegExts : 0
% 0.12/0.44 % Equation resolutions : 0
% 0.12/0.44 % Disequality decompositions : 0
% 0.12/0.44 % Total rewrite steps : 5
% 0.12/0.44 % ...of those cached : 1
% 0.12/0.44 % Propositional unsat checks : 0
% 0.12/0.44 % Propositional check models : 0
% 0.12/0.44 % Propositional check unsatisfiable : 0
% 0.12/0.44 % Propositional clauses : 0
% 0.12/0.44 % Propositional clauses after purity: 0
% 0.12/0.44 % Propositional unsat core size : 0
% 0.12/0.44 % Propositional preprocessing time : 0.000
% 0.12/0.44 % Propositional encoding time : 0.000
% 0.12/0.44 % Propositional solver time : 0.000
% 0.12/0.44 % Success case prop preproc time : 0.000
% 0.12/0.44 % Success case prop encoding time : 0.000
% 0.12/0.44 % Success case prop solver time : 0.000
% 0.12/0.44 % Current number of processed clauses : 12
% 0.12/0.44 % Positive orientable unit clauses : 5
% 0.12/0.44 % Positive unorientable unit clauses: 0
% 0.12/0.44 % Negative unit clauses : 2
% 0.12/0.44 % Non-unit-clauses : 5
% 0.12/0.44 % Current number of unprocessed clauses: 0
% 0.12/0.44 % ...number of literals in the above : 0
% 0.12/0.44 % Current number of archived formulas : 0
% 0.12/0.44 % Current number of archived clauses : 0
% 0.12/0.44 % Clause-clause subsumption calls (NU) : 4
% 0.12/0.44 % Rec. Clause-clause subsumption calls : 4
% 0.12/0.44 % Non-unit clause-clause subsumptions : 1
% 0.12/0.44 % Unit Clause-clause subsumption calls : 4
% 0.12/0.44 % Rewrite failures with RHS unbound : 0
% 0.12/0.44 % BW rewrite match attempts : 1
% 0.12/0.44 % BW rewrite match successes : 0
% 0.12/0.44 % Condensation attempts : 0
% 0.12/0.44 % Condensation successes : 0
% 0.12/0.44 % Termbank termtop insertions : 805
% 0.12/0.44 % Search garbage collected termcells : 190
% 0.12/0.44
% 0.12/0.44 % -------------------------------------------------
% 0.12/0.44 % User time : 0.003 s
% 0.12/0.44 % System time : 0.003 s
% 0.12/0.44 % Total time : 0.006 s
% 0.12/0.44 % Maximum resident set size: 3636 pages
% 0.12/0.44
% 0.12/0.44 % -------------------------------------------------
% 0.12/0.44 % User time : 0.004 s
% 0.12/0.44 % System time : 0.006 s
% 0.12/0.44 % Total time : 0.010 s
% 0.12/0.44 % Maximum resident set size: 4864 pages
% 0.12/0.44 % E exiting
%------------------------------------------------------------------------------