%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM612+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n008.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:54 EDT 2022
% Result : Theorem 8.65s 2.46s
% Output : CNFRefutation 8.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 16
% Syntax : Number of clauses : 41 ( 23 unt; 0 nHn; 41 RR)
% Number of literals : 81 ( 17 equ; 45 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 27 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_207,hypothesis,
sdtmndt0(xQ,szmzizndt0(xQ)) = xP,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-av3h3w26/lgb.p',i_0_207) ).
cnf(i_0_206,hypothesis,
szmzizndt0(xQ) = xp,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-av3h3w26/lgb.p',i_0_206) ).
cnf(i_0_15,plain,
( aSet0(X1)
| ~ aSet0(X2)
| ~ aSubsetOf0(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-av3h3w26/lgb.p',i_0_15) ).
cnf(i_0_203,hypothesis,
aSubsetOf0(xQ,xO),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-av3h3w26/lgb.p',i_0_203) ).
cnf(i_0_196,hypothesis,
aSet0(xO),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-av3h3w26/lgb.p',i_0_196) ).
cnf(i_0_213,negated_conjecture,
( szszuzczcdt0(sbrdtbr0(xP)) != sbrdtbr0(xQ)
| ~ aElementOf0(sbrdtbr0(xP),szNzAzT0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-av3h3w26/lgb.p',i_0_213) ).
cnf(i_0_66,plain,
( aElementOf0(sbrdtbr0(X1),szNzAzT0)
| ~ aSet0(X1)
| ~ isFinite0(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-av3h3w26/lgb.p',i_0_66) ).
cnf(i_0_208,hypothesis,
aSet0(xP),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-av3h3w26/lgb.p',i_0_208) ).
cnf(i_0_71,plain,
( szszuzczcdt0(sbrdtbr0(sdtmndt0(X1,X2))) = sbrdtbr0(X1)
| ~ aSet0(X1)
| ~ isFinite0(X1)
| ~ aElementOf0(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-av3h3w26/lgb.p',i_0_71) ).
cnf(i_0_209,hypothesis,
aElementOf0(xp,xQ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-av3h3w26/lgb.p',i_0_209) ).
cnf(i_0_105,plain,
( sbrdtbr0(X1) = X2
| X3 != slbdtsldtrb0(X4,X2)
| ~ aSet0(X4)
| ~ aElementOf0(X1,X3)
| ~ aElementOf0(X2,szNzAzT0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-av3h3w26/lgb.p',i_0_105) ).
cnf(i_0_201,hypothesis,
aElementOf0(xQ,slbdtsldtrb0(xO,xK)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-av3h3w26/lgb.p',i_0_201) ).
cnf(i_0_147,hypothesis,
aElementOf0(xK,szNzAzT0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-av3h3w26/lgb.p',i_0_147) ).
cnf(i_0_16,plain,
( isFinite0(X1)
| ~ aSet0(X2)
| ~ isFinite0(X2)
| ~ aSubsetOf0(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-av3h3w26/lgb.p',i_0_16) ).
cnf(i_0_211,hypothesis,
aSubsetOf0(xP,xQ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-av3h3w26/lgb.p',i_0_211) ).
cnf(i_0_67,plain,
( isFinite0(X1)
| ~ aSet0(X1)
| ~ aElementOf0(sbrdtbr0(X1),szNzAzT0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-av3h3w26/lgb.p',i_0_67) ).
cnf(c_0_230,hypothesis,
sdtmndt0(xQ,szmzizndt0(xQ)) = xP,
i_0_207 ).
cnf(c_0_231,hypothesis,
szmzizndt0(xQ) = xp,
i_0_206 ).
cnf(c_0_232,plain,
( aSet0(X1)
| ~ aSet0(X2)
| ~ aSubsetOf0(X1,X2) ),
i_0_15 ).
cnf(c_0_233,hypothesis,
aSubsetOf0(xQ,xO),
i_0_203 ).
cnf(c_0_234,hypothesis,
aSet0(xO),
i_0_196 ).
cnf(c_0_235,negated_conjecture,
( szszuzczcdt0(sbrdtbr0(xP)) != sbrdtbr0(xQ)
| ~ aElementOf0(sbrdtbr0(xP),szNzAzT0) ),
i_0_213 ).
cnf(c_0_236,plain,
( aElementOf0(sbrdtbr0(X1),szNzAzT0)
| ~ aSet0(X1)
| ~ isFinite0(X1) ),
i_0_66 ).
cnf(c_0_237,hypothesis,
aSet0(xP),
i_0_208 ).
cnf(c_0_238,plain,
( szszuzczcdt0(sbrdtbr0(sdtmndt0(X1,X2))) = sbrdtbr0(X1)
| ~ aSet0(X1)
| ~ isFinite0(X1)
| ~ aElementOf0(X2,X1) ),
i_0_71 ).
cnf(c_0_239,hypothesis,
sdtmndt0(xQ,xp) = xP,
inference(rw,[status(thm)],[c_0_230,c_0_231]) ).
cnf(c_0_240,hypothesis,
aElementOf0(xp,xQ),
i_0_209 ).
cnf(c_0_241,hypothesis,
aSet0(xQ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_232,c_0_233]),c_0_234])]) ).
cnf(c_0_242,plain,
( sbrdtbr0(X1) = X2
| X3 != slbdtsldtrb0(X4,X2)
| ~ aSet0(X4)
| ~ aElementOf0(X1,X3)
| ~ aElementOf0(X2,szNzAzT0) ),
i_0_105 ).
cnf(c_0_243,negated_conjecture,
( szszuzczcdt0(sbrdtbr0(xP)) != sbrdtbr0(xQ)
| ~ isFinite0(xP) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_235,c_0_236]),c_0_237])]) ).
cnf(c_0_244,hypothesis,
( szszuzczcdt0(sbrdtbr0(xP)) = sbrdtbr0(xQ)
| ~ isFinite0(xQ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_238,c_0_239]),c_0_240])]),c_0_241])]) ).
cnf(c_0_245,plain,
( sbrdtbr0(X1) = X2
| ~ aSet0(X3)
| ~ aElementOf0(X1,slbdtsldtrb0(X3,X2))
| ~ aElementOf0(X2,szNzAzT0) ),
inference(er,[status(thm)],[c_0_242]) ).
cnf(c_0_246,hypothesis,
aElementOf0(xQ,slbdtsldtrb0(xO,xK)),
i_0_201 ).
cnf(c_0_247,hypothesis,
aElementOf0(xK,szNzAzT0),
i_0_147 ).
cnf(c_0_248,plain,
( isFinite0(X1)
| ~ aSet0(X2)
| ~ isFinite0(X2)
| ~ aSubsetOf0(X1,X2) ),
i_0_16 ).
cnf(c_0_249,hypothesis,
aSubsetOf0(xP,xQ),
i_0_211 ).
cnf(c_0_250,negated_conjecture,
( ~ isFinite0(xP)
| ~ isFinite0(xQ) ),
inference(spm,[status(thm)],[c_0_243,c_0_244]) ).
cnf(c_0_251,plain,
( isFinite0(X1)
| ~ aSet0(X1)
| ~ aElementOf0(sbrdtbr0(X1),szNzAzT0) ),
i_0_67 ).
cnf(c_0_252,hypothesis,
sbrdtbr0(xQ) = xK,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_245,c_0_246]),c_0_234]),c_0_247])]) ).
cnf(c_0_253,hypothesis,
~ isFinite0(xQ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_248,c_0_249]),c_0_241])]),c_0_250]) ).
cnf(c_0_254,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_251,c_0_252]),c_0_241]),c_0_247])]),c_0_253]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : NUM612+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n008.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jul 5 03:10:25 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 8.65/2.46 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.65/2.46 # No SInE strategy applied
% 8.65/2.46 # Trying AutoSched0 for 150 seconds
% 8.65/2.46 # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 8.65/2.46 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.65/2.46 #
% 8.65/2.46 # Preprocessing time : 0.025 s
% 8.65/2.46
% 8.65/2.46 # Proof found!
% 8.65/2.46 # SZS status Theorem
% 8.65/2.46 # SZS output start CNFRefutation
% See solution above
% 8.65/2.46 # Training examples: 0 positive, 0 negative
% 8.65/2.46
% 8.65/2.46 # -------------------------------------------------
% 8.65/2.46 # User time : 0.033 s
% 8.65/2.46 # System time : 0.006 s
% 8.65/2.46 # Total time : 0.039 s
% 8.65/2.46 # Maximum resident set size: 7124 pages
% 8.65/2.46
%------------------------------------------------------------------------------