TSTP Solution File: NUM464+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM464+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n008.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:17 EDT 2022
% Result : Theorem 6.78s 2.13s
% Output : CNFRefutation 6.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% Syntax : Number of clauses : 20 ( 13 unt; 2 nHn; 20 RR)
% Number of literals : 31 ( 13 equ; 14 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 7 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_45,plain,
( X1 = sz00
| X1 = sz10
| sdtlseqdt0(sz10,X1)
| ~ aNaturalNumber0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2hllju8r/lgb.p',i_0_45) ).
cnf(i_0_48,hypothesis,
aNaturalNumber0(xm),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2hllju8r/lgb.p',i_0_48) ).
cnf(i_0_51,negated_conjecture,
sz00 != xm,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2hllju8r/lgb.p',i_0_51) ).
cnf(i_0_49,negated_conjecture,
~ sdtlseqdt0(sz10,xm),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2hllju8r/lgb.p',i_0_49) ).
cnf(i_0_50,negated_conjecture,
( sdtpldt0(sz10,X1) != xm
| ~ aNaturalNumber0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2hllju8r/lgb.p',i_0_50) ).
cnf(i_0_10,plain,
( sdtpldt0(X1,sz00) = X1
| ~ aNaturalNumber0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2hllju8r/lgb.p',i_0_10) ).
cnf(i_0_4,plain,
aNaturalNumber0(sz10),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2hllju8r/lgb.p',i_0_4) ).
cnf(i_0_2,plain,
aNaturalNumber0(sz00),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2hllju8r/lgb.p',i_0_2) ).
cnf(c_0_60,plain,
( X1 = sz00
| X1 = sz10
| sdtlseqdt0(sz10,X1)
| ~ aNaturalNumber0(X1) ),
i_0_45 ).
cnf(c_0_61,hypothesis,
aNaturalNumber0(xm),
i_0_48 ).
cnf(c_0_62,negated_conjecture,
sz00 != xm,
i_0_51 ).
cnf(c_0_63,negated_conjecture,
~ sdtlseqdt0(sz10,xm),
i_0_49 ).
cnf(c_0_64,negated_conjecture,
( sdtpldt0(sz10,X1) != xm
| ~ aNaturalNumber0(X1) ),
i_0_50 ).
cnf(c_0_65,hypothesis,
xm = sz10,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_62]),c_0_63]) ).
cnf(c_0_66,plain,
( sdtpldt0(X1,sz00) = X1
| ~ aNaturalNumber0(X1) ),
i_0_10 ).
cnf(c_0_67,plain,
aNaturalNumber0(sz10),
i_0_4 ).
cnf(c_0_68,negated_conjecture,
( sdtpldt0(sz10,X1) != sz10
| ~ aNaturalNumber0(X1) ),
inference(rw,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_69,plain,
sdtpldt0(sz10,sz00) = sz10,
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_70,plain,
aNaturalNumber0(sz00),
i_0_2 ).
cnf(c_0_71,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_70])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUM464+2 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n008.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.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jul 7 10:46:25 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 6.78/2.13 # ENIGMATIC: Solved by autoschedule-lgb:
% 6.78/2.13 # No SInE strategy applied
% 6.78/2.13 # Trying AutoSched0 for 150 seconds
% 6.78/2.13 # AutoSched0-Mode selected heuristic G_E___200_C45_F1_AE_CS_SP_PI_S0S
% 6.78/2.13 # and selection function SelectComplexG.
% 6.78/2.13 #
% 6.78/2.13 # Preprocessing time : 0.012 s
% 6.78/2.13
% 6.78/2.13 # Proof found!
% 6.78/2.13 # SZS status Theorem
% 6.78/2.13 # SZS output start CNFRefutation
% See solution above
% 6.78/2.13 # Training examples: 0 positive, 0 negative
% 6.78/2.13
% 6.78/2.13 # -------------------------------------------------
% 6.78/2.13 # User time : 0.011 s
% 6.78/2.13 # System time : 0.007 s
% 6.78/2.13 # Total time : 0.018 s
% 6.78/2.13 # Maximum resident set size: 7128 pages
% 6.78/2.13
%------------------------------------------------------------------------------