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