TSTP Solution File: NUM463+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM463+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n025.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:16 EDT 2022
% Result : Theorem 9.64s 2.48s
% Output : CNFRefutation 9.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 17
% Syntax : Number of clauses : 52 ( 23 unt; 9 nHn; 52 RR)
% Number of literals : 112 ( 46 equ; 54 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 40 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_6,plain,
( aNaturalNumber0(sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rbf_5nct/input.p',i_0_6) ).
cnf(i_0_48,hypothesis,
aNaturalNumber0(xm),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rbf_5nct/input.p',i_0_48) ).
cnf(i_0_45,plain,
( X1 = sz00
| X1 = sz10
| sdtlseqdt0(sz10,X1)
| ~ aNaturalNumber0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rbf_5nct/input.p',i_0_45) ).
cnf(i_0_51,negated_conjecture,
sz00 != xm,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rbf_5nct/input.p',i_0_51) ).
cnf(i_0_21,plain,
( X1 = X2
| X3 = sz00
| sdtasdt0(X1,X3) != sdtasdt0(X2,X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rbf_5nct/input.p',i_0_21) ).
cnf(i_0_11,plain,
( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rbf_5nct/input.p',i_0_11) ).
cnf(i_0_47,hypothesis,
aNaturalNumber0(xn),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rbf_5nct/input.p',i_0_47) ).
cnf(i_0_10,plain,
( sdtpldt0(X1,sz00) = X1
| ~ aNaturalNumber0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rbf_5nct/input.p',i_0_10) ).
cnf(i_0_43,plain,
( X1 = X2
| X3 = sz00
| sdtlseqdt0(sdtasdt0(X3,X1),sdtasdt0(X3,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X3)
| ~ sdtlseqdt0(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rbf_5nct/input.p',i_0_43) ).
cnf(i_0_4,plain,
aNaturalNumber0(sz10),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rbf_5nct/input.p',i_0_4) ).
cnf(i_0_14,plain,
( sdtasdt0(X1,sz10) = X1
| ~ aNaturalNumber0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rbf_5nct/input.p',i_0_14) ).
cnf(i_0_50,negated_conjecture,
( sdtpldt0(xn,X1) != sdtasdt0(xn,xm)
| ~ aNaturalNumber0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rbf_5nct/input.p',i_0_50) ).
cnf(i_0_2,plain,
aNaturalNumber0(sz00),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rbf_5nct/input.p',i_0_2) ).
cnf(i_0_49,negated_conjecture,
~ sdtlseqdt0(xn,sdtasdt0(xn,xm)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rbf_5nct/input.p',i_0_49) ).
cnf(i_0_32,plain,
( sdtlseqdt0(X1,X1)
| ~ aNaturalNumber0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rbf_5nct/input.p',i_0_32) ).
cnf(i_0_15,plain,
( sdtasdt0(sz00,X1) = sz00
| ~ aNaturalNumber0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rbf_5nct/input.p',i_0_15) ).
cnf(i_0_16,plain,
( sdtasdt0(X1,sz00) = sz00
| ~ aNaturalNumber0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rbf_5nct/input.p',i_0_16) ).
cnf(c_0_69,plain,
( aNaturalNumber0(sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
i_0_6 ).
cnf(c_0_70,hypothesis,
aNaturalNumber0(xm),
i_0_48 ).
cnf(c_0_71,plain,
( X1 = sz00
| X1 = sz10
| sdtlseqdt0(sz10,X1)
| ~ aNaturalNumber0(X1) ),
i_0_45 ).
cnf(c_0_72,negated_conjecture,
sz00 != xm,
i_0_51 ).
cnf(c_0_73,plain,
( X1 = X2
| X3 = sz00
| sdtasdt0(X1,X3) != sdtasdt0(X2,X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X1) ),
i_0_21 ).
cnf(c_0_74,plain,
( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
i_0_11 ).
cnf(c_0_75,hypothesis,
( aNaturalNumber0(sdtasdt0(X1,xm))
| ~ aNaturalNumber0(X1) ),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_76,hypothesis,
aNaturalNumber0(xn),
i_0_47 ).
cnf(c_0_77,plain,
( sdtpldt0(X1,sz00) = X1
| ~ aNaturalNumber0(X1) ),
i_0_10 ).
cnf(c_0_78,plain,
( X1 = X2
| X3 = sz00
| sdtlseqdt0(sdtasdt0(X3,X1),sdtasdt0(X3,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X3)
| ~ sdtlseqdt0(X1,X2) ),
i_0_43 ).
cnf(c_0_79,hypothesis,
( xm = sz10
| sdtlseqdt0(sz10,xm) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_70]),c_0_72]) ).
cnf(c_0_80,plain,
aNaturalNumber0(sz10),
i_0_4 ).
cnf(c_0_81,plain,
( sdtasdt0(X1,sz10) = X1
| ~ aNaturalNumber0(X1) ),
i_0_14 ).
cnf(c_0_82,hypothesis,
( X1 = X2
| sdtasdt0(X1,xm) != sdtasdt0(X2,xm)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_70]),c_0_72]) ).
cnf(c_0_83,hypothesis,
( sdtasdt0(X1,xm) = sdtasdt0(xm,X1)
| ~ aNaturalNumber0(X1) ),
inference(spm,[status(thm)],[c_0_74,c_0_70]) ).
cnf(c_0_84,hypothesis,
aNaturalNumber0(sdtasdt0(xn,xm)),
inference(spm,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_85,negated_conjecture,
( sdtpldt0(xn,X1) != sdtasdt0(xn,xm)
| ~ aNaturalNumber0(X1) ),
i_0_50 ).
cnf(c_0_86,hypothesis,
sdtpldt0(xn,sz00) = xn,
inference(spm,[status(thm)],[c_0_77,c_0_76]) ).
cnf(c_0_87,plain,
aNaturalNumber0(sz00),
i_0_2 ).
cnf(c_0_88,plain,
( xm = sz10
| X1 = sz00
| sdtlseqdt0(sdtasdt0(X1,sz10),sdtasdt0(X1,xm))
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_70]),c_0_80])]) ).
cnf(c_0_89,hypothesis,
sdtasdt0(xn,sz10) = xn,
inference(spm,[status(thm)],[c_0_81,c_0_76]) ).
cnf(c_0_90,negated_conjecture,
~ sdtlseqdt0(xn,sdtasdt0(xn,xm)),
i_0_49 ).
cnf(c_0_91,plain,
( sdtlseqdt0(X1,X1)
| ~ aNaturalNumber0(X1) ),
i_0_32 ).
cnf(c_0_92,hypothesis,
( X1 = xn
| sdtasdt0(X1,xm) != sdtasdt0(xn,xm)
| ~ aNaturalNumber0(X1) ),
inference(spm,[status(thm)],[c_0_82,c_0_76]) ).
cnf(c_0_93,hypothesis,
sdtasdt0(sdtasdt0(xn,xm),xm) = sdtasdt0(xm,sdtasdt0(xn,xm)),
inference(spm,[status(thm)],[c_0_83,c_0_84]) ).
cnf(c_0_94,negated_conjecture,
sdtasdt0(xn,xm) != xn,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_86]),c_0_87])]) ).
cnf(c_0_95,hypothesis,
( xn = sz00
| xm = sz10 ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_76]),c_0_89]),c_0_90]) ).
cnf(c_0_96,hypothesis,
sdtlseqdt0(xn,xn),
inference(spm,[status(thm)],[c_0_91,c_0_76]) ).
cnf(c_0_97,plain,
( sdtasdt0(sz00,X1) = sz00
| ~ aNaturalNumber0(X1) ),
i_0_15 ).
cnf(c_0_98,plain,
( sdtasdt0(X1,sz00) = sz00
| ~ aNaturalNumber0(X1) ),
i_0_16 ).
cnf(c_0_99,hypothesis,
sdtasdt0(xm,sdtasdt0(xn,xm)) != sdtasdt0(xn,xm),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_93]),c_0_84])]),c_0_94]) ).
cnf(c_0_100,negated_conjecture,
xn = sz00,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_95]),c_0_89]),c_0_96])]) ).
cnf(c_0_101,hypothesis,
sdtasdt0(sz00,xm) = sz00,
inference(spm,[status(thm)],[c_0_97,c_0_70]) ).
cnf(c_0_102,hypothesis,
sdtasdt0(xm,sz00) = sz00,
inference(spm,[status(thm)],[c_0_98,c_0_70]) ).
cnf(c_0_103,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_99,c_0_100]),c_0_101]),c_0_102]),c_0_100]),c_0_101])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : NUM463+2 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n025.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 18:59:00 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 9.64/2.48 # ENIGMATIC: Solved by autoschedule:
% 9.64/2.48 # No SInE strategy applied
% 9.64/2.48 # Trying AutoSched0 for 150 seconds
% 9.64/2.48 # AutoSched0-Mode selected heuristic G_E___200_C45_F1_AE_CS_SP_PI_S0S
% 9.64/2.48 # and selection function SelectComplexG.
% 9.64/2.48 #
% 9.64/2.48 # Preprocessing time : 0.018 s
% 9.64/2.48
% 9.64/2.48 # Proof found!
% 9.64/2.48 # SZS status Theorem
% 9.64/2.48 # SZS output start CNFRefutation
% See solution above
% 9.64/2.48 # Training examples: 0 positive, 0 negative
% 9.64/2.48
% 9.64/2.48 # -------------------------------------------------
% 9.64/2.48 # User time : 0.214 s
% 9.64/2.48 # System time : 0.015 s
% 9.64/2.48 # Total time : 0.229 s
% 9.64/2.48 # Maximum resident set size: 7124 pages
% 9.64/2.48
%------------------------------------------------------------------------------