%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL486+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 : n016.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 11.32s 2.77s
% Output : CNFRefutation 11.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of formulae : 39 ( 22 unt; 0 def)
% Number of atoms : 75 ( 4 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 62 ( 26 ~; 23 |; 7 &)
% ( 4 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 8 ( 6 usr; 6 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 11 con; 0-2 aty)
% Number of variables : 61 ( 0 sgn 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(r4,axiom,
( r4
<=> ! [X4,X5,X6] : is_a_theorem(implies(or(X4,or(X5,X6)),or(X5,or(X4,X6)))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',r4) ).
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(principia_r4,axiom,
r4,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+4.ax',principia_r4) ).
fof(principia_op_implies_or,axiom,
op_implies_or,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+4.ax',principia_op_implies_or) ).
fof(hilbert_implies_3,conjecture,
implies_3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_implies_3) ).
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/sandbox/benchmark/Axioms/LCL006+0.ax',modus_ponens) ).
fof(r5,axiom,
( r5
<=> ! [X4,X5,X6] : is_a_theorem(implies(implies(X5,X6),implies(or(X4,X5),or(X4,X6)))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',r5) ).
fof(principia_modus_ponens,axiom,
modus_ponens,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+4.ax',principia_modus_ponens) ).
fof(principia_r5,axiom,
r5,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+4.ax',principia_r5) ).
fof(implies_3,axiom,
( implies_3
<=> ! [X1,X2,X3] : is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',implies_3) ).
fof(c_0_10,plain,
! [X105,X106,X107] :
( ( r4
| ~ is_a_theorem(implies(or(esk50_0,or(esk51_0,esk52_0)),or(esk51_0,or(esk50_0,esk52_0)))) )
& ( is_a_theorem(implies(or(X105,or(X106,X107)),or(X106,or(X105,X107))))
| ~ r4 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[r4])])])])]) ).
fof(c_0_11,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])])])]) ).
cnf(c_0_12,plain,
( ~ r4
| is_a_theorem(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,plain,
r4,
inference(split_conjunct,[status(thm)],[principia_r4]) ).
cnf(c_0_14,plain,
( ~ op_implies_or
| implies(X1,X2) = or(not(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
op_implies_or,
inference(split_conjunct,[status(thm)],[principia_op_implies_or]) ).
fof(c_0_16,negated_conjecture,
~ implies_3,
inference(assume_negation,[status(cth)],[hilbert_implies_3]) ).
fof(c_0_17,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])])])])])]) ).
cnf(c_0_18,plain,
is_a_theorem(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]) ).
cnf(c_0_19,plain,
or(not(X1),X2) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]) ).
fof(c_0_20,plain,
! [X111,X112,X113] :
( ( r5
| ~ is_a_theorem(implies(implies(esk54_0,esk55_0),implies(or(esk53_0,esk54_0),or(esk53_0,esk55_0)))) )
& ( is_a_theorem(implies(implies(X112,X113),implies(or(X111,X112),or(X111,X113))))
| ~ r5 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[r5])])])])]) ).
fof(c_0_21,negated_conjecture,
~ implies_3,
inference(fof_simplification,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
( ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1)
| ~ modus_ponens
| is_a_theorem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,plain,
modus_ponens,
inference(split_conjunct,[status(thm)],[principia_modus_ponens]) ).
cnf(c_0_24,plain,
is_a_theorem(implies(implies(X1,or(X2,X3)),or(X2,implies(X1,X3)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_19]) ).
cnf(c_0_25,plain,
( ~ r5
| is_a_theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_26,plain,
r5,
inference(split_conjunct,[status(thm)],[principia_r5]) ).
fof(c_0_27,plain,
! [X27,X28,X29] :
( ( implies_3
| ~ is_a_theorem(implies(implies(esk11_0,esk12_0),implies(implies(esk12_0,esk13_0),implies(esk11_0,esk13_0)))) )
& ( is_a_theorem(implies(implies(X27,X28),implies(implies(X28,X29),implies(X27,X29))))
| ~ implies_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)],[implies_3])])])])]) ).
fof(c_0_28,negated_conjecture,
~ implies_3,
inference(fof_nnf,[status(thm)],[c_0_21]) ).
cnf(c_0_29,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_22,c_0_23])]) ).
cnf(c_0_30,plain,
is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(X2,implies(X1,X3)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_19]),c_0_19]) ).
cnf(c_0_31,plain,
is_a_theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26])]) ).
cnf(c_0_32,plain,
( ~ is_a_theorem(implies(implies(esk11_0,esk12_0),implies(implies(esk12_0,esk13_0),implies(esk11_0,esk13_0))))
| implies_3 ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_33,negated_conjecture,
~ implies_3,
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_34,plain,
( ~ is_a_theorem(implies(X2,implies(X1,X3)))
| is_a_theorem(implies(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X1),implies(X3,X2)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_19]),c_0_19]) ).
cnf(c_0_36,plain,
~ is_a_theorem(implies(implies(esk11_0,esk12_0),implies(implies(esk12_0,esk13_0),implies(esk11_0,esk13_0)))),
inference(sr,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL486+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.12/0.38 % Computer : n016.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Mon Sep 21 00:40:22 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.43 Running first-order theorem proving
% 0.12/0.43 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
% 11.32/2.77 % Version: 3.5.1
% 11.32/2.77 % Preprocessing class: FSMSSLSSSSSNFFN.
% 11.32/2.77 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.32/2.77 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 11.32/2.77 % Starting new_bool_3 with 300s (1) cores
% 11.32/2.77 % Starting new_bool_1 with 300s (1) cores
% 11.32/2.77 % Starting sh5l with 300s (1) cores
% 11.32/2.77 % new_bool_3 with pid 1197654 completed with status 9
% 11.32/2.77 % new_bool_1 with pid 1197655 completed with status 9
% 11.32/2.77 % sh5l with pid 1197656 completed with status 9
% 11.32/2.77 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with pid 1197653 completed with status 0
% 11.32/2.77 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 11.32/2.77 % Preprocessing class: FSMSSLSSSSSNFFN.
% 11.32/2.77 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.32/2.77 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 11.32/2.77 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 11.32/2.77 % No SInE strategy applied
% 11.32/2.77 % Search class: FGUSF-FFMM21-MFFFFFNN
% 11.32/2.77 % Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 11.32/2.77 % Starting SubtermCWHack with 151s (1) cores
% 11.32/2.77 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 750s (1) cores
% 11.32/2.77 % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 151s (1) cores
% 11.32/2.77 % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 151s (1) cores
% 11.32/2.77 % Starting U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 11.32/2.77 % U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 1197670 completed with status 0
% 11.32/2.77 % Result found by U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 11.32/2.77 % Preprocessing class: FSMSSLSSSSSNFFN.
% 11.32/2.77 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.32/2.77 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 11.32/2.77 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 11.32/2.77 % No SInE strategy applied
% 11.32/2.77 % Search class: FGUSF-FFMM21-MFFFFFNN
% 11.32/2.77 % Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 11.32/2.77 % Starting SubtermCWHack with 151s (1) cores
% 11.32/2.77 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 750s (1) cores
% 11.32/2.77 % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 151s (1) cores
% 11.32/2.77 % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 151s (1) cores
% 11.32/2.77 % Starting U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 11.32/2.77 % Preprocessing time : 0.003 s
% 11.32/2.77 % Presaturation interreduction done
% 11.32/2.77
% 11.32/2.77 % Proof found!
% 11.32/2.77 % SZS status Theorem
% 11.32/2.77 % SZS output start CNFRefutation
% See solution above
% 11.32/2.77 % Parsed axioms : 45
% 11.32/2.77 % Removed by relevancy pruning/SinE : 0
% 11.32/2.77 % Initial clauses : 74
% 11.32/2.77 % Removed in clause preprocessing : 0
% 11.32/2.77 % Initial clauses in saturation : 74
% 11.32/2.77 % Processed clauses : 7108
% 11.32/2.77 % ...of these trivial : 2005
% 11.32/2.77 % ...subsumed : 3478
% 11.32/2.77 % ...remaining for further processing : 1625
% 11.32/2.77 % Other redundant clauses eliminated : 0
% 11.32/2.77 % Clauses deleted for lack of memory : 0
% 11.32/2.77 % Backward-subsumed : 3
% 11.32/2.77 % Backward-rewritten : 98
% 11.32/2.77 % Generated clauses : 73544
% 11.32/2.77 % ...of the previous two non-redundant : 49830
% 11.32/2.77 % ...aggressively subsumed : 0
% 11.32/2.77 % Contextual simplify-reflections : 0
% 11.32/2.77 % Paramodulations : 73544
% 11.32/2.77 % Factorizations : 0
% 11.32/2.77 % NegExts : 0
% 11.32/2.77 % Equation resolutions : 0
% 11.32/2.77 % Disequality decompositions : 0
% 11.32/2.77 % Total rewrite steps : 202021
% 11.32/2.77 % ...of those cached : 192255
% 11.32/2.77 % Propositional unsat checks : 0
% 11.32/2.77 % Propositional check models : 0
% 11.32/2.77 % Propositional check unsatisfiable : 0
% 11.32/2.77 % Propositional clauses : 0
% 11.32/2.77 % Propositional clauses after purity: 0
% 11.32/2.77 % Propositional unsat core size : 0
% 11.32/2.77 % Propositional preprocessing time : 0.000
% 11.32/2.77 % Propositional encoding time : 0.000
% 11.32/2.77 % Propositional solver time : 0.000
% 11.32/2.77 % Success case prop preproc time : 0.000
% 11.32/2.77 % Success case prop encoding time : 0.000
% 11.32/2.77 % Success case prop solver time : 0.000
% 11.32/2.77 % Current number of processed clauses : 1463
% 11.32/2.77 % Positive orientable unit clauses : 931
% 11.32/2.77 % Positive unorientable unit clauses: 12
% 11.32/2.77 % Negative unit clauses : 4
% 11.32/2.77 % Non-unit-clauses : 516
% 11.32/2.77 % Current number of unprocessed clauses: 41953
% 11.32/2.77 % ...number of literals in the above : 58052
% 11.32/2.77 % Current number of archived formulas : 0
% 11.32/2.77 % Current number of archived clauses : 162
% 11.32/2.77 % Clause-clause subsumption calls (NU) : 91341
% 11.32/2.77 % Rec. Clause-clause subsumption calls : 90806
% 11.32/2.77 % Non-unit clause-clause subsumptions : 3391
% 11.32/2.77 % Unit Clause-clause subsumption calls : 3067
% 11.32/2.77 % Rewrite failures with RHS unbound : 0
% 11.32/2.77 % BW rewrite match attempts : 59186
% 11.32/2.77 % BW rewrite match successes : 153
% 11.32/2.77 % Condensation attempts : 0
% 11.32/2.77 % Condensation successes : 0
% 11.32/2.77 % Termbank termtop insertions : 1709191
% 11.32/2.77 % Search garbage collected termcells : 1092
% 11.32/2.77
% 11.32/2.77 % -------------------------------------------------
% 11.32/2.77 % User time : 2.178 s
% 11.32/2.77 % System time : 0.087 s
% 11.32/2.77 % Total time : 2.265 s
% 11.32/2.77 % Maximum resident set size: 3688 pages
% 11.32/2.77
% 11.32/2.77 % -------------------------------------------------
% 11.32/2.77 % User time : 10.810 s
% 11.32/2.77 % System time : 0.612 s
% 11.32/2.77 % Total time : 11.423 s
% 11.32/2.77 % Maximum resident set size: 4864 pages
% 11.32/2.77 % E exiting
%------------------------------------------------------------------------------