TSTP Solution File: NUM613+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM613+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n007.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:55 EDT 2022
% Result : Theorem 8.67s 2.48s
% Output : CNFRefutation 8.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 18 ( 15 unt; 0 nHn; 18 RR)
% Number of literals : 26 ( 16 equ; 10 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-1 aty)
% Number of variables : 5 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_215,hypothesis,
sbrdtbr0(xQ) = szszuzczcdt0(xk),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8unr2gki/lgb.p',i_0_215) ).
cnf(i_0_159,hypothesis,
szszuzczcdt0(xk) = xK,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8unr2gki/lgb.p',i_0_159) ).
cnf(i_0_49,plain,
( X1 = X2
| szszuzczcdt0(X1) != szszuzczcdt0(X2)
| ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8unr2gki/lgb.p',i_0_49) ).
cnf(i_0_160,hypothesis,
aElementOf0(xk,szNzAzT0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8unr2gki/lgb.p',i_0_160) ).
cnf(i_0_214,hypothesis,
szszuzczcdt0(sbrdtbr0(xP)) = sbrdtbr0(xQ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8unr2gki/lgb.p',i_0_214) ).
cnf(i_0_213,hypothesis,
aElementOf0(sbrdtbr0(xP),szNzAzT0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8unr2gki/lgb.p',i_0_213) ).
cnf(i_0_216,negated_conjecture,
sbrdtbr0(xP) != xk,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8unr2gki/lgb.p',i_0_216) ).
cnf(c_0_224,hypothesis,
sbrdtbr0(xQ) = szszuzczcdt0(xk),
i_0_215 ).
cnf(c_0_225,hypothesis,
szszuzczcdt0(xk) = xK,
i_0_159 ).
cnf(c_0_226,plain,
( X1 = X2
| szszuzczcdt0(X1) != szszuzczcdt0(X2)
| ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
i_0_49 ).
cnf(c_0_227,hypothesis,
aElementOf0(xk,szNzAzT0),
i_0_160 ).
cnf(c_0_228,hypothesis,
szszuzczcdt0(sbrdtbr0(xP)) = sbrdtbr0(xQ),
i_0_214 ).
cnf(c_0_229,hypothesis,
sbrdtbr0(xQ) = xK,
inference(rw,[status(thm)],[c_0_224,c_0_225]) ).
cnf(c_0_230,hypothesis,
( X1 = xk
| szszuzczcdt0(X1) != xK
| ~ aElementOf0(X1,szNzAzT0) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_226,c_0_227]),c_0_225]) ).
cnf(c_0_231,hypothesis,
aElementOf0(sbrdtbr0(xP),szNzAzT0),
i_0_213 ).
cnf(c_0_232,hypothesis,
szszuzczcdt0(sbrdtbr0(xP)) = xK,
inference(rw,[status(thm)],[c_0_228,c_0_229]) ).
cnf(c_0_233,negated_conjecture,
sbrdtbr0(xP) != xk,
i_0_216 ).
cnf(c_0_234,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_230,c_0_231]),c_0_232])]),c_0_233]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM613+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n007.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Wed Jul 6 19:40:45 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.20/0.44 # ENIGMATIC: Selected complete mode:
% 8.67/2.48 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.67/2.48 # No SInE strategy applied
% 8.67/2.48 # Trying AutoSched0 for 150 seconds
% 8.67/2.48 # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 8.67/2.48 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.67/2.48 #
% 8.67/2.48 # Preprocessing time : 0.014 s
% 8.67/2.48
% 8.67/2.48 # Proof found!
% 8.67/2.48 # SZS status Theorem
% 8.67/2.48 # SZS output start CNFRefutation
% See solution above
% 8.67/2.48 # Training examples: 0 positive, 0 negative
% 8.67/2.48
% 8.67/2.48 # -------------------------------------------------
% 8.67/2.48 # User time : 0.022 s
% 8.67/2.48 # System time : 0.007 s
% 8.67/2.48 # Total time : 0.029 s
% 8.67/2.48 # Maximum resident set size: 7124 pages
% 8.67/2.48
%------------------------------------------------------------------------------