%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LCL899+1 : TPTP v9.3.1. Released v5.5.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n031.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:45 AM UTC 2026
% Result : Theorem 13.82s 3.92s
% Output : CNFRefutation 13.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 13
% Syntax : Number of clauses : 47 ( 32 unt; 0 nHn; 14 RR)
% Number of literals : 66 ( 21 equ; 23 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; 3 con; 0-2 aty)
% Number of variables : 78 ( 18 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_3,plain,
'+'(X1,'0') = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xhn1qvsw/lgb.p',i_0_3) ).
cnf(i_0_2,plain,
'+'(X1,X2) = '+'(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xhn1qvsw/lgb.p',i_0_2) ).
cnf(i_0_6,plain,
( X1 = X2
| ~ '>='(X2,X1)
| ~ '>='(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xhn1qvsw/lgb.p',i_0_6) ).
cnf(i_0_9,plain,
'>='(X1,'0'),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xhn1qvsw/lgb.p',i_0_9) ).
cnf(i_0_8,plain,
( '>='(X1,'==>'(X2,X3))
| ~ '>='('+'(X2,X1),X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xhn1qvsw/lgb.p',i_0_8) ).
cnf(i_0_13,plain,
'+'(X1,'1') = '1',
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xhn1qvsw/lgb.p',i_0_13) ).
cnf(i_0_10,plain,
( '>='('+'(X1,X2),'+'(X3,X2))
| ~ '>='(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xhn1qvsw/lgb.p',i_0_10) ).
cnf(i_0_14,plain,
'==>'('==>'(X1,X2),X2) = '==>'('==>'(X2,X1),X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xhn1qvsw/lgb.p',i_0_14) ).
cnf(i_0_11,plain,
( '>='('==>'(X1,X2),'==>'(X3,X2))
| ~ '>='(X3,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xhn1qvsw/lgb.p',i_0_11) ).
cnf(i_0_7,plain,
( '>='('+'(X1,X2),X3)
| ~ '>='(X2,'==>'(X1,X3)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xhn1qvsw/lgb.p',i_0_7) ).
cnf(i_0_5,plain,
( '>='(X1,X2)
| ~ '>='(X3,X2)
| ~ '>='(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xhn1qvsw/lgb.p',i_0_5) ).
cnf(i_0_4,plain,
'>='(X1,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xhn1qvsw/lgb.p',i_0_4) ).
cnf(i_0_15,negated_conjecture,
'==>'('==>'(esk1_0,'1'),'1') != esk1_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-xhn1qvsw/lgb.p',i_0_15) ).
cnf(c_0_29,plain,
'+'(X1,'0') = X1,
i_0_3 ).
cnf(c_0_30,plain,
'+'(X1,X2) = '+'(X2,X1),
i_0_2 ).
cnf(c_0_31,plain,
( X1 = X2
| ~ '>='(X2,X1)
| ~ '>='(X1,X2) ),
i_0_6 ).
cnf(c_0_32,plain,
'>='(X1,'0'),
i_0_9 ).
cnf(c_0_33,plain,
( '>='(X1,'==>'(X2,X3))
| ~ '>='('+'(X2,X1),X3) ),
i_0_8 ).
cnf(c_0_34,plain,
'+'(X1,'1') = '1',
i_0_13 ).
cnf(c_0_35,plain,
( '>='('+'(X1,X2),'+'(X3,X2))
| ~ '>='(X1,X3) ),
i_0_10 ).
cnf(c_0_36,plain,
'+'('0',X1) = X1,
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_37,plain,
( '0' = X1
| ~ '>='('0',X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,plain,
'>='(X1,'==>'(X2,'0')),
inference(spm,[status(thm)],[c_0_33,c_0_32]) ).
cnf(c_0_39,plain,
'+'('1',X1) = '1',
inference(spm,[status(thm)],[c_0_34,c_0_30]) ).
cnf(c_0_40,plain,
'>='('+'(X1,X2),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_32]),c_0_36]) ).
cnf(c_0_41,plain,
'==>'(X1,'0') = '0',
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,plain,
'==>'('==>'(X1,X2),X2) = '==>'('==>'(X2,X1),X1),
i_0_14 ).
cnf(c_0_43,plain,
( '>='('==>'(X1,X2),'==>'(X3,X2))
| ~ '>='(X3,X1) ),
i_0_11 ).
cnf(c_0_44,plain,
( '>='(X1,'==>'('1',X2))
| ~ '>='('1',X2) ),
inference(spm,[status(thm)],[c_0_33,c_0_39]) ).
cnf(c_0_45,plain,
'>='('1',X1),
inference(spm,[status(thm)],[c_0_40,c_0_39]) ).
cnf(c_0_46,plain,
( '>='('+'(X1,X2),X3)
| ~ '>='(X2,'==>'(X1,X3)) ),
i_0_7 ).
cnf(c_0_47,plain,
'==>'('==>'('0',X1),X1) = '0',
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_48,plain,
( '>='(X1,X2)
| ~ '>='(X3,X2)
| ~ '>='(X1,X3) ),
i_0_5 ).
cnf(c_0_49,plain,
'>='('==>'('0',X1),'==>'(X2,X1)),
inference(spm,[status(thm)],[c_0_43,c_0_32]) ).
cnf(c_0_50,plain,
'>='(X1,X1),
i_0_4 ).
cnf(c_0_51,negated_conjecture,
'==>'('==>'(esk1_0,'1'),'1') != esk1_0,
i_0_15 ).
cnf(c_0_52,plain,
'>='(X1,'==>'('1',X2)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45])]) ).
cnf(c_0_53,plain,
'>='('+'('==>'('0',X1),X2),X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_32])]) ).
cnf(c_0_54,plain,
( '>='(X1,'==>'(X2,X3))
| ~ '>='(X1,'==>'('0',X3)) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_55,plain,
'>='(X1,'==>'(X2,'+'(X2,X1))),
inference(spm,[status(thm)],[c_0_33,c_0_50]) ).
cnf(c_0_56,negated_conjecture,
'==>'('==>'('1',esk1_0),esk1_0) != esk1_0,
inference(rw,[status(thm)],[c_0_51,c_0_42]) ).
cnf(c_0_57,plain,
'==>'('1',X1) = '0',
inference(spm,[status(thm)],[c_0_37,c_0_52]) ).
cnf(c_0_58,plain,
'>='('==>'('0',X1),X1),
inference(spm,[status(thm)],[c_0_53,c_0_29]) ).
cnf(c_0_59,plain,
'>='(X1,'==>'(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_36]) ).
cnf(c_0_60,negated_conjecture,
'==>'('0',esk1_0) != esk1_0,
inference(rw,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_61,plain,
'==>'('0',X1) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_58]),c_0_59])]) ).
cnf(c_0_62,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_61])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL899+1 : TPTP v9.3.1. Released v5.5.0.
% 0.00/0.04 % Command : enigmatic-eprover.py %s %d 1
% 0.08/0.35 % Computer : n031.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Sun Sep 6 01:04:42 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.13/0.45 # ENIGMATIC: Selected complete mode:
% 13.82/3.92 # ENIGMATIC: Solved by autoschedule-lgb:
% 13.82/3.92 # No SInE strategy applied
% 13.82/3.92 # Trying AutoSched0 for 150 seconds
% 13.82/3.92 # AutoSched0-Mode selected heuristic H_____047_C18_F1_AE_R8_CS_SP_S2S
% 13.82/3.92 # and selection function SelectNewComplexAHP.
% 13.82/3.92 #
% 13.82/3.92 # Preprocessing time : 0.023 s
% 13.82/3.92
% 13.82/3.92 # Proof found!
% 13.82/3.92 # SZS status Theorem
% 13.82/3.92 # SZS output start CNFRefutation
% See solution above
% 13.82/3.92 # Training examples: 0 positive, 0 negative
% 13.82/3.92
% 13.82/3.92 # -------------------------------------------------
% 13.82/3.92 # User time : 0.035 s
% 13.82/3.92 # System time : 0.006 s
% 13.82/3.92 # Total time : 0.041 s
% 13.82/3.92 # Maximum resident set size: 3328 pages
% 13.82/3.92
%------------------------------------------------------------------------------