%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYO894_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 : n010.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:57 PM UTC 2026
% Result : Theorem 0.10s 0.43s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 1
% Syntax : Number of formulae : 18 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 64 ( 0 equ)
% Maximal formula atoms : 17 ( 3 avg)
% Number of connectives : 76 ( 30 ~; 28 |; 9 &)
% ( 3 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 1 ( 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; 3 con; 0-0 aty)
% Number of variables : 16 ( 0 sgn 13 !; 3 ?; 16 :)
% 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_0: '$ki_world' ).
tff(verify,conjecture,
( ! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ( p(X1)
=> ~ p(X1) ) )
<=> ~ ? [X1: '$ki_world'] :
( p(X1)
& '$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)
=> ( p(X1)
=> ~ p(X1) ) )
<=> ~ ? [X1: '$ki_world'] :
( p(X1)
& '$ki_accessible'('$ki_local_world',X1) ) ),
inference(assume_negation,[status(cth)],[verify]) ).
tff(c_0_2,negated_conjecture,
~ ( ! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ( p(X1)
=> ~ p(X1) ) )
<=> ~ ? [X1: '$ki_world'] :
( p(X1)
& '$ki_accessible'('$ki_local_world',X1) ) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
tff(c_0_3,negated_conjecture,
! [X4: '$ki_world',X5: '$ki_world'] :
( ( ~ p(X5)
| ~ '$ki_accessible'('$ki_local_world',X5)
| ~ p(X4)
| ~ p(X4)
| ~ '$ki_accessible'('$ki_local_world',X4) )
& ( p(esk1_0)
| p(esk2_0) )
& ( p(esk1_0)
| '$ki_accessible'('$ki_local_world',esk2_0) )
& ( p(esk1_0)
| p(esk2_0) )
& ( p(esk1_0)
| '$ki_accessible'('$ki_local_world',esk2_0) )
& ( '$ki_accessible'('$ki_local_world',esk1_0)
| p(esk2_0) )
& ( '$ki_accessible'('$ki_local_world',esk1_0)
| '$ki_accessible'('$ki_local_world',esk2_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'('$ki_local_world',X2)
| ~ p(X1)
| ~ p(X1)
| ~ '$ki_accessible'('$ki_local_world',X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
tcf(c_0_5,negated_conjecture,
! [X2: '$ki_world',X1: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X1)
| ~ '$ki_accessible'('$ki_local_world',X2)
| ~ p(X1)
| ~ p(X2) ),
inference(cn,[status(thm)],[c_0_4]) ).
tcf(c_0_6,negated_conjecture,
( p(esk1_0)
| '$ki_accessible'('$ki_local_world',esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
tcf(c_0_7,negated_conjecture,
( p(esk1_0)
| p(esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
tcf(c_0_8,negated_conjecture,
! [X1: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X1)
| ~ p(X1)
| p(esk1_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7]) ).
tcf(c_0_9,negated_conjecture,
( '$ki_accessible'('$ki_local_world',esk1_0)
| p(esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
tcf(c_0_10,negated_conjecture,
p(esk1_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_6]),c_0_7]) ).
tcf(c_0_11,negated_conjecture,
! [X1: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X1)
| ~ p(X1)
| p(esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_9]),c_0_10])]) ).
tcf(c_0_12,negated_conjecture,
( '$ki_accessible'('$ki_local_world',esk1_0)
| '$ki_accessible'('$ki_local_world',esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
tcf(c_0_13,negated_conjecture,
p(esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_9]),c_0_10])]) ).
tcf(c_0_14,negated_conjecture,
! [X1: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X1)
| ~ p(X1)
| '$ki_accessible'('$ki_local_world',esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_12]),c_0_13])]) ).
tcf(c_0_15,negated_conjecture,
'$ki_accessible'('$ki_local_world',esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_12]),c_0_13])]) ).
tcf(c_0_16,negated_conjecture,
! [X1: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X1)
| ~ p(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_15]),c_0_10])]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_15]),c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO894_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.37 % Computer : n010.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 12:30:55 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 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.10/0.43 % Version: 3.5.1
% 0.10/0.43 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.10/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.10/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.43 % Starting sh5l with 300s (1) cores
% 0.10/0.43 % new_bool_3 with pid 859844 completed with status 0
% 0.10/0.43 % Result found by new_bool_3
% 0.10/0.43 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.10/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.10/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.43 % Search class: FGHNF-FFSM00-SFFFFFNN
% 0.10/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.43 % SubtermCWHack with pid 859847 completed with status 0
% 0.10/0.43 % Result found by SubtermCWHack
% 0.10/0.43 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.10/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.10/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.43 % Search class: FGHNF-FFSM00-SFFFFFNN
% 0.10/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.43 % Preprocessing time : 0.001 s
% 0.10/0.43
% 0.10/0.43 % Proof found!
% 0.10/0.43 % SZS status Theorem
% 0.10/0.43 % SZS output start CNFRefutation
% See solution above
% 0.10/0.43 % Parsed axioms : 6
% 0.10/0.43 % Removed by relevancy pruning/SinE : 4
% 0.10/0.43 % Initial clauses : 8
% 0.10/0.43 % Removed in clause preprocessing : 0
% 0.10/0.43 % Initial clauses in saturation : 8
% 0.10/0.43 % Processed clauses : 18
% 0.10/0.43 % ...of these trivial : 0
% 0.10/0.43 % ...subsumed : 3
% 0.10/0.43 % ...remaining for further processing : 15
% 0.10/0.43 % Other redundant clauses eliminated : 0
% 0.10/0.43 % Clauses deleted for lack of memory : 0
% 0.10/0.43 % Backward-subsumed : 2
% 0.10/0.43 % Backward-rewritten : 7
% 0.10/0.43 % Generated clauses : 20
% 0.10/0.43 % ...of the previous two non-redundant : 17
% 0.10/0.43 % ...aggressively subsumed : 0
% 0.10/0.43 % Contextual simplify-reflections : 2
% 0.10/0.43 % Paramodulations : 20
% 0.10/0.43 % Factorizations : 0
% 0.10/0.43 % NegExts : 0
% 0.10/0.43 % Equation resolutions : 0
% 0.10/0.43 % Disequality decompositions : 0
% 0.10/0.43 % Total rewrite steps : 13
% 0.10/0.43 % ...of those cached : 10
% 0.10/0.43 % Propositional unsat checks : 0
% 0.10/0.43 % Propositional check models : 0
% 0.10/0.43 % Propositional check unsatisfiable : 0
% 0.10/0.43 % Propositional clauses : 0
% 0.10/0.43 % Propositional clauses after purity: 0
% 0.10/0.43 % Propositional unsat core size : 0
% 0.10/0.43 % Propositional preprocessing time : 0.000
% 0.10/0.43 % Propositional encoding time : 0.000
% 0.10/0.43 % Propositional solver time : 0.000
% 0.10/0.43 % Success case prop preproc time : 0.000
% 0.10/0.43 % Success case prop encoding time : 0.000
% 0.10/0.43 % Success case prop solver time : 0.000
% 0.10/0.43 % Current number of processed clauses : 6
% 0.10/0.43 % Positive orientable unit clauses : 4
% 0.10/0.43 % Positive unorientable unit clauses: 0
% 0.10/0.43 % Negative unit clauses : 1
% 0.10/0.43 % Non-unit-clauses : 1
% 0.10/0.43 % Current number of unprocessed clauses: 0
% 0.10/0.43 % ...number of literals in the above : 0
% 0.10/0.43 % Current number of archived formulas : 0
% 0.10/0.43 % Current number of archived clauses : 9
% 0.10/0.43 % Clause-clause subsumption calls (NU) : 8
% 0.10/0.43 % Rec. Clause-clause subsumption calls : 7
% 0.10/0.43 % Non-unit clause-clause subsumptions : 5
% 0.10/0.43 % Unit Clause-clause subsumption calls : 3
% 0.10/0.43 % Rewrite failures with RHS unbound : 0
% 0.10/0.43 % BW rewrite match attempts : 3
% 0.10/0.43 % BW rewrite match successes : 3
% 0.10/0.43 % Condensation attempts : 0
% 0.10/0.43 % Condensation successes : 0
% 0.10/0.43 % Termbank termtop insertions : 722
% 0.10/0.43 % Search garbage collected termcells : 97
% 0.10/0.43
% 0.10/0.43 % -------------------------------------------------
% 0.10/0.43 % User time : 0.004 s
% 0.10/0.43 % System time : 0.001 s
% 0.10/0.43 % Total time : 0.005 s
% 0.10/0.43 % Maximum resident set size: 3628 pages
% 0.10/0.43
% 0.10/0.43 % -------------------------------------------------
% 0.10/0.43 % User time : 0.006 s
% 0.10/0.43 % System time : 0.005 s
% 0.10/0.43 % Total time : 0.011 s
% 0.10/0.43 % Maximum resident set size: 4864 pages
% 0.10/0.43 % E exiting
%------------------------------------------------------------------------------