TSTP Solution File: NUM609+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM609+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n003.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:52 EDT 2022
% Result : Theorem 7.90s 2.42s
% Output : CNFRefutation 7.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 12
% Syntax : Number of clauses : 31 ( 18 unt; 2 nHn; 31 RR)
% Number of literals : 65 ( 7 equ; 34 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 29 ( 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-z3adz6vt/lgb.p',i_0_35) ).
cnf(i_0_207,hypothesis,
sdtmndt0(xQ,szmzizndt0(xQ)) = xP,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z3adz6vt/lgb.p',i_0_207) ).
cnf(i_0_206,hypothesis,
szmzizndt0(xQ) = xp,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z3adz6vt/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-z3adz6vt/lgb.p',i_0_3) ).
cnf(i_0_210,hypothesis,
aElementOf0(xp,xO),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z3adz6vt/lgb.p',i_0_210) ).
cnf(i_0_196,hypothesis,
aSet0(xO),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z3adz6vt/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-z3adz6vt/lgb.p',i_0_15) ).
cnf(i_0_203,hypothesis,
aSubsetOf0(xQ,xO),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z3adz6vt/lgb.p',i_0_203) ).
cnf(i_0_12,plain,
( aSubsetOf0(X1,X2)
| ~ aSet0(X1)
| ~ aSet0(X2)
| ~ aElementOf0(esk2_2(X2,X1),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z3adz6vt/lgb.p',i_0_12) ).
cnf(i_0_13,plain,
( aSubsetOf0(X1,X2)
| aElementOf0(esk2_2(X2,X1),X1)
| ~ aSet0(X1)
| ~ aSet0(X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z3adz6vt/lgb.p',i_0_13) ).
cnf(i_0_208,hypothesis,
aSet0(xP),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z3adz6vt/lgb.p',i_0_208) ).
cnf(i_0_211,negated_conjecture,
~ aSubsetOf0(xP,xQ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z3adz6vt/lgb.p',i_0_211) ).
cnf(c_0_224,plain,
( aElementOf0(X1,X2)
| X3 != sdtmndt0(X2,X4)
| ~ aSet0(X2)
| ~ aElement0(X4)
| ~ aElementOf0(X1,X3) ),
i_0_35 ).
cnf(c_0_225,hypothesis,
sdtmndt0(xQ,szmzizndt0(xQ)) = xP,
i_0_207 ).
cnf(c_0_226,hypothesis,
szmzizndt0(xQ) = xp,
i_0_206 ).
cnf(c_0_227,plain,
( aElement0(X1)
| ~ aSet0(X2)
| ~ aElementOf0(X1,X2) ),
i_0_3 ).
cnf(c_0_228,hypothesis,
aElementOf0(xp,xO),
i_0_210 ).
cnf(c_0_229,hypothesis,
aSet0(xO),
i_0_196 ).
cnf(c_0_230,plain,
( aSet0(X1)
| ~ aSet0(X2)
| ~ aSubsetOf0(X1,X2) ),
i_0_15 ).
cnf(c_0_231,hypothesis,
aSubsetOf0(xQ,xO),
i_0_203 ).
cnf(c_0_232,plain,
( aElementOf0(X1,X2)
| ~ aElement0(X3)
| ~ aElementOf0(X1,sdtmndt0(X2,X3))
| ~ aSet0(X2) ),
inference(er,[status(thm)],[c_0_224]) ).
cnf(c_0_233,hypothesis,
sdtmndt0(xQ,xp) = xP,
inference(rw,[status(thm)],[c_0_225,c_0_226]) ).
cnf(c_0_234,hypothesis,
aElement0(xp),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_227,c_0_228]),c_0_229])]) ).
cnf(c_0_235,hypothesis,
aSet0(xQ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_230,c_0_231]),c_0_229])]) ).
cnf(c_0_236,plain,
( aSubsetOf0(X1,X2)
| ~ aSet0(X1)
| ~ aSet0(X2)
| ~ aElementOf0(esk2_2(X2,X1),X2) ),
i_0_12 ).
cnf(c_0_237,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_232,c_0_233]),c_0_234]),c_0_235])]) ).
cnf(c_0_238,plain,
( aSubsetOf0(X1,xQ)
| ~ aElementOf0(esk2_2(xQ,X1),xP)
| ~ aSet0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_236,c_0_237]),c_0_235])]) ).
cnf(c_0_239,plain,
( aSubsetOf0(X1,X2)
| aElementOf0(esk2_2(X2,X1),X1)
| ~ aSet0(X1)
| ~ aSet0(X2) ),
i_0_13 ).
cnf(c_0_240,hypothesis,
aSet0(xP),
i_0_208 ).
cnf(c_0_241,negated_conjecture,
~ aSubsetOf0(xP,xQ),
i_0_211 ).
cnf(c_0_242,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_238,c_0_239]),c_0_240]),c_0_235])]),c_0_241]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUM609+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n003.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 : Fri Jul 8 01:15:29 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.45 # ENIGMATIC: Selected complete mode:
% 7.90/2.42 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.90/2.42 # No SInE strategy applied
% 7.90/2.42 # Trying AutoSched0 for 150 seconds
% 7.90/2.42 # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 7.90/2.42 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.90/2.42 #
% 7.90/2.42 # Preprocessing time : 0.026 s
% 7.90/2.42
% 7.90/2.42 # Proof found!
% 7.90/2.42 # SZS status Theorem
% 7.90/2.42 # SZS output start CNFRefutation
% See solution above
% 7.90/2.42 # Training examples: 0 positive, 0 negative
% 7.90/2.42
% 7.90/2.42 # -------------------------------------------------
% 7.90/2.42 # User time : 0.038 s
% 7.90/2.42 # System time : 0.008 s
% 7.90/2.42 # Total time : 0.046 s
% 7.90/2.42 # Maximum resident set size: 7124 pages
% 7.90/2.42
%------------------------------------------------------------------------------