%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM592+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n015.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 : 600s
% DateTime : Mon Jul 18 08:37:42 EDT 2022
% Result : Theorem 8.47s 2.55s
% Output : CNFRefutation 8.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of clauses : 24 ( 12 unt; 0 nHn; 24 RR)
% Number of literals : 57 ( 10 equ; 37 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 9 con; 0-2 aty)
% Number of variables : 21 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_192,negated_conjecture,
( aElementOf0(esk22_2(X1,X2),slbdtsldtrb0(X2,xk))
| ~ isCountable0(X2)
| ~ aElementOf0(X1,xT)
| ~ aSubsetOf0(X2,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i0z88epy/lgb.p',i_0_192) ).
cnf(i_0_181,hypothesis,
sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))) = xY,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i0z88epy/lgb.p',i_0_181) ).
cnf(i_0_191,negated_conjecture,
( sdtlpdtrp0(sdtlpdtrp0(xC,xi),esk22_2(X1,X2)) != X1
| ~ isCountable0(X2)
| ~ aElementOf0(X1,xT)
| ~ aSubsetOf0(X2,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i0z88epy/lgb.p',i_0_191) ).
cnf(i_0_180,hypothesis,
sdtlpdtrp0(xC,xi) = xd,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i0z88epy/lgb.p',i_0_180) ).
cnf(i_0_187,hypothesis,
( sdtlpdtrp0(xd,X1) = xu
| ~ aSet0(X1)
| ~ aElementOf0(X1,slbdtsldtrb0(xX,xk)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i0z88epy/lgb.p',i_0_187) ).
cnf(i_0_189,hypothesis,
aSubsetOf0(xX,xY),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i0z88epy/lgb.p',i_0_189) ).
cnf(i_0_188,hypothesis,
isCountable0(xX),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i0z88epy/lgb.p',i_0_188) ).
cnf(i_0_190,hypothesis,
aElementOf0(xu,xT),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i0z88epy/lgb.p',i_0_190) ).
cnf(i_0_193,negated_conjecture,
( aSet0(esk22_2(X1,X2))
| ~ isCountable0(X2)
| ~ aElementOf0(X1,xT)
| ~ aSubsetOf0(X2,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i0z88epy/lgb.p',i_0_193) ).
cnf(c_0_203,negated_conjecture,
( aElementOf0(esk22_2(X1,X2),slbdtsldtrb0(X2,xk))
| ~ isCountable0(X2)
| ~ aElementOf0(X1,xT)
| ~ aSubsetOf0(X2,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))) ),
i_0_192 ).
cnf(c_0_204,hypothesis,
sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))) = xY,
i_0_181 ).
cnf(c_0_205,negated_conjecture,
( sdtlpdtrp0(sdtlpdtrp0(xC,xi),esk22_2(X1,X2)) != X1
| ~ isCountable0(X2)
| ~ aElementOf0(X1,xT)
| ~ aSubsetOf0(X2,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))) ),
i_0_191 ).
cnf(c_0_206,hypothesis,
sdtlpdtrp0(xC,xi) = xd,
i_0_180 ).
cnf(c_0_207,hypothesis,
( sdtlpdtrp0(xd,X1) = xu
| ~ aSet0(X1)
| ~ aElementOf0(X1,slbdtsldtrb0(xX,xk)) ),
i_0_187 ).
cnf(c_0_208,negated_conjecture,
( aElementOf0(esk22_2(X1,X2),slbdtsldtrb0(X2,xk))
| ~ aSubsetOf0(X2,xY)
| ~ aElementOf0(X1,xT)
| ~ isCountable0(X2) ),
inference(rw,[status(thm)],[c_0_203,c_0_204]) ).
cnf(c_0_209,hypothesis,
aSubsetOf0(xX,xY),
i_0_189 ).
cnf(c_0_210,hypothesis,
isCountable0(xX),
i_0_188 ).
cnf(c_0_211,negated_conjecture,
( sdtlpdtrp0(xd,esk22_2(X1,X2)) != X1
| ~ aSubsetOf0(X2,xY)
| ~ aElementOf0(X1,xT)
| ~ isCountable0(X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_205,c_0_206]),c_0_204]) ).
cnf(c_0_212,hypothesis,
( sdtlpdtrp0(xd,esk22_2(X1,xX)) = xu
| ~ aSet0(esk22_2(X1,xX))
| ~ aElementOf0(X1,xT) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_207,c_0_208]),c_0_209]),c_0_210])]) ).
cnf(c_0_213,hypothesis,
aElementOf0(xu,xT),
i_0_190 ).
cnf(c_0_214,negated_conjecture,
( aSet0(esk22_2(X1,X2))
| ~ isCountable0(X2)
| ~ aElementOf0(X1,xT)
| ~ aSubsetOf0(X2,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))) ),
i_0_193 ).
cnf(c_0_215,negated_conjecture,
~ aSet0(esk22_2(xu,xX)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_211,c_0_212]),c_0_209]),c_0_210])])]),c_0_213])]) ).
cnf(c_0_216,negated_conjecture,
( aSet0(esk22_2(X1,X2))
| ~ aSubsetOf0(X2,xY)
| ~ aElementOf0(X1,xT)
| ~ isCountable0(X2) ),
inference(rw,[status(thm)],[c_0_214,c_0_204]) ).
cnf(c_0_217,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_215,c_0_216]),c_0_209]),c_0_213]),c_0_210])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM592+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n015.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Wed Jul 6 05:38:20 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected complete mode:
% 8.47/2.55 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.47/2.55 # No SInE strategy applied
% 8.47/2.55 # Trying AutoSched0 for 150 seconds
% 8.47/2.55 # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 8.47/2.55 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.47/2.55 #
% 8.47/2.55 # Preprocessing time : 0.024 s
% 8.47/2.55
% 8.47/2.55 # Proof found!
% 8.47/2.55 # SZS status Theorem
% 8.47/2.55 # SZS output start CNFRefutation
% See solution above
% 8.47/2.55 # Training examples: 0 positive, 0 negative
% 8.47/2.55
% 8.47/2.55 # -------------------------------------------------
% 8.47/2.55 # User time : 0.032 s
% 8.47/2.55 # System time : 0.007 s
% 8.47/2.55 # Total time : 0.039 s
% 8.47/2.55 # Maximum resident set size: 7120 pages
% 8.47/2.55
%------------------------------------------------------------------------------