%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWX204+1 : TPTP v9.3.0. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n006.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.00s 2.46s
% Output : CNFRefutation 7.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 21 ( 21 unt; 0 nHn; 5 RR)
% Number of literals : 21 ( 20 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 22 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_4,plain,
s(x2(X1,X2)) = x2(s(X1),X2),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ffvf1to7/input.p',i_0_4) ).
cnf(i_0_3,plain,
x2(z,X1) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ffvf1to7/input.p',i_0_3) ).
cnf(i_0_6,plain,
x2(X1,x22(X2,X1)) = x22(s(X2),X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ffvf1to7/input.p',i_0_6) ).
cnf(i_0_5,plain,
x22(z,X1) = z,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ffvf1to7/input.p',i_0_5) ).
cnf(i_0_7,negated_conjecture,
x22(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ffvf1to7/input.p',i_0_7) ).
cnf(i_0_1,plain,
proj1S(s(X1)) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ffvf1to7/input.p',i_0_1) ).
cnf(i_0_2,plain,
s(X1) != z,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ffvf1to7/input.p',i_0_2) ).
cnf(c_0_15,plain,
s(x2(X1,X2)) = x2(s(X1),X2),
i_0_4 ).
cnf(c_0_16,plain,
x2(z,X1) = X1,
i_0_3 ).
cnf(c_0_17,plain,
x2(X1,x22(X2,X1)) = x22(s(X2),X1),
i_0_6 ).
cnf(c_0_18,plain,
x22(z,X1) = z,
i_0_5 ).
cnf(c_0_19,plain,
x2(s(z),X1) = s(X1),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
x22(s(z),X1) = x2(X1,z),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,plain,
x2(s(s(z)),X1) = s(s(X1)),
inference(spm,[status(thm)],[c_0_15,c_0_19]) ).
cnf(c_0_22,plain,
x2(X1,x2(X1,z)) = x22(s(s(z)),X1),
inference(spm,[status(thm)],[c_0_17,c_0_20]) ).
cnf(c_0_23,negated_conjecture,
x22(X1,X1) = X1,
i_0_7 ).
cnf(c_0_24,plain,
proj1S(s(X1)) = X1,
i_0_1 ).
cnf(c_0_25,plain,
s(s(s(s(z)))) = s(s(z)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_21]) ).
cnf(c_0_26,plain,
s(s(s(z))) = s(z),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_24]) ).
cnf(c_0_27,plain,
s(X1) != z,
i_0_2 ).
cnf(c_0_28,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_26]),c_0_24]),c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SWX204+1 : TPTP v9.3.0. Released v9.3.0.
% 0.12/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.17/0.36 % Computer : n006.cluster.edu
% 0.17/0.36 % Model : x86_64 x86_64
% 0.17/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.36 % Memory : 8042.1875MB
% 0.17/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.36 % CPULimit : 300
% 0.17/0.36 % WCLimit : 300
% 0.17/0.36 % DateTime : Tue May 5 11:28:02 EDT 2026
% 0.17/0.36 % CPUTime :
% 0.29/0.48 # ENIGMATIC: Selected complete mode:
% 7.00/2.46 # ENIGMATIC: Solved by autoschedule:
% 7.00/2.46 # No SInE strategy applied
% 7.00/2.46 # Trying AutoSched0 for 150 seconds
% 7.00/2.46 # AutoSched0-Mode selected heuristic G_____X1276__C12_02_nc_F1_AE_CS_SP_S2S
% 7.00/2.46 # and selection function SelectNewComplexAHP.
% 7.00/2.46 #
% 7.00/2.46 # Preprocessing time : 0.021 s
% 7.00/2.46 # Presaturation interreduction done
% 7.00/2.46
% 7.00/2.46 # Proof found!
% 7.00/2.46 # SZS status Theorem
% 7.00/2.46 # SZS output start CNFRefutation
% See solution above
% 7.00/2.46 # Training examples: 0 positive, 0 negative
% 7.00/2.46
% 7.00/2.46 # -------------------------------------------------
% 7.00/2.46 # User time : 0.021 s
% 7.00/2.46 # System time : 0.007 s
% 7.00/2.46 # Total time : 0.028 s
% 7.00/2.46 # Maximum resident set size: 7124 pages
% 7.00/2.46
%------------------------------------------------------------------------------