%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL455+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 : n003.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:12:49 PM UTC 2026
% Result : Theorem 0.03s 0.45s
% Output : CNFRefutation 0.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 15 ( 9 unt; 0 def)
% Number of atoms : 25 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 20 ( 10 ~; 6 |; 2 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 3 prp; 0-1 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 12 ( 2 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(principia_r2,conjecture,
r2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_r2) ).
fof(or_2,axiom,
( or_2
<=> ! [X1,X2] : is_a_theorem(implies(X2,or(X1,X2))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',or_2) ).
fof(r2,axiom,
( r2
<=> ! [X4,X5] : is_a_theorem(implies(X5,or(X4,X5))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',r2) ).
fof(hilbert_or_2,axiom,
or_2,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',hilbert_or_2) ).
fof(c_0_4,negated_conjecture,
~ r2,
inference(assume_negation,[status(cth)],[principia_r2]) ).
fof(c_0_5,plain,
! [X49,X50] :
( ( or_2
| ~ is_a_theorem(implies(esk23_0,or(esk22_0,esk23_0))) )
& ( is_a_theorem(implies(X50,or(X49,X50)))
| ~ or_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)],[or_2])])])])]) ).
fof(c_0_6,negated_conjecture,
~ r2,
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_7,plain,
! [X97,X98] :
( ( r2
| ~ is_a_theorem(implies(esk47_0,or(esk46_0,esk47_0))) )
& ( is_a_theorem(implies(X98,or(X97,X98)))
| ~ r2 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[r2])])])])]) ).
cnf(c_0_8,plain,
( ~ or_2
| is_a_theorem(implies(X1,or(X2,X1))) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
or_2,
inference(split_conjunct,[status(thm)],[hilbert_or_2]) ).
fof(c_0_10,negated_conjecture,
~ r2,
inference(fof_nnf,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( ~ is_a_theorem(implies(esk47_0,or(esk46_0,esk47_0)))
| r2 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
is_a_theorem(implies(X1,or(X2,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9])]) ).
cnf(c_0_13,negated_conjecture,
~ r2,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12])]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL455+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.36 % Computer : n003.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.03/0.36 % CPULimit : 300
% 0.03/0.36 % WCLimit : 300
% 0.03/0.36 % DateTime : Mon Sep 21 00:34:45 UTC 2026
% 0.03/0.36 % CPUTime :
% 0.03/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.03/0.42 Running first-order theorem proving
% 0.03/0.42 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.03/0.45 % Version: 3.5.1
% 0.03/0.45 % Preprocessing class: FSMSSLSSSSSNFFN.
% 0.03/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.03/0.45 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.03/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.03/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.03/0.45 % Starting sh5l with 300s (1) cores
% 0.03/0.45 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with pid 3018633 completed with status 0
% 0.03/0.45 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 0.03/0.45 % Preprocessing class: FSMSSLSSSSSNFFN.
% 0.03/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.03/0.45 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.03/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.03/0.45 % No SInE strategy applied
% 0.03/0.45 % Search class: FGUSF-FFMM21-MFFFFFNN
% 0.03/0.45 % Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.03/0.45 % Starting SubtermCWHack with 151s (1) cores
% 0.03/0.45 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 750s (1) cores
% 0.03/0.45 % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 151s (1) cores
% 0.03/0.45 % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 151s (1) cores
% 0.03/0.45 % Starting U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.03/0.45 % H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with pid 3018649 completed with status 0
% 0.03/0.45 % Result found by H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S
% 0.03/0.45 % Preprocessing class: FSMSSLSSSSSNFFN.
% 0.03/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.03/0.45 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.03/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.03/0.45 % No SInE strategy applied
% 0.03/0.45 % Search class: FGUSF-FFMM21-MFFFFFNN
% 0.03/0.45 % Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.03/0.45 % Starting SubtermCWHack with 151s (1) cores
% 0.03/0.45 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 750s (1) cores
% 0.03/0.45 % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 151s (1) cores
% 0.03/0.45 % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 151s (1) cores
% 0.03/0.45 % Preprocessing time : 0.001 s
% 0.03/0.45 % Presaturation interreduction done
% 0.03/0.45
% 0.03/0.45 % Proof found!
% 0.03/0.45 % SZS status Theorem
% 0.03/0.45 % SZS output start CNFRefutation
% See solution above
% 0.03/0.45 % Parsed axioms : 53
% 0.03/0.45 % Removed by relevancy pruning/SinE : 0
% 0.03/0.45 % Initial clauses : 82
% 0.03/0.45 % Removed in clause preprocessing : 0
% 0.03/0.45 % Initial clauses in saturation : 82
% 0.03/0.45 % Processed clauses : 42
% 0.03/0.45 % ...of these trivial : 11
% 0.03/0.45 % ...subsumed : 0
% 0.03/0.45 % ...remaining for further processing : 30
% 0.03/0.45 % Other redundant clauses eliminated : 0
% 0.03/0.45 % Clauses deleted for lack of memory : 0
% 0.03/0.45 % Backward-subsumed : 0
% 0.03/0.45 % Backward-rewritten : 0
% 0.03/0.45 % Generated clauses : 0
% 0.03/0.45 % ...of the previous two non-redundant : 0
% 0.03/0.45 % ...aggressively subsumed : 0
% 0.03/0.45 % Contextual simplify-reflections : 0
% 0.03/0.45 % Paramodulations : 0
% 0.03/0.45 % Factorizations : 0
% 0.03/0.45 % NegExts : 0
% 0.03/0.45 % Equation resolutions : 0
% 0.03/0.45 % Disequality decompositions : 0
% 0.03/0.45 % Total rewrite steps : 22
% 0.03/0.45 % ...of those cached : 7
% 0.03/0.45 % Propositional unsat checks : 0
% 0.03/0.45 % Propositional check models : 0
% 0.03/0.45 % Propositional check unsatisfiable : 0
% 0.03/0.45 % Propositional clauses : 0
% 0.03/0.45 % Propositional clauses after purity: 0
% 0.03/0.45 % Propositional unsat core size : 0
% 0.03/0.45 % Propositional preprocessing time : 0.000
% 0.03/0.45 % Propositional encoding time : 0.000
% 0.03/0.45 % Propositional solver time : 0.000
% 0.03/0.45 % Success case prop preproc time : 0.000
% 0.03/0.45 % Success case prop encoding time : 0.000
% 0.03/0.45 % Success case prop solver time : 0.000
% 0.03/0.45 % Current number of processed clauses : 30
% 0.03/0.45 % Positive orientable unit clauses : 26
% 0.03/0.45 % Positive unorientable unit clauses: 0
% 0.03/0.45 % Negative unit clauses : 1
% 0.03/0.45 % Non-unit-clauses : 3
% 0.03/0.45 % Current number of unprocessed clauses: 40
% 0.03/0.45 % ...number of literals in the above : 82
% 0.03/0.45 % Current number of archived formulas : 0
% 0.03/0.45 % Current number of archived clauses : 0
% 0.03/0.45 % Clause-clause subsumption calls (NU) : 0
% 0.03/0.45 % Rec. Clause-clause subsumption calls : 0
% 0.03/0.45 % Non-unit clause-clause subsumptions : 0
% 0.03/0.45 % Unit Clause-clause subsumption calls : 2
% 0.03/0.45 % Rewrite failures with RHS unbound : 0
% 0.03/0.45 % BW rewrite match attempts : 2
% 0.03/0.45 % BW rewrite match successes : 0
% 0.03/0.45 % Condensation attempts : 0
% 0.03/0.45 % Condensation successes : 0
% 0.03/0.45 % Termbank termtop insertions : 4503
% 0.03/0.45 % Search garbage collected termcells : 1092
% 0.03/0.45
% 0.03/0.45 % -------------------------------------------------
% 0.03/0.45 % User time : 0.008 s
% 0.03/0.45 % System time : 0.004 s
% 0.03/0.45 % Total time : 0.011 s
% 0.03/0.45 % Maximum resident set size: 3688 pages
% 0.03/0.45
% 0.03/0.45 % -------------------------------------------------
% 0.03/0.45 % User time : 0.019 s
% 0.03/0.45 % System time : 0.011 s
% 0.03/0.45 % Total time : 0.030 s
% 0.03/0.45 % Maximum resident set size: 4864 pages
% 0.03/0.45 % E exiting
%------------------------------------------------------------------------------