%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LCL896+1 : TPTP v9.3.1. Released v5.5.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n001.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 20.57s 4.59s
% Output : CNFRefutation 20.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of clauses : 34 ( 25 unt; 0 nHn; 10 RR)
% Number of literals : 45 ( 18 equ; 13 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 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 : 66 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_3,plain,
'+'(X1,'0') = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f7axyrmf/input.p',i_0_3) ).
cnf(i_0_2,plain,
'+'(X1,X2) = '+'(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f7axyrmf/input.p',i_0_2) ).
cnf(i_0_8,plain,
( '>='(X1,'==>'(X2,X3))
| ~ '>='('+'(X2,X1),X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f7axyrmf/input.p',i_0_8) ).
cnf(i_0_10,plain,
( '>='('+'(X1,X2),'+'(X3,X2))
| ~ '>='(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f7axyrmf/input.p',i_0_10) ).
cnf(i_0_9,plain,
'>='(X1,'0'),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f7axyrmf/input.p',i_0_9) ).
cnf(i_0_6,plain,
( X1 = X2
| ~ '>='(X2,X1)
| ~ '>='(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f7axyrmf/input.p',i_0_6) ).
cnf(i_0_13,plain,
'+'('+'(X1,'==>'(X1,X2)),'==>'('+'(X1,'==>'(X1,X2)),X3)) = '+'(X1,'==>'(X1,'+'(X2,'==>'(X2,X3)))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f7axyrmf/input.p',i_0_13) ).
cnf(i_0_1,plain,
'+'('+'(X1,X2),X3) = '+'(X1,'+'(X2,X3)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f7axyrmf/input.p',i_0_1) ).
cnf(i_0_7,plain,
( '>='('+'(X1,X2),X3)
| ~ '>='(X2,'==>'(X1,X3)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f7axyrmf/input.p',i_0_7) ).
cnf(i_0_4,plain,
'>='(X1,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f7axyrmf/input.p',i_0_4) ).
cnf(i_0_14,negated_conjecture,
'+'(esk1_0,'==>'(esk1_0,esk2_0)) != '+'(esk2_0,'==>'(esk2_0,esk1_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-f7axyrmf/input.p',i_0_14) ).
cnf(c_0_26,plain,
'+'(X1,'0') = X1,
i_0_3 ).
cnf(c_0_27,plain,
'+'(X1,X2) = '+'(X2,X1),
i_0_2 ).
cnf(c_0_28,plain,
( '>='(X1,'==>'(X2,X3))
| ~ '>='('+'(X2,X1),X3) ),
i_0_8 ).
cnf(c_0_29,plain,
( '>='('+'(X1,X2),'+'(X3,X2))
| ~ '>='(X1,X3) ),
i_0_10 ).
cnf(c_0_30,plain,
'>='(X1,'0'),
i_0_9 ).
cnf(c_0_31,plain,
'+'('0',X1) = X1,
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,plain,
( '>='('0','==>'(X1,X2))
| ~ '>='(X1,X2) ),
inference(spm,[status(thm)],[c_0_28,c_0_26]) ).
cnf(c_0_33,plain,
'>='('+'(X1,X2),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]) ).
cnf(c_0_34,plain,
( X1 = X2
| ~ '>='(X2,X1)
| ~ '>='(X1,X2) ),
i_0_6 ).
cnf(c_0_35,plain,
'>='('0','==>'('+'(X1,X2),X2)),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,plain,
'+'('+'(X1,'==>'(X1,X2)),'==>'('+'(X1,'==>'(X1,X2)),X3)) = '+'(X1,'==>'(X1,'+'(X2,'==>'(X2,X3)))),
i_0_13 ).
cnf(c_0_37,plain,
'+'('+'(X1,X2),X3) = '+'(X1,'+'(X2,X3)),
i_0_1 ).
cnf(c_0_38,plain,
'==>'('+'(X1,X2),X2) = '0',
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_30])]) ).
cnf(c_0_39,plain,
( '>='('+'(X1,X2),X3)
| ~ '>='(X2,'==>'(X1,X3)) ),
i_0_7 ).
cnf(c_0_40,plain,
'>='(X1,X1),
i_0_4 ).
cnf(c_0_41,plain,
'+'(X1,'+'('==>'(X1,X2),'==>'('+'(X1,'==>'(X1,X2)),X3))) = '+'(X1,'==>'(X1,'+'(X2,'==>'(X2,X3)))),
inference(rw,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_42,plain,
'==>'('+'(X1,X2),X1) = '0',
inference(spm,[status(thm)],[c_0_38,c_0_27]) ).
cnf(c_0_43,plain,
'>='('+'(X1,'==>'(X1,X2)),X2),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_44,plain,
'+'(X1,'==>'(X1,'+'(X2,'==>'(X2,X1)))) = '+'(X1,'==>'(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_26]) ).
cnf(c_0_45,plain,
'>='('+'(X1,'==>'(X1,X2)),'+'(X2,'==>'(X2,X1))),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_46,negated_conjecture,
'+'(esk1_0,'==>'(esk1_0,esk2_0)) != '+'(esk2_0,'==>'(esk2_0,esk1_0)),
i_0_14 ).
cnf(c_0_47,plain,
'+'(X1,'==>'(X1,X2)) = '+'(X2,'==>'(X2,X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_45]),c_0_45])]) ).
cnf(c_0_48,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_47])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL896+1 : TPTP v9.3.1. Released v5.5.0.
% 0.00/0.03 % Command : enigmatic-eprover.py %s %d 1
% 0.08/0.35 % Computer : n001.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 : Fri Sep 4 17:35:16 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.13/0.45 # ENIGMATIC: Selected complete mode:
% 20.57/4.59 # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d30-l6400-e0.15+coop-eprover66:
% 20.57/4.59 # ENIGMA: LightGBM model '/export/starexec/sandbox/solver/bin/data/Enigma/tptp-cade20-model03-h2e15/lgb-t150-d30-l6400-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 22; version: 991; iters: 150)
% 20.57/4.59 # Preprocessing time : 0.926 s
% 20.57/4.59 # Presaturation interreduction done
% 20.57/4.59
% 20.57/4.59 # Proof found!
% 20.57/4.59 # SZS status Theorem
% 20.57/4.59 # SZS output start CNFRefutation
% See solution above
% 20.57/4.59 # Training examples: 0 positive, 0 negative
% 20.57/4.59
% 20.57/4.59 # -------------------------------------------------
% 20.57/4.59 # User time : 0.876 s
% 20.57/4.59 # System time : 0.200 s
% 20.57/4.59 # Total time : 1.076 s
% 20.57/4.59 # ...preprocessing : 0.926 s
% 20.57/4.59 # ...main loop : 0.150 s
% 20.57/4.59 # Maximum resident set size: 169908 pages
% 20.57/4.59
%------------------------------------------------------------------------------