%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM427+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n012.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:52 EDT 2022
% Result : Theorem 8.05s 2.31s
% Output : CNFRefutation 8.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 11
% Syntax : Number of clauses : 26 ( 16 unt; 6 nHn; 26 RR)
% Number of literals : 58 ( 12 equ; 31 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 : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 21 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
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/sandbox/tmp/enigma-theBenchmark.p-dgjejfo6/lgb.p',i_0_29) ).
cnf(i_0_39,hypothesis,
sdtpldt0(xb,smndt0(xa)) = sdtasdt0(xq,smndt0(xn)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dgjejfo6/lgb.p',i_0_39) ).
cnf(i_0_35,hypothesis,
aInteger0(xa),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dgjejfo6/lgb.p',i_0_35) ).
cnf(i_0_34,hypothesis,
aInteger0(xb),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dgjejfo6/lgb.p',i_0_34) ).
cnf(i_0_24,plain,
( X1 = sz00
| aDivisorOf0(X1,X2)
| sdtasdt0(X1,X3) != X2
| ~ aInteger0(X2)
| ~ aInteger0(X3)
| ~ aInteger0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dgjejfo6/lgb.p',i_0_24) ).
cnf(i_0_6,plain,
( aInteger0(sdtasdt0(X1,X2))
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dgjejfo6/lgb.p',i_0_6) ).
cnf(i_0_33,hypothesis,
aInteger0(xq),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dgjejfo6/lgb.p',i_0_33) ).
cnf(i_0_32,hypothesis,
sz00 != xq,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dgjejfo6/lgb.p',i_0_32) ).
cnf(i_0_40,negated_conjecture,
~ sdteqdtlpzmzozddtrp0(xb,xa,xq),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dgjejfo6/lgb.p',i_0_40) ).
cnf(i_0_4,plain,
( aInteger0(smndt0(X1))
| ~ aInteger0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dgjejfo6/lgb.p',i_0_4) ).
cnf(i_0_38,hypothesis,
aInteger0(xn),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dgjejfo6/lgb.p',i_0_38) ).
cnf(c_0_52,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_53,hypothesis,
sdtpldt0(xb,smndt0(xa)) = sdtasdt0(xq,smndt0(xn)),
i_0_39 ).
cnf(c_0_54,hypothesis,
aInteger0(xa),
i_0_35 ).
cnf(c_0_55,hypothesis,
aInteger0(xb),
i_0_34 ).
cnf(c_0_56,plain,
( X1 = sz00
| aDivisorOf0(X1,X2)
| sdtasdt0(X1,X3) != X2
| ~ aInteger0(X2)
| ~ aInteger0(X3)
| ~ aInteger0(X1) ),
i_0_24 ).
cnf(c_0_57,plain,
( aInteger0(sdtasdt0(X1,X2))
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
i_0_6 ).
cnf(c_0_58,hypothesis,
( X1 = sz00
| sdteqdtlpzmzozddtrp0(xb,xa,X1)
| ~ aDivisorOf0(X1,sdtasdt0(xq,smndt0(xn)))
| ~ aInteger0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]),c_0_55])]) ).
cnf(c_0_59,plain,
( X1 = sz00
| aDivisorOf0(X1,sdtasdt0(X1,X2))
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_56]),c_0_57]) ).
cnf(c_0_60,hypothesis,
aInteger0(xq),
i_0_33 ).
cnf(c_0_61,hypothesis,
sz00 != xq,
i_0_32 ).
cnf(c_0_62,negated_conjecture,
~ sdteqdtlpzmzozddtrp0(xb,xa,xq),
i_0_40 ).
cnf(c_0_63,plain,
~ aInteger0(smndt0(xn)),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60])]),c_0_61]),c_0_62]) ).
cnf(c_0_64,plain,
( aInteger0(smndt0(X1))
| ~ aInteger0(X1) ),
i_0_4 ).
cnf(c_0_65,hypothesis,
aInteger0(xn),
i_0_38 ).
cnf(c_0_66,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_65])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUM427+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n012.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Wed Jul 6 13:28:17 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 8.05/2.31 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.05/2.31 # No SInE strategy applied
% 8.05/2.31 # Trying AutoSched0 for 150 seconds
% 8.05/2.31 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2S
% 8.05/2.31 # and selection function SelectNewComplexAHP.
% 8.05/2.31 #
% 8.05/2.31 # Preprocessing time : 0.024 s
% 8.05/2.31 # Presaturation interreduction done
% 8.05/2.31
% 8.05/2.31 # Proof found!
% 8.05/2.31 # SZS status Theorem
% 8.05/2.31 # SZS output start CNFRefutation
% See solution above
% 8.05/2.31 # Training examples: 0 positive, 0 negative
% 8.05/2.31
% 8.05/2.31 # -------------------------------------------------
% 8.05/2.31 # User time : 0.035 s
% 8.05/2.31 # System time : 0.006 s
% 8.05/2.31 # Total time : 0.041 s
% 8.05/2.31 # Maximum resident set size: 7124 pages
% 8.05/2.31
%------------------------------------------------------------------------------