%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL527+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 : n019.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:59 PM UTC 2026
% Result : Theorem 0.14s 5.49s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 28 ( 14 unt; 0 def)
% Number of atoms : 68 ( 0 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 65 ( 25 ~; 26 |; 9 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 4 prp; 0-1 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 24 ( 0 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(s1_0_adjunction,conjecture,
adjunction,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_0_adjunction) ).
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/sandbox2/benchmark/Axioms/LCL006+0.ax',modus_ponens) ).
fof(and_3,axiom,
( and_3
<=> ! [X1,X2] : is_a_theorem(implies(X1,implies(X2,and(X1,X2)))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',and_3) ).
fof(hilbert_modus_ponens,axiom,
modus_ponens,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',hilbert_modus_ponens) ).
fof(hilbert_and_3,axiom,
and_3,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',hilbert_and_3) ).
fof(adjunction,axiom,
( adjunction
<=> ! [X1,X2] :
( ( is_a_theorem(X2)
& is_a_theorem(X1) )
=> is_a_theorem(and(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL007+0.ax',adjunction) ).
fof(c_0_6,negated_conjecture,
~ adjunction,
inference(assume_negation,[status(cth)],[s1_0_adjunction]) ).
fof(c_0_7,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])])])])])]) ).
fof(c_0_8,plain,
! [X41,X42] :
( ( and_3
| ~ is_a_theorem(implies(esk18_0,implies(esk19_0,and(esk18_0,esk19_0)))) )
& ( is_a_theorem(implies(X41,implies(X42,and(X41,X42))))
| ~ and_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)],[and_3])])])])]) ).
fof(c_0_9,negated_conjecture,
~ adjunction,
inference(fof_simplification,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1)
| ~ modus_ponens
| is_a_theorem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
modus_ponens,
inference(split_conjunct,[status(thm)],[hilbert_modus_ponens]) ).
cnf(c_0_12,plain,
( ~ and_3
| is_a_theorem(implies(X1,implies(X2,and(X1,X2)))) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
and_3,
inference(split_conjunct,[status(thm)],[hilbert_and_3]) ).
fof(c_0_14,plain,
! [X133,X134] :
( ( adjunction
| ~ is_a_theorem(and(esk59_0,esk60_0)) )
& ( adjunction
| is_a_theorem(esk60_0) )
& ( adjunction
| is_a_theorem(esk59_0) )
& ( is_a_theorem(and(X133,X134))
| ~ is_a_theorem(X134)
| ~ is_a_theorem(X133)
| ~ adjunction ) ),
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)],[adjunction])])])])])]) ).
fof(c_0_15,negated_conjecture,
~ adjunction,
inference(fof_nnf,[status(thm)],[c_0_9]) ).
cnf(c_0_16,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_10,c_0_11])]) ).
cnf(c_0_17,plain,
is_a_theorem(implies(X1,implies(X2,and(X1,X2)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]) ).
cnf(c_0_18,plain,
( ~ is_a_theorem(and(esk59_0,esk60_0))
| adjunction ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,negated_conjecture,
~ adjunction,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
( ~ is_a_theorem(X2)
| is_a_theorem(implies(X1,and(X2,X1))) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
( adjunction
| is_a_theorem(esk60_0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,plain,
( adjunction
| is_a_theorem(esk59_0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_23,plain,
~ is_a_theorem(and(esk59_0,esk60_0)),
inference(sr,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
( ~ is_a_theorem(X1)
| ~ is_a_theorem(X2)
| is_a_theorem(and(X1,X2)) ),
inference(spm,[status(thm)],[c_0_16,c_0_20]) ).
cnf(c_0_25,plain,
is_a_theorem(esk60_0),
inference(sr,[status(thm)],[c_0_21,c_0_19]) ).
cnf(c_0_26,plain,
is_a_theorem(esk59_0),
inference(sr,[status(thm)],[c_0_22,c_0_19]) ).
cnf(c_0_27,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL527+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/5.41 % Computer : n019.cluster.edu
% 0.14/5.41 % Model : x86_64 x86_64
% 0.14/5.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/5.41 % Memory : 8046.5625MB
% 0.14/5.41 % OS : Linux 6.8.0-71-generic
% 0.14/5.41 % CPULimit : 300
% 0.14/5.41 % WCLimit : 300
% 0.14/5.41 % DateTime : Mon Sep 21 00:37:26 UTC 2026
% 0.14/5.41 % CPUTime :
% 0.14/5.41 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/5.45 Running first-order theorem proving
% 0.14/5.45 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/5.49 % Version: 3.5.1
% 0.14/5.49 % Preprocessing class: FSLSSLSSSSSNFFN.
% 0.14/5.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.49 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 1500s (5) cores
% 0.14/5.49 % Starting new_bool_3 with 300s (1) cores
% 0.14/5.49 % Starting new_bool_1 with 300s (1) cores
% 0.14/5.49 % Starting sh5l with 300s (1) cores
% 0.14/5.49 % new_bool_3 with pid 1320153 completed with status 9
% 0.14/5.49 % H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with pid 1320152 completed with status 0
% 0.14/5.49 % Result found by H----_102_C18_F1_PI_AE_CS_SP_PS_S2S
% 0.14/5.49 % Preprocessing class: FSLSSLSSSSSNFFN.
% 0.14/5.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.49 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 1500s (5) cores
% 0.14/5.49 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/5.49 % No SInE strategy applied
% 0.14/5.49 % Search class: FGUSF-FFMM21-MFFFFFNN
% 0.14/5.49 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/5.49 % Starting SubtermCWHack with 136s (1) cores
% 0.14/5.49 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 151s (1) cores
% 0.14/5.49 % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 136s (1) cores
% 0.14/5.49 % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.14/5.49 % Starting U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.14/5.49 % G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with pid 1320169 completed with status 0
% 0.14/5.49 % Result found by G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI
% 0.14/5.49 % Preprocessing class: FSLSSLSSSSSNFFN.
% 0.14/5.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.49 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 1500s (5) cores
% 0.14/5.49 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/5.49 % No SInE strategy applied
% 0.14/5.49 % Search class: FGUSF-FFMM21-MFFFFFNN
% 0.14/5.49 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/5.49 % Starting SubtermCWHack with 136s (1) cores
% 0.14/5.49 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 151s (1) cores
% 0.14/5.49 % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 136s (1) cores
% 0.14/5.49 % Preprocessing time : 0.003 s
% 0.14/5.49 % Presaturation interreduction done
% 0.14/5.49
% 0.14/5.49 % Proof found!
% 0.14/5.49 % SZS status Theorem
% 0.14/5.49 % SZS output start CNFRefutation
% See solution above
% 0.14/5.49 % Parsed axioms : 88
% 0.14/5.49 % Removed by relevancy pruning/SinE : 0
% 0.14/5.49 % Initial clauses : 146
% 0.14/5.49 % Removed in clause preprocessing : 0
% 0.14/5.49 % Initial clauses in saturation : 146
% 0.14/5.49 % Processed clauses : 272
% 0.14/5.49 % ...of these trivial : 33
% 0.14/5.49 % ...subsumed : 2
% 0.14/5.49 % ...remaining for further processing : 237
% 0.14/5.49 % Other redundant clauses eliminated : 0
% 0.14/5.49 % Clauses deleted for lack of memory : 0
% 0.14/5.49 % Backward-subsumed : 0
% 0.14/5.49 % Backward-rewritten : 5
% 0.14/5.49 % Generated clauses : 65
% 0.14/5.49 % ...of the previous two non-redundant : 63
% 0.14/5.49 % ...aggressively subsumed : 0
% 0.14/5.49 % Contextual simplify-reflections : 0
% 0.14/5.49 % Paramodulations : 65
% 0.14/5.49 % Factorizations : 0
% 0.14/5.49 % NegExts : 0
% 0.14/5.49 % Equation resolutions : 0
% 0.14/5.49 % Disequality decompositions : 0
% 0.14/5.49 % Total rewrite steps : 124
% 0.14/5.49 % ...of those cached : 34
% 0.14/5.49 % Propositional unsat checks : 0
% 0.14/5.49 % Propositional check models : 0
% 0.14/5.49 % Propositional check unsatisfiable : 0
% 0.14/5.49 % Propositional clauses : 0
% 0.14/5.49 % Propositional clauses after purity: 0
% 0.14/5.49 % Propositional unsat core size : 0
% 0.14/5.49 % Propositional preprocessing time : 0.000
% 0.14/5.49 % Propositional encoding time : 0.000
% 0.14/5.49 % Propositional solver time : 0.000
% 0.14/5.49 % Success case prop preproc time : 0.000
% 0.14/5.49 % Success case prop encoding time : 0.000
% 0.14/5.49 % Success case prop solver time : 0.000
% 0.14/5.49 % Current number of processed clauses : 119
% 0.14/5.49 % Positive orientable unit clauses : 50
% 0.14/5.49 % Positive unorientable unit clauses: 0
% 0.14/5.49 % Negative unit clauses : 2
% 0.14/5.49 % Non-unit-clauses : 67
% 0.14/5.49 % Current number of unprocessed clauses: 50
% 0.14/5.49 % ...number of literals in the above : 93
% 0.14/5.49 % Current number of archived formulas : 0
% 0.14/5.49 % Current number of archived clauses : 118
% 0.14/5.49 % Clause-clause subsumption calls (NU) : 759
% 0.14/5.49 % Rec. Clause-clause subsumption calls : 405
% 0.14/5.49 % Non-unit clause-clause subsumptions : 1
% 0.14/5.49 % Unit Clause-clause subsumption calls : 122
% 0.14/5.49 % Rewrite failures with RHS unbound : 0
% 0.14/5.49 % BW rewrite match attempts : 42
% 0.14/5.49 % BW rewrite match successes : 5
% 0.14/5.49 % Condensation attempts : 0
% 0.14/5.49 % Condensation successes : 0
% 0.14/5.49 % Termbank termtop insertions : 10221
% 0.14/5.49 % Search garbage collected termcells : 2057
% 0.14/5.49
% 0.14/5.49 % -------------------------------------------------
% 0.14/5.49 % User time : 0.022 s
% 0.14/5.49 % System time : 0.005 s
% 0.14/5.49 % Total time : 0.026 s
% 0.14/5.49 % Maximum resident set size: 3992 pages
% 0.14/5.49
% 0.14/5.49 % -------------------------------------------------
% 0.14/5.49 % User time : 0.090 s
% 0.14/5.49 % System time : 0.032 s
% 0.14/5.49 % Total time : 0.122 s
% 0.14/5.49 % Maximum resident set size: 4608 pages
% 0.14/5.49 % E exiting
%------------------------------------------------------------------------------