TSTP Solution File: NUM423+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM423+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n015.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:35:50 EDT 2022
% Result : Theorem 7.31s 2.34s
% Output : CNFRefutation 7.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 10
% Syntax : Number of clauses : 25 ( 13 unt; 6 nHn; 25 RR)
% Number of literals : 58 ( 14 equ; 33 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 23 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_34,negated_conjecture,
~ sdteqdtlpzmzozddtrp0(xa,xa,xq),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5bmqmy35/input.p',i_0_34) ).
cnf(i_0_29,plain,
( X1 = sz00
| sdteqdtlpzmzozddtrp0(X2,X3,X1)
| ~ aInteger0(X3)
| ~ aInteger0(X2)
| ~ aInteger0(X1)
| ~ aDivisorOf0(X1,sdtpldt0(X2,smndt0(X3))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5bmqmy35/input.p',i_0_29) ).
cnf(i_0_33,hypothesis,
aInteger0(xa),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5bmqmy35/input.p',i_0_33) ).
cnf(i_0_32,hypothesis,
aInteger0(xq),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5bmqmy35/input.p',i_0_32) ).
cnf(i_0_31,hypothesis,
sz00 != xq,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5bmqmy35/input.p',i_0_31) ).
cnf(i_0_24,plain,
( X1 = sz00
| aDivisorOf0(X1,X2)
| sdtasdt0(X1,X3) != X2
| ~ aInteger0(X2)
| ~ aInteger0(X3)
| ~ aInteger0(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5bmqmy35/input.p',i_0_24) ).
cnf(i_0_6,plain,
( aInteger0(sdtasdt0(X1,X2))
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5bmqmy35/input.p',i_0_6) ).
cnf(i_0_12,plain,
( sdtpldt0(X1,smndt0(X1)) = sz00
| ~ aInteger0(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5bmqmy35/input.p',i_0_12) ).
cnf(i_0_20,plain,
( sdtasdt0(X1,sz00) = sz00
| ~ aInteger0(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5bmqmy35/input.p',i_0_20) ).
cnf(i_0_2,plain,
aInteger0(sz00),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5bmqmy35/input.p',i_0_2) ).
cnf(c_0_45,negated_conjecture,
~ sdteqdtlpzmzozddtrp0(xa,xa,xq),
i_0_34 ).
cnf(c_0_46,plain,
( X1 = sz00
| sdteqdtlpzmzozddtrp0(X2,X3,X1)
| ~ aInteger0(X3)
| ~ aInteger0(X2)
| ~ aInteger0(X1)
| ~ aDivisorOf0(X1,sdtpldt0(X2,smndt0(X3))) ),
i_0_29 ).
cnf(c_0_47,hypothesis,
aInteger0(xa),
i_0_33 ).
cnf(c_0_48,hypothesis,
aInteger0(xq),
i_0_32 ).
cnf(c_0_49,hypothesis,
sz00 != xq,
i_0_31 ).
cnf(c_0_50,plain,
( X1 = sz00
| aDivisorOf0(X1,X2)
| sdtasdt0(X1,X3) != X2
| ~ aInteger0(X2)
| ~ aInteger0(X3)
| ~ aInteger0(X1) ),
i_0_24 ).
cnf(c_0_51,plain,
( aInteger0(sdtasdt0(X1,X2))
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
i_0_6 ).
cnf(c_0_52,negated_conjecture,
~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xa))),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]),c_0_48])]),c_0_49]) ).
cnf(c_0_53,plain,
( sdtpldt0(X1,smndt0(X1)) = sz00
| ~ aInteger0(X1) ),
i_0_12 ).
cnf(c_0_54,plain,
( X1 = sz00
| aDivisorOf0(X1,sdtasdt0(X1,X2))
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_50]),c_0_51]) ).
cnf(c_0_55,plain,
( sdtasdt0(X1,sz00) = sz00
| ~ aInteger0(X1) ),
i_0_20 ).
cnf(c_0_56,plain,
aInteger0(sz00),
i_0_2 ).
cnf(c_0_57,plain,
~ aDivisorOf0(xq,sz00),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_47])]) ).
cnf(c_0_58,plain,
( X1 = sz00
| aDivisorOf0(X1,sz00)
| ~ aInteger0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56])]) ).
cnf(c_0_59,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_48])]),c_0_49]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : NUM423+1 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n015.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Tue Jul 5 12:01:04 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.22/0.47 # ENIGMATIC: Selected complete mode:
% 7.31/2.34 # ENIGMATIC: Solved by autoschedule:
% 7.31/2.34 # No SInE strategy applied
% 7.31/2.34 # Trying AutoSched0 for 150 seconds
% 7.31/2.34 # AutoSched0-Mode selected heuristic G_E___107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y
% 7.31/2.34 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.31/2.34 #
% 7.31/2.34 # Preprocessing time : 0.018 s
% 7.31/2.34 # Presaturation interreduction done
% 7.31/2.34
% 7.31/2.34 # Proof found!
% 7.31/2.34 # SZS status Theorem
% 7.31/2.34 # SZS output start CNFRefutation
% See solution above
% 7.31/2.34 # Training examples: 0 positive, 0 negative
% 7.31/2.34
% 7.31/2.34 # -------------------------------------------------
% 7.31/2.34 # User time : 0.021 s
% 7.31/2.34 # System time : 0.005 s
% 7.31/2.34 # Total time : 0.027 s
% 7.31/2.34 # Maximum resident set size: 7120 pages
% 7.31/2.34
%------------------------------------------------------------------------------