%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PLA053_2 : 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 : n013.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:58:57 PM UTC 2026
% Result : Theorem 0.11s 0.43s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 23 ( 11 unt; 0 typ; 0 def)
% Number of atoms : 70 ( 0 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 78 ( 31 ~; 26 |; 11 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 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 : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 36 ( 0 sgn 33 !; 3 ?; 18 :)
% 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,
h: ( $i * '$ki_world' ) > $o ).
tff(decl_26,type,
bomb: ( $i * '$ki_world' ) > $o ).
tff(decl_27,type,
defused: ( $i * '$ki_world' ) > $o ).
tff(decl_28,type,
'$ki_exists_in_world_$i': ( $i * '$ki_world' ) > $o ).
tff(decl_32,type,
esk4_2: ( $i * '$ki_world' ) > $i ).
tff(decl_33,type,
esk5_0: '$ki_world' ).
tff(decl_34,type,
esk6_0: $i ).
tff(verify,conjecture,
! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ! [X2] :
( '$ki_exists_in_world_$i'(X1,X2)
=> ? [X6] :
( ( ( h(X1,X6)
& bomb(X1,X2) )
=> defused(X1,X2) )
& '$ki_exists_in_world_$i'(X1,X6) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',verify) ).
tff(ax3,axiom,
! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ! [X2] :
( '$ki_exists_in_world_$i'(X1,X2)
=> ? [X6] :
( ! [X5: '$ki_world'] :
( '$ki_accessible'(X1,X5)
=> ( ( h(X5,X6)
& bomb(X5,X2) )
=> defused(X5,X2) ) )
& '$ki_exists_in_world_$i'(X1,X6) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax3) ).
tff('$ki_exists_in_world_$i_const',axiom,
! [X1: '$ki_world',X2] : '$ki_exists_in_world_$i'(X1,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','$ki_exists_in_world_$i_const') ).
tff(mrel_reflexive,axiom,
! [X1: '$ki_world'] : '$ki_accessible'(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mrel_reflexive) ).
tff(c_0_4,negated_conjecture,
~ ! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ! [X2] :
( '$ki_exists_in_world_$i'(X1,X2)
=> ? [X6] :
( ( ( h(X1,X6)
& bomb(X1,X2) )
=> defused(X1,X2) )
& '$ki_exists_in_world_$i'(X1,X6) ) ) ),
inference(assume_negation,[status(cth)],[verify]) ).
tff(c_0_5,plain,
! [X18: '$ki_world',X19,X21: '$ki_world'] :
( ( ~ '$ki_accessible'('$ki_local_world',X18)
| ~ '$ki_exists_in_world_$i'(X18,X19)
| defused(X21,X19)
| ~ h(X21,esk4_2(X18,X19))
| ~ bomb(X21,X19)
| ~ '$ki_accessible'(X18,X21) )
& ( ~ '$ki_accessible'('$ki_local_world',X18)
| ~ '$ki_exists_in_world_$i'(X18,X19)
| '$ki_exists_in_world_$i'(X18,esk4_2(X18,X19)) ) ),
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)],[ax3])])])])])]) ).
tff(c_0_6,plain,
! [X8: '$ki_world',X9] : '$ki_exists_in_world_$i'(X8,X9),
inference(variable_rename,[status(thm)],['$ki_exists_in_world_$i_const']) ).
tff(c_0_7,negated_conjecture,
! [X24] :
( ( ~ '$ki_exists_in_world_$i'(esk5_0,X24)
| ~ defused(esk5_0,esk6_0) )
& ( ~ '$ki_exists_in_world_$i'(esk5_0,X24)
| h(esk5_0,X24) )
& ( ~ '$ki_exists_in_world_$i'(esk5_0,X24)
| bomb(esk5_0,esk6_0) )
& '$ki_exists_in_world_$i'(esk5_0,esk6_0)
& '$ki_accessible'('$ki_local_world',esk5_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_4])])])])])]) ).
tcf(c_0_8,plain,
! [X5: '$ki_world',X2,X1: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X1)
| ~ '$ki_exists_in_world_$i'(X1,X2)
| ~ h(X5,esk4_2(X1,X2))
| ~ bomb(X5,X2)
| ~ '$ki_accessible'(X1,X5)
| defused(X5,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
tcf(c_0_9,plain,
! [X1: '$ki_world',X2] : '$ki_exists_in_world_$i'(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
tcf(c_0_10,negated_conjecture,
! [X2] :
( ~ '$ki_exists_in_world_$i'(esk5_0,X2)
| h(esk5_0,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
tcf(c_0_11,plain,
! [X1: '$ki_world',X5: '$ki_world',X2] :
( ~ h(X5,esk4_2(X1,X2))
| ~ '$ki_accessible'('$ki_local_world',X1)
| ~ '$ki_accessible'(X1,X5)
| ~ bomb(X5,X2)
| defused(X5,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9])]) ).
tcf(c_0_12,negated_conjecture,
! [X2] : h(esk5_0,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_9])]) ).
tcf(c_0_13,negated_conjecture,
! [X2] :
( ~ '$ki_exists_in_world_$i'(esk5_0,X2)
| bomb(esk5_0,esk6_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
tcf(c_0_14,negated_conjecture,
! [X2] :
( ~ '$ki_exists_in_world_$i'(esk5_0,X2)
| ~ defused(esk5_0,esk6_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
tcf(c_0_15,negated_conjecture,
! [X2,X1: '$ki_world'] :
( ~ '$ki_accessible'(X1,esk5_0)
| ~ '$ki_accessible'('$ki_local_world',X1)
| ~ bomb(esk5_0,X2)
| defused(esk5_0,X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
tcf(c_0_16,negated_conjecture,
bomb(esk5_0,esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_9])]) ).
tcf(c_0_17,negated_conjecture,
~ defused(esk5_0,esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_9])]) ).
tff(c_0_18,plain,
! [X7: '$ki_world'] : '$ki_accessible'(X7,X7),
inference(variable_rename,[status(thm)],[mrel_reflexive]) ).
tcf(c_0_19,negated_conjecture,
! [X1: '$ki_world'] :
( ~ '$ki_accessible'(X1,esk5_0)
| ~ '$ki_accessible'('$ki_local_world',X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
tcf(c_0_20,plain,
! [X1: '$ki_world'] : '$ki_accessible'(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
tcf(c_0_21,negated_conjecture,
'$ki_accessible'('$ki_local_world',esk5_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PLA053_2 : TPTP v9.3.1. Released v8.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n013.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 21 03:38:20 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.41 Running first-order theorem proving
% 0.11/0.41 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.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 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 4059710 completed with status 0
% 0.11/0.43 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 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 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.43 % No SInE strategy applied
% 0.11/0.43 % Search class: FHUNS-FFSF21-SFFFFFNN
% 0.11/0.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.11/0.43 % Starting G-E--_107_C18_F1_AE_Q4_CS_SP_S0Y with 136s (1) cores
% 0.11/0.43 % Starting new_bool_3 with 136s (1) cores
% 0.11/0.43 % Starting new_bool_1 with 136s (1) cores
% 0.11/0.43 % new_bool_1 with pid 4059718 completed with status 0
% 0.11/0.43 % Result found by new_bool_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 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.43 % No SInE strategy applied
% 0.11/0.43 % Search class: FHUNS-FFSF21-SFFFFFNN
% 0.11/0.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.11/0.43 % Starting G-E--_107_C18_F1_AE_Q4_CS_SP_S0Y with 136s (1) cores
% 0.11/0.43 % Starting new_bool_3 with 136s (1) cores
% 0.11/0.43 % Starting new_bool_1 with 136s (1) cores
% 0.11/0.43 % Preprocessing time : 0.001 s
% 0.11/0.43 % Presaturation interreduction done
% 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 : 14
% 0.11/0.43 % Removed by relevancy pruning/SinE : 0
% 0.11/0.43 % Initial clauses : 21
% 0.11/0.43 % Removed in clause preprocessing : 13
% 0.11/0.43 % Initial clauses in saturation : 8
% 0.11/0.43 % Processed clauses : 19
% 0.11/0.43 % ...of these trivial : 0
% 0.11/0.43 % ...subsumed : 0
% 0.11/0.43 % ...remaining for further processing : 19
% 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 : 1
% 0.11/0.43 % Backward-rewritten : 0
% 0.11/0.43 % Generated clauses : 7
% 0.11/0.43 % ...of the previous two non-redundant : 5
% 0.11/0.43 % ...aggressively subsumed : 0
% 0.11/0.43 % Contextual simplify-reflections : 0
% 0.11/0.43 % Paramodulations : 7
% 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 : 1
% 0.11/0.43 % ...of those cached : 0
% 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 : 10
% 0.11/0.43 % Positive orientable unit clauses : 6
% 0.11/0.43 % Positive unorientable unit clauses: 0
% 0.11/0.43 % Negative unit clauses : 1
% 0.11/0.43 % Non-unit-clauses : 3
% 0.11/0.43 % Current number of unprocessed clauses: 2
% 0.11/0.43 % ...number of literals in the above : 8
% 0.11/0.43 % Current number of archived formulas : 0
% 0.11/0.43 % Current number of archived clauses : 10
% 0.11/0.43 % Clause-clause subsumption calls (NU) : 2
% 0.11/0.43 % Rec. Clause-clause subsumption calls : 1
% 0.11/0.43 % Non-unit clause-clause subsumptions : 1
% 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 : 1133
% 0.11/0.43 % Search garbage collected termcells : 252
% 0.11/0.43
% 0.11/0.43 % -------------------------------------------------
% 0.11/0.43 % User time : 0.003 s
% 0.11/0.43 % System time : 0.002 s
% 0.11/0.43 % Total time : 0.005 s
% 0.11/0.43 % Maximum resident set size: 3640 pages
% 0.11/0.43
% 0.11/0.43 % -------------------------------------------------
% 0.11/0.43 % User time : 0.008 s
% 0.11/0.43 % System time : 0.016 s
% 0.11/0.43 % Total time : 0.024 s
% 0.11/0.43 % Maximum resident set size: 4864 pages
% 0.11/0.43 % E exiting
%------------------------------------------------------------------------------