%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LCL893+1 : TPTP v9.3.1. Released v5.5.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n007.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:48:44 AM UTC 2026
% Result : Theorem 14.64s 3.54s
% Output : CNFRefutation 14.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 21 ( 16 unt; 0 nHn; 12 RR)
% Number of literals : 28 ( 11 equ; 9 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 21 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_9,plain,
( '>='(X1,'==>'(X2,X3))
| ~ '>='('+'(X2,X1),X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ipwb9mdn/lgb.p',i_0_9) ).
cnf(i_0_3,plain,
'+'(X1,'0') = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ipwb9mdn/lgb.p',i_0_3) ).
cnf(i_0_5,plain,
'>='(X1,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ipwb9mdn/lgb.p',i_0_5) ).
cnf(i_0_15,plain,
'==>'(h(X1),X1) = h(X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ipwb9mdn/lgb.p',i_0_15) ).
cnf(i_0_17,negated_conjecture,
h(esk1_0) = esk1_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ipwb9mdn/lgb.p',i_0_17) ).
cnf(i_0_7,plain,
( X1 = X2
| ~ '>='(X2,X1)
| ~ '>='(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ipwb9mdn/lgb.p',i_0_7) ).
cnf(i_0_10,plain,
'>='(X1,'0'),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ipwb9mdn/lgb.p',i_0_10) ).
cnf(i_0_16,negated_conjecture,
'0' != esk1_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ipwb9mdn/lgb.p',i_0_16) ).
cnf(c_0_26,plain,
( '>='(X1,'==>'(X2,X3))
| ~ '>='('+'(X2,X1),X3) ),
i_0_9 ).
cnf(c_0_27,plain,
'+'(X1,'0') = X1,
i_0_3 ).
cnf(c_0_28,plain,
( '>='('0','==>'(X1,X2))
| ~ '>='(X1,X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_29,plain,
'>='(X1,X1),
i_0_5 ).
cnf(c_0_30,plain,
'==>'(h(X1),X1) = h(X1),
i_0_15 ).
cnf(c_0_31,negated_conjecture,
h(esk1_0) = esk1_0,
i_0_17 ).
cnf(c_0_32,plain,
'>='('0','==>'(X1,X1)),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,negated_conjecture,
'==>'(esk1_0,esk1_0) = esk1_0,
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,plain,
( X1 = X2
| ~ '>='(X2,X1)
| ~ '>='(X1,X2) ),
i_0_7 ).
cnf(c_0_35,negated_conjecture,
'>='('0',esk1_0),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,plain,
'>='(X1,'0'),
i_0_10 ).
cnf(c_0_37,negated_conjecture,
'0' != esk1_0,
i_0_16 ).
cnf(c_0_38,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]),c_0_37]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL893+1 : TPTP v9.3.1. Released v5.5.0.
% 0.00/0.04 % Command : enigmatic-eprover.py %s %d 1
% 0.09/0.36 % Computer : n007.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sun Sep 6 00:23:26 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.14/0.46 # ENIGMATIC: Selected complete mode:
% 14.64/3.54 # ENIGMATIC: Solved by autoschedule-lgb:
% 14.64/3.54 # No SInE strategy applied
% 14.64/3.54 # Trying AutoSched0 for 150 seconds
% 14.64/3.54 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_AE_CS_SP_PI_S0e
% 14.64/3.54 # and selection function SelectLargestNegLit.
% 14.64/3.54 #
% 14.64/3.54 # Preprocessing time : 0.023 s
% 14.64/3.54
% 14.64/3.54 # Proof found!
% 14.64/3.54 # SZS status Theorem
% 14.64/3.54 # SZS output start CNFRefutation
% See solution above
% 14.64/3.54 # Training examples: 0 positive, 0 negative
% 14.64/3.54
% 14.64/3.54 # -------------------------------------------------
% 14.64/3.54 # User time : 0.027 s
% 14.64/3.54 # System time : 0.004 s
% 14.64/3.54 # Total time : 0.031 s
% 14.64/3.54 # Maximum resident set size: 3328 pages
% 14.64/3.54
%------------------------------------------------------------------------------