%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWX222+1 : TPTP v9.3.0. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n025.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 7.30s 2.36s
% Output : CNFRefutation 7.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of clauses : 19 ( 7 unt; 0 nHn; 15 RR)
% Number of literals : 33 ( 8 equ; 21 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-2 aty)
% Number of variables : 32 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_43,negated_conjecture,
( ~ nf(X1)
| ~ tc(nil,X1,arr(a,arr(b,b))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bkentmde/input.p',i_0_43) ).
cnf(i_0_38,plain,
( tc(X1,lam(X2),arr(X3,X4))
| ~ tc(cons(X3,X1),X2,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bkentmde/input.p',i_0_38) ).
cnf(i_0_41,plain,
( tc(X1,var(X2),X3)
| X4 != X3
| index(X1,X2) != just(X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bkentmde/input.p',i_0_41) ).
cnf(i_0_32,plain,
index(cons(X1,X2),zero) = just(X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bkentmde/input.p',i_0_32) ).
cnf(i_0_28,plain,
( nf(lam(X1))
| ~ nf(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bkentmde/input.p',i_0_28) ).
cnf(i_0_30,plain,
nf(var(X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-bkentmde/input.p',i_0_30) ).
cnf(c_0_50,negated_conjecture,
( ~ nf(X1)
| ~ tc(nil,X1,arr(a,arr(b,b))) ),
i_0_43 ).
cnf(c_0_51,plain,
( tc(X1,lam(X2),arr(X3,X4))
| ~ tc(cons(X3,X1),X2,X4) ),
i_0_38 ).
cnf(c_0_52,negated_conjecture,
( ~ tc(cons(a,nil),X1,arr(b,b))
| ~ nf(lam(X1)) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_53,plain,
( tc(X1,var(X2),X3)
| X4 != X3
| index(X1,X2) != just(X4) ),
i_0_41 ).
cnf(c_0_54,plain,
( ~ tc(cons(b,cons(a,nil)),X1,b)
| ~ nf(lam(lam(X1))) ),
inference(spm,[status(thm)],[c_0_52,c_0_51]) ).
cnf(c_0_55,plain,
( tc(X1,var(X2),X3)
| index(X1,X2) != just(X3) ),
inference(er,[status(thm)],[c_0_53]) ).
cnf(c_0_56,plain,
( index(cons(b,cons(a,nil)),X1) != just(b)
| ~ nf(lam(lam(var(X1)))) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_57,plain,
index(cons(X1,X2),zero) = just(X1),
i_0_32 ).
cnf(c_0_58,plain,
~ nf(lam(lam(var(zero)))),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_59,plain,
( nf(lam(X1))
| ~ nf(X1) ),
i_0_28 ).
cnf(c_0_60,plain,
~ nf(lam(var(zero))),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_61,plain,
nf(var(X1)),
i_0_30 ).
cnf(c_0_62,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_59]),c_0_61])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWX222+1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.16/0.34 % Computer : n025.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Tue May 5 12:33:00 EDT 2026
% 0.16/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 7.30/2.36 # ENIGMATIC: Solved by autoschedule:
% 7.30/2.36 # No SInE strategy applied
% 7.30/2.36 # Trying AutoSched0 for 150 seconds
% 7.30/2.36 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.30/2.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.30/2.36 #
% 7.30/2.36 # Preprocessing time : 0.013 s
% 7.30/2.36 # Presaturation interreduction done
% 7.30/2.36
% 7.30/2.36 # Proof found!
% 7.30/2.36 # SZS status Theorem
% 7.30/2.36 # SZS output start CNFRefutation
% See solution above
% 7.30/2.36 # Training examples: 0 positive, 0 negative
% 7.30/2.36
% 7.30/2.36 # -------------------------------------------------
% 7.30/2.36 # User time : 0.015 s
% 7.30/2.36 # System time : 0.006 s
% 7.30/2.36 # Total time : 0.021 s
% 7.30/2.36 # Maximum resident set size: 7120 pages
% 7.30/2.36
%------------------------------------------------------------------------------