TSTP Solution File: NUM545+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM545+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n026.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 4.50s 2.09s
% Output : CNFRefutation 4.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 12
% Syntax : Number of clauses : 33 ( 15 unt; 5 nHn; 33 RR)
% Number of literals : 63 ( 14 equ; 29 neg)
% Maximal clause size : 5 ( 1 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 : 20 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_101,negated_conjecture,
( ~ aElementOf0(X1,szNzAzT0)
| ~ aSubsetOf0(xS,slbdtrb0(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2r85t8jh/lgb.p',i_0_101) ).
cnf(i_0_100,hypothesis,
( xS = slcrc0
| aSubsetOf0(xS,slbdtrb0(szszuzczcdt0(szmzazxdt0(xS)))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2r85t8jh/lgb.p',i_0_100) ).
cnf(i_0_14,plain,
( aElementOf0(X1,X2)
| ~ aSet0(X2)
| ~ aElementOf0(X1,X3)
| ~ aSubsetOf0(X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2r85t8jh/lgb.p',i_0_14) ).
cnf(i_0_99,hypothesis,
aSubsetOf0(xS,szNzAzT0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2r85t8jh/lgb.p',i_0_99) ).
cnf(i_0_45,plain,
aSet0(szNzAzT0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2r85t8jh/lgb.p',i_0_45) ).
cnf(i_0_82,plain,
( X1 = slcrc0
| aElementOf0(X2,X1)
| X2 != szmzazxdt0(X1)
| ~ isFinite0(X1)
| ~ aSubsetOf0(X1,szNzAzT0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2r85t8jh/lgb.p',i_0_82) ).
cnf(i_0_48,plain,
( aElementOf0(szszuzczcdt0(X1),szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2r85t8jh/lgb.p',i_0_48) ).
cnf(i_0_92,plain,
slbdtrb0(sz00) = slcrc0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2r85t8jh/lgb.p',i_0_92) ).
cnf(i_0_46,plain,
aElementOf0(sz00,szNzAzT0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2r85t8jh/lgb.p',i_0_46) ).
cnf(i_0_98,hypothesis,
isFinite0(xS),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2r85t8jh/lgb.p',i_0_98) ).
cnf(i_0_7,plain,
( aSet0(X1)
| X1 != slcrc0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2r85t8jh/lgb.p',i_0_7) ).
cnf(i_0_17,plain,
( aSubsetOf0(X1,X1)
| ~ aSet0(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2r85t8jh/lgb.p',i_0_17) ).
cnf(c_0_114,negated_conjecture,
( ~ aElementOf0(X1,szNzAzT0)
| ~ aSubsetOf0(xS,slbdtrb0(X1)) ),
i_0_101 ).
cnf(c_0_115,hypothesis,
( xS = slcrc0
| aSubsetOf0(xS,slbdtrb0(szszuzczcdt0(szmzazxdt0(xS)))) ),
i_0_100 ).
cnf(c_0_116,plain,
( aElementOf0(X1,X2)
| ~ aSet0(X2)
| ~ aElementOf0(X1,X3)
| ~ aSubsetOf0(X3,X2) ),
i_0_14 ).
cnf(c_0_117,hypothesis,
aSubsetOf0(xS,szNzAzT0),
i_0_99 ).
cnf(c_0_118,plain,
aSet0(szNzAzT0),
i_0_45 ).
cnf(c_0_119,plain,
( X1 = slcrc0
| aElementOf0(X2,X1)
| X2 != szmzazxdt0(X1)
| ~ isFinite0(X1)
| ~ aSubsetOf0(X1,szNzAzT0) ),
i_0_82 ).
cnf(c_0_120,negated_conjecture,
( xS = slcrc0
| ~ aElementOf0(szszuzczcdt0(szmzazxdt0(xS)),szNzAzT0) ),
inference(spm,[status(thm)],[c_0_114,c_0_115]) ).
cnf(c_0_121,plain,
( aElementOf0(szszuzczcdt0(X1),szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
i_0_48 ).
cnf(c_0_122,plain,
slbdtrb0(sz00) = slcrc0,
i_0_92 ).
cnf(c_0_123,plain,
aElementOf0(sz00,szNzAzT0),
i_0_46 ).
cnf(c_0_124,hypothesis,
( aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X1,xS) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_116,c_0_117]),c_0_118])]) ).
cnf(c_0_125,plain,
( X1 = slcrc0
| aElementOf0(szmzazxdt0(X1),X1)
| ~ isFinite0(X1)
| ~ aSubsetOf0(X1,szNzAzT0) ),
inference(er,[status(thm)],[c_0_119]) ).
cnf(c_0_126,hypothesis,
isFinite0(xS),
i_0_98 ).
cnf(c_0_127,plain,
( xS = slcrc0
| ~ aElementOf0(szmzazxdt0(xS),szNzAzT0) ),
inference(spm,[status(thm)],[c_0_120,c_0_121]) ).
cnf(c_0_128,plain,
~ aSubsetOf0(xS,slcrc0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_114,c_0_122]),c_0_123])]) ).
cnf(c_0_129,hypothesis,
xS = slcrc0,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_124,c_0_125]),c_0_126]),c_0_117])]),c_0_127]) ).
cnf(c_0_130,plain,
( aSet0(X1)
| X1 != slcrc0 ),
i_0_7 ).
cnf(c_0_131,plain,
~ aSubsetOf0(slcrc0,slcrc0),
inference(rw,[status(thm)],[c_0_128,c_0_129]) ).
cnf(c_0_132,plain,
( aSubsetOf0(X1,X1)
| ~ aSet0(X1) ),
i_0_17 ).
cnf(c_0_133,plain,
aSet0(slcrc0),
inference(er,[status(thm)],[c_0_130]) ).
cnf(c_0_134,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_131,c_0_132]),c_0_133])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM545+1 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n026.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 00:24:40 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.42 # ENIGMATIC: Selected complete mode:
% 4.50/2.09 # ENIGMATIC: Solved by autoschedule-lgb:
% 4.50/2.09 # No SInE strategy applied
% 4.50/2.09 # Trying AutoSched0 for 150 seconds
% 4.50/2.09 # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 4.50/2.09 # and selection function SelectMaxLComplexAvoidPosPred.
% 4.50/2.09 #
% 4.50/2.09 # Preprocessing time : 0.024 s
% 4.50/2.09
% 4.50/2.09 # Proof found!
% 4.50/2.09 # SZS status Theorem
% 4.50/2.09 # SZS output start CNFRefutation
% See solution above
% 4.50/2.09 # Training examples: 0 positive, 0 negative
% 4.50/2.09
% 4.50/2.09 # -------------------------------------------------
% 4.50/2.09 # User time : 0.031 s
% 4.50/2.09 # System time : 0.006 s
% 4.50/2.09 # Total time : 0.037 s
% 4.50/2.09 # Maximum resident set size: 7120 pages
% 4.50/2.09
%------------------------------------------------------------------------------