TSTP Solution File: NUM607+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM607+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n015.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:51 EDT 2022
% Result : Theorem 8.62s 2.40s
% Output : CNFRefutation 8.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 13
% Syntax : Number of clauses : 35 ( 22 unt; 0 nHn; 35 RR)
% Number of literals : 79 ( 12 equ; 47 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 36 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_105,plain,
( sbrdtbr0(X1) = X2
| X3 != slbdtsldtrb0(X4,X2)
| ~ aSet0(X4)
| ~ aElementOf0(X1,X3)
| ~ aElementOf0(X2,szNzAzT0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tr0q7lh_/input.p',i_0_105) ).
cnf(i_0_104,plain,
( aElementOf0(X1,X2)
| sbrdtbr0(X1) != X3
| X2 != slbdtsldtrb0(X4,X3)
| ~ aSet0(X4)
| ~ aSubsetOf0(X1,X4)
| ~ aElementOf0(X3,szNzAzT0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tr0q7lh_/input.p',i_0_104) ).
cnf(i_0_201,hypothesis,
aElementOf0(xQ,slbdtsldtrb0(xO,xK)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tr0q7lh_/input.p',i_0_201) ).
cnf(i_0_147,hypothesis,
aElementOf0(xK,szNzAzT0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tr0q7lh_/input.p',i_0_147) ).
cnf(i_0_194,hypothesis,
aSet0(xO),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tr0q7lh_/input.p',i_0_194) ).
cnf(i_0_15,plain,
( aSet0(X1)
| ~ aSet0(X2)
| ~ aSubsetOf0(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tr0q7lh_/input.p',i_0_15) ).
cnf(i_0_149,hypothesis,
aSubsetOf0(xS,szNzAzT0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tr0q7lh_/input.p',i_0_149) ).
cnf(i_0_45,plain,
aSet0(szNzAzT0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tr0q7lh_/input.p',i_0_45) ).
cnf(i_0_19,plain,
( aSubsetOf0(X1,X2)
| ~ aSet0(X2)
| ~ aSet0(X3)
| ~ aSet0(X1)
| ~ aSubsetOf0(X3,X2)
| ~ aSubsetOf0(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tr0q7lh_/input.p',i_0_19) ).
cnf(i_0_151,hypothesis,
slbdtsldtrb0(xS,xK) = szDzozmdt0(xc),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tr0q7lh_/input.p',i_0_151) ).
cnf(i_0_205,negated_conjecture,
~ aElementOf0(xQ,szDzozmdt0(xc)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tr0q7lh_/input.p',i_0_205) ).
cnf(i_0_200,hypothesis,
aSubsetOf0(xO,xS),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tr0q7lh_/input.p',i_0_200) ).
cnf(i_0_203,hypothesis,
aSubsetOf0(xQ,xO),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tr0q7lh_/input.p',i_0_203) ).
cnf(c_0_219,plain,
( sbrdtbr0(X1) = X2
| X3 != slbdtsldtrb0(X4,X2)
| ~ aSet0(X4)
| ~ aElementOf0(X1,X3)
| ~ aElementOf0(X2,szNzAzT0) ),
i_0_105 ).
cnf(c_0_220,plain,
( aElementOf0(X1,X2)
| sbrdtbr0(X1) != X3
| X2 != slbdtsldtrb0(X4,X3)
| ~ aSet0(X4)
| ~ aSubsetOf0(X1,X4)
| ~ aElementOf0(X3,szNzAzT0) ),
i_0_104 ).
cnf(c_0_221,plain,
( sbrdtbr0(X1) = X2
| ~ aElementOf0(X1,slbdtsldtrb0(X3,X2))
| ~ aElementOf0(X2,szNzAzT0)
| ~ aSet0(X3) ),
inference(er,[status(thm)],[c_0_219]) ).
cnf(c_0_222,hypothesis,
aElementOf0(xQ,slbdtsldtrb0(xO,xK)),
i_0_201 ).
cnf(c_0_223,hypothesis,
aElementOf0(xK,szNzAzT0),
i_0_147 ).
cnf(c_0_224,hypothesis,
aSet0(xO),
i_0_194 ).
cnf(c_0_225,plain,
( aElementOf0(X1,slbdtsldtrb0(X2,sbrdtbr0(X1)))
| ~ aSubsetOf0(X1,X2)
| ~ aElementOf0(sbrdtbr0(X1),szNzAzT0)
| ~ aSet0(X2) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_220])]) ).
cnf(c_0_226,hypothesis,
sbrdtbr0(xQ) = xK,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_221,c_0_222]),c_0_223]),c_0_224])]) ).
cnf(c_0_227,plain,
( aSet0(X1)
| ~ aSet0(X2)
| ~ aSubsetOf0(X1,X2) ),
i_0_15 ).
cnf(c_0_228,hypothesis,
aSubsetOf0(xS,szNzAzT0),
i_0_149 ).
cnf(c_0_229,plain,
aSet0(szNzAzT0),
i_0_45 ).
cnf(c_0_230,plain,
( aSubsetOf0(X1,X2)
| ~ aSet0(X2)
| ~ aSet0(X3)
| ~ aSet0(X1)
| ~ aSubsetOf0(X3,X2)
| ~ aSubsetOf0(X1,X3) ),
i_0_19 ).
cnf(c_0_231,plain,
( aElementOf0(xQ,slbdtsldtrb0(X1,xK))
| ~ aSubsetOf0(xQ,X1)
| ~ aSet0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_225,c_0_226]),c_0_223])]) ).
cnf(c_0_232,hypothesis,
slbdtsldtrb0(xS,xK) = szDzozmdt0(xc),
i_0_151 ).
cnf(c_0_233,hypothesis,
aSet0(xS),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_227,c_0_228]),c_0_229])]) ).
cnf(c_0_234,negated_conjecture,
~ aElementOf0(xQ,szDzozmdt0(xc)),
i_0_205 ).
cnf(c_0_235,plain,
( aSubsetOf0(X1,X2)
| ~ aSubsetOf0(X3,X2)
| ~ aSubsetOf0(X1,X3)
| ~ aSet0(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_230,c_0_227]),c_0_227]) ).
cnf(c_0_236,hypothesis,
aSubsetOf0(xO,xS),
i_0_200 ).
cnf(c_0_237,hypothesis,
~ aSubsetOf0(xQ,xS),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_231,c_0_232]),c_0_233])]),c_0_234]) ).
cnf(c_0_238,hypothesis,
( aSubsetOf0(X1,xS)
| ~ aSubsetOf0(X1,xO) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_235,c_0_236]),c_0_233])]) ).
cnf(c_0_239,hypothesis,
aSubsetOf0(xQ,xO),
i_0_203 ).
cnf(c_0_240,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_237,c_0_238]),c_0_239])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM607+1 : TPTP v8.1.0. Released v4.0.0.
% 0.00/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n015.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 15:25:20 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 8.62/2.40 # ENIGMATIC: Solved by autoschedule:
% 8.62/2.40 # No SInE strategy applied
% 8.62/2.40 # Trying AutoSched0 for 150 seconds
% 8.62/2.40 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S0Y
% 8.62/2.40 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.62/2.40 #
% 8.62/2.40 # Preprocessing time : 0.031 s
% 8.62/2.40 # Presaturation interreduction done
% 8.62/2.40
% 8.62/2.40 # Proof found!
% 8.62/2.40 # SZS status Theorem
% 8.62/2.40 # SZS output start CNFRefutation
% See solution above
% 8.62/2.40 # Training examples: 0 positive, 0 negative
% 8.62/2.40
% 8.62/2.40 # -------------------------------------------------
% 8.62/2.40 # User time : 0.094 s
% 8.62/2.40 # System time : 0.008 s
% 8.62/2.40 # Total time : 0.102 s
% 8.62/2.40 # Maximum resident set size: 7124 pages
% 8.62/2.40
%------------------------------------------------------------------------------