%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM474+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n007.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:24 EDT 2022
% Result : Theorem 8.91s 2.58s
% Output : CNFRefutation 8.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of clauses : 24 ( 21 unt; 0 nHn; 24 RR)
% Number of literals : 31 ( 17 equ; 12 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 7 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_80,negated_conjecture,
sdtpldt0(sdtasdt0(xl,xp),sdtasdt0(xl,xr)) != sdtpldt0(sdtasdt0(xl,xp),xn),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ph50uu_v/lgb.p',i_0_80) ).
cnf(i_0_69,hypothesis,
sdtasdt0(xl,xp) = xm,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ph50uu_v/lgb.p',i_0_69) ).
cnf(i_0_62,hypothesis,
sdtpldt0(xm,xn) = sdtasdt0(xl,esk4_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ph50uu_v/lgb.p',i_0_62) ).
cnf(i_0_72,hypothesis,
sdtpldt0(xm,xn) = sdtasdt0(xl,xq),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ph50uu_v/lgb.p',i_0_72) ).
cnf(i_0_18,plain,
( sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3)) = sdtasdt0(X1,sdtpldt0(X2,X3))
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ph50uu_v/lgb.p',i_0_18) ).
cnf(i_0_70,hypothesis,
aNaturalNumber0(xp),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ph50uu_v/lgb.p',i_0_70) ).
cnf(i_0_60,hypothesis,
aNaturalNumber0(xl),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ph50uu_v/lgb.p',i_0_60) ).
cnf(i_0_78,hypothesis,
sdtpldt0(xp,xr) = xq,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ph50uu_v/lgb.p',i_0_78) ).
cnf(i_0_79,hypothesis,
aNaturalNumber0(xr),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ph50uu_v/lgb.p',i_0_79) ).
cnf(c_0_90,negated_conjecture,
sdtpldt0(sdtasdt0(xl,xp),sdtasdt0(xl,xr)) != sdtpldt0(sdtasdt0(xl,xp),xn),
i_0_80 ).
cnf(c_0_91,hypothesis,
sdtasdt0(xl,xp) = xm,
i_0_69 ).
cnf(c_0_92,negated_conjecture,
sdtpldt0(xm,sdtasdt0(xl,xr)) != sdtpldt0(xm,xn),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_90,c_0_91]),c_0_91]) ).
cnf(c_0_93,hypothesis,
sdtpldt0(xm,xn) = sdtasdt0(xl,esk4_0),
i_0_62 ).
cnf(c_0_94,hypothesis,
sdtpldt0(xm,xn) = sdtasdt0(xl,xq),
i_0_72 ).
cnf(c_0_95,negated_conjecture,
sdtpldt0(xm,sdtasdt0(xl,xr)) != sdtasdt0(xl,esk4_0),
inference(rw,[status(thm)],[c_0_92,c_0_93]) ).
cnf(c_0_96,hypothesis,
sdtasdt0(xl,esk4_0) = sdtasdt0(xl,xq),
inference(rw,[status(thm)],[c_0_94,c_0_93]) ).
cnf(c_0_97,plain,
( sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3)) = sdtasdt0(X1,sdtpldt0(X2,X3))
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
i_0_18 ).
cnf(c_0_98,hypothesis,
aNaturalNumber0(xp),
i_0_70 ).
cnf(c_0_99,hypothesis,
aNaturalNumber0(xl),
i_0_60 ).
cnf(c_0_100,negated_conjecture,
sdtpldt0(xm,sdtasdt0(xl,xr)) != sdtasdt0(xl,xq),
inference(rw,[status(thm)],[c_0_95,c_0_96]) ).
cnf(c_0_101,hypothesis,
( sdtpldt0(xm,sdtasdt0(xl,X1)) = sdtasdt0(xl,sdtpldt0(xp,X1))
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_91]),c_0_98]),c_0_99])]) ).
cnf(c_0_102,hypothesis,
sdtpldt0(xp,xr) = xq,
i_0_78 ).
cnf(c_0_103,hypothesis,
aNaturalNumber0(xr),
i_0_79 ).
cnf(c_0_104,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_101]),c_0_102]),c_0_103])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : NUM474+2 : TPTP v8.1.0. Released v4.0.0.
% 0.13/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n007.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 : Thu Jul 7 02:19:15 EDT 2022
% 0.20/0.36 % CPUTime :
% 0.20/0.47 # ENIGMATIC: Selected complete mode:
% 8.91/2.58 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.91/2.58 # No SInE strategy applied
% 8.91/2.58 # Trying AutoSched0 for 150 seconds
% 8.91/2.58 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2m
% 8.91/2.58 # and selection function SelectCQArNTNpEqFirst.
% 8.91/2.58 #
% 8.91/2.58 # Preprocessing time : 0.024 s
% 8.91/2.58 # Presaturation interreduction done
% 8.91/2.58
% 8.91/2.58 # Proof found!
% 8.91/2.58 # SZS status Theorem
% 8.91/2.58 # SZS output start CNFRefutation
% See solution above
% 8.91/2.58 # Training examples: 0 positive, 0 negative
% 8.91/2.58
% 8.91/2.58 # -------------------------------------------------
% 8.91/2.58 # User time : 0.170 s
% 8.91/2.58 # System time : 0.013 s
% 8.91/2.58 # Total time : 0.183 s
% 8.91/2.58 # Maximum resident set size: 7124 pages
% 8.91/2.58
%------------------------------------------------------------------------------