%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM538+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n021.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:07 EDT 2022
% Result : Theorem 7.68s 2.32s
% Output : CNFRefutation 7.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 14
% Syntax : Number of clauses : 35 ( 14 unt; 6 nHn; 35 RR)
% Number of literals : 87 ( 11 equ; 51 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 39 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_77,negated_conjecture,
( aElementOf0(X1,xS)
| ~ aElementOf0(X1,sdtmndt0(xS,xx)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0xbfrrup/lgb.p',i_0_77) ).
cnf(i_0_13,plain,
( aSubsetOf0(X1,X2)
| aElementOf0(esk2_2(X2,X1),X1)
| ~ aSet0(X1)
| ~ aSet0(X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0xbfrrup/lgb.p',i_0_13) ).
cnf(i_0_79,negated_conjecture,
aSet0(sdtmndt0(xS,xx)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0xbfrrup/lgb.p',i_0_79) ).
cnf(i_0_37,plain,
( aSet0(X1)
| X1 != sdtmndt0(X2,X3)
| ~ aSet0(X2)
| ~ aElement0(X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0xbfrrup/lgb.p',i_0_37) ).
cnf(i_0_12,plain,
( aSubsetOf0(X1,X2)
| ~ aSet0(X1)
| ~ aSet0(X2)
| ~ aElementOf0(esk2_2(X2,X1),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0xbfrrup/lgb.p',i_0_12) ).
cnf(i_0_71,hypothesis,
aSet0(xS),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0xbfrrup/lgb.p',i_0_71) ).
cnf(i_0_76,negated_conjecture,
( X1 != xx
| ~ aElementOf0(X1,sdtmndt0(xS,xx)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0xbfrrup/lgb.p',i_0_76) ).
cnf(i_0_70,plain,
( sbrdtbr0(sdtpldt0(X1,X2)) = szszuzczcdt0(sbrdtbr0(X1))
| aElementOf0(X2,X1)
| ~ aSet0(X1)
| ~ aElement0(X2)
| ~ isFinite0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0xbfrrup/lgb.p',i_0_70) ).
cnf(i_0_38,plain,
( sdtpldt0(sdtmndt0(X1,X2),X2) = X1
| ~ aSet0(X1)
| ~ aElementOf0(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0xbfrrup/lgb.p',i_0_38) ).
cnf(i_0_3,plain,
( aElement0(X1)
| ~ aSet0(X2)
| ~ aElementOf0(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0xbfrrup/lgb.p',i_0_3) ).
cnf(i_0_16,plain,
( isFinite0(X1)
| ~ aSet0(X2)
| ~ isFinite0(X2)
| ~ aSubsetOf0(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0xbfrrup/lgb.p',i_0_16) ).
cnf(i_0_73,hypothesis,
isFinite0(xS),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0xbfrrup/lgb.p',i_0_73) ).
cnf(i_0_72,hypothesis,
aElementOf0(xx,xS),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0xbfrrup/lgb.p',i_0_72) ).
cnf(i_0_74,negated_conjecture,
szszuzczcdt0(sbrdtbr0(sdtmndt0(xS,xx))) != sbrdtbr0(xS),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0xbfrrup/lgb.p',i_0_74) ).
cnf(c_0_94,negated_conjecture,
( aElementOf0(X1,xS)
| ~ aElementOf0(X1,sdtmndt0(xS,xx)) ),
i_0_77 ).
cnf(c_0_95,plain,
( aSubsetOf0(X1,X2)
| aElementOf0(esk2_2(X2,X1),X1)
| ~ aSet0(X1)
| ~ aSet0(X2) ),
i_0_13 ).
cnf(c_0_96,negated_conjecture,
aSet0(sdtmndt0(xS,xx)),
i_0_79 ).
cnf(c_0_97,plain,
( aSet0(X1)
| X1 != sdtmndt0(X2,X3)
| ~ aSet0(X2)
| ~ aElement0(X3) ),
i_0_37 ).
cnf(c_0_98,plain,
( aSubsetOf0(X1,X2)
| ~ aSet0(X1)
| ~ aSet0(X2)
| ~ aElementOf0(esk2_2(X2,X1),X2) ),
i_0_12 ).
cnf(c_0_99,negated_conjecture,
( aElementOf0(esk2_2(X1,sdtmndt0(xS,xx)),xS)
| aSubsetOf0(sdtmndt0(xS,xx),X1)
| ~ aSet0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_95]),c_0_96])]) ).
cnf(c_0_100,hypothesis,
aSet0(xS),
i_0_71 ).
cnf(c_0_101,negated_conjecture,
( X1 != xx
| ~ aElementOf0(X1,sdtmndt0(xS,xx)) ),
i_0_76 ).
cnf(c_0_102,plain,
( sbrdtbr0(sdtpldt0(X1,X2)) = szszuzczcdt0(sbrdtbr0(X1))
| aElementOf0(X2,X1)
| ~ aSet0(X1)
| ~ aElement0(X2)
| ~ isFinite0(X1) ),
i_0_70 ).
cnf(c_0_103,plain,
( sdtpldt0(sdtmndt0(X1,X2),X2) = X1
| ~ aSet0(X1)
| ~ aElementOf0(X2,X1) ),
i_0_38 ).
cnf(c_0_104,plain,
( aSet0(sdtmndt0(X1,X2))
| ~ aElement0(X2)
| ~ aSet0(X1) ),
inference(er,[status(thm)],[c_0_97]) ).
cnf(c_0_105,plain,
( aElement0(X1)
| ~ aSet0(X2)
| ~ aElementOf0(X1,X2) ),
i_0_3 ).
cnf(c_0_106,plain,
( isFinite0(X1)
| ~ aSet0(X2)
| ~ isFinite0(X2)
| ~ aSubsetOf0(X1,X2) ),
i_0_16 ).
cnf(c_0_107,plain,
aSubsetOf0(sdtmndt0(xS,xx),xS),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_99]),c_0_100]),c_0_96])]) ).
cnf(c_0_108,hypothesis,
isFinite0(xS),
i_0_73 ).
cnf(c_0_109,negated_conjecture,
~ aElementOf0(xx,sdtmndt0(xS,xx)),
inference(er,[status(thm)],[c_0_101]) ).
cnf(c_0_110,plain,
( szszuzczcdt0(sbrdtbr0(sdtmndt0(X1,X2))) = sbrdtbr0(X1)
| aElementOf0(X2,sdtmndt0(X1,X2))
| ~ isFinite0(sdtmndt0(X1,X2))
| ~ aSet0(X1)
| ~ aElementOf0(X2,X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_103]),c_0_104]),c_0_105]) ).
cnf(c_0_111,plain,
isFinite0(sdtmndt0(xS,xx)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_106,c_0_107]),c_0_108]),c_0_100])]) ).
cnf(c_0_112,hypothesis,
aElementOf0(xx,xS),
i_0_72 ).
cnf(c_0_113,negated_conjecture,
szszuzczcdt0(sbrdtbr0(sdtmndt0(xS,xx))) != sbrdtbr0(xS),
i_0_74 ).
cnf(c_0_114,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_110]),c_0_111]),c_0_100]),c_0_112])]),c_0_113]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : NUM538+2 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n021.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 01:38:35 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 7.68/2.32 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.68/2.32 # No SInE strategy applied
% 7.68/2.32 # Trying AutoSched0 for 150 seconds
% 7.68/2.32 # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 7.68/2.32 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.68/2.32 #
% 7.68/2.32 # Preprocessing time : 0.013 s
% 7.68/2.32
% 7.68/2.32 # Proof found!
% 7.68/2.32 # SZS status Theorem
% 7.68/2.32 # SZS output start CNFRefutation
% See solution above
% 7.68/2.32 # Training examples: 0 positive, 0 negative
% 7.68/2.32
% 7.68/2.32 # -------------------------------------------------
% 7.68/2.32 # User time : 0.018 s
% 7.68/2.32 # System time : 0.002 s
% 7.68/2.32 # Total time : 0.020 s
% 7.68/2.32 # Maximum resident set size: 7124 pages
% 7.68/2.32
%------------------------------------------------------------------------------