%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : LCL452+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/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:19:31 PM UTC 2026
% Result : Theorem 0.15s 0.60s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of formulae : 28 ( 16 unt; 0 def)
% Number of atoms : 44 ( 8 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 31 ( 15 ~; 10 |; 2 &)
% ( 2 <=>; 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 : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 28 ( 2 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(luka_cn2,conjecture,
cn2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',luka_cn2) ).
fof(op_implies_and,axiom,
( op_implies_and
=> ! [X1,X2] : implies(X1,X2) = not(and(X1,not(X2))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax',op_implies_and) ).
fof(cn2,axiom,
( cn2
<=> ! [X4,X5] : is_a_theorem(implies(X4,implies(not(X4),X5))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',cn2) ).
fof(op_or,axiom,
( op_or
=> ! [X1,X2] : or(X1,X2) = not(and(not(X1),not(X2))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax',op_or) ).
fof(hilbert_op_implies_and,axiom,
op_implies_and,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_op_implies_and) ).
fof(or_1,axiom,
( or_1
<=> ! [X1,X2] : is_a_theorem(implies(X1,or(X1,X2))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',or_1) ).
fof(hilbert_op_or,axiom,
op_or,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_op_or) ).
fof(hilbert_or_1,axiom,
or_1,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_or_1) ).
fof(c_0_8,negated_conjecture,
~ cn2,
inference(assume_negation,[status(cth)],[luka_cn2]) ).
fof(c_0_9,negated_conjecture,
~ cn2,
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_10,plain,
! [X121,X122] :
( implies(X121,X122) = not(and(X121,not(X122)))
| ~ op_implies_and ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_implies_and])])])]) ).
fof(c_0_11,plain,
! [X89,X90] :
( ( cn2
| ~ is_a_theorem(implies(esk42_0,implies(not(esk42_0),esk43_0))) )
& ( is_a_theorem(implies(X89,implies(not(X89),X90)))
| ~ cn2 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cn2])])])])]) ).
fof(c_0_12,negated_conjecture,
~ cn2,
inference(fof_nnf,[status(thm)],[c_0_9]) ).
fof(c_0_13,plain,
! [X117,X118] :
( or(X117,X118) = not(and(not(X117),not(X118)))
| ~ op_or ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_or])])])]) ).
cnf(c_0_14,plain,
( ~ op_implies_and
| implies(X1,X2) = not(and(X1,not(X2))) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
op_implies_and,
inference(split_conjunct,[status(thm)],[hilbert_op_implies_and]) ).
fof(c_0_16,plain,
! [X45,X46] :
( ( or_1
| ~ is_a_theorem(implies(esk20_0,or(esk20_0,esk21_0))) )
& ( is_a_theorem(implies(X45,or(X45,X46)))
| ~ or_1 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[or_1])])])])]) ).
cnf(c_0_17,plain,
( ~ is_a_theorem(implies(esk42_0,implies(not(esk42_0),esk43_0)))
| cn2 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,negated_conjecture,
~ cn2,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
( ~ op_or
| or(X1,X2) = not(and(not(X1),not(X2))) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
not(and(X1,not(X2))) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]) ).
cnf(c_0_21,plain,
op_or,
inference(split_conjunct,[status(thm)],[hilbert_op_or]) ).
cnf(c_0_22,plain,
( ~ or_1
| is_a_theorem(implies(X1,or(X1,X2))) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
or_1,
inference(split_conjunct,[status(thm)],[hilbert_or_1]) ).
cnf(c_0_24,plain,
~ is_a_theorem(implies(esk42_0,implies(not(esk42_0),esk43_0))),
inference(sr,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_25,plain,
implies(not(X1),X2) = or(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_26,plain,
is_a_theorem(implies(X1,or(X1,X2))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]) ).
cnf(c_0_27,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL452+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.53 % Computer : n013.cluster.edu
% 0.11/0.53 % Model : x86_64 x86_64
% 0.11/0.53 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.53 % Memory : 8046.5625MB
% 0.11/0.53 % OS : Linux 6.8.0-71-generic
% 0.11/0.53 % CPULimit : 300
% 0.11/0.53 % WCLimit : 300
% 0.11/0.53 % DateTime : Mon Sep 21 00:33:07 UTC 2026
% 0.11/0.53 % CPUTime :
% 0.11/0.53 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.57 Running first-order theorem proving
% 0.15/0.57 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.15/0.60 % Version: 3.5.1
% 0.15/0.60 % Preprocessing class: FSMSSLSSSSSNFFN.
% 0.15/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.60 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.15/0.60 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.60 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.60 % Starting sh5l with 300s (1) cores
% 0.15/0.60 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with pid 3781718 completed with status 0
% 0.15/0.60 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 0.15/0.60 % Preprocessing class: FSMSSLSSSSSNFFN.
% 0.15/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.60 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.15/0.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.60 % No SInE strategy applied
% 0.15/0.60 % Search class: FGUSF-FFMM21-MFFFFFNN
% 0.15/0.60 % Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.60 % Starting SubtermCWHack with 151s (1) cores
% 0.15/0.60 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 750s (1) cores
% 0.15/0.60 % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 151s (1) cores
% 0.15/0.60 % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 151s (1) cores
% 0.15/0.60 % Starting U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.60 % SubtermCWHack with pid 3781727 completed with status 0
% 0.15/0.60 % Result found by SubtermCWHack
% 0.15/0.60 % Preprocessing class: FSMSSLSSSSSNFFN.
% 0.15/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.60 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.15/0.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.60 % No SInE strategy applied
% 0.15/0.60 % Search class: FGUSF-FFMM21-MFFFFFNN
% 0.15/0.60 % Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.60 % Starting SubtermCWHack with 151s (1) cores
% 0.15/0.60 % Preprocessing time : 0.001 s
% 0.15/0.60
% 0.15/0.60 % Proof found!
% 0.15/0.60 % SZS status Theorem
% 0.15/0.60 % SZS output start CNFRefutation
% See solution above
% 0.15/0.60 % Parsed axioms : 53
% 0.15/0.60 % Removed by relevancy pruning/SinE : 0
% 0.15/0.60 % Initial clauses : 82
% 0.15/0.60 % Removed in clause preprocessing : 0
% 0.15/0.60 % Initial clauses in saturation : 82
% 0.15/0.60 % Processed clauses : 77
% 0.15/0.60 % ...of these trivial : 14
% 0.15/0.60 % ...subsumed : 3
% 0.15/0.60 % ...remaining for further processing : 60
% 0.15/0.60 % Other redundant clauses eliminated : 0
% 0.15/0.60 % Clauses deleted for lack of memory : 0
% 0.15/0.60 % Backward-subsumed : 0
% 0.15/0.60 % Backward-rewritten : 3
% 0.15/0.60 % Generated clauses : 66
% 0.15/0.60 % ...of the previous two non-redundant : 53
% 0.15/0.60 % ...aggressively subsumed : 0
% 0.15/0.60 % Contextual simplify-reflections : 0
% 0.15/0.60 % Paramodulations : 66
% 0.15/0.60 % Factorizations : 0
% 0.15/0.60 % NegExts : 0
% 0.15/0.60 % Equation resolutions : 0
% 0.15/0.60 % Disequality decompositions : 0
% 0.15/0.60 % Total rewrite steps : 39
% 0.15/0.60 % ...of those cached : 12
% 0.15/0.60 % Propositional unsat checks : 0
% 0.15/0.60 % Propositional check models : 0
% 0.15/0.60 % Propositional check unsatisfiable : 0
% 0.15/0.60 % Propositional clauses : 0
% 0.15/0.60 % Propositional clauses after purity: 0
% 0.15/0.60 % Propositional unsat core size : 0
% 0.15/0.60 % Propositional preprocessing time : 0.000
% 0.15/0.60 % Propositional encoding time : 0.000
% 0.15/0.60 % Propositional solver time : 0.000
% 0.15/0.60 % Success case prop preproc time : 0.000
% 0.15/0.60 % Success case prop encoding time : 0.000
% 0.15/0.60 % Success case prop solver time : 0.000
% 0.15/0.60 % Current number of processed clauses : 57
% 0.15/0.60 % Positive orientable unit clauses : 30
% 0.15/0.60 % Positive unorientable unit clauses: 0
% 0.15/0.60 % Negative unit clauses : 3
% 0.15/0.60 % Non-unit-clauses : 24
% 0.15/0.60 % Current number of unprocessed clauses: 46
% 0.15/0.60 % ...number of literals in the above : 107
% 0.15/0.60 % Current number of archived formulas : 0
% 0.15/0.60 % Current number of archived clauses : 3
% 0.15/0.60 % Clause-clause subsumption calls (NU) : 27
% 0.15/0.60 % Rec. Clause-clause subsumption calls : 27
% 0.15/0.60 % Non-unit clause-clause subsumptions : 2
% 0.15/0.60 % Unit Clause-clause subsumption calls : 15
% 0.15/0.60 % Rewrite failures with RHS unbound : 0
% 0.15/0.60 % BW rewrite match attempts : 6
% 0.15/0.60 % BW rewrite match successes : 3
% 0.15/0.60 % Condensation attempts : 0
% 0.15/0.60 % Condensation successes : 0
% 0.15/0.60 % Termbank termtop insertions : 5190
% 0.15/0.60 % Search garbage collected termcells : 1092
% 0.15/0.60
% 0.15/0.60 % -------------------------------------------------
% 0.15/0.60 % User time : 0.006 s
% 0.15/0.60 % System time : 0.006 s
% 0.15/0.60 % Total time : 0.012 s
% 0.15/0.60 % Maximum resident set size: 3688 pages
% 0.15/0.60
% 0.15/0.60 % -------------------------------------------------
% 0.15/0.60 % User time : 0.014 s
% 0.15/0.60 % System time : 0.020 s
% 0.15/0.60 % Total time : 0.035 s
% 0.15/0.60 % Maximum resident set size: 4608 pages
% 0.15/0.60 % E exiting
%------------------------------------------------------------------------------