%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWX190+1 : TPTP v9.3.0. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n031.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:47 PM UTC 2026
% Result : Theorem 7.16s 2.27s
% Output : CNFRefutation 7.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 23 ( 23 unt; 0 nHn; 5 RR)
% Number of literals : 23 ( 22 equ; 3 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 : 6 ( 6 usr; 1 con; 0-2 aty)
% Number of variables : 33 ( 17 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_54,negated_conjecture,
opt(d(opt(X1))) = opt(d(X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1mdpsxax/lgb.p',i_0_54) ).
cnf(i_0_50,plain,
opt(x(n(z),X1)) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1mdpsxax/lgb.p',i_0_50) ).
cnf(i_0_40,plain,
x(d(X1),d(X2)) = d(x(X1,X2)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1mdpsxax/lgb.p',i_0_40) ).
cnf(i_0_39,plain,
d(n(X1)) = n(z),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1mdpsxax/lgb.p',i_0_39) ).
cnf(i_0_53,plain,
opt(y(n(z),X1)) = n(z),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1mdpsxax/lgb.p',i_0_53) ).
cnf(i_0_8,plain,
n(X1) != x(X2,X3),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1mdpsxax/lgb.p',i_0_8) ).
cnf(i_0_41,plain,
x(y(d(X1),X2),y(X1,d(X2))) = d(y(X1,X2)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1mdpsxax/lgb.p',i_0_41) ).
cnf(c_0_62,negated_conjecture,
opt(d(opt(X1))) = opt(d(X1)),
i_0_54 ).
cnf(c_0_63,plain,
opt(x(n(z),X1)) = X1,
i_0_50 ).
cnf(c_0_64,plain,
x(d(X1),d(X2)) = d(x(X1,X2)),
i_0_40 ).
cnf(c_0_65,plain,
d(n(X1)) = n(z),
i_0_39 ).
cnf(c_0_66,plain,
opt(y(n(z),X1)) = n(z),
i_0_53 ).
cnf(c_0_67,negated_conjecture,
opt(d(x(n(z),X1))) = opt(d(X1)),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_68,plain,
d(x(X1,n(X2))) = x(d(X1),n(z)),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_69,negated_conjecture,
opt(d(y(n(z),X1))) = opt(n(z)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_66]),c_0_65]) ).
cnf(c_0_70,negated_conjecture,
opt(n(z)) = n(z),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_65]),c_0_63]),c_0_65]) ).
cnf(c_0_71,plain,
d(x(n(X1),X2)) = x(n(z),d(X2)),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_72,plain,
n(X1) != x(X2,X3),
i_0_8 ).
cnf(c_0_73,plain,
x(y(d(X1),X2),y(X1,d(X2))) = d(y(X1,X2)),
i_0_41 ).
cnf(c_0_74,negated_conjecture,
opt(d(y(n(z),X1))) = n(z),
inference(rw,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_75,negated_conjecture,
opt(d(X1)) = d(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_67,c_0_71]),c_0_63]) ).
cnf(c_0_76,plain,
n(X1) != d(y(X2,X3)),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_77,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_74,c_0_75]),c_0_76]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWX190+1 : TPTP v9.3.0. Released v9.3.0.
% 0.12/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.16/0.34 % Computer : n031.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 09:54:25 EDT 2026
% 0.16/0.34 % CPUTime :
% 0.28/0.45 # ENIGMATIC: Selected complete mode:
% 7.16/2.27 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.16/2.27 # No SInE strategy applied
% 7.16/2.27 # Trying AutoSched0 for 150 seconds
% 7.16/2.27 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.16/2.27 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.16/2.27 #
% 7.16/2.27 # Preprocessing time : 0.024 s
% 7.16/2.27 # Presaturation interreduction done
% 7.16/2.27
% 7.16/2.27 # Proof found!
% 7.16/2.27 # SZS status Theorem
% 7.16/2.27 # SZS output start CNFRefutation
% See solution above
% 7.16/2.27 # Training examples: 0 positive, 0 negative
% 7.16/2.27
% 7.16/2.27 # -------------------------------------------------
% 7.16/2.27 # User time : 0.050 s
% 7.16/2.27 # System time : 0.011 s
% 7.16/2.27 # Total time : 0.061 s
% 7.16/2.27 # Maximum resident set size: 7124 pages
% 7.16/2.27
%------------------------------------------------------------------------------