%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM538+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n003.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 8.40s 2.39s
% Output : CNFRefutation 8.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 27 ( 11 unt; 4 nHn; 27 RR)
% Number of literals : 75 ( 14 equ; 49 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 38 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_37,plain,
( aSet0(X1)
| X1 != sdtmndt0(X2,X3)
| ~ aSet0(X2)
| ~ aElement0(X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q_pa_xg_/lgb.p',i_0_37) ).
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-q_pa_xg_/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-q_pa_xg_/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-q_pa_xg_/lgb.p',i_0_3) ).
cnf(i_0_43,plain,
( isFinite0(sdtmndt0(X1,X2))
| ~ aSet0(X1)
| ~ aElement0(X2)
| ~ isFinite0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q_pa_xg_/lgb.p',i_0_43) ).
cnf(i_0_34,plain,
( X1 != X2
| X3 != sdtmndt0(X4,X2)
| ~ aSet0(X4)
| ~ aElement0(X2)
| ~ aElementOf0(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q_pa_xg_/lgb.p',i_0_34) ).
cnf(i_0_72,hypothesis,
aElementOf0(xx,xS),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q_pa_xg_/lgb.p',i_0_72) ).
cnf(i_0_73,hypothesis,
isFinite0(xS),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q_pa_xg_/lgb.p',i_0_73) ).
cnf(i_0_71,hypothesis,
aSet0(xS),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q_pa_xg_/lgb.p',i_0_71) ).
cnf(i_0_74,negated_conjecture,
szszuzczcdt0(sbrdtbr0(sdtmndt0(xS,xx))) != sbrdtbr0(xS),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q_pa_xg_/lgb.p',i_0_74) ).
cnf(c_0_85,plain,
( aSet0(X1)
| X1 != sdtmndt0(X2,X3)
| ~ aSet0(X2)
| ~ aElement0(X3) ),
i_0_37 ).
cnf(c_0_86,plain,
( sbrdtbr0(sdtpldt0(X1,X2)) = szszuzczcdt0(sbrdtbr0(X1))
| aElementOf0(X2,X1)
| ~ aSet0(X1)
| ~ aElement0(X2)
| ~ isFinite0(X1) ),
i_0_70 ).
cnf(c_0_87,plain,
( sdtpldt0(sdtmndt0(X1,X2),X2) = X1
| ~ aSet0(X1)
| ~ aElementOf0(X2,X1) ),
i_0_38 ).
cnf(c_0_88,plain,
( aSet0(sdtmndt0(X1,X2))
| ~ aElement0(X2)
| ~ aSet0(X1) ),
inference(er,[status(thm)],[c_0_85]) ).
cnf(c_0_89,plain,
( aElement0(X1)
| ~ aSet0(X2)
| ~ aElementOf0(X1,X2) ),
i_0_3 ).
cnf(c_0_90,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_86,c_0_87]),c_0_88]),c_0_89]) ).
cnf(c_0_91,plain,
( isFinite0(sdtmndt0(X1,X2))
| ~ aSet0(X1)
| ~ aElement0(X2)
| ~ isFinite0(X1) ),
i_0_43 ).
cnf(c_0_92,plain,
( X1 != X2
| X3 != sdtmndt0(X4,X2)
| ~ aSet0(X4)
| ~ aElement0(X2)
| ~ aElementOf0(X1,X3) ),
i_0_34 ).
cnf(c_0_93,plain,
( szszuzczcdt0(sbrdtbr0(sdtmndt0(X1,X2))) = sbrdtbr0(X1)
| aElementOf0(X2,sdtmndt0(X1,X2))
| ~ isFinite0(X1)
| ~ aSet0(X1)
| ~ aElementOf0(X2,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_89]) ).
cnf(c_0_94,hypothesis,
aElementOf0(xx,xS),
i_0_72 ).
cnf(c_0_95,hypothesis,
isFinite0(xS),
i_0_73 ).
cnf(c_0_96,hypothesis,
aSet0(xS),
i_0_71 ).
cnf(c_0_97,negated_conjecture,
szszuzczcdt0(sbrdtbr0(sdtmndt0(xS,xx))) != sbrdtbr0(xS),
i_0_74 ).
cnf(c_0_98,plain,
( ~ aElement0(X1)
| ~ aSet0(X2)
| ~ aElementOf0(X1,sdtmndt0(X2,X1)) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_92])]) ).
cnf(c_0_99,hypothesis,
aElementOf0(xx,sdtmndt0(xS,xx)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_94]),c_0_95]),c_0_96])]),c_0_97]) ).
cnf(c_0_100,hypothesis,
aElement0(xx),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_94]),c_0_96])]) ).
cnf(c_0_101,plain,
$false,
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])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : NUM538+1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n003.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 20:09:43 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 8.40/2.39 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.40/2.39 # No SInE strategy applied
% 8.40/2.39 # Trying AutoSched0 for 150 seconds
% 8.40/2.39 # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 8.40/2.39 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.40/2.39 #
% 8.40/2.39 # Preprocessing time : 0.024 s
% 8.40/2.39
% 8.40/2.39 # Proof found!
% 8.40/2.39 # SZS status Theorem
% 8.40/2.39 # SZS output start CNFRefutation
% See solution above
% 8.40/2.39 # Training examples: 0 positive, 0 negative
% 8.40/2.39
% 8.40/2.39 # -------------------------------------------------
% 8.40/2.39 # User time : 0.057 s
% 8.40/2.39 # System time : 0.006 s
% 8.40/2.39 # Total time : 0.063 s
% 8.40/2.39 # Maximum resident set size: 7124 pages
% 8.40/2.39
%------------------------------------------------------------------------------