%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : LCL897+1 : TPTP v9.3.1. Released v5.5.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n019.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 40.73s 6.79s
% Output : CNFRefutation 40.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of clauses : 26 ( 26 unt; 0 nHn; 6 RR)
% Number of literals : 26 ( 25 equ; 5 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 57 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1,plain,
'+'('+'(X1,X2),X3) = '+'(X1,'+'(X2,X3)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b8u847na/input.p',i_0_1) ).
cnf(i_0_2,plain,
'+'(X1,X2) = '+'(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b8u847na/input.p',i_0_2) ).
cnf(i_0_8,plain,
'+'(X1,'==>'(X1,X2)) = '+'(X2,'==>'(X2,X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b8u847na/input.p',i_0_8) ).
cnf(i_0_7,plain,
'==>'('+'(X1,X2),X3) = '==>'(X1,'==>'(X2,X3)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b8u847na/input.p',i_0_7) ).
cnf(i_0_9,negated_conjecture,
'+'('+'(a,'==>'(a,b)),'==>'('+'(a,'==>'(a,b)),c)) != '+'(a,'==>'(a,'+'(b,'==>'(b,c)))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b8u847na/input.p',i_0_9) ).
cnf(c_0_15,plain,
'+'('+'(X1,X2),X3) = '+'(X1,'+'(X2,X3)),
i_0_1 ).
cnf(c_0_16,plain,
'+'(X1,X2) = '+'(X2,X1),
i_0_2 ).
cnf(c_0_17,plain,
'+'(X1,'==>'(X1,X2)) = '+'(X2,'==>'(X2,X1)),
i_0_8 ).
cnf(c_0_18,plain,
'+'(X1,'+'(X2,X3)) = '+'(X2,'+'(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_15]) ).
cnf(c_0_19,plain,
'+'(X1,'==>'(X1,'+'(X2,X3))) = '+'(X2,'+'(X3,'==>'('+'(X2,X3),X1))),
inference(spm,[status(thm)],[c_0_15,c_0_17]) ).
cnf(c_0_20,plain,
'==>'('+'(X1,X2),X3) = '==>'(X1,'==>'(X2,X3)),
i_0_7 ).
cnf(c_0_21,plain,
'+'(X1,'==>'(X1,'+'(X2,X3))) = '+'(X3,'+'(X2,'==>'('+'(X2,X3),X1))),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
'+'('==>'(X1,X2),'==>'('==>'(X1,X2),X3)) = '+'(X3,'==>'('+'(X3,X1),X2)),
inference(spm,[status(thm)],[c_0_17,c_0_20]) ).
cnf(c_0_23,negated_conjecture,
'+'('+'(a,'==>'(a,b)),'==>'('+'(a,'==>'(a,b)),c)) != '+'(a,'==>'(a,'+'(b,'==>'(b,c)))),
i_0_9 ).
cnf(c_0_24,plain,
'+'(X1,'+'('==>'(X1,X2),'==>'('==>'(X1,X2),X3))) = '+'(X2,'==>'(X2,'+'(X3,X1))),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,plain,
'+'('==>'(X1,X2),'==>'('==>'(X1,X2),X3)) = '+'(X3,'==>'('+'(X1,X3),X2)),
inference(spm,[status(thm)],[c_0_22,c_0_16]) ).
cnf(c_0_26,negated_conjecture,
'+'(a,'+'('==>'(a,b),'==>'('+'(a,'==>'(a,b)),c))) != '+'(a,'==>'(a,'+'(b,'==>'(b,c)))),
inference(rw,[status(thm)],[c_0_23,c_0_15]) ).
cnf(c_0_27,plain,
'+'(X1,'+'('==>'(X1,X2),'==>'('+'('==>'(X1,X2),X3),X4))) = '+'(X2,'==>'(X2,'+'('==>'(X3,X4),X1))),
inference(spm,[status(thm)],[c_0_24,c_0_20]) ).
cnf(c_0_28,plain,
'+'('==>'(X1,X2),'==>'('+'(X1,'==>'(X1,X2)),X3)) = '+'('==>'(X1,X3),'==>'('+'(X3,'==>'(X3,X1)),X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_17]),c_0_20]),c_0_16]) ).
cnf(c_0_29,negated_conjecture,
'+'(c,'==>'(c,'+'(a,'==>'(a,b)))) != '+'(a,'==>'(a,'+'(b,'==>'(b,c)))),
inference(rw,[status(thm)],[c_0_26,c_0_19]) ).
cnf(c_0_30,plain,
'+'(X1,'==>'(X1,'+'(X2,'==>'(X2,X3)))) = '+'(X3,'==>'(X3,'+'(X2,'==>'(X2,X1)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_27]),c_0_16]),c_0_16]) ).
cnf(c_0_31,plain,
'+'(X1,'==>'(X1,'+'(X2,'==>'(X2,X3)))) = '+'(X3,'+'('==>'(X3,X2),'==>'('+'(X2,'==>'(X2,X3)),X1))),
inference(spm,[status(thm)],[c_0_19,c_0_17]) ).
cnf(c_0_32,plain,
'+'(X1,'+'('==>'(X1,X2),'==>'('+'(X2,'==>'(X2,X1)),X3))) = '+'(X2,'==>'(X2,'+'(X1,'==>'(X1,X3)))),
inference(spm,[status(thm)],[c_0_19,c_0_28]) ).
cnf(c_0_33,negated_conjecture,
'+'(b,'==>'(b,'+'(a,'==>'(a,c)))) != '+'(a,'==>'(a,'+'(b,'==>'(b,c)))),
inference(rw,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,plain,
'+'(X1,'==>'(X1,'+'(X2,'==>'(X2,X3)))) = '+'(X2,'==>'(X2,'+'(X3,'==>'(X3,X1)))),
inference(rw,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL897+1 : TPTP v9.3.1. Released v5.5.0.
% 0.00/0.03 % Command : enigmatic-eprover.py %s %d 1
% 0.10/0.36 % Computer : n019.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sat Sep 5 15:07:25 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.13/0.42 # ENIGMATIC: Selected complete mode:
% 40.73/6.79 # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d60-l8000-e0.15+coop-eprover73:
% 40.73/6.79 # ENIGMA: LightGBM model '/export/starexec/sandbox/solver/bin/data/Enigma/tptp-cade20-model03-h2e15/lgb-t150-d60-l8000-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 25; version: 991; iters: 150)
% 40.73/6.79 # Preprocessing time : 2.347 s
% 40.73/6.79 # Presaturation interreduction done
% 40.73/6.79
% 40.73/6.79 # Proof found!
% 40.73/6.79 # SZS status Theorem
% 40.73/6.79 # SZS output start CNFRefutation
% See solution above
% 40.73/6.79 # Training examples: 0 positive, 0 negative
% 40.73/6.79
% 40.73/6.79 # -------------------------------------------------
% 40.73/6.79 # User time : 2.843 s
% 40.73/6.79 # System time : 0.359 s
% 40.73/6.79 # Total time : 3.202 s
% 40.73/6.79 # ...preprocessing : 2.347 s
% 40.73/6.79 # ...main loop : 0.855 s
% 40.73/6.79 # Maximum resident set size: 186788 pages
% 40.73/6.79
%------------------------------------------------------------------------------