%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM544+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n004.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:37:11 EDT 2022
% Result : Theorem 10.92s 3.70s
% Output : CNFRefutation 10.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 28 ( 14 unt; 2 nHn; 28 RR)
% Number of literals : 61 ( 9 equ; 35 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-1 aty)
% Number of variables : 25 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_81,plain,
( X1 = slcrc0
| sdtlseqdt0(X2,X3)
| X3 != szmzazxdt0(X1)
| ~ isFinite0(X1)
| ~ aElementOf0(X2,X1)
| ~ aSubsetOf0(X1,szNzAzT0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-42bszi1y/input.p',i_0_81) ).
cnf(i_0_6,plain,
( X1 != slcrc0
| ~ aElementOf0(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-42bszi1y/input.p',i_0_6) ).
cnf(i_0_99,hypothesis,
aSubsetOf0(xS,szNzAzT0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-42bszi1y/input.p',i_0_99) ).
cnf(i_0_98,hypothesis,
isFinite0(xS),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-42bszi1y/input.p',i_0_98) ).
cnf(i_0_100,hypothesis,
( aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X1,xS) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-42bszi1y/input.p',i_0_100) ).
cnf(i_0_110,negated_conjecture,
aElementOf0(szmzazxdt0(xS),xS),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-42bszi1y/input.p',i_0_110) ).
cnf(i_0_104,negated_conjecture,
aElementOf0(esk11_0,xS),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-42bszi1y/input.p',i_0_104) ).
cnf(i_0_105,negated_conjecture,
( aElementOf0(X1,slbdtrb0(szszuzczcdt0(szmzazxdt0(xS))))
| ~ aElementOf0(X1,szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(X1),szszuzczcdt0(szmzazxdt0(xS))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-42bszi1y/input.p',i_0_105) ).
cnf(i_0_57,plain,
( sdtlseqdt0(szszuzczcdt0(X1),szszuzczcdt0(X2))
| ~ sdtlseqdt0(X1,X2)
| ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-42bszi1y/input.p',i_0_57) ).
cnf(i_0_103,negated_conjecture,
~ aElementOf0(esk11_0,slbdtrb0(szszuzczcdt0(szmzazxdt0(xS)))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-42bszi1y/input.p',i_0_103) ).
cnf(c_0_121,plain,
( X1 = slcrc0
| sdtlseqdt0(X2,X3)
| X3 != szmzazxdt0(X1)
| ~ isFinite0(X1)
| ~ aElementOf0(X2,X1)
| ~ aSubsetOf0(X1,szNzAzT0) ),
i_0_81 ).
cnf(c_0_122,plain,
( X1 != slcrc0
| ~ aElementOf0(X2,X1) ),
i_0_6 ).
cnf(c_0_123,plain,
( sdtlseqdt0(X1,X2)
| X2 != szmzazxdt0(X3)
| ~ aSubsetOf0(X3,szNzAzT0)
| ~ aElementOf0(X1,X3)
| ~ isFinite0(X3) ),
inference(csr,[status(thm)],[c_0_121,c_0_122]) ).
cnf(c_0_124,hypothesis,
aSubsetOf0(xS,szNzAzT0),
i_0_99 ).
cnf(c_0_125,hypothesis,
isFinite0(xS),
i_0_98 ).
cnf(c_0_126,hypothesis,
( aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X1,xS) ),
i_0_100 ).
cnf(c_0_127,negated_conjecture,
aElementOf0(szmzazxdt0(xS),xS),
i_0_110 ).
cnf(c_0_128,hypothesis,
( sdtlseqdt0(X1,X2)
| X2 != szmzazxdt0(xS)
| ~ aElementOf0(X1,xS) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_123,c_0_124]),c_0_125])]) ).
cnf(c_0_129,negated_conjecture,
aElementOf0(esk11_0,xS),
i_0_104 ).
cnf(c_0_130,negated_conjecture,
( aElementOf0(X1,slbdtrb0(szszuzczcdt0(szmzazxdt0(xS))))
| ~ aElementOf0(X1,szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(X1),szszuzczcdt0(szmzazxdt0(xS))) ),
i_0_105 ).
cnf(c_0_131,plain,
( sdtlseqdt0(szszuzczcdt0(X1),szszuzczcdt0(X2))
| ~ sdtlseqdt0(X1,X2)
| ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
i_0_57 ).
cnf(c_0_132,hypothesis,
aElementOf0(szmzazxdt0(xS),szNzAzT0),
inference(spm,[status(thm)],[c_0_126,c_0_127]) ).
cnf(c_0_133,negated_conjecture,
( sdtlseqdt0(esk11_0,X1)
| X1 != szmzazxdt0(xS) ),
inference(spm,[status(thm)],[c_0_128,c_0_129]) ).
cnf(c_0_134,negated_conjecture,
~ aElementOf0(esk11_0,slbdtrb0(szszuzczcdt0(szmzazxdt0(xS)))),
i_0_103 ).
cnf(c_0_135,negated_conjecture,
( aElementOf0(X1,slbdtrb0(szszuzczcdt0(szmzazxdt0(xS))))
| ~ sdtlseqdt0(X1,szmzazxdt0(xS))
| ~ aElementOf0(X1,szNzAzT0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_130,c_0_131]),c_0_132])]) ).
cnf(c_0_136,negated_conjecture,
sdtlseqdt0(esk11_0,szmzazxdt0(xS)),
inference(er,[status(thm)],[c_0_133]) ).
cnf(c_0_137,negated_conjecture,
aElementOf0(esk11_0,szNzAzT0),
inference(spm,[status(thm)],[c_0_126,c_0_129]) ).
cnf(c_0_138,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_134,c_0_135]),c_0_136]),c_0_137])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11 % Problem : NUM544+2 : TPTP v8.1.0. Released v4.0.0.
% 0.05/0.11 % Command : enigmatic-eprover.py %s %d 1
% 0.10/0.32 % Computer : n004.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 600
% 0.10/0.32 % DateTime : Tue Jul 5 02:55:54 EDT 2022
% 0.10/0.32 % CPUTime :
% 0.15/0.42 # ENIGMATIC: Selected complete mode:
% 10.92/3.70 # ENIGMATIC: Solved by autoschedule:
% 10.92/3.70 # No SInE strategy applied
% 10.92/3.70 # Trying AutoSched0 for 150 seconds
% 10.92/3.70 # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_RG_S04BN
% 10.92/3.70 # and selection function PSelectComplexExceptUniqMaxHorn.
% 10.92/3.70 #
% 10.92/3.70 # Preprocessing time : 0.026 s
% 10.92/3.70
% 10.92/3.70 # Proof found!
% 10.92/3.70 # SZS status Theorem
% 10.92/3.70 # SZS output start CNFRefutation
% See solution above
% 10.92/3.70 # Training examples: 0 positive, 0 negative
% 10.92/3.70
% 10.92/3.70 # -------------------------------------------------
% 10.92/3.70 # User time : 0.044 s
% 10.92/3.70 # System time : 0.008 s
% 10.92/3.70 # Total time : 0.052 s
% 10.92/3.70 # Maximum resident set size: 7120 pages
% 10.92/3.70
%------------------------------------------------------------------------------