TSTP Solution File: NUM625+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM625+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n016.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:03 EDT 2022
% Result : Theorem 6.69s 2.21s
% Output : CNFRefutation 6.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 10
% Syntax : Number of clauses : 26 ( 19 unt; 0 nHn; 26 RR)
% Number of literals : 44 ( 12 equ; 22 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 18 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_206,hypothesis,
szmzizndt0(xQ) = xp,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-swgw2s4r/lgb.p',i_0_206) ).
cnf(i_0_229,hypothesis,
xx = xp,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-swgw2s4r/lgb.p',i_0_229) ).
cnf(i_0_34,plain,
( X1 != X2
| X3 != sdtmndt0(X4,X2)
| ~ aSet0(X4)
| ~ aElement0(X2)
| ~ aElementOf0(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-swgw2s4r/lgb.p',i_0_34) ).
cnf(i_0_207,hypothesis,
sdtmndt0(xQ,szmzizndt0(xQ)) = xP,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-swgw2s4r/lgb.p',i_0_207) ).
cnf(i_0_15,plain,
( aSet0(X1)
| ~ aSet0(X2)
| ~ aSubsetOf0(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-swgw2s4r/lgb.p',i_0_15) ).
cnf(i_0_203,hypothesis,
aSubsetOf0(xQ,xO),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-swgw2s4r/lgb.p',i_0_203) ).
cnf(i_0_196,hypothesis,
aSet0(xO),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-swgw2s4r/lgb.p',i_0_196) ).
cnf(i_0_219,hypothesis,
aElementOf0(xx,xP),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-swgw2s4r/lgb.p',i_0_219) ).
cnf(i_0_3,plain,
( aElement0(X1)
| ~ aSet0(X2)
| ~ aElementOf0(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-swgw2s4r/lgb.p',i_0_3) ).
cnf(i_0_220,hypothesis,
aElementOf0(xx,xO),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-swgw2s4r/lgb.p',i_0_220) ).
cnf(c_0_240,hypothesis,
szmzizndt0(xQ) = xp,
i_0_206 ).
cnf(c_0_241,hypothesis,
xx = xp,
i_0_229 ).
cnf(c_0_242,plain,
( X1 != X2
| X3 != sdtmndt0(X4,X2)
| ~ aSet0(X4)
| ~ aElement0(X2)
| ~ aElementOf0(X1,X3) ),
i_0_34 ).
cnf(c_0_243,hypothesis,
sdtmndt0(xQ,szmzizndt0(xQ)) = xP,
i_0_207 ).
cnf(c_0_244,hypothesis,
szmzizndt0(xQ) = xx,
inference(rw,[status(thm)],[c_0_240,c_0_241]) ).
cnf(c_0_245,plain,
( aSet0(X1)
| ~ aSet0(X2)
| ~ aSubsetOf0(X1,X2) ),
i_0_15 ).
cnf(c_0_246,hypothesis,
aSubsetOf0(xQ,xO),
i_0_203 ).
cnf(c_0_247,hypothesis,
aSet0(xO),
i_0_196 ).
cnf(c_0_248,plain,
( ~ aElementOf0(X1,sdtmndt0(X2,X1))
| ~ aElement0(X1)
| ~ aSet0(X2) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_242])]) ).
cnf(c_0_249,hypothesis,
sdtmndt0(xQ,xx) = xP,
inference(rw,[status(thm)],[c_0_243,c_0_244]) ).
cnf(c_0_250,hypothesis,
aElementOf0(xx,xP),
i_0_219 ).
cnf(c_0_251,hypothesis,
aSet0(xQ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_245,c_0_246]),c_0_247])]) ).
cnf(c_0_252,plain,
( aElement0(X1)
| ~ aSet0(X2)
| ~ aElementOf0(X1,X2) ),
i_0_3 ).
cnf(c_0_253,hypothesis,
aElementOf0(xx,xO),
i_0_220 ).
cnf(c_0_254,hypothesis,
~ aElement0(xx),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_248,c_0_249]),c_0_250])]),c_0_251])]) ).
cnf(c_0_255,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_252,c_0_253]),c_0_247])]),c_0_254]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : NUM625+1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.32 % Computer : n016.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Wed Jul 6 00:57:36 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.17/0.44 # ENIGMATIC: Selected complete mode:
% 6.69/2.21 # ENIGMATIC: Solved by autoschedule-lgb:
% 6.69/2.21 # No SInE strategy applied
% 6.69/2.21 # Trying AutoSched0 for 150 seconds
% 6.69/2.21 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2S
% 6.69/2.21 # and selection function SelectNewComplexAHP.
% 6.69/2.21 #
% 6.69/2.21 # Preprocessing time : 0.013 s
% 6.69/2.21 # Presaturation interreduction done
% 6.69/2.21
% 6.69/2.21 # Proof found!
% 6.69/2.21 # SZS status Theorem
% 6.69/2.21 # SZS output start CNFRefutation
% See solution above
% 6.69/2.21 # Training examples: 0 positive, 0 negative
% 6.69/2.21
% 6.69/2.21 # -------------------------------------------------
% 6.69/2.21 # User time : 0.020 s
% 6.69/2.21 # System time : 0.002 s
% 6.69/2.21 # Total time : 0.022 s
% 6.69/2.21 # Maximum resident set size: 7128 pages
% 6.69/2.21
%------------------------------------------------------------------------------