TSTP Solution File: NUM617+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM617+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n011.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:57 EDT 2022
% Result : Theorem 7.63s 2.21s
% Output : CNFRefutation 7.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 13
% Syntax : Number of clauses : 34 ( 23 unt; 0 nHn; 34 RR)
% Number of literals : 61 ( 7 equ; 30 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 : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 27 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_35,plain,
( aElementOf0(X1,X2)
| X3 != sdtmndt0(X2,X4)
| ~ aSet0(X2)
| ~ aElement0(X4)
| ~ aElementOf0(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-01rqpvn_/lgb.p',i_0_35) ).
cnf(i_0_207,hypothesis,
sdtmndt0(xQ,szmzizndt0(xQ)) = xP,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-01rqpvn_/lgb.p',i_0_207) ).
cnf(i_0_206,hypothesis,
szmzizndt0(xQ) = xp,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-01rqpvn_/lgb.p',i_0_206) ).
cnf(i_0_3,plain,
( aElement0(X1)
| ~ aSet0(X2)
| ~ aElementOf0(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-01rqpvn_/lgb.p',i_0_3) ).
cnf(i_0_210,hypothesis,
aElementOf0(xp,xO),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-01rqpvn_/lgb.p',i_0_210) ).
cnf(i_0_196,hypothesis,
aSet0(xO),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-01rqpvn_/lgb.p',i_0_196) ).
cnf(i_0_15,plain,
( aSet0(X1)
| ~ aSet0(X2)
| ~ aSubsetOf0(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-01rqpvn_/lgb.p',i_0_15) ).
cnf(i_0_203,hypothesis,
aSubsetOf0(xQ,xO),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-01rqpvn_/lgb.p',i_0_203) ).
cnf(i_0_14,plain,
( aElementOf0(X1,X2)
| ~ aSet0(X2)
| ~ aElementOf0(X1,X3)
| ~ aSubsetOf0(X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-01rqpvn_/lgb.p',i_0_14) ).
cnf(i_0_204,hypothesis,
aSubsetOf0(xQ,szNzAzT0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-01rqpvn_/lgb.p',i_0_204) ).
cnf(i_0_45,plain,
aSet0(szNzAzT0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-01rqpvn_/lgb.p',i_0_45) ).
cnf(i_0_220,negated_conjecture,
~ aElementOf0(xx,szNzAzT0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-01rqpvn_/lgb.p',i_0_220) ).
cnf(i_0_219,hypothesis,
aElementOf0(xx,xP),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-01rqpvn_/lgb.p',i_0_219) ).
cnf(c_0_234,plain,
( aElementOf0(X1,X2)
| X3 != sdtmndt0(X2,X4)
| ~ aSet0(X2)
| ~ aElement0(X4)
| ~ aElementOf0(X1,X3) ),
i_0_35 ).
cnf(c_0_235,hypothesis,
sdtmndt0(xQ,szmzizndt0(xQ)) = xP,
i_0_207 ).
cnf(c_0_236,hypothesis,
szmzizndt0(xQ) = xp,
i_0_206 ).
cnf(c_0_237,plain,
( aElement0(X1)
| ~ aSet0(X2)
| ~ aElementOf0(X1,X2) ),
i_0_3 ).
cnf(c_0_238,hypothesis,
aElementOf0(xp,xO),
i_0_210 ).
cnf(c_0_239,hypothesis,
aSet0(xO),
i_0_196 ).
cnf(c_0_240,plain,
( aSet0(X1)
| ~ aSet0(X2)
| ~ aSubsetOf0(X1,X2) ),
i_0_15 ).
cnf(c_0_241,hypothesis,
aSubsetOf0(xQ,xO),
i_0_203 ).
cnf(c_0_242,plain,
( aElementOf0(X1,X2)
| ~ aSet0(X2)
| ~ aElementOf0(X1,X3)
| ~ aSubsetOf0(X3,X2) ),
i_0_14 ).
cnf(c_0_243,hypothesis,
aSubsetOf0(xQ,szNzAzT0),
i_0_204 ).
cnf(c_0_244,plain,
aSet0(szNzAzT0),
i_0_45 ).
cnf(c_0_245,plain,
( aElementOf0(X1,X2)
| ~ aElement0(X3)
| ~ aSet0(X2)
| ~ aElementOf0(X1,sdtmndt0(X2,X3)) ),
inference(er,[status(thm)],[c_0_234]) ).
cnf(c_0_246,hypothesis,
sdtmndt0(xQ,xp) = xP,
inference(rw,[status(thm)],[c_0_235,c_0_236]) ).
cnf(c_0_247,hypothesis,
aElement0(xp),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_237,c_0_238]),c_0_239])]) ).
cnf(c_0_248,hypothesis,
aSet0(xQ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_240,c_0_241]),c_0_239])]) ).
cnf(c_0_249,negated_conjecture,
~ aElementOf0(xx,szNzAzT0),
i_0_220 ).
cnf(c_0_250,hypothesis,
( aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X1,xQ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_242,c_0_243]),c_0_244])]) ).
cnf(c_0_251,hypothesis,
( aElementOf0(X1,xQ)
| ~ aElementOf0(X1,xP) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_245,c_0_246]),c_0_247]),c_0_248])]) ).
cnf(c_0_252,hypothesis,
aElementOf0(xx,xP),
i_0_219 ).
cnf(c_0_253,negated_conjecture,
~ aElementOf0(xx,xQ),
inference(spm,[status(thm)],[c_0_249,c_0_250]) ).
cnf(c_0_254,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_251,c_0_252]),c_0_253]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM617+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n011.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jul 5 08:28:39 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.41 # ENIGMATIC: Selected complete mode:
% 7.63/2.21 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.63/2.21 # No SInE strategy applied
% 7.63/2.21 # Trying AutoSched0 for 150 seconds
% 7.63/2.21 # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 7.63/2.21 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.63/2.21 #
% 7.63/2.21 # Preprocessing time : 0.026 s
% 7.63/2.21
% 7.63/2.21 # Proof found!
% 7.63/2.21 # SZS status Theorem
% 7.63/2.21 # SZS output start CNFRefutation
% See solution above
% 7.63/2.21 # Training examples: 0 positive, 0 negative
% 7.63/2.21
% 7.63/2.21 # -------------------------------------------------
% 7.63/2.21 # User time : 0.036 s
% 7.63/2.21 # System time : 0.008 s
% 7.63/2.21 # Total time : 0.044 s
% 7.63/2.21 # Maximum resident set size: 7128 pages
% 7.63/2.21
%------------------------------------------------------------------------------