%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWX200+1 : TPTP v9.3.0. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n011.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:48 PM UTC 2026
% Result : Theorem 7.46s 2.36s
% Output : CNFRefutation 7.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 13 ( 9 unt; 2 nHn; 7 RR)
% Number of literals : 19 ( 2 equ; 6 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 17 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_19,negated_conjecture,
( ord(X1)
| ord(merge(X2,X1))
| ~ ord(X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8gl_s62s/input.p',i_0_19) ).
cnf(i_0_14,plain,
ord(nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8gl_s62s/input.p',i_0_14) ).
cnf(i_0_10,plain,
merge(nil,X1) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8gl_s62s/input.p',i_0_10) ).
cnf(i_0_18,plain,
( leqNat(X1,X2)
| ~ ord(cons(X1,cons(X2,X3))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8gl_s62s/input.p',i_0_18) ).
cnf(i_0_7,plain,
~ leqNat(s(X1),z),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8gl_s62s/input.p',i_0_7) ).
cnf(c_0_25,negated_conjecture,
( ord(X1)
| ord(merge(X2,X1))
| ~ ord(X2) ),
i_0_19 ).
cnf(c_0_26,plain,
ord(nil),
i_0_14 ).
cnf(c_0_27,plain,
merge(nil,X1) = X1,
i_0_10 ).
cnf(c_0_28,plain,
( leqNat(X1,X2)
| ~ ord(cons(X1,cons(X2,X3))) ),
i_0_18 ).
cnf(c_0_29,plain,
ord(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).
cnf(c_0_30,plain,
~ leqNat(s(X1),z),
i_0_7 ).
cnf(c_0_31,plain,
leqNat(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]) ).
cnf(c_0_32,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SWX200+1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.16/0.33 % Computer : n011.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Tue May 5 11:14:18 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.46/2.36 # ENIGMATIC: Solved by autoschedule:
% 7.46/2.36 # No SInE strategy applied
% 7.46/2.36 # Trying AutoSched0 for 150 seconds
% 7.46/2.36 # AutoSched0-Mode selected heuristic G_E___200_B02_F1_SE_CS_SP_PI_S0S
% 7.46/2.36 # and selection function SelectComplexG.
% 7.46/2.36 #
% 7.46/2.36 # Preprocessing time : 0.016 s
% 7.46/2.36
% 7.46/2.36 # Proof found!
% 7.46/2.36 # SZS status Theorem
% 7.46/2.36 # SZS output start CNFRefutation
% See solution above
% 7.46/2.36 # Training examples: 0 positive, 0 negative
% 7.46/2.36
% 7.46/2.36 # -------------------------------------------------
% 7.46/2.36 # User time : 0.016 s
% 7.46/2.36 # System time : 0.004 s
% 7.46/2.36 # Total time : 0.021 s
% 7.46/2.36 # Maximum resident set size: 7124 pages
% 7.46/2.36
%------------------------------------------------------------------------------