%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM436+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n017.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:58 EDT 2022
% Result : Theorem 4.58s 2.24s
% Output : CNFRefutation 4.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 13
% Syntax : Number of clauses : 35 ( 24 unt; 6 nHn; 35 RR)
% Number of literals : 68 ( 17 equ; 35 neg)
% Maximal clause size : 6 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 19 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
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-b29zuz07/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-b29zuz07/lgb.p',i_0_6) ).
cnf(i_0_43,hypothesis,
sdtasdt0(xq,sdtasdt0(xp,xm)) = sdtpldt0(xa,smndt0(xb)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b29zuz07/lgb.p',i_0_43) ).
cnf(i_0_44,hypothesis,
sdtasdt0(xp,sdtasdt0(xq,xm)) = sdtpldt0(xa,smndt0(xb)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b29zuz07/lgb.p',i_0_44) ).
cnf(i_0_35,hypothesis,
aInteger0(xq),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b29zuz07/lgb.p',i_0_35) ).
cnf(i_0_34,hypothesis,
sz00 != xq,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b29zuz07/lgb.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/sandbox/tmp/enigma-theBenchmark.p-b29zuz07/lgb.p',i_0_29) ).
cnf(i_0_38,hypothesis,
aInteger0(xb),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b29zuz07/lgb.p',i_0_38) ).
cnf(i_0_39,hypothesis,
aInteger0(xa),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b29zuz07/lgb.p',i_0_39) ).
cnf(i_0_42,hypothesis,
aInteger0(xm),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b29zuz07/lgb.p',i_0_42) ).
cnf(i_0_37,hypothesis,
aInteger0(xp),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b29zuz07/lgb.p',i_0_37) ).
cnf(i_0_45,negated_conjecture,
( ~ sdteqdtlpzmzozddtrp0(xa,xb,xp)
| ~ sdteqdtlpzmzozddtrp0(xa,xb,xq) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b29zuz07/lgb.p',i_0_45) ).
cnf(i_0_36,hypothesis,
sz00 != xp,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b29zuz07/lgb.p',i_0_36) ).
cnf(c_0_59,plain,
( X1 = sz00
| aDivisorOf0(X1,X2)
| sdtasdt0(X1,X3) != X2
| ~ aInteger0(X2)
| ~ aInteger0(X3)
| ~ aInteger0(X1) ),
i_0_24 ).
cnf(c_0_60,plain,
( aInteger0(sdtasdt0(X1,X2))
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
i_0_6 ).
cnf(c_0_61,hypothesis,
sdtasdt0(xq,sdtasdt0(xp,xm)) = sdtpldt0(xa,smndt0(xb)),
i_0_43 ).
cnf(c_0_62,hypothesis,
sdtasdt0(xp,sdtasdt0(xq,xm)) = sdtpldt0(xa,smndt0(xb)),
i_0_44 ).
cnf(c_0_63,plain,
( X1 = sz00
| aDivisorOf0(X1,sdtasdt0(X1,X2))
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_59]),c_0_60]) ).
cnf(c_0_64,hypothesis,
sdtasdt0(xq,sdtasdt0(xp,xm)) = sdtasdt0(xp,sdtasdt0(xq,xm)),
inference(rw,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_65,hypothesis,
aInteger0(xq),
i_0_35 ).
cnf(c_0_66,hypothesis,
sz00 != xq,
i_0_34 ).
cnf(c_0_67,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_68,hypothesis,
aInteger0(xb),
i_0_38 ).
cnf(c_0_69,hypothesis,
aInteger0(xa),
i_0_39 ).
cnf(c_0_70,hypothesis,
( aDivisorOf0(xq,sdtasdt0(xp,sdtasdt0(xq,xm)))
| ~ aInteger0(sdtasdt0(xp,xm)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_65])]),c_0_66]) ).
cnf(c_0_71,hypothesis,
aInteger0(xm),
i_0_42 ).
cnf(c_0_72,hypothesis,
aInteger0(xp),
i_0_37 ).
cnf(c_0_73,hypothesis,
( X1 = sz00
| sdteqdtlpzmzozddtrp0(xa,xb,X1)
| ~ aDivisorOf0(X1,sdtasdt0(xp,sdtasdt0(xq,xm)))
| ~ aInteger0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_62]),c_0_68]),c_0_69])]) ).
cnf(c_0_74,plain,
aDivisorOf0(xq,sdtasdt0(xp,sdtasdt0(xq,xm))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_60]),c_0_71]),c_0_72])]) ).
cnf(c_0_75,negated_conjecture,
( ~ sdteqdtlpzmzozddtrp0(xa,xb,xp)
| ~ sdteqdtlpzmzozddtrp0(xa,xb,xq) ),
i_0_45 ).
cnf(c_0_76,plain,
sdteqdtlpzmzozddtrp0(xa,xb,xq),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_65])]),c_0_66]) ).
cnf(c_0_77,hypothesis,
sz00 != xp,
i_0_36 ).
cnf(c_0_78,negated_conjecture,
~ sdteqdtlpzmzozddtrp0(xa,xb,xp),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_75,c_0_76])]) ).
cnf(c_0_79,plain,
~ aInteger0(sdtasdt0(xq,xm)),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_63]),c_0_72])]),c_0_77]),c_0_78]) ).
cnf(c_0_80,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_60]),c_0_71]),c_0_65])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : NUM436+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 : n017.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 01:05:45 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.45 # ENIGMATIC: Selected complete mode:
% 4.58/2.24 # ENIGMATIC: Solved by autoschedule-lgb:
% 4.58/2.24 # No SInE strategy applied
% 4.58/2.24 # Trying AutoSched0 for 150 seconds
% 4.58/2.24 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2S
% 4.58/2.24 # and selection function SelectNewComplexAHP.
% 4.58/2.24 #
% 4.58/2.24 # Preprocessing time : 0.023 s
% 4.58/2.24 # Presaturation interreduction done
% 4.58/2.24
% 4.58/2.24 # Proof found!
% 4.58/2.24 # SZS status Theorem
% 4.58/2.24 # SZS output start CNFRefutation
% See solution above
% 4.58/2.24 # Training examples: 0 positive, 0 negative
% 4.58/2.24
% 4.58/2.24 # -------------------------------------------------
% 4.58/2.24 # User time : 0.041 s
% 4.58/2.24 # System time : 0.005 s
% 4.58/2.24 # Total time : 0.046 s
% 4.58/2.24 # Maximum resident set size: 7128 pages
% 4.58/2.24
%------------------------------------------------------------------------------