%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL512+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 : n006.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:57 PM UTC 2026
% Result : Theorem 0.11s 0.43s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 23 ( 14 unt; 0 def)
% Number of atoms : 36 ( 4 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 26 ( 13 ~; 8 |; 2 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 4 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 22 ( 2 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(hilbert_equivalence_1,conjecture,
equivalence_1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_equivalence_1) ).
fof(kn2,axiom,
( kn2
<=> ! [X4,X5] : is_a_theorem(implies(and(X4,X5),X4)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',kn2) ).
fof(op_equiv,axiom,
( op_equiv
=> ! [X1,X2] : equiv(X1,X2) = and(implies(X1,X2),implies(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax',op_equiv) ).
fof(equivalence_1,axiom,
( equivalence_1
<=> ! [X1,X2] : is_a_theorem(implies(equiv(X1,X2),implies(X1,X2))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',equivalence_1) ).
fof(rosser_kn2,axiom,
kn2,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+5.ax',rosser_kn2) ).
fof(rosser_op_equiv,axiom,
op_equiv,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+5.ax',rosser_op_equiv) ).
fof(c_0_6,negated_conjecture,
~ equivalence_1,
inference(assume_negation,[status(cth)],[hilbert_equivalence_1]) ).
fof(c_0_7,negated_conjecture,
~ equivalence_1,
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_8,plain,
! [X27,X28] :
( ( kn2
| ~ is_a_theorem(implies(and(esk10_0,esk11_0),esk10_0)) )
& ( is_a_theorem(implies(and(X27,X28),X27))
| ~ kn2 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kn2])])])])]) ).
fof(c_0_9,plain,
! [X23,X24] :
( equiv(X23,X24) = and(implies(X23,X24),implies(X24,X23))
| ~ op_equiv ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_equiv])])])]) ).
fof(c_0_10,plain,
! [X7,X8] :
( ( equivalence_1
| ~ is_a_theorem(implies(equiv(esk1_0,esk2_0),implies(esk1_0,esk2_0))) )
& ( is_a_theorem(implies(equiv(X7,X8),implies(X7,X8)))
| ~ equivalence_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)],[equivalence_1])])])])]) ).
fof(c_0_11,negated_conjecture,
~ equivalence_1,
inference(fof_nnf,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( ~ kn2
| is_a_theorem(implies(and(X1,X2),X1)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
kn2,
inference(split_conjunct,[status(thm)],[rosser_kn2]) ).
cnf(c_0_14,plain,
( ~ op_equiv
| equiv(X1,X2) = and(implies(X1,X2),implies(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
op_equiv,
inference(split_conjunct,[status(thm)],[rosser_op_equiv]) ).
cnf(c_0_16,plain,
( ~ is_a_theorem(implies(equiv(esk1_0,esk2_0),implies(esk1_0,esk2_0)))
| equivalence_1 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
~ equivalence_1,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
is_a_theorem(implies(and(X1,X2),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]) ).
cnf(c_0_19,plain,
and(implies(X1,X2),implies(X2,X1)) = equiv(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]) ).
cnf(c_0_20,plain,
~ is_a_theorem(implies(equiv(esk1_0,esk2_0),implies(esk1_0,esk2_0))),
inference(sr,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
is_a_theorem(implies(equiv(X1,X2),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL512+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.11/0.36 % Computer : n006.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 21 00:36:28 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 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.11/0.43 % Version: 3.5.1
% 0.11/0.43 % Preprocessing class: FSMSSLSSSSSNFFN.
% 0.11/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.43 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.11/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.43 % Starting sh5l with 300s (1) cores
% 0.11/0.43 % sh5l with pid 1640399 completed with status 0
% 0.11/0.43 % Result found by sh5l
% 0.11/0.43 % Preprocessing class: FSMSSLSSSSSNFFN.
% 0.11/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.43 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.11/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.43 % Starting sh5l with 300s (1) cores
% 0.11/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.11/0.43 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.11/0.43 % Search class: FGUSF-FFSM21-MFFFFFNN
% 0.11/0.43 % partial match(1): FGUSF-FFMM21-MFFFFFNN
% 0.11/0.43 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.43 % Starting SubtermCWHack with 28s (1) cores
% 0.11/0.43 % SubtermCWHack with pid 1640403 completed with status 0
% 0.11/0.43 % Result found by SubtermCWHack
% 0.11/0.43 % Preprocessing class: FSMSSLSSSSSNFFN.
% 0.11/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.43 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.11/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.43 % Starting sh5l with 300s (1) cores
% 0.11/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.11/0.43 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.11/0.43 % Search class: FGUSF-FFSM21-MFFFFFNN
% 0.11/0.43 % partial match(1): FGUSF-FFMM21-MFFFFFNN
% 0.11/0.43 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.43 % Starting SubtermCWHack with 28s (1) cores
% 0.11/0.43 % Preprocessing time : 0.001 s
% 0.11/0.43
% 0.11/0.43 % Proof found!
% 0.11/0.43 % SZS status Theorem
% 0.11/0.43 % SZS output start CNFRefutation
% See solution above
% 0.11/0.43 % Parsed axioms : 43
% 0.11/0.43 % Removed by relevancy pruning/SinE : 22
% 0.11/0.43 % Initial clauses : 29
% 0.11/0.43 % Removed in clause preprocessing : 0
% 0.11/0.43 % Initial clauses in saturation : 29
% 0.11/0.43 % Processed clauses : 27
% 0.11/0.43 % ...of these trivial : 7
% 0.11/0.43 % ...subsumed : 1
% 0.11/0.43 % ...remaining for further processing : 19
% 0.11/0.43 % Other redundant clauses eliminated : 0
% 0.11/0.43 % Clauses deleted for lack of memory : 0
% 0.11/0.43 % Backward-subsumed : 0
% 0.11/0.43 % Backward-rewritten : 1
% 0.11/0.43 % Generated clauses : 4
% 0.11/0.43 % ...of the previous two non-redundant : 3
% 0.11/0.43 % ...aggressively subsumed : 0
% 0.11/0.43 % Contextual simplify-reflections : 0
% 0.11/0.43 % Paramodulations : 4
% 0.11/0.43 % Factorizations : 0
% 0.11/0.43 % NegExts : 0
% 0.11/0.43 % Equation resolutions : 0
% 0.11/0.43 % Disequality decompositions : 0
% 0.11/0.43 % Total rewrite steps : 17
% 0.11/0.43 % ...of those cached : 7
% 0.11/0.43 % Propositional unsat checks : 0
% 0.11/0.43 % Propositional check models : 0
% 0.11/0.43 % Propositional check unsatisfiable : 0
% 0.11/0.43 % Propositional clauses : 0
% 0.11/0.43 % Propositional clauses after purity: 0
% 0.11/0.43 % Propositional unsat core size : 0
% 0.11/0.43 % Propositional preprocessing time : 0.000
% 0.11/0.43 % Propositional encoding time : 0.000
% 0.11/0.43 % Propositional solver time : 0.000
% 0.11/0.43 % Success case prop preproc time : 0.000
% 0.11/0.43 % Success case prop encoding time : 0.000
% 0.11/0.43 % Success case prop solver time : 0.000
% 0.11/0.43 % Current number of processed clauses : 18
% 0.11/0.43 % Positive orientable unit clauses : 14
% 0.11/0.43 % Positive unorientable unit clauses: 0
% 0.11/0.43 % Negative unit clauses : 1
% 0.11/0.43 % Non-unit-clauses : 3
% 0.11/0.43 % Current number of unprocessed clauses: 5
% 0.11/0.43 % ...number of literals in the above : 9
% 0.11/0.43 % Current number of archived formulas : 0
% 0.11/0.43 % Current number of archived clauses : 1
% 0.11/0.43 % Clause-clause subsumption calls (NU) : 1
% 0.11/0.43 % Rec. Clause-clause subsumption calls : 1
% 0.11/0.43 % Non-unit clause-clause subsumptions : 0
% 0.11/0.43 % Unit Clause-clause subsumption calls : 2
% 0.11/0.43 % Rewrite failures with RHS unbound : 0
% 0.11/0.43 % BW rewrite match attempts : 3
% 0.11/0.43 % BW rewrite match successes : 1
% 0.11/0.43 % Condensation attempts : 0
% 0.11/0.43 % Condensation successes : 0
% 0.11/0.43 % Termbank termtop insertions : 1682
% 0.11/0.43 % Search garbage collected termcells : 507
% 0.11/0.43
% 0.11/0.43 % -------------------------------------------------
% 0.11/0.43 % User time : 0.003 s
% 0.11/0.43 % System time : 0.004 s
% 0.11/0.43 % Total time : 0.006 s
% 0.11/0.43 % Maximum resident set size: 3688 pages
% 0.11/0.43
% 0.11/0.43 % -------------------------------------------------
% 0.11/0.43 % User time : 0.004 s
% 0.11/0.43 % System time : 0.009 s
% 0.11/0.43 % Total time : 0.013 s
% 0.11/0.43 % Maximum resident set size: 4608 pages
% 0.11/0.43 % E exiting
%------------------------------------------------------------------------------