%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL483+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 : n005.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:53 PM UTC 2026
% Result : Theorem 0.17s 5.57s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of formulae : 35 ( 20 unt; 0 def)
% Number of atoms : 54 ( 12 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 36 ( 17 ~; 12 |; 2 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 8 ( 6 usr; 6 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 38 ( 0 sgn 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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(hilbert_modus_tollens,conjecture,
modus_tollens,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_modus_tollens) ).
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/theBenchmark.p',hilbert_op_implies_and) ).
fof(r3,axiom,
( r3
<=> ! [X4,X5] : is_a_theorem(implies(or(X4,X5),or(X5,X4))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',r3) ).
fof(op_implies_or,axiom,
( op_implies_or
=> ! [X1,X2] : implies(X1,X2) = or(not(X1),X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax',op_implies_or) ).
fof(modus_tollens,axiom,
( modus_tollens
<=> ! [X1,X2] : is_a_theorem(implies(implies(not(X2),not(X1)),implies(X1,X2))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',modus_tollens) ).
fof(hilbert_op_or,axiom,
op_or,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_op_or) ).
fof(principia_r3,axiom,
r3,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+4.ax',principia_r3) ).
fof(principia_op_implies_or,axiom,
op_implies_or,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+4.ax',principia_op_implies_or) ).
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,negated_conjecture,
~ modus_tollens,
inference(assume_negation,[status(cth)],[hilbert_modus_tollens]) ).
fof(c_0_12,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_13,plain,
( ~ op_implies_and
| implies(X1,X2) = not(and(X1,not(X2))) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
op_implies_and,
inference(split_conjunct,[status(thm)],[hilbert_op_implies_and]) ).
fof(c_0_15,negated_conjecture,
~ modus_tollens,
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_16,plain,
! [X101,X102] :
( ( r3
| ~ is_a_theorem(implies(or(esk48_0,esk49_0),or(esk49_0,esk48_0))) )
& ( is_a_theorem(implies(or(X101,X102),or(X102,X101)))
| ~ r3 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[r3])])])])]) ).
fof(c_0_17,plain,
! [X123,X124] :
( implies(X123,X124) = or(not(X123),X124)
| ~ op_implies_or ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_implies_or])])])]) ).
fof(c_0_18,plain,
! [X15,X16] :
( ( modus_tollens
| ~ is_a_theorem(implies(implies(not(esk6_0),not(esk5_0)),implies(esk5_0,esk6_0))) )
& ( is_a_theorem(implies(implies(not(X16),not(X15)),implies(X15,X16)))
| ~ modus_tollens ) ),
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_tollens])])])])]) ).
cnf(c_0_19,plain,
( ~ op_or
| or(X1,X2) = not(and(not(X1),not(X2))) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,plain,
not(and(X1,not(X2))) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]) ).
cnf(c_0_21,plain,
op_or,
inference(split_conjunct,[status(thm)],[hilbert_op_or]) ).
fof(c_0_22,negated_conjecture,
~ modus_tollens,
inference(fof_nnf,[status(thm)],[c_0_15]) ).
cnf(c_0_23,plain,
( ~ r3
| is_a_theorem(implies(or(X1,X2),or(X2,X1))) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,plain,
r3,
inference(split_conjunct,[status(thm)],[principia_r3]) ).
cnf(c_0_25,plain,
( ~ op_implies_or
| implies(X1,X2) = or(not(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_26,plain,
op_implies_or,
inference(split_conjunct,[status(thm)],[principia_op_implies_or]) ).
cnf(c_0_27,plain,
( ~ is_a_theorem(implies(implies(not(esk6_0),not(esk5_0)),implies(esk5_0,esk6_0)))
| modus_tollens ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_28,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_29,negated_conjecture,
~ modus_tollens,
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_30,plain,
is_a_theorem(implies(or(X1,X2),or(X2,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]) ).
cnf(c_0_31,plain,
or(not(X1),X2) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26])]) ).
cnf(c_0_32,plain,
~ is_a_theorem(implies(or(esk6_0,not(esk5_0)),implies(esk5_0,esk6_0))),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
cnf(c_0_33,plain,
is_a_theorem(implies(or(X1,not(X2)),implies(X2,X1))),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL483+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.14/5.40 % Computer : n005.cluster.edu
% 0.14/5.40 % Model : x86_64 x86_64
% 0.14/5.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/5.40 % Memory : 8046.5625MB
% 0.14/5.40 % OS : Linux 6.8.0-71-generic
% 0.14/5.40 % CPULimit : 300
% 0.14/5.40 % WCLimit : 300
% 0.14/5.40 % DateTime : Mon Sep 21 00:33:54 UTC 2026
% 0.14/5.41 % CPUTime :
% 0.14/5.41 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/5.48 Running first-order theorem proving
% 0.14/5.48 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.17/5.57 % Version: 3.5.1
% 0.17/5.57 % Preprocessing class: FSMSSLSSSSSNFFN.
% 0.17/5.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/5.57 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.17/5.57 % Starting new_bool_3 with 300s (1) cores
% 0.17/5.57 % Starting new_bool_1 with 300s (1) cores
% 0.17/5.57 % Starting sh5l with 300s (1) cores
% 0.17/5.57 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with pid 2162952 completed with status 0
% 0.17/5.57 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 0.17/5.57 % Preprocessing class: FSMSSLSSSSSNFFN.
% 0.17/5.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/5.57 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.17/5.57 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.17/5.57 % No SInE strategy applied
% 0.17/5.57 % Search class: FGUSF-FFMM21-MFFFFFNN
% 0.17/5.57 % Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/5.57 % Starting SubtermCWHack with 151s (1) cores
% 0.17/5.57 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 750s (1) cores
% 0.17/5.57 % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 151s (1) cores
% 0.17/5.57 % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 151s (1) cores
% 0.17/5.57 % Starting U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/5.57 % SubtermCWHack with pid 2162960 completed with status 0
% 0.17/5.57 % Result found by SubtermCWHack
% 0.17/5.57 % Preprocessing class: FSMSSLSSSSSNFFN.
% 0.17/5.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/5.57 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.17/5.57 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.17/5.57 % No SInE strategy applied
% 0.17/5.57 % Search class: FGUSF-FFMM21-MFFFFFNN
% 0.17/5.57 % Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/5.57 % Starting SubtermCWHack with 151s (1) cores
% 0.17/5.57 % Preprocessing time : 0.003 s
% 0.17/5.57
% 0.17/5.57 % Proof found!
% 0.17/5.57 % SZS status Theorem
% 0.17/5.57 % SZS output start CNFRefutation
% See solution above
% 0.17/5.57 % Parsed axioms : 45
% 0.17/5.57 % Removed by relevancy pruning/SinE : 0
% 0.17/5.57 % Initial clauses : 74
% 0.17/5.57 % Removed in clause preprocessing : 0
% 0.17/5.57 % Initial clauses in saturation : 74
% 0.17/5.57 % Processed clauses : 184
% 0.17/5.57 % ...of these trivial : 12
% 0.17/5.57 % ...subsumed : 35
% 0.17/5.57 % ...remaining for further processing : 137
% 0.17/5.57 % Other redundant clauses eliminated : 0
% 0.17/5.57 % Clauses deleted for lack of memory : 0
% 0.17/5.57 % Backward-subsumed : 8
% 0.17/5.57 % Backward-rewritten : 6
% 0.17/5.57 % Generated clauses : 279
% 0.17/5.57 % ...of the previous two non-redundant : 234
% 0.17/5.57 % ...aggressively subsumed : 0
% 0.17/5.57 % Contextual simplify-reflections : 0
% 0.17/5.57 % Paramodulations : 279
% 0.17/5.57 % Factorizations : 0
% 0.17/5.57 % NegExts : 0
% 0.17/5.57 % Equation resolutions : 0
% 0.17/5.57 % Disequality decompositions : 0
% 0.17/5.57 % Total rewrite steps : 73
% 0.17/5.57 % ...of those cached : 30
% 0.17/5.57 % Propositional unsat checks : 0
% 0.17/5.57 % Propositional check models : 0
% 0.17/5.57 % Propositional check unsatisfiable : 0
% 0.17/5.57 % Propositional clauses : 0
% 0.17/5.57 % Propositional clauses after purity: 0
% 0.17/5.57 % Propositional unsat core size : 0
% 0.17/5.57 % Propositional preprocessing time : 0.000
% 0.17/5.57 % Propositional encoding time : 0.000
% 0.17/5.57 % Propositional solver time : 0.000
% 0.17/5.57 % Success case prop preproc time : 0.000
% 0.17/5.57 % Success case prop encoding time : 0.000
% 0.17/5.57 % Success case prop solver time : 0.000
% 0.17/5.57 % Current number of processed clauses : 123
% 0.17/5.57 % Positive orientable unit clauses : 34
% 0.17/5.57 % Positive unorientable unit clauses: 0
% 0.17/5.57 % Negative unit clauses : 3
% 0.17/5.57 % Non-unit-clauses : 86
% 0.17/5.57 % Current number of unprocessed clauses: 118
% 0.17/5.57 % ...number of literals in the above : 220
% 0.17/5.57 % Current number of archived formulas : 0
% 0.17/5.57 % Current number of archived clauses : 14
% 0.17/5.57 % Clause-clause subsumption calls (NU) : 1376
% 0.17/5.57 % Rec. Clause-clause subsumption calls : 1372
% 0.17/5.57 % Non-unit clause-clause subsumptions : 40
% 0.17/5.57 % Unit Clause-clause subsumption calls : 106
% 0.17/5.57 % Rewrite failures with RHS unbound : 0
% 0.17/5.57 % BW rewrite match attempts : 19
% 0.17/5.57 % BW rewrite match successes : 6
% 0.17/5.57 % Condensation attempts : 0
% 0.17/5.57 % Condensation successes : 0
% 0.17/5.57 % Termbank termtop insertions : 7179
% 0.17/5.57 % Search garbage collected termcells : 1092
% 0.17/5.57
% 0.17/5.57 % -------------------------------------------------
% 0.17/5.57 % User time : 0.026 s
% 0.17/5.57 % System time : 0.008 s
% 0.17/5.57 % Total time : 0.034 s
% 0.17/5.57 % Maximum resident set size: 3688 pages
% 0.17/5.57
% 0.17/5.57 % -------------------------------------------------
% 0.17/5.57 % User time : 0.084 s
% 0.17/5.57 % System time : 0.027 s
% 0.17/5.57 % Total time : 0.111 s
% 0.17/5.57 % Maximum resident set size: 4608 pages
% 0.17/5.57 % E exiting
%------------------------------------------------------------------------------