TSTP Solution File: RNG120+4 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : RNG120+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n017.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 20:25:03 EDT 2022
% Result : Theorem 8.50s 2.48s
% Output : CNFRefutation 8.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 26 ( 13 unt; 0 nHn; 26 RR)
% Number of literals : 48 ( 2 equ; 27 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 17 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_147,hypothesis,
( aElementOf0(sdtasdt0(X1,X2),xI)
| ~ aElement0(X1)
| ~ aElementOf0(X2,xI) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-aeiszp1q/input.p',i_0_147) ).
cnf(i_0_20,plain,
( sdtasdt0(smndt0(sz10),X1) = smndt0(X1)
| ~ aElement0(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-aeiszp1q/input.p',i_0_20) ).
cnf(i_0_202,negated_conjecture,
~ aElementOf0(smndt0(sdtasdt0(xq,xu)),xI),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-aeiszp1q/input.p',i_0_202) ).
cnf(i_0_4,plain,
( aElement0(smndt0(X1))
| ~ aElement0(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-aeiszp1q/input.p',i_0_4) ).
cnf(i_0_3,plain,
aElement0(sz10),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-aeiszp1q/input.p',i_0_3) ).
cnf(i_0_176,hypothesis,
aElementOf0(xu,xI),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-aeiszp1q/input.p',i_0_176) ).
cnf(i_0_200,hypothesis,
aElement0(xq),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-aeiszp1q/input.p',i_0_200) ).
cnf(i_0_26,plain,
( aElement0(X1)
| ~ aSet0(X2)
| ~ aElementOf0(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-aeiszp1q/input.p',i_0_26) ).
cnf(i_0_149,hypothesis,
aSet0(xI),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-aeiszp1q/input.p',i_0_149) ).
cnf(i_0_6,plain,
( aElement0(sdtasdt0(X1,X2))
| ~ aElement0(X2)
| ~ aElement0(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-aeiszp1q/input.p',i_0_6) ).
cnf(c_0_213,hypothesis,
( aElementOf0(sdtasdt0(X1,X2),xI)
| ~ aElement0(X1)
| ~ aElementOf0(X2,xI) ),
i_0_147 ).
cnf(c_0_214,plain,
( sdtasdt0(smndt0(sz10),X1) = smndt0(X1)
| ~ aElement0(X1) ),
i_0_20 ).
cnf(c_0_215,negated_conjecture,
~ aElementOf0(smndt0(sdtasdt0(xq,xu)),xI),
i_0_202 ).
cnf(c_0_216,hypothesis,
( aElementOf0(smndt0(X1),xI)
| ~ aElementOf0(X1,xI)
| ~ aElement0(smndt0(sz10))
| ~ aElement0(X1) ),
inference(spm,[status(thm)],[c_0_213,c_0_214]) ).
cnf(c_0_217,negated_conjecture,
( ~ aElementOf0(sdtasdt0(xq,xu),xI)
| ~ aElement0(sdtasdt0(xq,xu))
| ~ aElement0(smndt0(sz10)) ),
inference(spm,[status(thm)],[c_0_215,c_0_216]) ).
cnf(c_0_218,plain,
( aElement0(smndt0(X1))
| ~ aElement0(X1) ),
i_0_4 ).
cnf(c_0_219,plain,
aElement0(sz10),
i_0_3 ).
cnf(c_0_220,plain,
( ~ aElementOf0(sdtasdt0(xq,xu),xI)
| ~ aElement0(sdtasdt0(xq,xu)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_217,c_0_218]),c_0_219])]) ).
cnf(c_0_221,hypothesis,
aElementOf0(xu,xI),
i_0_176 ).
cnf(c_0_222,hypothesis,
aElement0(xq),
i_0_200 ).
cnf(c_0_223,plain,
( aElement0(X1)
| ~ aSet0(X2)
| ~ aElementOf0(X1,X2) ),
i_0_26 ).
cnf(c_0_224,hypothesis,
aSet0(xI),
i_0_149 ).
cnf(c_0_225,hypothesis,
~ aElement0(sdtasdt0(xq,xu)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_220,c_0_213]),c_0_221]),c_0_222])]) ).
cnf(c_0_226,plain,
( aElement0(sdtasdt0(X1,X2))
| ~ aElement0(X2)
| ~ aElement0(X1) ),
i_0_6 ).
cnf(c_0_227,hypothesis,
aElement0(xu),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_223,c_0_221]),c_0_224])]) ).
cnf(c_0_228,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_225,c_0_226]),c_0_227]),c_0_222])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : RNG120+4 : TPTP v8.1.0. Released v4.0.0.
% 0.00/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n017.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 : Mon May 30 16:08:42 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 8.50/2.48 # ENIGMATIC: Solved by autoschedule:
% 8.50/2.48 # No SInE strategy applied
% 8.50/2.48 # Trying AutoSched0 for 150 seconds
% 8.50/2.48 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S0Y
% 8.50/2.48 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.50/2.48 #
% 8.50/2.48 # Preprocessing time : 0.030 s
% 8.50/2.48 # Presaturation interreduction done
% 8.50/2.48
% 8.50/2.48 # Proof found!
% 8.50/2.48 # SZS status Theorem
% 8.50/2.48 # SZS output start CNFRefutation
% See solution above
% 8.50/2.48 # Training examples: 0 positive, 0 negative
% 8.50/2.48
% 8.50/2.48 # -------------------------------------------------
% 8.50/2.48 # User time : 0.070 s
% 8.50/2.48 # System time : 0.009 s
% 8.50/2.48 # Total time : 0.080 s
% 8.50/2.48 # Maximum resident set size: 7124 pages
% 8.50/2.48
%------------------------------------------------------------------------------