TSTP Solution File: SEU160+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU160+2 : TPTP v8.1.0. Released v3.3.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 : Tue Jul 19 08:39:00 EDT 2022
% Result : Theorem 7.79s 2.38s
% Output : CNFRefutation 7.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 24 ( 10 unt; 7 nHn; 19 RR)
% Number of literals : 44 ( 23 equ; 15 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 13 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_145,plain,
( X1 = empty_set
| ~ empty(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7x9m4fcz/lgb.p',i_0_145) ).
cnf(i_0_99,plain,
empty(esk17_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7x9m4fcz/lgb.p',i_0_99) ).
cnf(i_0_94,lemma,
( X1 = empty_set
| X1 = unordered_pair(X2,X2)
| ~ subset(X1,unordered_pair(X2,X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7x9m4fcz/lgb.p',i_0_94) ).
cnf(i_0_128,negated_conjecture,
( esk20_0 = empty_set
| unordered_pair(esk21_0,esk21_0) = esk20_0
| subset(esk20_0,unordered_pair(esk21_0,esk21_0)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7x9m4fcz/lgb.p',i_0_128) ).
cnf(i_0_130,negated_conjecture,
( esk20_0 != empty_set
| ~ subset(esk20_0,unordered_pair(esk21_0,esk21_0)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7x9m4fcz/lgb.p',i_0_130) ).
cnf(i_0_129,negated_conjecture,
( unordered_pair(esk21_0,esk21_0) != esk20_0
| ~ subset(esk20_0,unordered_pair(esk21_0,esk21_0)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7x9m4fcz/lgb.p',i_0_129) ).
cnf(i_0_101,plain,
subset(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7x9m4fcz/lgb.p',i_0_101) ).
cnf(i_0_115,lemma,
subset(empty_set,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7x9m4fcz/lgb.p',i_0_115) ).
cnf(c_0_154,plain,
( X1 = empty_set
| ~ empty(X1) ),
i_0_145 ).
cnf(c_0_155,plain,
empty(esk17_0),
i_0_99 ).
cnf(c_0_156,lemma,
( X1 = empty_set
| X1 = unordered_pair(X2,X2)
| ~ subset(X1,unordered_pair(X2,X2)) ),
i_0_94 ).
cnf(c_0_157,plain,
empty_set = esk17_0,
inference(spm,[status(thm)],[c_0_154,c_0_155]) ).
cnf(c_0_158,negated_conjecture,
( esk20_0 = empty_set
| unordered_pair(esk21_0,esk21_0) = esk20_0
| subset(esk20_0,unordered_pair(esk21_0,esk21_0)) ),
i_0_128 ).
cnf(c_0_159,lemma,
( X1 = unordered_pair(X2,X2)
| X1 = esk17_0
| ~ subset(X1,unordered_pair(X2,X2)) ),
inference(rw,[status(thm)],[c_0_156,c_0_157]) ).
cnf(c_0_160,negated_conjecture,
( esk20_0 = unordered_pair(esk21_0,esk21_0)
| esk20_0 = esk17_0
| subset(esk20_0,unordered_pair(esk21_0,esk21_0)) ),
inference(rw,[status(thm)],[c_0_158,c_0_157]) ).
cnf(c_0_161,negated_conjecture,
( esk20_0 != empty_set
| ~ subset(esk20_0,unordered_pair(esk21_0,esk21_0)) ),
i_0_130 ).
cnf(c_0_162,negated_conjecture,
( unordered_pair(esk21_0,esk21_0) != esk20_0
| ~ subset(esk20_0,unordered_pair(esk21_0,esk21_0)) ),
i_0_129 ).
cnf(c_0_163,negated_conjecture,
( esk20_0 = unordered_pair(esk21_0,esk21_0)
| esk20_0 = esk17_0 ),
inference(spm,[status(thm)],[c_0_159,c_0_160]) ).
cnf(c_0_164,plain,
subset(X1,X1),
i_0_101 ).
cnf(c_0_165,lemma,
subset(empty_set,X1),
i_0_115 ).
cnf(c_0_166,negated_conjecture,
( esk20_0 != esk17_0
| ~ subset(esk20_0,unordered_pair(esk21_0,esk21_0)) ),
inference(rw,[status(thm)],[c_0_161,c_0_157]) ).
cnf(c_0_167,negated_conjecture,
esk20_0 = esk17_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_162,c_0_163]),c_0_164])]) ).
cnf(c_0_168,lemma,
subset(esk17_0,X1),
inference(rw,[status(thm)],[c_0_165,c_0_157]) ).
cnf(c_0_169,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_166,c_0_167]),c_0_167]),c_0_168])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU160+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n026.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jun 19 02:32:11 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 7.79/2.38 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.79/2.38 # No SInE strategy applied
% 7.79/2.38 # Trying AutoSched0 for 150 seconds
% 7.79/2.38 # AutoSched0-Mode selected heuristic G_E___107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y
% 7.79/2.38 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.79/2.38 #
% 7.79/2.38 # Preprocessing time : 0.013 s
% 7.79/2.38 # Presaturation interreduction done
% 7.79/2.38
% 7.79/2.38 # Proof found!
% 7.79/2.38 # SZS status Theorem
% 7.79/2.38 # SZS output start CNFRefutation
% See solution above
% 7.79/2.38 # Training examples: 0 positive, 0 negative
% 7.79/2.38
% 7.79/2.38 # -------------------------------------------------
% 7.79/2.38 # User time : 0.024 s
% 7.79/2.38 # System time : 0.002 s
% 7.79/2.38 # Total time : 0.026 s
% 7.79/2.38 # Maximum resident set size: 7124 pages
% 7.79/2.38
%------------------------------------------------------------------------------