%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MGT076+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n010.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 : Tue Sep 8 06:08:03 AM UTC 2026
% Result : Theorem 5.58s 2.91s
% Output : CNFRefutation 5.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 16 ( 6 unt; 0 def)
% Number of atoms : 35 ( 3 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 32 ( 13 ~; 11 |; 4 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 18 ( 0 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(odrl311,conjecture,
! [X1] :
( leq(v800,X1)
=> leq(v400,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',odrl311) ).
fof(leq_trans,axiom,
! [X1,X2,X3] :
( ( leq(X1,X2)
& leq(X2,X3) )
=> leq(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',leq_trans) ).
fof(leq_def,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> ( less(X1,X2)
| X1 = X2 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',leq_def) ).
fof(ord_v400_v800,axiom,
less(v400,v800),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v400_v800) ).
fof(c_0_4,negated_conjecture,
~ ! [X1] :
( leq(v800,X1)
=> leq(v400,X1) ),
inference(assume_negation,[status(cth)],[odrl311]) ).
fof(c_0_5,plain,
! [X31,X32,X33] :
( ~ leq(X31,X32)
| ~ leq(X32,X33)
| leq(X31,X33) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_trans])]) ).
fof(c_0_6,negated_conjecture,
( leq(v800,esk4_0)
& ~ leq(v400,esk4_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
cnf(c_0_7,plain,
( leq(X1,X3)
| ~ leq(X1,X2)
| ~ leq(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
leq(v800,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
~ leq(v400,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
( leq(X1,esk4_0)
| ~ leq(X1,v800) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
fof(c_0_11,plain,
! [X19,X20] :
( ( ~ leq(X19,X20)
| less(X19,X20)
| X19 = X20 )
& ( ~ less(X19,X20)
| leq(X19,X20) )
& ( X19 != X20
| leq(X19,X20) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_def])])]) ).
cnf(c_0_12,negated_conjecture,
~ leq(v400,v800),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
( leq(X1,X2)
| ~ less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,plain,
less(v400,v800),
inference(split_conjunct,[status(thm)],[ord_v400_v800]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT076+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.04 % Command : enigmatic-eprover.py %s %d 1
% 0.07/0.35 % Computer : n010.cluster.edu
% 0.07/0.35 % Model : x86_64 x86_64
% 0.07/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35 % Memory : 8046.5625MB
% 0.07/0.35 % OS : Linux 6.8.0-71-generic
% 0.07/0.35 % CPULimit : 300
% 0.07/0.35 % WCLimit : 300
% 0.07/0.35 % DateTime : Mon Sep 7 14:12:27 UTC 2026
% 0.07/0.35 % CPUTime :
% 0.12/0.45 # ENIGMATIC: Selected SinE mode:
% 0.12/0.45 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.12/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.12/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 5.58/2.91 # ENIGMATIC: Solved by autoschedule:
% 5.58/2.91 # No SInE strategy applied
% 5.58/2.91 # Trying AutoSched0 for 150 seconds
% 5.58/2.91 # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S0Y
% 5.58/2.91 # and selection function SelectMaxLComplexAvoidPosPred.
% 5.58/2.91 #
% 5.58/2.91 # Preprocessing time : 0.015 s
% 5.58/2.91
% 5.58/2.91 # Proof found!
% 5.58/2.91 # SZS status Theorem
% 5.58/2.91 # SZS output start CNFRefutation
% See solution above
% 5.58/2.91 # Training examples: 0 positive, 0 negative
% 5.58/2.91
% 5.58/2.91 # -------------------------------------------------
% 5.58/2.91 # User time : 0.017 s
% 5.58/2.91 # System time : 0.003 s
% 5.58/2.91 # Total time : 0.020 s
% 5.58/2.91 # Maximum resident set size: 3584 pages
% 5.58/2.91
%------------------------------------------------------------------------------