%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : LCL961_11 : 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 : n012.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 01:24:34 PM UTC 2026
% Result : Theorem 0.07s 0.37s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 2
% Syntax : Number of formulae : 10 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 38 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 35 ( 7 ~; 5 |; 7 &)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 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 : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 22 ( 0 sgn 22 !; 0 ?; 22 :)
% 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,
q: '$ki_world' > $o ).
tff(decl_27,type,
esk1_0: '$ki_world' ).
tff(decl_28,type,
esk2_0: '$ki_world' ).
tff(decl_29,type,
esk3_0: '$ki_world' ).
tff(decl_30,type,
esk4_0: '$ki_world' ).
tff(verify,conjecture,
( ! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ( ! [X3: '$ki_world'] :
( '$ki_accessible'(X1,X3)
=> q(X3) )
=> ! [X3: '$ki_world'] :
( '$ki_accessible'(X1,X3)
=> p(X3) ) ) )
| ! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ( ! [X3: '$ki_world'] :
( '$ki_accessible'(X1,X3)
=> p(X3) )
=> ! [X3: '$ki_world'] :
( '$ki_accessible'(X1,X3)
=> q(X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).
tff(mrel_universal,axiom,
! [X1: '$ki_world',X2: '$ki_world'] : '$ki_accessible'(X1,X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mrel_universal) ).
tff(c_0_2,negated_conjecture,
~ ( ! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ( ! [X3: '$ki_world'] :
( '$ki_accessible'(X1,X3)
=> q(X3) )
=> ! [X3: '$ki_world'] :
( '$ki_accessible'(X1,X3)
=> p(X3) ) ) )
| ! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ( ! [X3: '$ki_world'] :
( '$ki_accessible'(X1,X3)
=> p(X3) )
=> ! [X3: '$ki_world'] :
( '$ki_accessible'(X1,X3)
=> q(X3) ) ) ) ),
inference(assume_negation,[status(cth)],[verify]) ).
tff(c_0_3,negated_conjecture,
! [X7: '$ki_world',X10: '$ki_world'] :
( ~ p(esk4_0)
& '$ki_accessible'(esk3_0,esk4_0)
& ( q(X10)
| ~ '$ki_accessible'(esk3_0,X10) )
& '$ki_accessible'('$ki_local_world',esk3_0)
& ~ q(esk2_0)
& '$ki_accessible'(esk1_0,esk2_0)
& ( p(X7)
| ~ '$ki_accessible'(esk1_0,X7) )
& '$ki_accessible'('$ki_local_world',esk1_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,
! [X4: '$ki_world',X5: '$ki_world'] : '$ki_accessible'(X4,X5),
inference(variable_rename,[status(thm)],[mrel_universal]) ).
tcf(c_0_5,negated_conjecture,
! [X1: '$ki_world'] :
( ~ '$ki_accessible'(esk1_0,X1)
| p(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
tcf(c_0_6,plain,
! [X1: '$ki_world',X2: '$ki_world'] : '$ki_accessible'(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
tcf(c_0_7,negated_conjecture,
~ p(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
tcf(c_0_8,negated_conjecture,
! [X1: '$ki_world'] : p(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6])]) ).
cnf(c_0_9,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL961_11 : TPTP v9.3.1. Released v8.2.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.33 % Computer : n012.cluster.edu
% 0.07/0.33 % Model : x86_64 x86_64
% 0.07/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.33 % Memory : 8046.5625MB
% 0.07/0.33 % OS : Linux 6.8.0-71-generic
% 0.07/0.34 % CPULimit : 300
% 0.07/0.34 % WCLimit : 300
% 0.07/0.34 % DateTime : Mon Sep 21 01:14:07 UTC 2026
% 0.07/0.34 % CPUTime :
% 0.07/0.34 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.36 Running first-order theorem proving
% 0.07/0.36 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.07/0.37 % Version: 3.5.1
% 0.07/0.37 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.07/0.37 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.37 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.07/0.37 % Starting new_bool_3 with 300s (1) cores
% 0.07/0.37 % Starting new_bool_1 with 300s (1) cores
% 0.07/0.37 % Starting sh5l with 300s (1) cores
% 0.07/0.37 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1283584 completed with status 0
% 0.07/0.37 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.07/0.37 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.07/0.37 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.37 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.07/0.37 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.07/0.37 % No SInE strategy applied
% 0.07/0.37 % Search class: FUHPF-FFSF00-SFFFFFNN
% 0.07/0.37 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.07/0.37 % Starting SubtermCWHack with 136s (1) cores
% 0.07/0.37 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.07/0.37 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.07/0.37 % Starting new_bool_3 with 136s (1) cores
% 0.07/0.37 % Starting new_bool_1 with 136s (1) cores
% 0.07/0.37 % SubtermCWHack with pid 1283588 completed with status 0
% 0.07/0.37 % Result found by SubtermCWHack
% 0.07/0.37 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.07/0.37 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.37 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.07/0.37 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.07/0.37 % No SInE strategy applied
% 0.07/0.37 % Search class: FUHPF-FFSF00-SFFFFFNN
% 0.07/0.37 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.07/0.37 % Starting SubtermCWHack with 136s (1) cores
% 0.07/0.37 % Preprocessing time : 0.001 s
% 0.07/0.37
% 0.07/0.37 % Proof found!
% 0.07/0.37 % SZS status Theorem
% 0.07/0.37 % SZS output start CNFRefutation
% See solution above
% 0.07/0.37 % Parsed axioms : 7
% 0.07/0.37 % Removed by relevancy pruning/SinE : 0
% 0.07/0.37 % Initial clauses : 14
% 0.07/0.37 % Removed in clause preprocessing : 12
% 0.07/0.37 % Initial clauses in saturation : 2
% 0.07/0.37 % Processed clauses : 1
% 0.07/0.37 % ...of these trivial : 0
% 0.07/0.37 % ...subsumed : 0
% 0.07/0.37 % ...remaining for further processing : 0
% 0.07/0.37 % Other redundant clauses eliminated : 0
% 0.07/0.37 % Clauses deleted for lack of memory : 0
% 0.07/0.37 % Backward-subsumed : 0
% 0.07/0.37 % Backward-rewritten : 0
% 0.07/0.37 % Generated clauses : 0
% 0.07/0.37 % ...of the previous two non-redundant : 0
% 0.07/0.37 % ...aggressively subsumed : 0
% 0.07/0.37 % Contextual simplify-reflections : 0
% 0.07/0.37 % Paramodulations : 0
% 0.07/0.37 % Factorizations : 0
% 0.07/0.37 % NegExts : 0
% 0.07/0.37 % Equation resolutions : 0
% 0.07/0.37 % Disequality decompositions : 0
% 0.07/0.37 % Total rewrite steps : 0
% 0.07/0.37 % ...of those cached : 0
% 0.07/0.37 % Propositional unsat checks : 0
% 0.07/0.37 % Propositional check models : 0
% 0.07/0.37 % Propositional check unsatisfiable : 0
% 0.07/0.37 % Propositional clauses : 0
% 0.07/0.37 % Propositional clauses after purity: 0
% 0.07/0.37 % Propositional unsat core size : 0
% 0.07/0.37 % Propositional preprocessing time : 0.000
% 0.07/0.37 % Propositional encoding time : 0.000
% 0.07/0.37 % Propositional solver time : 0.000
% 0.07/0.37 % Success case prop preproc time : 0.000
% 0.07/0.37 % Success case prop encoding time : 0.000
% 0.07/0.37 % Success case prop solver time : 0.000
% 0.07/0.37 % Current number of processed clauses : 0
% 0.07/0.37 % Positive orientable unit clauses : 0
% 0.07/0.37 % Positive unorientable unit clauses: 0
% 0.07/0.37 % Negative unit clauses : 0
% 0.07/0.37 % Non-unit-clauses : 0
% 0.07/0.37 % Current number of unprocessed clauses: 1
% 0.07/0.37 % ...number of literals in the above : 0
% 0.07/0.37 % Current number of archived formulas : 0
% 0.07/0.37 % Current number of archived clauses : 3
% 0.07/0.37 % Clause-clause subsumption calls (NU) : 0
% 0.07/0.37 % Rec. Clause-clause subsumption calls : 0
% 0.07/0.37 % Non-unit clause-clause subsumptions : 0
% 0.07/0.37 % Unit Clause-clause subsumption calls : 0
% 0.07/0.37 % Rewrite failures with RHS unbound : 0
% 0.07/0.37 % BW rewrite match attempts : 0
% 0.07/0.37 % BW rewrite match successes : 0
% 0.07/0.37 % Condensation attempts : 0
% 0.07/0.37 % Condensation successes : 0
% 0.07/0.37 % Termbank termtop insertions : 455
% 0.07/0.37 % Search garbage collected termcells : 131
% 0.07/0.37
% 0.07/0.37 % -------------------------------------------------
% 0.07/0.37 % User time : 0.002 s
% 0.07/0.37 % System time : 0.001 s
% 0.07/0.37 % Total time : 0.003 s
% 0.07/0.37 % Maximum resident set size: 3628 pages
% 0.07/0.37
% 0.07/0.37 % -------------------------------------------------
% 0.07/0.37 % User time : 0.006 s
% 0.07/0.37 % System time : 0.005 s
% 0.07/0.37 % Total time : 0.010 s
% 0.07/0.37 % Maximum resident set size: 4864 pages
% 0.07/0.37 % E exiting
%------------------------------------------------------------------------------