TSTP Solution File: NUM504+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM504+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n014.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:36:44 EDT 2022
% Result : Theorem 4.53s 2.19s
% Output : CNFRefutation 4.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 12
% Syntax : Number of clauses : 31 ( 25 unt; 0 nHn; 31 RR)
% Number of literals : 47 ( 12 equ; 19 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 12 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_237,hypothesis,
sdtasdt0(xr,esk14_0) = sdtasdt0(xn,xm),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gw9qx_pp/lgb.p',i_0_237) ).
cnf(i_0_221,hypothesis,
sdtasdt0(xp,xk) = sdtasdt0(xn,xm),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gw9qx_pp/lgb.p',i_0_221) ).
cnf(i_0_249,hypothesis,
sdtpldt0(sdtasdt0(xn,xm),esk16_0) = sdtasdt0(xp,xm),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gw9qx_pp/lgb.p',i_0_249) ).
cnf(i_0_6,plain,
( aNaturalNumber0(sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gw9qx_pp/lgb.p',i_0_6) ).
cnf(i_0_238,hypothesis,
aNaturalNumber0(esk14_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gw9qx_pp/lgb.p',i_0_238) ).
cnf(i_0_235,hypothesis,
aNaturalNumber0(xr),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gw9qx_pp/lgb.p',i_0_235) ).
cnf(i_0_5,plain,
( aNaturalNumber0(sdtpldt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gw9qx_pp/lgb.p',i_0_5) ).
cnf(i_0_250,hypothesis,
aNaturalNumber0(esk16_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gw9qx_pp/lgb.p',i_0_250) ).
cnf(i_0_248,hypothesis,
sdtlseqdt0(sdtasdt0(xn,xm),sdtasdt0(xp,xm)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gw9qx_pp/lgb.p',i_0_248) ).
cnf(i_0_33,plain,
( X1 = X2
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ sdtlseqdt0(X2,X1)
| ~ sdtlseqdt0(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gw9qx_pp/lgb.p',i_0_33) ).
cnf(i_0_244,hypothesis,
sdtlseqdt0(sdtasdt0(xp,xm),sdtasdt0(xp,xk)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gw9qx_pp/lgb.p',i_0_244) ).
cnf(i_0_247,hypothesis,
sdtasdt0(xp,xk) != sdtasdt0(xp,xm),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gw9qx_pp/lgb.p',i_0_247) ).
cnf(c_0_263,hypothesis,
sdtasdt0(xr,esk14_0) = sdtasdt0(xn,xm),
i_0_237 ).
cnf(c_0_264,hypothesis,
sdtasdt0(xp,xk) = sdtasdt0(xn,xm),
i_0_221 ).
cnf(c_0_265,hypothesis,
sdtpldt0(sdtasdt0(xn,xm),esk16_0) = sdtasdt0(xp,xm),
i_0_249 ).
cnf(c_0_266,plain,
( aNaturalNumber0(sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
i_0_6 ).
cnf(c_0_267,hypothesis,
sdtasdt0(xr,esk14_0) = sdtasdt0(xp,xk),
inference(rw,[status(thm)],[c_0_263,c_0_264]) ).
cnf(c_0_268,hypothesis,
aNaturalNumber0(esk14_0),
i_0_238 ).
cnf(c_0_269,hypothesis,
aNaturalNumber0(xr),
i_0_235 ).
cnf(c_0_270,plain,
( aNaturalNumber0(sdtpldt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
i_0_5 ).
cnf(c_0_271,hypothesis,
sdtpldt0(sdtasdt0(xp,xk),esk16_0) = sdtasdt0(xp,xm),
inference(rw,[status(thm)],[c_0_265,c_0_264]) ).
cnf(c_0_272,hypothesis,
aNaturalNumber0(esk16_0),
i_0_250 ).
cnf(c_0_273,hypothesis,
aNaturalNumber0(sdtasdt0(xp,xk)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_266,c_0_267]),c_0_268]),c_0_269])]) ).
cnf(c_0_274,hypothesis,
sdtlseqdt0(sdtasdt0(xn,xm),sdtasdt0(xp,xm)),
i_0_248 ).
cnf(c_0_275,plain,
( X1 = X2
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ sdtlseqdt0(X2,X1)
| ~ sdtlseqdt0(X1,X2) ),
i_0_33 ).
cnf(c_0_276,hypothesis,
sdtlseqdt0(sdtasdt0(xp,xm),sdtasdt0(xp,xk)),
i_0_244 ).
cnf(c_0_277,plain,
aNaturalNumber0(sdtasdt0(xp,xm)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_270,c_0_271]),c_0_272]),c_0_273])]) ).
cnf(c_0_278,hypothesis,
sdtasdt0(xp,xk) != sdtasdt0(xp,xm),
i_0_247 ).
cnf(c_0_279,hypothesis,
sdtlseqdt0(sdtasdt0(xp,xk),sdtasdt0(xp,xm)),
inference(rw,[status(thm)],[c_0_274,c_0_264]) ).
cnf(c_0_280,plain,
~ sdtlseqdt0(sdtasdt0(xp,xk),sdtasdt0(xp,xm)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_275,c_0_276]),c_0_277]),c_0_273])]),c_0_278]) ).
cnf(c_0_281,hypothesis,
$false,
inference(sr,[status(thm)],[c_0_279,c_0_280]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : NUM504+3 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n014.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 : Tue Jul 5 06:13:40 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.17/0.44 # ENIGMATIC: Selected complete mode:
% 4.53/2.19 # ENIGMATIC: Solved by autoschedule-lgb:
% 4.53/2.19 # No SInE strategy applied
% 4.53/2.19 # Trying AutoSched0 for 150 seconds
% 4.53/2.19 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S068N
% 4.53/2.19 # and selection function PSelectNewComplexAHP.
% 4.53/2.19 #
% 4.53/2.19 # Preprocessing time : 0.020 s
% 4.53/2.19 # Presaturation interreduction done
% 4.53/2.19
% 4.53/2.19 # Proof found!
% 4.53/2.19 # SZS status Theorem
% 4.53/2.19 # SZS output start CNFRefutation
% See solution above
% 4.53/2.19 # Training examples: 0 positive, 0 negative
% 4.53/2.19
% 4.53/2.19 # -------------------------------------------------
% 4.53/2.19 # User time : 0.022 s
% 4.53/2.19 # System time : 0.009 s
% 4.53/2.19 # Total time : 0.031 s
% 4.53/2.19 # Maximum resident set size: 7124 pages
% 4.53/2.19
%------------------------------------------------------------------------------