TSTP Solution File: NUM430+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM430+1 : 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:35:54 EDT 2022
% Result : Theorem 8.10s 2.36s
% Output : CNFRefutation 8.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of clauses : 30 ( 14 unt; 2 nHn; 30 RR)
% Number of literals : 60 ( 11 equ; 32 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 22 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_30,plain,
( X1 = sz00
| aDivisorOf0(X1,sdtpldt0(X2,smndt0(X3)))
| ~ aInteger0(X1)
| ~ aInteger0(X3)
| ~ aInteger0(X2)
| ~ sdteqdtlpzmzozddtrp0(X2,X3,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ma5u70fh/input.p',i_0_30) ).
cnf(i_0_38,hypothesis,
sdteqdtlpzmzozddtrp0(xb,xc,xq),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ma5u70fh/input.p',i_0_38) ).
cnf(i_0_33,hypothesis,
aInteger0(xc),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ma5u70fh/input.p',i_0_33) ).
cnf(i_0_36,hypothesis,
aInteger0(xb),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ma5u70fh/input.p',i_0_36) ).
cnf(i_0_35,hypothesis,
aInteger0(xq),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ma5u70fh/input.p',i_0_35) ).
cnf(i_0_34,hypothesis,
sz00 != xq,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ma5u70fh/input.p',i_0_34) ).
cnf(i_0_25,plain,
( sdtasdt0(X1,esk1_2(X2,X1)) = X2
| ~ aInteger0(X2)
| ~ aDivisorOf0(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ma5u70fh/input.p',i_0_25) ).
cnf(i_0_26,plain,
( aInteger0(esk1_2(X1,X2))
| ~ aInteger0(X1)
| ~ aDivisorOf0(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ma5u70fh/input.p',i_0_26) ).
cnf(i_0_5,plain,
( aInteger0(sdtpldt0(X1,X2))
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ma5u70fh/input.p',i_0_5) ).
cnf(i_0_4,plain,
( aInteger0(smndt0(X1))
| ~ aInteger0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ma5u70fh/input.p',i_0_4) ).
cnf(i_0_42,negated_conjecture,
( sdtasdt0(xq,X1) != sdtpldt0(xb,smndt0(xc))
| ~ aInteger0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ma5u70fh/input.p',i_0_42) ).
cnf(c_0_54,plain,
( X1 = sz00
| aDivisorOf0(X1,sdtpldt0(X2,smndt0(X3)))
| ~ aInteger0(X1)
| ~ aInteger0(X3)
| ~ aInteger0(X2)
| ~ sdteqdtlpzmzozddtrp0(X2,X3,X1) ),
i_0_30 ).
cnf(c_0_55,hypothesis,
sdteqdtlpzmzozddtrp0(xb,xc,xq),
i_0_38 ).
cnf(c_0_56,hypothesis,
aInteger0(xc),
i_0_33 ).
cnf(c_0_57,hypothesis,
aInteger0(xb),
i_0_36 ).
cnf(c_0_58,hypothesis,
aInteger0(xq),
i_0_35 ).
cnf(c_0_59,hypothesis,
sz00 != xq,
i_0_34 ).
cnf(c_0_60,plain,
( sdtasdt0(X1,esk1_2(X2,X1)) = X2
| ~ aInteger0(X2)
| ~ aDivisorOf0(X1,X2) ),
i_0_25 ).
cnf(c_0_61,hypothesis,
aDivisorOf0(xq,sdtpldt0(xb,smndt0(xc))),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56]),c_0_57]),c_0_58])]),c_0_59]) ).
cnf(c_0_62,plain,
( aInteger0(esk1_2(X1,X2))
| ~ aInteger0(X1)
| ~ aDivisorOf0(X2,X1) ),
i_0_26 ).
cnf(c_0_63,plain,
( sdtasdt0(xq,esk1_2(sdtpldt0(xb,smndt0(xc)),xq)) = sdtpldt0(xb,smndt0(xc))
| ~ aInteger0(sdtpldt0(xb,smndt0(xc))) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_64,plain,
( aInteger0(sdtpldt0(X1,X2))
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
i_0_5 ).
cnf(c_0_65,plain,
( aInteger0(esk1_2(sdtpldt0(xb,smndt0(xc)),xq))
| ~ aInteger0(sdtpldt0(xb,smndt0(xc))) ),
inference(spm,[status(thm)],[c_0_62,c_0_61]) ).
cnf(c_0_66,plain,
( sdtasdt0(xq,esk1_2(sdtpldt0(xb,smndt0(xc)),xq)) = sdtpldt0(xb,smndt0(xc))
| ~ aInteger0(smndt0(xc)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_57])]) ).
cnf(c_0_67,plain,
( aInteger0(smndt0(X1))
| ~ aInteger0(X1) ),
i_0_4 ).
cnf(c_0_68,plain,
( aInteger0(esk1_2(sdtpldt0(xb,smndt0(xc)),xq))
| ~ aInteger0(smndt0(xc)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_64]),c_0_57])]) ).
cnf(c_0_69,negated_conjecture,
( sdtasdt0(xq,X1) != sdtpldt0(xb,smndt0(xc))
| ~ aInteger0(X1) ),
i_0_42 ).
cnf(c_0_70,plain,
sdtasdt0(xq,esk1_2(sdtpldt0(xb,smndt0(xc)),xq)) = sdtpldt0(xb,smndt0(xc)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_56])]) ).
cnf(c_0_71,plain,
aInteger0(esk1_2(sdtpldt0(xb,smndt0(xc)),xq)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_67]),c_0_56])]) ).
cnf(c_0_72,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_71])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : NUM430+1 : TPTP v8.1.0. Released v4.0.0.
% 0.10/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 : Thu Jul 7 16:43:16 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 8.10/2.36 # ENIGMATIC: Solved by autoschedule:
% 8.10/2.36 # No SInE strategy applied
% 8.10/2.36 # Trying AutoSched0 for 150 seconds
% 8.10/2.36 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2S
% 8.10/2.36 # and selection function SelectNewComplexAHP.
% 8.10/2.36 #
% 8.10/2.36 # Preprocessing time : 0.023 s
% 8.10/2.36 # Presaturation interreduction done
% 8.10/2.36
% 8.10/2.36 # Proof found!
% 8.10/2.36 # SZS status Theorem
% 8.10/2.36 # SZS output start CNFRefutation
% See solution above
% 8.10/2.36 # Training examples: 0 positive, 0 negative
% 8.10/2.36
% 8.10/2.36 # -------------------------------------------------
% 8.10/2.36 # User time : 0.031 s
% 8.10/2.36 # System time : 0.006 s
% 8.10/2.36 # Total time : 0.037 s
% 8.10/2.36 # Maximum resident set size: 7124 pages
% 8.10/2.36
%------------------------------------------------------------------------------