TSTP Solution File: NUM630+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM630+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n025.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:06 EDT 2022
% Result : Theorem 8.33s 2.43s
% Output : CNFRefutation 8.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 6
% Syntax : Number of clauses : 14 ( 11 unt; 0 nHn; 14 RR)
% Number of literals : 22 ( 7 equ; 10 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 8 con; 0-2 aty)
% Number of variables : 5 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_171,hypothesis,
( sdtlpdtrp0(xc,sdtpldt0(X1,szmzizndt0(sdtlpdtrp0(xN,X2)))) = sdtlpdtrp0(sdtlpdtrp0(xC,X2),X1)
| ~ aSet0(X1)
| ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X2),szmzizndt0(sdtlpdtrp0(xN,X2))),xk)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tgux1d_3/lgb.p',i_0_171) ).
cnf(i_0_220,hypothesis,
sdtmndt0(sdtlpdtrp0(xN,xn),szmzizndt0(sdtlpdtrp0(xN,xn))) = xD,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tgux1d_3/lgb.p',i_0_220) ).
cnf(i_0_216,hypothesis,
aElementOf0(xn,szNzAzT0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tgux1d_3/lgb.p',i_0_216) ).
cnf(i_0_222,negated_conjecture,
sdtlpdtrp0(xc,sdtpldt0(xP,szmzizndt0(sdtlpdtrp0(xN,xn)))) != sdtlpdtrp0(sdtlpdtrp0(xC,xn),xP),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tgux1d_3/lgb.p',i_0_222) ).
cnf(i_0_208,hypothesis,
aSet0(xP),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tgux1d_3/lgb.p',i_0_208) ).
cnf(i_0_221,hypothesis,
aElementOf0(xP,slbdtsldtrb0(xD,xk)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tgux1d_3/lgb.p',i_0_221) ).
cnf(c_0_229,hypothesis,
( sdtlpdtrp0(xc,sdtpldt0(X1,szmzizndt0(sdtlpdtrp0(xN,X2)))) = sdtlpdtrp0(sdtlpdtrp0(xC,X2),X1)
| ~ aSet0(X1)
| ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X2),szmzizndt0(sdtlpdtrp0(xN,X2))),xk)) ),
i_0_171 ).
cnf(c_0_230,hypothesis,
sdtmndt0(sdtlpdtrp0(xN,xn),szmzizndt0(sdtlpdtrp0(xN,xn))) = xD,
i_0_220 ).
cnf(c_0_231,hypothesis,
aElementOf0(xn,szNzAzT0),
i_0_216 ).
cnf(c_0_232,negated_conjecture,
sdtlpdtrp0(xc,sdtpldt0(xP,szmzizndt0(sdtlpdtrp0(xN,xn)))) != sdtlpdtrp0(sdtlpdtrp0(xC,xn),xP),
i_0_222 ).
cnf(c_0_233,hypothesis,
( sdtlpdtrp0(xc,sdtpldt0(X1,szmzizndt0(sdtlpdtrp0(xN,xn)))) = sdtlpdtrp0(sdtlpdtrp0(xC,xn),X1)
| ~ aSet0(X1)
| ~ aElementOf0(X1,slbdtsldtrb0(xD,xk)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_229,c_0_230]),c_0_231])]) ).
cnf(c_0_234,hypothesis,
aSet0(xP),
i_0_208 ).
cnf(c_0_235,hypothesis,
aElementOf0(xP,slbdtsldtrb0(xD,xk)),
i_0_221 ).
cnf(c_0_236,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_232,c_0_233]),c_0_234]),c_0_235])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUM630+1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n025.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 : Wed Jul 6 10:14:15 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.45 # ENIGMATIC: Selected complete mode:
% 8.33/2.43 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.33/2.43 # No SInE strategy applied
% 8.33/2.43 # Trying AutoSched0 for 150 seconds
% 8.33/2.43 # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 8.33/2.43 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.33/2.43 #
% 8.33/2.43 # Preprocessing time : 0.024 s
% 8.33/2.43
% 8.33/2.43 # Proof found!
% 8.33/2.43 # SZS status Theorem
% 8.33/2.43 # SZS output start CNFRefutation
% See solution above
% 8.33/2.43 # Training examples: 0 positive, 0 negative
% 8.33/2.43
% 8.33/2.43 # -------------------------------------------------
% 8.33/2.43 # User time : 0.037 s
% 8.33/2.43 # System time : 0.006 s
% 8.33/2.43 # Total time : 0.043 s
% 8.33/2.43 # Maximum resident set size: 7124 pages
% 8.33/2.43
%------------------------------------------------------------------------------