TSTP Solution File: NUM455+6 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM455+6 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n026.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:11 EDT 2022
% Result : Theorem 7.90s 2.31s
% Output : CNFRefutation 7.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 15 ( 11 unt; 2 nHn; 15 RR)
% Number of literals : 21 ( 14 equ; 11 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 2 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_231,negated_conjecture,
( X1 = sz10
| X1 = smndt0(sz10)
| ~ aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mjefp3ek/lgb.p',i_0_231) ).
cnf(i_0_222,hypothesis,
aElementOf0(sdtpldt0(sz10,xp),szAzrzSzezqlpdtcmdtrp0(sz10,xp)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mjefp3ek/lgb.p',i_0_222) ).
cnf(i_0_228,hypothesis,
sdtpldt0(sz10,xp) != sz10,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mjefp3ek/lgb.p',i_0_228) ).
cnf(i_0_229,hypothesis,
( sdtpldt0(sz10,xp) != smndt0(sz10)
| sdtpldt0(sz10,smndt0(xp)) != smndt0(sz10) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mjefp3ek/lgb.p',i_0_229) ).
cnf(i_0_217,hypothesis,
aElementOf0(sdtpldt0(sz10,smndt0(xp)),szAzrzSzezqlpdtcmdtrp0(sz10,xp)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mjefp3ek/lgb.p',i_0_217) ).
cnf(i_0_227,hypothesis,
sdtpldt0(sz10,smndt0(xp)) != sz10,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mjefp3ek/lgb.p',i_0_227) ).
cnf(c_0_238,negated_conjecture,
( X1 = sz10
| X1 = smndt0(sz10)
| ~ aElementOf0(X1,szAzrzSzezqlpdtcmdtrp0(sz10,xp)) ),
i_0_231 ).
cnf(c_0_239,hypothesis,
aElementOf0(sdtpldt0(sz10,xp),szAzrzSzezqlpdtcmdtrp0(sz10,xp)),
i_0_222 ).
cnf(c_0_240,hypothesis,
sdtpldt0(sz10,xp) != sz10,
i_0_228 ).
cnf(c_0_241,hypothesis,
( sdtpldt0(sz10,xp) != smndt0(sz10)
| sdtpldt0(sz10,smndt0(xp)) != smndt0(sz10) ),
i_0_229 ).
cnf(c_0_242,hypothesis,
sdtpldt0(sz10,xp) = smndt0(sz10),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_238,c_0_239]),c_0_240]) ).
cnf(c_0_243,hypothesis,
aElementOf0(sdtpldt0(sz10,smndt0(xp)),szAzrzSzezqlpdtcmdtrp0(sz10,xp)),
i_0_217 ).
cnf(c_0_244,hypothesis,
sdtpldt0(sz10,smndt0(xp)) != sz10,
i_0_227 ).
cnf(c_0_245,hypothesis,
sdtpldt0(sz10,smndt0(xp)) != smndt0(sz10),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_241,c_0_242])]) ).
cnf(c_0_246,hypothesis,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_238,c_0_243]),c_0_244]),c_0_245]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM455+6 : TPTP v8.1.0. Released v4.0.0.
% 0.00/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n026.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:04:40 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected complete mode:
% 7.90/2.31 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.90/2.31 # No SInE strategy applied
% 7.90/2.31 # Trying AutoSched0 for 150 seconds
% 7.90/2.31 # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 7.90/2.31 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.90/2.31 #
% 7.90/2.31 # Preprocessing time : 0.025 s
% 7.90/2.31
% 7.90/2.31 # Proof found!
% 7.90/2.31 # SZS status Theorem
% 7.90/2.31 # SZS output start CNFRefutation
% See solution above
% 7.90/2.31 # Training examples: 0 positive, 0 negative
% 7.90/2.31
% 7.90/2.31 # -------------------------------------------------
% 7.90/2.31 # User time : 0.028 s
% 7.90/2.31 # System time : 0.010 s
% 7.90/2.31 # Total time : 0.038 s
% 7.90/2.31 # Maximum resident set size: 7124 pages
% 7.90/2.31
%------------------------------------------------------------------------------