%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LCL901+1 : TPTP v9.3.1. Released v5.5.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n014.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 12.84s 3.56s
% Output : CNFRefutation 12.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 15
% Syntax : Number of clauses : 66 ( 51 unt; 0 nHn; 15 RR)
% Number of literals : 85 ( 33 equ; 22 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 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 : 117 ( 20 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_3,plain,
'+'(X1,'0') = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9xvodrgj/input.p',i_0_3) ).
cnf(i_0_2,plain,
'+'(X1,X2) = '+'(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9xvodrgj/input.p',i_0_2) ).
cnf(i_0_8,plain,
( '>='(X1,'==>'(X2,X3))
| ~ '>='('+'(X2,X1),X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9xvodrgj/input.p',i_0_8) ).
cnf(i_0_10,plain,
( '>='('+'(X1,X2),'+'(X3,X2))
| ~ '>='(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9xvodrgj/input.p',i_0_10) ).
cnf(i_0_9,plain,
'>='(X1,'0'),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9xvodrgj/input.p',i_0_9) ).
cnf(i_0_4,plain,
'>='(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9xvodrgj/input.p',i_0_4) ).
cnf(i_0_6,plain,
( X1 = X2
| ~ '>='(X2,X1)
| ~ '>='(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9xvodrgj/input.p',i_0_6) ).
cnf(i_0_5,plain,
( '>='(X1,X2)
| ~ '>='(X3,X2)
| ~ '>='(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9xvodrgj/input.p',i_0_5) ).
cnf(i_0_14,plain,
'==>'('==>'(X1,X2),X2) = '==>'('==>'(X2,X1),X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9xvodrgj/input.p',i_0_14) ).
cnf(i_0_15,plain,
'+'(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9xvodrgj/input.p',i_0_15) ).
cnf(i_0_7,plain,
( '>='('+'(X1,X2),X3)
| ~ '>='(X2,'==>'(X1,X3)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9xvodrgj/input.p',i_0_7) ).
cnf(i_0_13,plain,
'+'(X1,'1') = '1',
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9xvodrgj/input.p',i_0_13) ).
cnf(i_0_1,plain,
'+'('+'(X1,X2),X3) = '+'(X1,'+'(X2,X3)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9xvodrgj/input.p',i_0_1) ).
cnf(i_0_12,plain,
( '>='('==>'(X1,X2),'==>'(X1,X3))
| ~ '>='(X2,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9xvodrgj/input.p',i_0_12) ).
cnf(i_0_16,negated_conjecture,
'==>'('==>'('==>'(esk1_0,'1'),esk1_0),esk1_0) != '0',
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9xvodrgj/input.p',i_0_16) ).
cnf(c_0_32,plain,
'+'(X1,'0') = X1,
i_0_3 ).
cnf(c_0_33,plain,
'+'(X1,X2) = '+'(X2,X1),
i_0_2 ).
cnf(c_0_34,plain,
( '>='(X1,'==>'(X2,X3))
| ~ '>='('+'(X2,X1),X3) ),
i_0_8 ).
cnf(c_0_35,plain,
( '>='('+'(X1,X2),'+'(X3,X2))
| ~ '>='(X1,X3) ),
i_0_10 ).
cnf(c_0_36,plain,
'>='(X1,'0'),
i_0_9 ).
cnf(c_0_37,plain,
'+'('0',X1) = X1,
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,plain,
( '>='('0','==>'(X1,X2))
| ~ '>='(X1,X2) ),
inference(spm,[status(thm)],[c_0_34,c_0_32]) ).
cnf(c_0_39,plain,
'>='(X1,X1),
i_0_4 ).
cnf(c_0_40,plain,
'>='('+'(X1,X2),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]) ).
cnf(c_0_41,plain,
( X1 = X2
| ~ '>='(X2,X1)
| ~ '>='(X1,X2) ),
i_0_6 ).
cnf(c_0_42,plain,
'>='('0','==>'(X1,'0')),
inference(spm,[status(thm)],[c_0_38,c_0_36]) ).
cnf(c_0_43,plain,
( '>='(X1,X2)
| ~ '>='(X3,X2)
| ~ '>='(X1,X3) ),
i_0_5 ).
cnf(c_0_44,plain,
'>='('0','==>'(X1,X1)),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_45,plain,
'>='(X1,'==>'(X2,X1)),
inference(spm,[status(thm)],[c_0_34,c_0_40]) ).
cnf(c_0_46,plain,
'==>'('==>'(X1,X2),X2) = '==>'('==>'(X2,X1),X1),
i_0_14 ).
cnf(c_0_47,plain,
'==>'(X1,'0') = '0',
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_36])]) ).
cnf(c_0_48,plain,
( '0' = X1
| ~ '>='('0',X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_36]) ).
cnf(c_0_49,plain,
'>='(X1,'==>'(X2,X2)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_36])]) ).
cnf(c_0_50,plain,
'>='('+'(X1,X2),'+'('==>'(X3,X1),X2)),
inference(spm,[status(thm)],[c_0_35,c_0_45]) ).
cnf(c_0_51,plain,
'+'(X1,X1) = X1,
i_0_15 ).
cnf(c_0_52,plain,
( '>='('+'(X1,X2),X3)
| ~ '>='(X2,'==>'(X1,X3)) ),
i_0_7 ).
cnf(c_0_53,plain,
'==>'('==>'('0',X1),X1) = '0',
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_54,plain,
'0' = '==>'(X1,X1),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_55,plain,
'>='(X1,'+'(X1,'==>'(X2,X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_33]) ).
cnf(c_0_56,plain,
'>='('+'(X1,X2),X1),
inference(spm,[status(thm)],[c_0_40,c_0_33]) ).
cnf(c_0_57,plain,
'>='('+'(X1,'==>'(X1,X2)),X2),
inference(spm,[status(thm)],[c_0_52,c_0_39]) ).
cnf(c_0_58,plain,
'>='('+'('==>'('0',X1),X2),X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_36])]) ).
cnf(c_0_59,plain,
'+'(X1,'==>'(X2,X2)) = X1,
inference(spm,[status(thm)],[c_0_32,c_0_54]) ).
cnf(c_0_60,plain,
'+'(X1,'1') = '1',
i_0_13 ).
cnf(c_0_61,plain,
'+'(X1,'==>'(X2,X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_55]),c_0_56])]) ).
cnf(c_0_62,plain,
'>='('0','==>'('+'(X1,'==>'(X1,X2)),X2)),
inference(spm,[status(thm)],[c_0_38,c_0_57]) ).
cnf(c_0_63,plain,
'>='('==>'('0',X1),X1),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_64,plain,
'+'('1',X1) = '1',
inference(spm,[status(thm)],[c_0_60,c_0_33]) ).
cnf(c_0_65,plain,
'>='(X1,'==>'(X2,'+'(X2,X1))),
inference(spm,[status(thm)],[c_0_34,c_0_39]) ).
cnf(c_0_66,plain,
'+'(X1,'==>'('==>'(X1,X2),X2)) = X1,
inference(spm,[status(thm)],[c_0_61,c_0_46]) ).
cnf(c_0_67,plain,
'==>'('+'(X1,'==>'(X1,X2)),X2) = '0',
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_62]),c_0_36])]) ).
cnf(c_0_68,plain,
'==>'('0',X1) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_63]),c_0_45])]) ).
cnf(c_0_69,plain,
'+'('+'(X1,X2),X3) = '+'(X1,'+'(X2,X3)),
i_0_1 ).
cnf(c_0_70,plain,
( '>='('==>'(X1,X2),'==>'(X1,X3))
| ~ '>='(X2,X3) ),
i_0_12 ).
cnf(c_0_71,plain,
'>='('1',X1),
inference(spm,[status(thm)],[c_0_40,c_0_64]) ).
cnf(c_0_72,plain,
( '==>'(X1,'+'(X1,X2)) = X2
| ~ '>='('==>'(X1,'+'(X1,X2)),X2) ),
inference(spm,[status(thm)],[c_0_41,c_0_65]) ).
cnf(c_0_73,plain,
'+'(X1,'==>'(X1,X2)) = '+'(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_68]),c_0_69]),c_0_33]),c_0_61]) ).
cnf(c_0_74,plain,
'>='('==>'(X1,'+'(X2,X3)),'==>'(X1,X3)),
inference(spm,[status(thm)],[c_0_70,c_0_40]) ).
cnf(c_0_75,plain,
'>='('==>'(X1,'1'),'==>'(X1,X2)),
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_76,negated_conjecture,
'==>'('==>'('==>'(esk1_0,'1'),esk1_0),esk1_0) != '0',
i_0_16 ).
cnf(c_0_77,plain,
'==>'(X1,'+'(X1,X2)) = '==>'(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_74])]) ).
cnf(c_0_78,plain,
'>='('0','==>'('==>'(X1,'1'),'==>'(X1,X2))),
inference(spm,[status(thm)],[c_0_38,c_0_75]) ).
cnf(c_0_79,negated_conjecture,
'==>'('==>'(esk1_0,'==>'(esk1_0,'1')),'==>'(esk1_0,'1')) != '0',
inference(rw,[status(thm)],[c_0_76,c_0_46]) ).
cnf(c_0_80,plain,
'==>'(X1,'==>'(X1,X2)) = '==>'(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_73]),c_0_77]) ).
cnf(c_0_81,plain,
'==>'('==>'(X1,'1'),'==>'(X1,X2)) = '0',
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_78]),c_0_36])]) ).
cnf(c_0_82,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_79,c_0_80]),c_0_81])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL901+1 : TPTP v9.3.1. Released v5.5.0.
% 0.00/0.04 % Command : enigmatic-eprover.py %s %d 1
% 0.09/0.35 % Computer : n014.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Sat Sep 5 10:21:44 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.13/0.45 # ENIGMATIC: Selected complete mode:
% 12.84/3.56 # ENIGMATIC: Solved by autoschedule:
% 12.84/3.56 # No SInE strategy applied
% 12.84/3.56 # Trying AutoSched0 for 150 seconds
% 12.84/3.56 # AutoSched0-Mode selected heuristic H_____042_B03_F1_AE_Q4_SP_S2S
% 12.84/3.56 # and selection function SelectNewComplexAHP.
% 12.84/3.56 #
% 12.84/3.56 # Preprocessing time : 0.013 s
% 12.84/3.56
% 12.84/3.56 # Proof found!
% 12.84/3.56 # SZS status Theorem
% 12.84/3.56 # SZS output start CNFRefutation
% See solution above
% 12.84/3.56 # Training examples: 0 positive, 0 negative
% 12.84/3.56
% 12.84/3.56 # -------------------------------------------------
% 12.84/3.56 # User time : 0.055 s
% 12.84/3.56 # System time : 0.001 s
% 12.84/3.56 # Total time : 0.056 s
% 12.84/3.56 # Maximum resident set size: 3328 pages
% 12.84/3.56
%------------------------------------------------------------------------------