%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWX220+1 : TPTP v9.3.0. Released v9.3.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 : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 06:59:51 PM UTC 2026
% Result : Theorem 70.38s 10.27s
% Output : CNFRefutation 70.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 6
% Syntax : Number of clauses : 28 ( 10 unt; 0 nHn; 24 RR)
% Number of literals : 60 ( 33 equ; 48 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 5 con; 0-3 aty)
% Number of variables : 87 ( 31 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_36,negated_conjecture,
~ tc(nil,X1,arr(arr(a,arr(b,c)),arr(b,arr(a,c)))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-225_rgkq/input.p',i_0_36) ).
cnf(i_0_31,plain,
( tc(X1,lam(X2),arr(X3,X4))
| ~ tc(cons(X3,X1),X2,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-225_rgkq/input.p',i_0_31) ).
cnf(i_0_27,plain,
( tc(X1,app(X2,X3,X4),X5)
| ~ tc(X1,X3,X4)
| ~ tc(X1,X2,arr(X4,X5)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-225_rgkq/input.p',i_0_27) ).
cnf(i_0_34,plain,
( tc(X1,var(X2),X3)
| X4 != X3
| index(X1,X2) != just(X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-225_rgkq/input.p',i_0_34) ).
cnf(i_0_26,plain,
index(cons(X1,X2),suc(X3)) = index(X2,X3),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-225_rgkq/input.p',i_0_26) ).
cnf(i_0_25,plain,
index(cons(X1,X2),zero) = just(X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-225_rgkq/input.p',i_0_25) ).
cnf(c_0_43,negated_conjecture,
~ tc(nil,X1,arr(arr(a,arr(b,c)),arr(b,arr(a,c)))),
i_0_36 ).
cnf(c_0_44,plain,
( tc(X1,lam(X2),arr(X3,X4))
| ~ tc(cons(X3,X1),X2,X4) ),
i_0_31 ).
cnf(c_0_45,negated_conjecture,
~ tc(cons(arr(a,arr(b,c)),nil),X1,arr(b,arr(a,c))),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_46,plain,
~ tc(cons(b,cons(arr(a,arr(b,c)),nil)),X1,arr(a,c)),
inference(spm,[status(thm)],[c_0_45,c_0_44]) ).
cnf(c_0_47,plain,
~ tc(cons(a,cons(b,cons(arr(a,arr(b,c)),nil))),X1,c),
inference(spm,[status(thm)],[c_0_46,c_0_44]) ).
cnf(c_0_48,plain,
( tc(X1,app(X2,X3,X4),X5)
| ~ tc(X1,X3,X4)
| ~ tc(X1,X2,arr(X4,X5)) ),
i_0_27 ).
cnf(c_0_49,plain,
( ~ tc(cons(a,cons(b,cons(arr(a,arr(b,c)),nil))),X1,arr(X2,c))
| ~ tc(cons(a,cons(b,cons(arr(a,arr(b,c)),nil))),X3,X2) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_50,plain,
( tc(X1,var(X2),X3)
| X4 != X3
| index(X1,X2) != just(X4) ),
i_0_34 ).
cnf(c_0_51,plain,
( ~ tc(cons(a,cons(b,cons(arr(a,arr(b,c)),nil))),X1,arr(X2,arr(X3,c)))
| ~ tc(cons(a,cons(b,cons(arr(a,arr(b,c)),nil))),X4,X3)
| ~ tc(cons(a,cons(b,cons(arr(a,arr(b,c)),nil))),X5,X2) ),
inference(spm,[status(thm)],[c_0_49,c_0_48]) ).
cnf(c_0_52,plain,
( tc(X1,var(X2),X3)
| index(X1,X2) != just(X3) ),
inference(er,[status(thm)],[c_0_50]) ).
cnf(c_0_53,plain,
( index(cons(a,cons(b,cons(arr(a,arr(b,c)),nil))),X1) != just(arr(X2,arr(X3,c)))
| ~ tc(cons(a,cons(b,cons(arr(a,arr(b,c)),nil))),X4,X3)
| ~ tc(cons(a,cons(b,cons(arr(a,arr(b,c)),nil))),X5,X2) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_54,plain,
( index(cons(a,cons(b,cons(arr(a,arr(b,c)),nil))),X1) != just(arr(X2,arr(X3,c)))
| index(cons(a,cons(b,cons(arr(a,arr(b,c)),nil))),X4) != just(X3)
| ~ tc(cons(a,cons(b,cons(arr(a,arr(b,c)),nil))),X5,X2) ),
inference(spm,[status(thm)],[c_0_53,c_0_52]) ).
cnf(c_0_55,plain,
( index(cons(a,cons(b,cons(arr(a,arr(b,c)),nil))),X1) != just(arr(X2,arr(X3,c)))
| index(cons(a,cons(b,cons(arr(a,arr(b,c)),nil))),X4) != just(X3)
| index(cons(a,cons(b,cons(arr(a,arr(b,c)),nil))),X5) != just(X2) ),
inference(spm,[status(thm)],[c_0_54,c_0_52]) ).
cnf(c_0_56,plain,
index(cons(X1,X2),suc(X3)) = index(X2,X3),
i_0_26 ).
cnf(c_0_57,plain,
( index(cons(a,cons(b,cons(arr(a,arr(b,c)),nil))),X1) != just(arr(X2,arr(X3,c)))
| index(cons(a,cons(b,cons(arr(a,arr(b,c)),nil))),X4) != just(X2)
| index(cons(b,cons(arr(a,arr(b,c)),nil)),X5) != just(X3) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_58,plain,
index(cons(X1,X2),zero) = just(X1),
i_0_25 ).
cnf(c_0_59,plain,
( index(cons(a,cons(b,cons(arr(a,arr(b,c)),nil))),X1) != just(arr(X2,arr(X3,c)))
| index(cons(b,cons(arr(a,arr(b,c)),nil)),X4) != just(X3)
| just(a) != just(X2) ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_60,plain,
( index(cons(a,cons(b,cons(arr(a,arr(b,c)),nil))),X1) != just(arr(X2,arr(X3,c)))
| just(b) != just(X3)
| just(a) != just(X2) ),
inference(spm,[status(thm)],[c_0_59,c_0_58]) ).
cnf(c_0_61,plain,
( index(cons(b,cons(arr(a,arr(b,c)),nil)),X1) != just(arr(X2,arr(X3,c)))
| just(b) != just(X3)
| just(a) != just(X2) ),
inference(spm,[status(thm)],[c_0_60,c_0_56]) ).
cnf(c_0_62,plain,
( index(cons(arr(a,arr(b,c)),nil),X1) != just(arr(X2,arr(X3,c)))
| just(b) != just(X3)
| just(a) != just(X2) ),
inference(spm,[status(thm)],[c_0_61,c_0_56]) ).
cnf(c_0_63,plain,
( just(arr(a,arr(b,c))) != just(arr(X1,arr(X2,c)))
| just(b) != just(X2)
| just(a) != just(X1) ),
inference(spm,[status(thm)],[c_0_62,c_0_58]) ).
cnf(c_0_64,plain,
$false,
inference(er,[status(thm)],[c_0_63]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWX220+1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.15/0.33 % Computer : n007.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Tue May 5 12:24:25 EDT 2026
% 0.15/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 70.38/10.27 # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d45-l8000-e0.15+coop-mzr02:
% 70.38/10.27 # ENIGMA: LightGBM model '/export/starexec/sandbox2/solver/bin/data/Enigma/tptp-cade20-model03-h2e15/lgb-t150-d45-l8000-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 33; version: 991; iters: 150)
% 70.38/10.27 # Preprocessing time : 1.165 s
% 70.38/10.27
% 70.38/10.27 # Proof found!
% 70.38/10.27 # SZS status Theorem
% 70.38/10.27 # SZS output start CNFRefutation
% See solution above
% 70.38/10.27 # Training examples: 0 positive, 0 negative
% 70.38/10.27
% 70.38/10.27 # -------------------------------------------------
% 70.38/10.27 # User time : 7.693 s
% 70.38/10.27 # System time : 0.178 s
% 70.38/10.27 # Total time : 7.871 s
% 70.38/10.27 # ...preprocessing : 1.165 s
% 70.38/10.27 # ...main loop : 6.706 s
% 70.38/10.27 # Maximum resident set size: 175872 pages
% 70.38/10.27
%------------------------------------------------------------------------------