%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL469+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 : n015.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:51 PM UTC 2026
% Result : Theorem 0.14s 0.40s
% Output : CNFRefutation 0.14s
% 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(hilbert_or_1,conjecture,
or_1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_or_1) ).
fof(op_implies_and,axiom,
( op_implies_and
=> ! [X1,X2] : implies(X1,X2) = not(and(X1,not(X2))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+1.ax',op_implies_and) ).
fof(or_1,axiom,
( or_1
<=> ! [X1,X2] : is_a_theorem(implies(X1,or(X1,X2))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',or_1) ).
fof(op_or,axiom,
( op_or
=> ! [X1,X2] : or(X1,X2) = not(and(not(X1),not(X2))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+1.ax',op_or) ).
fof(hilbert_op_implies_and,axiom,
op_implies_and,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_op_implies_and) ).
fof(cn2,axiom,
( cn2
<=> ! [X4,X5] : is_a_theorem(implies(X4,implies(not(X4),X5))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',cn2) ).
fof(luka_op_or,axiom,
op_or,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+3.ax',luka_op_or) ).
fof(luka_cn2,axiom,
cn2,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+3.ax',luka_cn2) ).
fof(c_0_8,negated_conjecture,
~ or_1,
inference(assume_negation,[status(cth)],[hilbert_or_1]) ).
fof(c_0_9,negated_conjecture,
~ or_1,
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_10,plain,
! [X19,X20] :
( implies(X19,X20) = not(and(X19,not(X20)))
| ~ 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,
! [X7,X8] :
( ( or_1
| ~ is_a_theorem(implies(esk1_0,or(esk1_0,esk2_0))) )
& ( is_a_theorem(implies(X7,or(X7,X8)))
| ~ 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])])])])]) ).
fof(c_0_12,negated_conjecture,
~ or_1,
inference(fof_nnf,[status(thm)],[c_0_9]) ).
fof(c_0_13,plain,
! [X11,X12] :
( or(X11,X12) = not(and(not(X11),not(X12)))
| ~ 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,
! [X13,X14] :
( ( cn2
| ~ is_a_theorem(implies(esk3_0,implies(not(esk3_0),esk4_0))) )
& ( is_a_theorem(implies(X13,implies(not(X13),X14)))
| ~ 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])])])])]) ).
cnf(c_0_17,plain,
( ~ is_a_theorem(implies(esk1_0,or(esk1_0,esk2_0)))
| or_1 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,negated_conjecture,
~ or_1,
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)],[luka_op_or]) ).
cnf(c_0_22,plain,
( ~ cn2
| is_a_theorem(implies(X1,implies(not(X1),X2))) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
cn2,
inference(split_conjunct,[status(thm)],[luka_cn2]) ).
cnf(c_0_24,plain,
~ is_a_theorem(implies(esk1_0,or(esk1_0,esk2_0))),
inference(sr,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_25,plain,
or(X1,X2) = implies(not(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,implies(not(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.02 % Problem : LCL469+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.03 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.32 % Computer : n015.cluster.edu
% 0.09/0.32 % Model : x86_64 x86_64
% 0.09/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.32 % Memory : 8046.5625MB
% 0.09/0.32 % OS : Linux 6.8.0-71-generic
% 0.09/0.33 % CPULimit : 300
% 0.09/0.33 % WCLimit : 300
% 0.09/0.33 % DateTime : Mon Sep 21 00:38:21 UTC 2026
% 0.09/0.33 % CPUTime :
% 0.09/0.33 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.38 Running first-order theorem proving
% 0.14/0.38 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.14/0.40 % Version: 3.5.1
% 0.14/0.40 % Preprocessing class: FSMSSLSSSSSNFFN.
% 0.14/0.40 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.40 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.14/0.40 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.40 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.40 % Starting sh5l with 300s (1) cores
% 0.14/0.40 % sh5l with pid 179436 completed with status 0
% 0.14/0.40 % Result found by sh5l
% 0.14/0.40 % Preprocessing class: FSMSSLSSSSSNFFN.
% 0.14/0.40 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.40 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.14/0.40 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.40 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.40 % Starting sh5l with 300s (1) cores
% 0.14/0.40 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.14/0.40 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.40 % Search class: FGUSF-FFSM21-MFFFFFNN
% 0.14/0.40 % partial match(1): FGUSF-FFMM21-MFFFFFNN
% 0.14/0.40 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.40 % Starting SubtermCWHack with 28s (1) cores
% 0.14/0.40 % SubtermCWHack with pid 179438 completed with status 0
% 0.14/0.40 % Result found by SubtermCWHack
% 0.14/0.40 % Preprocessing class: FSMSSLSSSSSNFFN.
% 0.14/0.40 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.40 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.14/0.40 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.40 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.40 % Starting sh5l with 300s (1) cores
% 0.14/0.40 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.14/0.40 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.40 % Search class: FGUSF-FFSM21-MFFFFFNN
% 0.14/0.40 % partial match(1): FGUSF-FFMM21-MFFFFFNN
% 0.14/0.40 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.40 % Starting SubtermCWHack with 28s (1) cores
% 0.14/0.40 % Preprocessing time : 0.001 s
% 0.14/0.40
% 0.14/0.40 % Proof found!
% 0.14/0.40 % SZS status Theorem
% 0.14/0.40 % SZS output start CNFRefutation
% See solution above
% 0.14/0.40 % Parsed axioms : 43
% 0.14/0.40 % Removed by relevancy pruning/SinE : 25
% 0.14/0.40 % Initial clauses : 26
% 0.14/0.40 % Removed in clause preprocessing : 0
% 0.14/0.40 % Initial clauses in saturation : 26
% 0.14/0.40 % Processed clauses : 23
% 0.14/0.40 % ...of these trivial : 4
% 0.14/0.40 % ...subsumed : 1
% 0.14/0.40 % ...remaining for further processing : 18
% 0.14/0.40 % Other redundant clauses eliminated : 0
% 0.14/0.40 % Clauses deleted for lack of memory : 0
% 0.14/0.40 % Backward-subsumed : 0
% 0.14/0.40 % Backward-rewritten : 0
% 0.14/0.40 % Generated clauses : 7
% 0.14/0.40 % ...of the previous two non-redundant : 3
% 0.14/0.40 % ...aggressively subsumed : 0
% 0.14/0.40 % Contextual simplify-reflections : 0
% 0.14/0.40 % Paramodulations : 7
% 0.14/0.40 % Factorizations : 0
% 0.14/0.40 % NegExts : 0
% 0.14/0.40 % Equation resolutions : 0
% 0.14/0.40 % Disequality decompositions : 0
% 0.14/0.40 % Total rewrite steps : 12
% 0.14/0.40 % ...of those cached : 3
% 0.14/0.40 % Propositional unsat checks : 0
% 0.14/0.40 % Propositional check models : 0
% 0.14/0.40 % Propositional check unsatisfiable : 0
% 0.14/0.40 % Propositional clauses : 0
% 0.14/0.40 % Propositional clauses after purity: 0
% 0.14/0.40 % Propositional unsat core size : 0
% 0.14/0.40 % Propositional preprocessing time : 0.000
% 0.14/0.40 % Propositional encoding time : 0.000
% 0.14/0.40 % Propositional solver time : 0.000
% 0.14/0.40 % Success case prop preproc time : 0.000
% 0.14/0.40 % Success case prop encoding time : 0.000
% 0.14/0.40 % Success case prop solver time : 0.000
% 0.14/0.40 % Current number of processed clauses : 18
% 0.14/0.40 % Positive orientable unit clauses : 9
% 0.14/0.40 % Positive unorientable unit clauses: 0
% 0.14/0.40 % Negative unit clauses : 2
% 0.14/0.40 % Non-unit-clauses : 7
% 0.14/0.40 % Current number of unprocessed clauses: 6
% 0.14/0.40 % ...number of literals in the above : 9
% 0.14/0.40 % Current number of archived formulas : 0
% 0.14/0.40 % Current number of archived clauses : 0
% 0.14/0.40 % Clause-clause subsumption calls (NU) : 12
% 0.14/0.40 % Rec. Clause-clause subsumption calls : 12
% 0.14/0.40 % Non-unit clause-clause subsumptions : 0
% 0.14/0.40 % Unit Clause-clause subsumption calls : 0
% 0.14/0.40 % Rewrite failures with RHS unbound : 0
% 0.14/0.40 % BW rewrite match attempts : 0
% 0.14/0.40 % BW rewrite match successes : 0
% 0.14/0.40 % Condensation attempts : 0
% 0.14/0.40 % Condensation successes : 0
% 0.14/0.40 % Termbank termtop insertions : 1626
% 0.14/0.40 % Search garbage collected termcells : 506
% 0.14/0.40
% 0.14/0.40 % -------------------------------------------------
% 0.14/0.40 % User time : 0.000 s
% 0.14/0.40 % System time : 0.004 s
% 0.14/0.40 % Total time : 0.004 s
% 0.14/0.40 % Maximum resident set size: 3668 pages
% 0.14/0.40
% 0.14/0.40 % -------------------------------------------------
% 0.14/0.40 % User time : 0.001 s
% 0.14/0.40 % System time : 0.008 s
% 0.14/0.40 % Total time : 0.009 s
% 0.14/0.40 % Maximum resident set size: 4608 pages
% 0.14/0.40 % E exiting
%------------------------------------------------------------------------------