TSTP Solution File: RNG118+4 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : RNG118+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n028.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.05s 2.39s
% Output : CNFRefutation 8.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of clauses : 33 ( 15 unt; 8 nHn; 33 RR)
% Number of literals : 83 ( 27 equ; 48 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 31 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_26,plain,
( aElement0(X1)
| ~ aSet0(X2)
| ~ aElementOf0(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-td3v_656/lgb.p',i_0_26) ).
cnf(i_0_176,hypothesis,
aElementOf0(xu,xI),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-td3v_656/lgb.p',i_0_176) ).
cnf(i_0_149,hypothesis,
aSet0(xI),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-td3v_656/lgb.p',i_0_149) ).
cnf(i_0_197,negated_conjecture,
( sdtpldt0(sdtasdt0(X1,xu),X2) != xb
| ~ aElement0(X1)
| ~ aElement0(X2)
| ~ iLess0(sbrdtbr0(X2),sbrdtbr0(xu)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-td3v_656/lgb.p',i_0_197) ).
cnf(i_0_68,plain,
( X1 = sz00
| esk15_2(X2,X1) = sz00
| iLess0(sbrdtbr0(esk15_2(X2,X1)),sbrdtbr0(X1))
| ~ aElement0(X1)
| ~ aElement0(X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-td3v_656/lgb.p',i_0_68) ).
cnf(i_0_175,hypothesis,
sz00 != xu,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-td3v_656/lgb.p',i_0_175) ).
cnf(i_0_69,plain,
( X1 = sz00
| sdtpldt0(sdtasdt0(esk14_2(X2,X1),X1),esk15_2(X2,X1)) = X2
| ~ aElement0(X1)
| ~ aElement0(X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-td3v_656/lgb.p',i_0_69) ).
cnf(i_0_94,hypothesis,
aElement0(xb),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-td3v_656/lgb.p',i_0_94) ).
cnf(i_0_71,plain,
( X1 = sz00
| aElement0(esk14_2(X2,X1))
| ~ aElement0(X1)
| ~ aElement0(X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-td3v_656/lgb.p',i_0_71) ).
cnf(i_0_70,plain,
( X1 = sz00
| aElement0(esk15_2(X2,X1))
| ~ aElement0(X1)
| ~ aElement0(X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-td3v_656/lgb.p',i_0_70) ).
cnf(i_0_198,negated_conjecture,
( X1 != sz00
| sdtpldt0(sdtasdt0(X2,xu),X1) != xb
| ~ aElement0(X2)
| ~ aElement0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-td3v_656/lgb.p',i_0_198) ).
cnf(i_0_2,plain,
aElement0(sz00),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-td3v_656/lgb.p',i_0_2) ).
cnf(c_0_211,plain,
( aElement0(X1)
| ~ aSet0(X2)
| ~ aElementOf0(X1,X2) ),
i_0_26 ).
cnf(c_0_212,hypothesis,
aElementOf0(xu,xI),
i_0_176 ).
cnf(c_0_213,hypothesis,
aSet0(xI),
i_0_149 ).
cnf(c_0_214,negated_conjecture,
( sdtpldt0(sdtasdt0(X1,xu),X2) != xb
| ~ aElement0(X1)
| ~ aElement0(X2)
| ~ iLess0(sbrdtbr0(X2),sbrdtbr0(xu)) ),
i_0_197 ).
cnf(c_0_215,plain,
( X1 = sz00
| esk15_2(X2,X1) = sz00
| iLess0(sbrdtbr0(esk15_2(X2,X1)),sbrdtbr0(X1))
| ~ aElement0(X1)
| ~ aElement0(X2) ),
i_0_68 ).
cnf(c_0_216,hypothesis,
sz00 != xu,
i_0_175 ).
cnf(c_0_217,hypothesis,
aElement0(xu),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_211,c_0_212]),c_0_213])]) ).
cnf(c_0_218,negated_conjecture,
( esk15_2(X1,xu) = sz00
| sdtpldt0(sdtasdt0(X2,xu),esk15_2(X1,xu)) != xb
| ~ aElement0(esk15_2(X1,xu))
| ~ aElement0(X2)
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_214,c_0_215]),c_0_216]),c_0_217])]) ).
cnf(c_0_219,plain,
( X1 = sz00
| sdtpldt0(sdtasdt0(esk14_2(X2,X1),X1),esk15_2(X2,X1)) = X2
| ~ aElement0(X1)
| ~ aElement0(X2) ),
i_0_69 ).
cnf(c_0_220,hypothesis,
aElement0(xb),
i_0_94 ).
cnf(c_0_221,plain,
( esk15_2(xb,xu) = sz00
| ~ aElement0(esk15_2(xb,xu))
| ~ aElement0(esk14_2(xb,xu)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_218,c_0_219]),c_0_217])]),c_0_216])]),c_0_220])]) ).
cnf(c_0_222,plain,
( X1 = sz00
| aElement0(esk14_2(X2,X1))
| ~ aElement0(X1)
| ~ aElement0(X2) ),
i_0_71 ).
cnf(c_0_223,plain,
( esk15_2(xb,xu) = sz00
| ~ aElement0(esk15_2(xb,xu)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_221,c_0_222]),c_0_220]),c_0_217])]),c_0_216]) ).
cnf(c_0_224,plain,
( X1 = sz00
| aElement0(esk15_2(X2,X1))
| ~ aElement0(X1)
| ~ aElement0(X2) ),
i_0_70 ).
cnf(c_0_225,negated_conjecture,
( X1 != sz00
| sdtpldt0(sdtasdt0(X2,xu),X1) != xb
| ~ aElement0(X2)
| ~ aElement0(X1) ),
i_0_198 ).
cnf(c_0_226,plain,
aElement0(sz00),
i_0_2 ).
cnf(c_0_227,plain,
esk15_2(xb,xu) = sz00,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_223,c_0_224]),c_0_220]),c_0_217])]),c_0_216]) ).
cnf(c_0_228,negated_conjecture,
( sdtpldt0(sdtasdt0(X1,xu),sz00) != xb
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_225]),c_0_226])]) ).
cnf(c_0_229,plain,
sdtpldt0(sdtasdt0(esk14_2(xb,xu),xu),sz00) = xb,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_219,c_0_227]),c_0_220]),c_0_217])]),c_0_216]) ).
cnf(c_0_230,negated_conjecture,
~ aElement0(esk14_2(xb,xu)),
inference(spm,[status(thm)],[c_0_228,c_0_229]) ).
cnf(c_0_231,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_230,c_0_222]),c_0_220]),c_0_217])]),c_0_216]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : RNG118+4 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n028.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 : Mon May 30 18:06:51 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 8.05/2.39 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.05/2.39 # No SInE strategy applied
% 8.05/2.39 # Trying AutoSched0 for 150 seconds
% 8.05/2.39 # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 8.05/2.39 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.05/2.39 #
% 8.05/2.39 # Preprocessing time : 0.024 s
% 8.05/2.39
% 8.05/2.39 # Proof found!
% 8.05/2.39 # SZS status Theorem
% 8.05/2.39 # SZS output start CNFRefutation
% See solution above
% 8.05/2.39 # Training examples: 0 positive, 0 negative
% 8.05/2.39
% 8.05/2.39 # -------------------------------------------------
% 8.05/2.39 # User time : 0.030 s
% 8.05/2.39 # System time : 0.005 s
% 8.05/2.39 # Total time : 0.035 s
% 8.05/2.39 # Maximum resident set size: 7124 pages
% 8.05/2.39
%------------------------------------------------------------------------------