%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LCL512+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% 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 : Mon Sep 7 11:44:54 AM UTC 2026
% Result : Theorem 13.68s 3.88s
% Output : CNFRefutation 13.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 22 ( 13 unt; 0 def)
% Number of atoms : 35 ( 4 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 25 ( 12 ~; 8 |; 2 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 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,plain,
! [X73,X74] :
( ( ~ kn2
| is_a_theorem(implies(and(X73,X74),X73)) )
& ( ~ is_a_theorem(implies(and(esk34_0,esk35_0),esk34_0))
| kn2 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kn2])])])]) ).
fof(c_0_8,plain,
! [X125,X126] :
( ~ op_equiv
| equiv(X125,X126) = and(implies(X125,X126),implies(X126,X125)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_equiv])])]) ).
fof(c_0_9,plain,
! [X59,X60] :
( ( ~ equivalence_1
| is_a_theorem(implies(equiv(X59,X60),implies(X59,X60))) )
& ( ~ is_a_theorem(implies(equiv(esk27_0,esk28_0),implies(esk27_0,esk28_0)))
| equivalence_1 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equivalence_1])])])]) ).
fof(c_0_10,negated_conjecture,
~ equivalence_1,
inference(fof_simplification,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( is_a_theorem(implies(and(X1,X2),X1))
| ~ kn2 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
kn2,
inference(split_conjunct,[status(thm)],[rosser_kn2]) ).
cnf(c_0_13,plain,
( equiv(X1,X2) = and(implies(X1,X2),implies(X2,X1))
| ~ op_equiv ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
op_equiv,
inference(split_conjunct,[status(thm)],[rosser_op_equiv]) ).
cnf(c_0_15,plain,
( equivalence_1
| ~ is_a_theorem(implies(equiv(esk27_0,esk28_0),implies(esk27_0,esk28_0))) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,negated_conjecture,
~ equivalence_1,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
is_a_theorem(implies(and(X1,X2),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12])]) ).
cnf(c_0_18,plain,
and(implies(X1,X2),implies(X2,X1)) = equiv(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]) ).
cnf(c_0_19,plain,
~ is_a_theorem(implies(equiv(esk27_0,esk28_0),implies(esk27_0,esk28_0))),
inference(sr,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
is_a_theorem(implies(equiv(X1,X2),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL512+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.03 % Command : enigmatic-eprover.py %s %d 1
% 0.10/0.36 % Computer : n006.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sat Sep 5 17:13:18 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.41 # ENIGMATIC: Selected SinE mode:
% 0.10/0.42 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.42 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.10/0.42 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.10/0.42 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 13.68/3.88 # ENIGMATIC: Solved by autoschedule:
% 13.68/3.88 # No SInE strategy applied
% 13.68/3.88 # Trying AutoSched0 for 150 seconds
% 13.68/3.88 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 13.68/3.88 # and selection function SelectComplexExceptUniqMaxHorn.
% 13.68/3.88 #
% 13.68/3.88 # Preprocessing time : 0.015 s
% 13.68/3.88 # Presaturation interreduction done
% 13.68/3.88
% 13.68/3.88 # Proof found!
% 13.68/3.88 # SZS status Theorem
% 13.68/3.88 # SZS output start CNFRefutation
% See solution above
% 13.68/3.88 # Training examples: 0 positive, 0 negative
% 13.68/3.88
% 13.68/3.88 # -------------------------------------------------
% 13.68/3.88 # User time : 0.017 s
% 13.68/3.88 # System time : 0.004 s
% 13.68/3.88 # Total time : 0.021 s
% 13.68/3.88 # Maximum resident set size: 3584 pages
% 13.68/3.88
%------------------------------------------------------------------------------