TSTP Solution File: NUM627+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM627+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n026.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:38:04 EDT 2022
% Result : Theorem 7.58s 2.26s
% Output : CNFRefutation 7.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 18 ( 11 unt; 2 nHn; 18 RR)
% Number of literals : 33 ( 0 equ; 20 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 10 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_225,hypothesis,
~ aSubsetOf0(sdtlpdtrp0(xN,xm),sdtlpdtrp0(xN,szszuzczcdt0(xn))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v1qest60/lgb.p',i_0_225) ).
cnf(i_0_168,hypothesis,
( aSubsetOf0(sdtlpdtrp0(xN,X1),sdtlpdtrp0(xN,X2))
| ~ sdtlseqdt0(X2,X1)
| ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v1qest60/lgb.p',i_0_168) ).
cnf(i_0_223,hypothesis,
aElementOf0(xm,szNzAzT0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v1qest60/lgb.p',i_0_223) ).
cnf(i_0_226,hypothesis,
~ aSubsetOf0(sdtlpdtrp0(xN,xn),sdtlpdtrp0(xN,xm)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v1qest60/lgb.p',i_0_226) ).
cnf(i_0_216,hypothesis,
aElementOf0(xn,szNzAzT0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v1qest60/lgb.p',i_0_216) ).
cnf(i_0_62,plain,
( sdtlseqdt0(X1,X2)
| sdtlseqdt0(szszuzczcdt0(X2),X1)
| ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v1qest60/lgb.p',i_0_62) ).
cnf(i_0_48,plain,
( aElementOf0(szszuzczcdt0(X1),szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v1qest60/lgb.p',i_0_48) ).
cnf(c_0_234,hypothesis,
~ aSubsetOf0(sdtlpdtrp0(xN,xm),sdtlpdtrp0(xN,szszuzczcdt0(xn))),
i_0_225 ).
cnf(c_0_235,hypothesis,
( aSubsetOf0(sdtlpdtrp0(xN,X1),sdtlpdtrp0(xN,X2))
| ~ sdtlseqdt0(X2,X1)
| ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
i_0_168 ).
cnf(c_0_236,hypothesis,
aElementOf0(xm,szNzAzT0),
i_0_223 ).
cnf(c_0_237,hypothesis,
~ aSubsetOf0(sdtlpdtrp0(xN,xn),sdtlpdtrp0(xN,xm)),
i_0_226 ).
cnf(c_0_238,hypothesis,
aElementOf0(xn,szNzAzT0),
i_0_216 ).
cnf(c_0_239,hypothesis,
( ~ sdtlseqdt0(szszuzczcdt0(xn),xm)
| ~ aElementOf0(szszuzczcdt0(xn),szNzAzT0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_234,c_0_235]),c_0_236])]) ).
cnf(c_0_240,plain,
( sdtlseqdt0(X1,X2)
| sdtlseqdt0(szszuzczcdt0(X2),X1)
| ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
i_0_62 ).
cnf(c_0_241,hypothesis,
~ sdtlseqdt0(xm,xn),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_237,c_0_235]),c_0_236]),c_0_238])]) ).
cnf(c_0_242,plain,
~ aElementOf0(szszuzczcdt0(xn),szNzAzT0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_239,c_0_240]),c_0_238]),c_0_236])]),c_0_241]) ).
cnf(c_0_243,plain,
( aElementOf0(szszuzczcdt0(X1),szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
i_0_48 ).
cnf(c_0_244,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_242,c_0_243]),c_0_238])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : NUM627+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 : n026.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 05:41:09 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.58/2.26 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.58/2.26 # No SInE strategy applied
% 7.58/2.26 # Trying AutoSched0 for 150 seconds
% 7.58/2.26 # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 7.58/2.26 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.58/2.26 #
% 7.58/2.26 # Preprocessing time : 0.025 s
% 7.58/2.26
% 7.58/2.26 # Proof found!
% 7.58/2.26 # SZS status Theorem
% 7.58/2.26 # SZS output start CNFRefutation
% See solution above
% 7.58/2.26 # Training examples: 0 positive, 0 negative
% 7.58/2.26
% 7.58/2.26 # -------------------------------------------------
% 7.58/2.26 # User time : 0.035 s
% 7.58/2.26 # System time : 0.003 s
% 7.58/2.26 # Total time : 0.038 s
% 7.58/2.26 # Maximum resident set size: 7120 pages
% 7.58/2.26
%------------------------------------------------------------------------------