%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL544+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 : 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 01:13:01 PM UTC 2026
% Result : Theorem 0.17s 5.65s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of formulae : 44 ( 22 unt; 0 def)
% Number of atoms : 92 ( 4 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 81 ( 33 ~; 31 |; 9 &)
% ( 5 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 9 ( 7 usr; 7 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 8 con; 0-2 aty)
% Number of variables : 44 ( 0 sgn 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(modus_ponens,axiom,
( modus_ponens
<=> ! [X1,X2] :
( ( is_a_theorem(implies(X1,X2))
& is_a_theorem(X1) )
=> is_a_theorem(X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',modus_ponens) ).
fof(implies_2,axiom,
( implies_2
<=> ! [X1,X2] : is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',implies_2) ).
fof(s1_0_axiom_m4,conjecture,
axiom_m4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_0_axiom_m4) ).
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(hilbert_modus_ponens,axiom,
modus_ponens,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',hilbert_modus_ponens) ).
fof(hilbert_implies_2,axiom,
implies_2,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',hilbert_implies_2) ).
fof(and_3,axiom,
( and_3
<=> ! [X1,X2] : is_a_theorem(implies(X1,implies(X2,and(X1,X2)))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',and_3) ).
fof(km4b_necessitation,axiom,
necessitation,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+3.ax',km4b_necessitation) ).
fof(s1_0_op_strict_implies,axiom,
op_strict_implies,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_0_op_strict_implies) ).
fof(hilbert_and_3,axiom,
and_3,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',hilbert_and_3) ).
fof(axiom_m4,axiom,
( axiom_m4
<=> ! [X1] : is_a_theorem(strict_implies(X1,and(X1,X1))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+0.ax',axiom_m4) ).
fof(c_0_12,plain,
! [X7,X8] :
( ( modus_ponens
| ~ is_a_theorem(esk2_0) )
& ( modus_ponens
| is_a_theorem(implies(esk1_0,esk2_0)) )
& ( modus_ponens
| is_a_theorem(esk1_0) )
& ( is_a_theorem(X8)
| ~ is_a_theorem(implies(X7,X8))
| ~ is_a_theorem(X7)
| ~ modus_ponens ) ),
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)],[modus_ponens])])])])])]) ).
fof(c_0_13,plain,
! [X23,X24] :
( ( implies_2
| ~ is_a_theorem(implies(implies(esk9_0,implies(esk9_0,esk10_0)),implies(esk9_0,esk10_0))) )
& ( is_a_theorem(implies(implies(X23,implies(X23,X24)),implies(X23,X24)))
| ~ implies_2 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[implies_2])])])])]) ).
fof(c_0_14,negated_conjecture,
~ axiom_m4,
inference(assume_negation,[status(cth)],[s1_0_axiom_m4]) ).
fof(c_0_15,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_16,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])])])]) ).
cnf(c_0_17,plain,
( ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1)
| ~ modus_ponens
| is_a_theorem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
modus_ponens,
inference(split_conjunct,[status(thm)],[hilbert_modus_ponens]) ).
cnf(c_0_19,plain,
( ~ implies_2
| is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2))) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
implies_2,
inference(split_conjunct,[status(thm)],[hilbert_implies_2]) ).
fof(c_0_21,plain,
! [X41,X42] :
( ( and_3
| ~ is_a_theorem(implies(esk18_0,implies(esk19_0,and(esk18_0,esk19_0)))) )
& ( is_a_theorem(implies(X41,implies(X42,and(X41,X42))))
| ~ and_3 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[and_3])])])])]) ).
fof(c_0_22,negated_conjecture,
~ axiom_m4,
inference(fof_simplification,[status(thm)],[c_0_14]) ).
cnf(c_0_23,plain,
( ~ is_a_theorem(X1)
| ~ necessitation
| is_a_theorem(necessarily(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,plain,
necessitation,
inference(split_conjunct,[status(thm)],[km4b_necessitation]) ).
cnf(c_0_25,plain,
( ~ op_strict_implies
| strict_implies(X1,X2) = necessarily(implies(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_26,plain,
op_strict_implies,
inference(split_conjunct,[status(thm)],[s1_0_op_strict_implies]) ).
cnf(c_0_27,plain,
( ~ is_a_theorem(X2)
| ~ is_a_theorem(implies(X2,X1))
| is_a_theorem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]) ).
cnf(c_0_28,plain,
is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]) ).
cnf(c_0_29,plain,
( ~ and_3
| is_a_theorem(implies(X1,implies(X2,and(X1,X2)))) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_30,plain,
and_3,
inference(split_conjunct,[status(thm)],[hilbert_and_3]) ).
fof(c_0_31,plain,
! [X183] :
( ( axiom_m4
| ~ is_a_theorem(strict_implies(esk84_0,and(esk84_0,esk84_0))) )
& ( is_a_theorem(strict_implies(X183,and(X183,X183)))
| ~ axiom_m4 ) ),
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_m4])])])])]) ).
fof(c_0_32,negated_conjecture,
~ axiom_m4,
inference(fof_nnf,[status(thm)],[c_0_22]) ).
cnf(c_0_33,plain,
( ~ is_a_theorem(X1)
| is_a_theorem(necessarily(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]) ).
cnf(c_0_34,plain,
necessarily(implies(X1,X2)) = strict_implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26])]) ).
cnf(c_0_35,plain,
( ~ is_a_theorem(implies(X1,implies(X1,X2)))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_36,plain,
is_a_theorem(implies(X1,implies(X2,and(X1,X2)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30])]) ).
cnf(c_0_37,plain,
( ~ is_a_theorem(strict_implies(esk84_0,and(esk84_0,esk84_0)))
| axiom_m4 ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_38,negated_conjecture,
~ axiom_m4,
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_39,plain,
( ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(strict_implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_40,plain,
is_a_theorem(implies(X1,and(X1,X1))),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_41,plain,
~ is_a_theorem(strict_implies(esk84_0,and(esk84_0,esk84_0))),
inference(sr,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,plain,
is_a_theorem(strict_implies(X1,and(X1,X1))),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_43,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_42])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL544+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/5.40 % Computer : n010.cluster.edu
% 0.13/5.40 % Model : x86_64 x86_64
% 0.13/5.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/5.40 % Memory : 8046.5625MB
% 0.13/5.40 % OS : Linux 6.8.0-71-generic
% 0.13/5.40 % CPULimit : 300
% 0.13/5.40 % WCLimit : 300
% 0.13/5.40 % DateTime : Mon Sep 21 00:38:03 UTC 2026
% 0.13/5.40 % CPUTime :
% 0.13/5.41 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/5.47 Running first-order theorem proving
% 0.13/5.47 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/5.65 % Version: 3.5.1
% 0.17/5.65 % Preprocessing class: FSLSSLSSSSSNFFN.
% 0.17/5.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/5.65 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 1500s (5) cores
% 0.17/5.65 % Starting new_bool_3 with 300s (1) cores
% 0.17/5.65 % Starting new_bool_1 with 300s (1) cores
% 0.17/5.65 % Starting sh5l with 300s (1) cores
% 0.17/5.65 % new_bool_3 with pid 3882742 completed with status 9
% 0.17/5.65 % new_bool_1 with pid 3882743 completed with status 9
% 0.17/5.65 % sh5l with pid 3882744 completed with status 9
% 0.17/5.65 % H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with pid 3882741 completed with status 0
% 0.17/5.65 % Result found by H----_102_C18_F1_PI_AE_CS_SP_PS_S2S
% 0.17/5.65 % Preprocessing class: FSLSSLSSSSSNFFN.
% 0.17/5.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/5.65 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 1500s (5) cores
% 0.17/5.65 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.17/5.65 % No SInE strategy applied
% 0.17/5.65 % Search class: FGUSF-FFMM21-MFFFFFNN
% 0.17/5.65 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/5.65 % Starting SubtermCWHack with 136s (1) cores
% 0.17/5.65 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 151s (1) cores
% 0.17/5.65 % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 136s (1) cores
% 0.17/5.65 % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.17/5.65 % Starting U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.17/5.65 % H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with pid 3882766 completed with status 0
% 0.17/5.65 % Result found by H----_102_C18_F1_PI_AE_CS_SP_PS_S2S
% 0.17/5.65 % Preprocessing class: FSLSSLSSSSSNFFN.
% 0.17/5.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/5.65 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 1500s (5) cores
% 0.17/5.65 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.17/5.65 % No SInE strategy applied
% 0.17/5.65 % Search class: FGUSF-FFMM21-MFFFFFNN
% 0.17/5.65 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/5.65 % Starting SubtermCWHack with 136s (1) cores
% 0.17/5.65 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 151s (1) cores
% 0.17/5.65 % Preprocessing time : 0.005 s
% 0.17/5.65 % Presaturation interreduction done
% 0.17/5.65
% 0.17/5.65 % Proof found!
% 0.17/5.65 % SZS status Theorem
% 0.17/5.65 % SZS output start CNFRefutation
% See solution above
% 0.17/5.65 % Parsed axioms : 89
% 0.17/5.65 % Removed by relevancy pruning/SinE : 0
% 0.17/5.65 % Initial clauses : 147
% 0.17/5.65 % Removed in clause preprocessing : 0
% 0.17/5.65 % Initial clauses in saturation : 147
% 0.17/5.65 % Processed clauses : 482
% 0.17/5.65 % ...of these trivial : 46
% 0.17/5.65 % ...subsumed : 54
% 0.17/5.65 % ...remaining for further processing : 382
% 0.17/5.65 % Other redundant clauses eliminated : 0
% 0.17/5.65 % Clauses deleted for lack of memory : 0
% 0.17/5.65 % Backward-subsumed : 1
% 0.17/5.65 % Backward-rewritten : 23
% 0.17/5.65 % Generated clauses : 911
% 0.17/5.65 % ...of the previous two non-redundant : 739
% 0.17/5.65 % ...aggressively subsumed : 0
% 0.17/5.65 % Contextual simplify-reflections : 4
% 0.17/5.65 % Paramodulations : 911
% 0.17/5.65 % Factorizations : 0
% 0.17/5.65 % NegExts : 0
% 0.17/5.65 % Equation resolutions : 0
% 0.17/5.65 % Disequality decompositions : 0
% 0.17/5.65 % Total rewrite steps : 540
% 0.17/5.65 % ...of those cached : 251
% 0.17/5.65 % Propositional unsat checks : 0
% 0.17/5.65 % Propositional check models : 0
% 0.17/5.65 % Propositional check unsatisfiable : 0
% 0.17/5.65 % Propositional clauses : 0
% 0.17/5.65 % Propositional clauses after purity: 0
% 0.17/5.65 % Propositional unsat core size : 0
% 0.17/5.65 % Propositional preprocessing time : 0.000
% 0.17/5.65 % Propositional encoding time : 0.000
% 0.17/5.65 % Propositional solver time : 0.000
% 0.17/5.65 % Success case prop preproc time : 0.000
% 0.17/5.65 % Success case prop encoding time : 0.000
% 0.17/5.65 % Success case prop solver time : 0.000
% 0.17/5.65 % Current number of processed clauses : 243
% 0.17/5.65 % Positive orientable unit clauses : 109
% 0.17/5.65 % Positive unorientable unit clauses: 1
% 0.17/5.65 % Negative unit clauses : 3
% 0.17/5.65 % Non-unit-clauses : 130
% 0.17/5.65 % Current number of unprocessed clauses: 519
% 0.17/5.65 % ...number of literals in the above : 791
% 0.17/5.65 % Current number of archived formulas : 0
% 0.17/5.65 % Current number of archived clauses : 139
% 0.17/5.65 % Clause-clause subsumption calls (NU) : 4732
% 0.17/5.65 % Rec. Clause-clause subsumption calls : 2646
% 0.17/5.65 % Non-unit clause-clause subsumptions : 57
% 0.17/5.65 % Unit Clause-clause subsumption calls : 527
% 0.17/5.65 % Rewrite failures with RHS unbound : 0
% 0.17/5.65 % BW rewrite match attempts : 201
% 0.17/5.65 % BW rewrite match successes : 16
% 0.17/5.65 % Condensation attempts : 0
% 0.17/5.65 % Condensation successes : 0
% 0.17/5.65 % Termbank termtop insertions : 19501
% 0.17/5.65 % Search garbage collected termcells : 2057
% 0.17/5.65
% 0.17/5.65 % -------------------------------------------------
% 0.17/5.65 % User time : 0.061 s
% 0.17/5.65 % System time : 0.014 s
% 0.17/5.65 % Total time : 0.074 s
% 0.17/5.65 % Maximum resident set size: 3940 pages
% 0.17/5.65
% 0.17/5.65 % -------------------------------------------------
% 0.17/5.65 % User time : 0.273 s
% 0.17/5.65 % System time : 0.132 s
% 0.17/5.65 % Total time : 0.404 s
% 0.17/5.65 % Maximum resident set size: 4608 pages
% 0.17/5.65 % E exiting
%------------------------------------------------------------------------------