TSTP Solution File: RNG106+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : RNG106+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n023.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 20:25:00 EDT 2022
% Result : Theorem 7.41s 2.34s
% Output : CNFRefutation 7.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of clauses : 31 ( 6 unt; 8 nHn; 31 RR)
% Number of literals : 92 ( 2 equ; 56 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 1 con; 0-2 aty)
% Number of variables : 31 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_96,negated_conjecture,
( aElementOf0(sdtpldt0(X1,X2),slsdtgt0(xc))
| ~ aElement0(X3)
| ~ aElementOf0(X2,slsdtgt0(xc))
| ~ aElementOf0(X1,slsdtgt0(xc)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tuhtqdtv/input.p',i_0_96) ).
cnf(i_0_93,hypothesis,
aElement0(xc),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tuhtqdtv/input.p',i_0_93) ).
cnf(i_0_48,plain,
( aIdeal0(X1)
| aElement0(esk11_1(X1))
| ~ aSet0(X1)
| ~ aElementOf0(sdtpldt0(esk9_1(X1),esk10_1(X1)),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tuhtqdtv/input.p',i_0_48) ).
cnf(i_0_94,negated_conjecture,
~ aIdeal0(slsdtgt0(xc)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tuhtqdtv/input.p',i_0_94) ).
cnf(i_0_50,plain,
( aIdeal0(X1)
| aElement0(esk11_1(X1))
| aElementOf0(esk10_1(X1),X1)
| ~ aSet0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tuhtqdtv/input.p',i_0_50) ).
cnf(i_0_95,negated_conjecture,
( aElementOf0(sdtasdt0(X1,X2),slsdtgt0(xc))
| ~ aElement0(X1)
| ~ aElementOf0(X3,slsdtgt0(xc))
| ~ aElementOf0(X2,slsdtgt0(xc)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tuhtqdtv/input.p',i_0_95) ).
cnf(i_0_51,plain,
( aIdeal0(X1)
| aElementOf0(esk9_1(X1),X1)
| ~ aSet0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tuhtqdtv/input.p',i_0_51) ).
cnf(i_0_49,plain,
( aIdeal0(X1)
| aElementOf0(esk10_1(X1),X1)
| ~ aSet0(X1)
| ~ aElementOf0(sdtasdt0(esk11_1(X1),esk9_1(X1)),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tuhtqdtv/input.p',i_0_49) ).
cnf(i_0_47,plain,
( aIdeal0(X1)
| ~ aSet0(X1)
| ~ aElementOf0(sdtpldt0(esk9_1(X1),esk10_1(X1)),X1)
| ~ aElementOf0(sdtasdt0(esk11_1(X1),esk9_1(X1)),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tuhtqdtv/input.p',i_0_47) ).
cnf(i_0_92,plain,
( aSet0(X1)
| X1 != slsdtgt0(X2)
| ~ aElement0(X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tuhtqdtv/input.p',i_0_92) ).
cnf(c_0_107,negated_conjecture,
( aElementOf0(sdtpldt0(X1,X2),slsdtgt0(xc))
| ~ aElement0(X3)
| ~ aElementOf0(X2,slsdtgt0(xc))
| ~ aElementOf0(X1,slsdtgt0(xc)) ),
i_0_96 ).
cnf(c_0_108,hypothesis,
aElement0(xc),
i_0_93 ).
cnf(c_0_109,plain,
( aIdeal0(X1)
| aElement0(esk11_1(X1))
| ~ aSet0(X1)
| ~ aElementOf0(sdtpldt0(esk9_1(X1),esk10_1(X1)),X1) ),
i_0_48 ).
cnf(c_0_110,hypothesis,
( aElementOf0(sdtpldt0(X1,X2),slsdtgt0(xc))
| ~ aElementOf0(X2,slsdtgt0(xc))
| ~ aElementOf0(X1,slsdtgt0(xc)) ),
inference(spm,[status(thm)],[c_0_107,c_0_108]) ).
cnf(c_0_111,negated_conjecture,
~ aIdeal0(slsdtgt0(xc)),
i_0_94 ).
cnf(c_0_112,plain,
( aElement0(esk11_1(slsdtgt0(xc)))
| ~ aElementOf0(esk10_1(slsdtgt0(xc)),slsdtgt0(xc))
| ~ aElementOf0(esk9_1(slsdtgt0(xc)),slsdtgt0(xc))
| ~ aSet0(slsdtgt0(xc)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_110]),c_0_111]) ).
cnf(c_0_113,plain,
( aIdeal0(X1)
| aElement0(esk11_1(X1))
| aElementOf0(esk10_1(X1),X1)
| ~ aSet0(X1) ),
i_0_50 ).
cnf(c_0_114,negated_conjecture,
( aElementOf0(sdtasdt0(X1,X2),slsdtgt0(xc))
| ~ aElement0(X1)
| ~ aElementOf0(X3,slsdtgt0(xc))
| ~ aElementOf0(X2,slsdtgt0(xc)) ),
i_0_95 ).
cnf(c_0_115,plain,
( aIdeal0(X1)
| aElementOf0(esk9_1(X1),X1)
| ~ aSet0(X1) ),
i_0_51 ).
cnf(c_0_116,plain,
( aElement0(esk11_1(slsdtgt0(xc)))
| ~ aElementOf0(esk9_1(slsdtgt0(xc)),slsdtgt0(xc))
| ~ aSet0(slsdtgt0(xc)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_112,c_0_113]),c_0_111]) ).
cnf(c_0_117,plain,
( aIdeal0(X1)
| aElementOf0(esk10_1(X1),X1)
| ~ aSet0(X1)
| ~ aElementOf0(sdtasdt0(esk11_1(X1),esk9_1(X1)),X1) ),
i_0_49 ).
cnf(c_0_118,negated_conjecture,
( aElementOf0(sdtasdt0(X1,X2),slsdtgt0(xc))
| ~ aElementOf0(X2,slsdtgt0(xc))
| ~ aSet0(slsdtgt0(xc))
| ~ aElement0(X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_114,c_0_115]),c_0_111]) ).
cnf(c_0_119,plain,
( aElement0(esk11_1(slsdtgt0(xc)))
| ~ aSet0(slsdtgt0(xc)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_116,c_0_115]),c_0_111]) ).
cnf(c_0_120,plain,
( aIdeal0(X1)
| ~ aSet0(X1)
| ~ aElementOf0(sdtpldt0(esk9_1(X1),esk10_1(X1)),X1)
| ~ aElementOf0(sdtasdt0(esk11_1(X1),esk9_1(X1)),X1) ),
i_0_47 ).
cnf(c_0_121,plain,
( aElementOf0(esk10_1(slsdtgt0(xc)),slsdtgt0(xc))
| ~ aElementOf0(esk9_1(slsdtgt0(xc)),slsdtgt0(xc))
| ~ aSet0(slsdtgt0(xc)) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_117,c_0_118]),c_0_111]),c_0_119]) ).
cnf(c_0_122,plain,
( ~ aElementOf0(sdtasdt0(esk11_1(slsdtgt0(xc)),esk9_1(slsdtgt0(xc))),slsdtgt0(xc))
| ~ aElementOf0(esk9_1(slsdtgt0(xc)),slsdtgt0(xc))
| ~ aSet0(slsdtgt0(xc)) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_120,c_0_110]),c_0_111]),c_0_121]) ).
cnf(c_0_123,negated_conjecture,
( ~ aElementOf0(esk9_1(slsdtgt0(xc)),slsdtgt0(xc))
| ~ aSet0(slsdtgt0(xc)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_122,c_0_118]),c_0_119]) ).
cnf(c_0_124,plain,
( aSet0(X1)
| X1 != slsdtgt0(X2)
| ~ aElement0(X2) ),
i_0_92 ).
cnf(c_0_125,plain,
~ aSet0(slsdtgt0(xc)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_123,c_0_115]),c_0_111]) ).
cnf(c_0_126,plain,
( aSet0(slsdtgt0(X1))
| ~ aElement0(X1) ),
inference(er,[status(thm)],[c_0_124]) ).
cnf(c_0_127,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_125,c_0_126]),c_0_108])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : RNG106+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n023.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 : Mon May 30 12:05:58 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 7.41/2.34 # ENIGMATIC: Solved by autoschedule:
% 7.41/2.34 # No SInE strategy applied
% 7.41/2.34 # Trying AutoSched0 for 150 seconds
% 7.41/2.34 # AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_SE_Q4_CS_SP_S0Y
% 7.41/2.34 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.41/2.34 #
% 7.41/2.34 # Preprocessing time : 0.025 s
% 7.41/2.34
% 7.41/2.34 # Proof found!
% 7.41/2.34 # SZS status Theorem
% 7.41/2.34 # SZS output start CNFRefutation
% See solution above
% 7.41/2.34 # Training examples: 0 positive, 0 negative
% 7.41/2.34
% 7.41/2.34 # -------------------------------------------------
% 7.41/2.34 # User time : 0.041 s
% 7.41/2.34 # System time : 0.005 s
% 7.41/2.34 # Total time : 0.046 s
% 7.41/2.34 # Maximum resident set size: 7120 pages
% 7.41/2.34
%------------------------------------------------------------------------------