%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYO893_11 : 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 : n011.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:56 PM UTC 2026
% Result : Theorem 0.11s 0.41s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 2
% Syntax : Number of formulae : 13 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 93 ( 0 equ)
% Maximal formula atoms : 50 ( 7 avg)
% Number of connectives : 128 ( 48 ~; 47 |; 21 &)
% ( 3 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 7 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 : 7 ( 7 usr; 3 con; 0-1 aty)
% Number of variables : 41 ( 0 sgn 32 !; 9 ?; 41 :)
% 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_1: '$ki_world' > '$ki_world' ).
tff(decl_27,type,
esk2_1: '$ki_world' > '$ki_world' ).
tff(decl_28,type,
esk3_0: '$ki_world' ).
tff(decl_29,type,
esk4_1: '$ki_world' > '$ki_world' ).
tff(decl_30,type,
esk5_0: '$ki_world' ).
tff(decl_31,type,
esk6_1: '$ki_world' > '$ki_world' ).
tff(verify,conjecture,
( ~ ! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ? [X3: '$ki_world'] :
( ! [X4: '$ki_world'] :
( '$ki_accessible'(X3,X4)
=> p(X4) )
& '$ki_accessible'(X1,X3) ) )
<=> ? [X1: '$ki_world'] :
( ! [X3: '$ki_world'] :
( '$ki_accessible'(X1,X3)
=> ? [X4: '$ki_world'] :
( ~ p(X4)
& '$ki_accessible'(X3,X4) ) )
& '$ki_accessible'('$ki_local_world',X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',verify) ).
tff(mrel_universal,axiom,
! [X1: '$ki_world',X2: '$ki_world'] : '$ki_accessible'(X1,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mrel_universal) ).
tff(c_0_2,negated_conjecture,
~ ( ~ ! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ? [X3: '$ki_world'] :
( ! [X4: '$ki_world'] :
( '$ki_accessible'(X3,X4)
=> p(X4) )
& '$ki_accessible'(X1,X3) ) )
<=> ? [X1: '$ki_world'] :
( ! [X3: '$ki_world'] :
( '$ki_accessible'(X1,X3)
=> ? [X4: '$ki_world'] :
( ~ p(X4)
& '$ki_accessible'(X3,X4) ) )
& '$ki_accessible'('$ki_local_world',X1) ) ),
inference(assume_negation,[status(cth)],[verify]) ).
tff(c_0_3,negated_conjecture,
~ ( ~ ! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ? [X3: '$ki_world'] :
( ! [X4: '$ki_world'] :
( '$ki_accessible'(X3,X4)
=> p(X4) )
& '$ki_accessible'(X1,X3) ) )
<=> ? [X1: '$ki_world'] :
( ! [X3: '$ki_world'] :
( '$ki_accessible'(X1,X3)
=> ? [X4: '$ki_world'] :
( ~ p(X4)
& '$ki_accessible'(X3,X4) ) )
& '$ki_accessible'('$ki_local_world',X1) ) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
tff(c_0_4,negated_conjecture,
! [X7: '$ki_world',X9: '$ki_world',X10: '$ki_world',X12: '$ki_world',X14: '$ki_world',X17: '$ki_world'] :
( ( ~ '$ki_accessible'(esk3_0,X14)
| ~ p(esk4_1(X14))
| ~ '$ki_accessible'(esk5_0,X17)
| ~ p(esk6_1(X17)) )
& ( ~ '$ki_accessible'(esk3_0,X14)
| ~ p(esk4_1(X14))
| ~ '$ki_accessible'(esk5_0,X17)
| '$ki_accessible'(X17,esk6_1(X17)) )
& ( ~ '$ki_accessible'(esk3_0,X14)
| ~ p(esk4_1(X14))
| '$ki_accessible'('$ki_local_world',esk5_0) )
& ( ~ '$ki_accessible'(esk3_0,X14)
| '$ki_accessible'(X14,esk4_1(X14))
| ~ '$ki_accessible'(esk5_0,X17)
| ~ p(esk6_1(X17)) )
& ( ~ '$ki_accessible'(esk3_0,X14)
| '$ki_accessible'(X14,esk4_1(X14))
| ~ '$ki_accessible'(esk5_0,X17)
| '$ki_accessible'(X17,esk6_1(X17)) )
& ( ~ '$ki_accessible'(esk3_0,X14)
| '$ki_accessible'(X14,esk4_1(X14))
| '$ki_accessible'('$ki_local_world',esk5_0) )
& ( '$ki_accessible'('$ki_local_world',esk3_0)
| ~ '$ki_accessible'(esk5_0,X17)
| ~ p(esk6_1(X17)) )
& ( '$ki_accessible'('$ki_local_world',esk3_0)
| ~ '$ki_accessible'(esk5_0,X17)
| '$ki_accessible'(X17,esk6_1(X17)) )
& ( '$ki_accessible'('$ki_local_world',esk3_0)
| '$ki_accessible'('$ki_local_world',esk5_0) )
& ( ~ '$ki_accessible'('$ki_local_world',X7)
| p(X9)
| ~ '$ki_accessible'(esk1_1(X7),X9)
| ~ '$ki_accessible'('$ki_local_world',X10)
| p(X12)
| ~ '$ki_accessible'(esk2_1(X10),X12) )
& ( ~ '$ki_accessible'('$ki_local_world',X7)
| p(X9)
| ~ '$ki_accessible'(esk1_1(X7),X9)
| ~ '$ki_accessible'('$ki_local_world',X10)
| '$ki_accessible'(X10,esk2_1(X10)) )
& ( ~ '$ki_accessible'('$ki_local_world',X7)
| '$ki_accessible'(X7,esk1_1(X7))
| ~ '$ki_accessible'('$ki_local_world',X10)
| p(X12)
| ~ '$ki_accessible'(esk2_1(X10),X12) )
& ( ~ '$ki_accessible'('$ki_local_world',X7)
| '$ki_accessible'(X7,esk1_1(X7))
| ~ '$ki_accessible'('$ki_local_world',X10)
| '$ki_accessible'(X10,esk2_1(X10)) ) ),
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_3])])])])])]) ).
tff(c_0_5,plain,
! [X5: '$ki_world',X6: '$ki_world'] : '$ki_accessible'(X5,X6),
inference(variable_rename,[status(thm)],[mrel_universal]) ).
tcf(c_0_6,negated_conjecture,
! [X1: '$ki_world',X2: '$ki_world',X4: '$ki_world',X3: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X3)
| ~ '$ki_accessible'(esk1_1(X3),X4)
| ~ '$ki_accessible'('$ki_local_world',X1)
| ~ '$ki_accessible'(esk2_1(X1),X2)
| p(X4)
| p(X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
tcf(c_0_7,plain,
! [X1: '$ki_world',X2: '$ki_world'] : '$ki_accessible'(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
tcf(c_0_8,negated_conjecture,
! [X1: '$ki_world',X2: '$ki_world'] :
( ~ '$ki_accessible'(esk3_0,X2)
| ~ p(esk4_1(X2))
| ~ '$ki_accessible'(esk5_0,X1)
| ~ p(esk6_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
tcf(c_0_9,negated_conjecture,
! [X4: '$ki_world',X2: '$ki_world'] :
( p(X2)
| p(X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7]),c_0_7]),c_0_7]),c_0_7])]) ).
tcf(c_0_10,negated_conjecture,
! [X2: '$ki_world',X1: '$ki_world'] :
( ~ p(esk6_1(X1))
| ~ p(esk4_1(X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_7]),c_0_7])]) ).
tcf(c_0_11,negated_conjecture,
! [X1: '$ki_world'] : p(X1),
inference(ef,[status(thm)],[c_0_9]) ).
cnf(c_0_12,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYO893_11 : TPTP v9.3.1. Released v8.2.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.35 % Computer : n011.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Mon Sep 21 12:30:40 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.39 Running first-order theorem proving
% 0.11/0.39 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.11/0.41 % Version: 3.5.1
% 0.11/0.41 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.41 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/0.41 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.41 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.41 % Starting sh5l with 300s (1) cores
% 0.11/0.41 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1878195 completed with status 0
% 0.11/0.41 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.11/0.41 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.41 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/0.41 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.41 % No SInE strategy applied
% 0.11/0.41 % Search class: FGHNF-FFSF11-SFFFFFNN
% 0.11/0.41 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.41 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.41 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.11/0.41 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.11/0.41 % Starting new_bool_3 with 136s (1) cores
% 0.11/0.41 % Starting new_bool_1 with 136s (1) cores
% 0.11/0.41 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1878201 completed with status 0
% 0.11/0.41 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.11/0.41 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.41 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/0.41 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.41 % No SInE strategy applied
% 0.11/0.41 % Search class: FGHNF-FFSF11-SFFFFFNN
% 0.11/0.41 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.41 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.41 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.11/0.41 % Preprocessing time : 0.001 s
% 0.11/0.41
% 0.11/0.41 % Proof found!
% 0.11/0.41 % SZS status Theorem
% 0.11/0.41 % SZS output start CNFRefutation
% See solution above
% 0.11/0.41 % Parsed axioms : 6
% 0.11/0.41 % Removed by relevancy pruning/SinE : 0
% 0.11/0.41 % Initial clauses : 18
% 0.11/0.41 % Removed in clause preprocessing : 16
% 0.11/0.41 % Initial clauses in saturation : 2
% 0.11/0.41 % Processed clauses : 3
% 0.11/0.41 % ...of these trivial : 0
% 0.11/0.41 % ...subsumed : 0
% 0.11/0.41 % ...remaining for further processing : 3
% 0.11/0.41 % Other redundant clauses eliminated : 0
% 0.11/0.41 % Clauses deleted for lack of memory : 0
% 0.11/0.41 % Backward-subsumed : 1
% 0.11/0.41 % Backward-rewritten : 1
% 0.11/0.41 % Generated clauses : 4
% 0.11/0.41 % ...of the previous two non-redundant : 4
% 0.11/0.41 % ...aggressively subsumed : 0
% 0.11/0.41 % Contextual simplify-reflections : 0
% 0.11/0.41 % Paramodulations : 2
% 0.11/0.41 % Factorizations : 2
% 0.11/0.41 % NegExts : 0
% 0.11/0.41 % Equation resolutions : 0
% 0.11/0.41 % Disequality decompositions : 0
% 0.11/0.41 % Total rewrite steps : 2
% 0.11/0.41 % ...of those cached : 0
% 0.11/0.41 % Propositional unsat checks : 0
% 0.11/0.41 % Propositional check models : 0
% 0.11/0.41 % Propositional check unsatisfiable : 0
% 0.11/0.41 % Propositional clauses : 0
% 0.11/0.41 % Propositional clauses after purity: 0
% 0.11/0.41 % Propositional unsat core size : 0
% 0.11/0.41 % Propositional preprocessing time : 0.000
% 0.11/0.41 % Propositional encoding time : 0.000
% 0.11/0.41 % Propositional solver time : 0.000
% 0.11/0.41 % Success case prop preproc time : 0.000
% 0.11/0.41 % Success case prop encoding time : 0.000
% 0.11/0.41 % Success case prop solver time : 0.000
% 0.11/0.41 % Current number of processed clauses : 1
% 0.11/0.41 % Positive orientable unit clauses : 1
% 0.11/0.41 % Positive unorientable unit clauses: 0
% 0.11/0.41 % Negative unit clauses : 0
% 0.11/0.41 % Non-unit-clauses : 0
% 0.11/0.41 % Current number of unprocessed clauses: 3
% 0.11/0.41 % ...number of literals in the above : 5
% 0.11/0.41 % Current number of archived formulas : 0
% 0.11/0.41 % Current number of archived clauses : 3
% 0.11/0.41 % Clause-clause subsumption calls (NU) : 0
% 0.11/0.41 % Rec. Clause-clause subsumption calls : 0
% 0.11/0.41 % Non-unit clause-clause subsumptions : 0
% 0.11/0.41 % Unit Clause-clause subsumption calls : 1
% 0.11/0.41 % Rewrite failures with RHS unbound : 0
% 0.11/0.41 % BW rewrite match attempts : 4
% 0.11/0.41 % BW rewrite match successes : 4
% 0.11/0.41 % Condensation attempts : 0
% 0.11/0.41 % Condensation successes : 0
% 0.11/0.41 % Termbank termtop insertions : 901
% 0.11/0.41 % Search garbage collected termcells : 217
% 0.11/0.41
% 0.11/0.41 % -------------------------------------------------
% 0.11/0.41 % User time : 0.004 s
% 0.11/0.41 % System time : 0.002 s
% 0.11/0.41 % Total time : 0.006 s
% 0.11/0.41 % Maximum resident set size: 3372 pages
% 0.11/0.41
% 0.11/0.41 % -------------------------------------------------
% 0.11/0.41 % User time : 0.012 s
% 0.11/0.41 % System time : 0.008 s
% 0.11/0.41 % Total time : 0.021 s
% 0.11/0.41 % Maximum resident set size: 4608 pages
% 0.11/0.41 % E exiting
%------------------------------------------------------------------------------