%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL536+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/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 01:13:00 PM UTC 2026
% Result : Theorem 0.17s 0.54s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of formulae : 29 ( 15 unt; 0 def)
% Number of atoms : 54 ( 4 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 45 ( 20 ~; 16 |; 4 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 7 ( 5 usr; 5 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 20 ( 0 sgn 10 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(s1_0_m10_axiom_m10,conjecture,
axiom_m10,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_0_m10_axiom_m10) ).
fof(necessitation,axiom,
( necessitation
<=> ! [X1] :
( is_a_theorem(X1)
=> is_a_theorem(necessarily(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+0.ax',necessitation) ).
fof(op_strict_implies,axiom,
( op_strict_implies
=> ! [X1,X2] : strict_implies(X1,X2) = necessarily(implies(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+1.ax',op_strict_implies) ).
fof(axiom_m10,axiom,
( axiom_m10
<=> ! [X1] : is_a_theorem(strict_implies(possibly(X1),necessarily(possibly(X1)))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+0.ax',axiom_m10) ).
fof(km5_necessitation,axiom,
necessitation,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+2.ax',km5_necessitation) ).
fof(s1_0_op_strict_implies,axiom,
op_strict_implies,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_0_op_strict_implies) ).
fof(axiom_5,axiom,
( axiom_5
<=> ! [X1] : is_a_theorem(implies(possibly(X1),necessarily(possibly(X1)))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+0.ax',axiom_5) ).
fof(km5_axiom_5,axiom,
axiom_5,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+2.ax',km5_axiom_5) ).
fof(c_0_8,negated_conjecture,
~ axiom_m10,
inference(assume_negation,[status(cth)],[s1_0_m10_axiom_m10]) ).
fof(c_0_9,negated_conjecture,
~ axiom_m10,
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_10,plain,
! [X127] :
( ( necessitation
| ~ is_a_theorem(necessarily(esk56_0)) )
& ( necessitation
| is_a_theorem(esk56_0) )
& ( is_a_theorem(necessarily(X127))
| ~ is_a_theorem(X127)
| ~ necessitation ) ),
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)],[necessitation])])])])])]) ).
fof(c_0_11,plain,
! [X207,X208] :
( strict_implies(X207,X208) = necessarily(implies(X207,X208))
| ~ op_strict_implies ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_strict_implies])])])]) ).
fof(c_0_12,plain,
! [X203] :
( ( axiom_m10
| ~ is_a_theorem(strict_implies(possibly(esk94_0),necessarily(possibly(esk94_0)))) )
& ( is_a_theorem(strict_implies(possibly(X203),necessarily(possibly(X203))))
| ~ axiom_m10 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_m10])])])])]) ).
fof(c_0_13,negated_conjecture,
~ axiom_m10,
inference(fof_nnf,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( ~ is_a_theorem(X1)
| ~ necessitation
| is_a_theorem(necessarily(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
necessitation,
inference(split_conjunct,[status(thm)],[km5_necessitation]) ).
cnf(c_0_16,plain,
( ~ op_strict_implies
| strict_implies(X1,X2) = necessarily(implies(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
op_strict_implies,
inference(split_conjunct,[status(thm)],[s1_0_op_strict_implies]) ).
fof(c_0_18,plain,
! [X151] :
( ( axiom_5
| ~ is_a_theorem(implies(possibly(esk68_0),necessarily(possibly(esk68_0)))) )
& ( is_a_theorem(implies(possibly(X151),necessarily(possibly(X151))))
| ~ axiom_5 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_5])])])])]) ).
cnf(c_0_19,plain,
( ~ is_a_theorem(strict_implies(possibly(esk94_0),necessarily(possibly(esk94_0))))
| axiom_m10 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,negated_conjecture,
~ axiom_m10,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
( ~ is_a_theorem(X1)
| is_a_theorem(necessarily(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]) ).
cnf(c_0_22,plain,
necessarily(implies(X1,X2)) = strict_implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]) ).
cnf(c_0_23,plain,
( ~ axiom_5
| is_a_theorem(implies(possibly(X1),necessarily(possibly(X1)))) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,plain,
axiom_5,
inference(split_conjunct,[status(thm)],[km5_axiom_5]) ).
cnf(c_0_25,plain,
~ is_a_theorem(strict_implies(possibly(esk94_0),necessarily(possibly(esk94_0)))),
inference(sr,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,plain,
( ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(strict_implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
is_a_theorem(implies(possibly(X1),necessarily(possibly(X1)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]) ).
cnf(c_0_28,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL536+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.38 % Computer : n014.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8046.5625MB
% 0.13/0.38 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Mon Sep 21 00:37:20 UTC 2026
% 0.13/0.38 % CPUTime :
% 0.13/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 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.17/0.54 % Version: 3.5.1
% 0.17/0.54 % Preprocessing class: FSLSSLSSSSSNFFN.
% 0.17/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.54 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 1500s (5) cores
% 0.17/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.17/0.54 % Starting new_bool_1 with 300s (1) cores
% 0.17/0.54 % Starting sh5l with 300s (1) cores
% 0.17/0.54 % new_bool_1 with pid 2782660 completed with status 9
% 0.17/0.54 % H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with pid 2782658 completed with status 0
% 0.17/0.54 % Result found by H----_102_C18_F1_PI_AE_CS_SP_PS_S2S
% 0.17/0.54 % Preprocessing class: FSLSSLSSSSSNFFN.
% 0.17/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.54 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 1500s (5) cores
% 0.17/0.54 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.17/0.54 % No SInE strategy applied
% 0.17/0.54 % Search class: FGUSF-FFMM21-MFFFFFNN
% 0.17/0.54 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.54 % Starting SubtermCWHack with 136s (1) cores
% 0.17/0.54 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 151s (1) cores
% 0.17/0.54 % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 136s (1) cores
% 0.17/0.54 % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.17/0.54 % Starting U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.17/0.54 % SubtermCWHack with pid 2782665 completed with status 0
% 0.17/0.54 % Result found by SubtermCWHack
% 0.17/0.54 % Preprocessing class: FSLSSLSSSSSNFFN.
% 0.17/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.54 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 1500s (5) cores
% 0.17/0.54 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.17/0.54 % No SInE strategy applied
% 0.17/0.54 % Search class: FGUSF-FFMM21-MFFFFFNN
% 0.17/0.54 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.54 % Starting SubtermCWHack with 136s (1) cores
% 0.17/0.54 % Preprocessing time : 0.005 s
% 0.17/0.54
% 0.17/0.54 % Proof found!
% 0.17/0.54 % SZS status Theorem
% 0.17/0.54 % SZS output start CNFRefutation
% See solution above
% 0.17/0.54 % Parsed axioms : 88
% 0.17/0.54 % Removed by relevancy pruning/SinE : 0
% 0.17/0.54 % Initial clauses : 146
% 0.17/0.54 % Removed in clause preprocessing : 0
% 0.17/0.54 % Initial clauses in saturation : 146
% 0.17/0.54 % Processed clauses : 98
% 0.17/0.54 % ...of these trivial : 19
% 0.17/0.54 % ...subsumed : 1
% 0.17/0.54 % ...remaining for further processing : 78
% 0.17/0.54 % Other redundant clauses eliminated : 0
% 0.17/0.54 % Clauses deleted for lack of memory : 0
% 0.17/0.54 % Backward-subsumed : 0
% 0.17/0.54 % Backward-rewritten : 0
% 0.17/0.54 % Generated clauses : 39
% 0.17/0.54 % ...of the previous two non-redundant : 22
% 0.17/0.54 % ...aggressively subsumed : 0
% 0.17/0.54 % Contextual simplify-reflections : 0
% 0.17/0.54 % Paramodulations : 39
% 0.17/0.54 % Factorizations : 0
% 0.17/0.54 % NegExts : 0
% 0.17/0.54 % Equation resolutions : 0
% 0.17/0.54 % Disequality decompositions : 0
% 0.17/0.54 % Total rewrite steps : 41
% 0.17/0.54 % ...of those cached : 14
% 0.17/0.54 % Propositional unsat checks : 0
% 0.17/0.54 % Propositional check models : 0
% 0.17/0.54 % Propositional check unsatisfiable : 0
% 0.17/0.54 % Propositional clauses : 0
% 0.17/0.54 % Propositional clauses after purity: 0
% 0.17/0.54 % Propositional unsat core size : 0
% 0.17/0.54 % Propositional preprocessing time : 0.000
% 0.17/0.54 % Propositional encoding time : 0.000
% 0.17/0.54 % Propositional solver time : 0.000
% 0.17/0.54 % Success case prop preproc time : 0.000
% 0.17/0.54 % Success case prop encoding time : 0.000
% 0.17/0.54 % Success case prop solver time : 0.000
% 0.17/0.54 % Current number of processed clauses : 78
% 0.17/0.54 % Positive orientable unit clauses : 37
% 0.17/0.54 % Positive unorientable unit clauses: 0
% 0.17/0.54 % Negative unit clauses : 2
% 0.17/0.54 % Non-unit-clauses : 39
% 0.17/0.54 % Current number of unprocessed clauses: 66
% 0.17/0.54 % ...number of literals in the above : 141
% 0.17/0.54 % Current number of archived formulas : 0
% 0.17/0.54 % Current number of archived clauses : 0
% 0.17/0.54 % Clause-clause subsumption calls (NU) : 386
% 0.17/0.54 % Rec. Clause-clause subsumption calls : 156
% 0.17/0.54 % Non-unit clause-clause subsumptions : 0
% 0.17/0.54 % Unit Clause-clause subsumption calls : 27
% 0.17/0.54 % Rewrite failures with RHS unbound : 0
% 0.17/0.54 % BW rewrite match attempts : 2
% 0.17/0.54 % BW rewrite match successes : 0
% 0.17/0.54 % Condensation attempts : 0
% 0.17/0.54 % Condensation successes : 0
% 0.17/0.54 % Termbank termtop insertions : 8795
% 0.17/0.54 % Search garbage collected termcells : 2057
% 0.17/0.54
% 0.17/0.54 % -------------------------------------------------
% 0.17/0.54 % User time : 0.023 s
% 0.17/0.54 % System time : 0.008 s
% 0.17/0.54 % Total time : 0.030 s
% 0.17/0.54 % Maximum resident set size: 3736 pages
% 0.17/0.54
% 0.17/0.54 % -------------------------------------------------
% 0.17/0.54 % User time : 0.079 s
% 0.17/0.54 % System time : 0.060 s
% 0.17/0.54 % Total time : 0.139 s
% 0.17/0.54 % Maximum resident set size: 4864 pages
% 0.17/0.54 % E exiting
%------------------------------------------------------------------------------