TSTP Solution File: SEU212+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU212+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n011.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:35 EDT 2022
% Result : Theorem 8.32s 2.58s
% Output : CNFRefutation 8.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of clauses : 37 ( 11 unt; 8 nHn; 35 RR)
% Number of literals : 87 ( 16 equ; 47 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; 3 con; 0-2 aty)
% Number of variables : 43 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_377,negated_conjecture,
( in(esk70_0,relation_dom(esk72_0))
| in(unordered_pair(unordered_pair(esk70_0,esk71_0),unordered_pair(esk70_0,esk70_0)),esk72_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-codd3bx7/lgb.p',i_0_377) ).
cnf(i_0_5,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-codd3bx7/lgb.p',i_0_5) ).
cnf(i_0_105,plain,
( in(unordered_pair(unordered_pair(X1,X2),unordered_pair(X1,X1)),X3)
| X2 != apply(X3,X1)
| ~ function(X3)
| ~ relation(X3)
| ~ in(X1,relation_dom(X3)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-codd3bx7/lgb.p',i_0_105) ).
cnf(i_0_312,lemma,
( subset(unordered_pair(X1,X1),X2)
| ~ in(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-codd3bx7/lgb.p',i_0_312) ).
cnf(i_0_380,negated_conjecture,
relation(esk72_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-codd3bx7/lgb.p',i_0_380) ).
cnf(i_0_379,negated_conjecture,
function(esk72_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-codd3bx7/lgb.p',i_0_379) ).
cnf(i_0_376,negated_conjecture,
( apply(esk72_0,esk70_0) = esk71_0
| in(unordered_pair(unordered_pair(esk70_0,esk71_0),unordered_pair(esk70_0,esk70_0)),esk72_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-codd3bx7/lgb.p',i_0_376) ).
cnf(i_0_378,negated_conjecture,
( apply(esk72_0,esk70_0) != esk71_0
| ~ in(esk70_0,relation_dom(esk72_0))
| ~ in(unordered_pair(unordered_pair(esk70_0,esk71_0),unordered_pair(esk70_0,esk70_0)),esk72_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-codd3bx7/lgb.p',i_0_378) ).
cnf(i_0_316,lemma,
( in(X1,X2)
| ~ subset(unordered_pair(X1,X3),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-codd3bx7/lgb.p',i_0_316) ).
cnf(i_0_291,lemma,
( in(X1,relation_dom(X2))
| ~ relation(X2)
| ~ in(unordered_pair(unordered_pair(X1,X3),unordered_pair(X1,X1)),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-codd3bx7/lgb.p',i_0_291) ).
cnf(i_0_104,plain,
( X1 = apply(X2,X3)
| ~ function(X2)
| ~ relation(X2)
| ~ in(X3,relation_dom(X2))
| ~ in(unordered_pair(unordered_pair(X3,X1),unordered_pair(X3,X3)),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-codd3bx7/lgb.p',i_0_104) ).
cnf(c_0_392,negated_conjecture,
( in(esk70_0,relation_dom(esk72_0))
| in(unordered_pair(unordered_pair(esk70_0,esk71_0),unordered_pair(esk70_0,esk70_0)),esk72_0) ),
i_0_377 ).
cnf(c_0_393,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
i_0_5 ).
cnf(c_0_394,plain,
( in(unordered_pair(unordered_pair(X1,X2),unordered_pair(X1,X1)),X3)
| X2 != apply(X3,X1)
| ~ function(X3)
| ~ relation(X3)
| ~ in(X1,relation_dom(X3)) ),
i_0_105 ).
cnf(c_0_395,lemma,
( subset(unordered_pair(X1,X1),X2)
| ~ in(X1,X2) ),
i_0_312 ).
cnf(c_0_396,negated_conjecture,
( in(unordered_pair(unordered_pair(esk70_0,esk70_0),unordered_pair(esk70_0,esk71_0)),esk72_0)
| in(esk70_0,relation_dom(esk72_0)) ),
inference(rw,[status(thm)],[c_0_392,c_0_393]) ).
cnf(c_0_397,plain,
( in(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,apply(X2,X1))),X2)
| ~ relation(X2)
| ~ function(X2)
| ~ in(X1,relation_dom(X2)) ),
inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_394]),c_0_393]) ).
cnf(c_0_398,lemma,
( subset(unordered_pair(unordered_pair(unordered_pair(esk70_0,esk70_0),unordered_pair(esk70_0,esk71_0)),unordered_pair(unordered_pair(esk70_0,esk70_0),unordered_pair(esk70_0,esk71_0))),esk72_0)
| in(esk70_0,relation_dom(esk72_0)) ),
inference(spm,[status(thm)],[c_0_395,c_0_396]) ).
cnf(c_0_399,negated_conjecture,
relation(esk72_0),
i_0_380 ).
cnf(c_0_400,negated_conjecture,
function(esk72_0),
i_0_379 ).
cnf(c_0_401,negated_conjecture,
( apply(esk72_0,esk70_0) = esk71_0
| in(unordered_pair(unordered_pair(esk70_0,esk71_0),unordered_pair(esk70_0,esk70_0)),esk72_0) ),
i_0_376 ).
cnf(c_0_402,lemma,
( subset(unordered_pair(unordered_pair(unordered_pair(esk70_0,esk70_0),unordered_pair(esk70_0,esk71_0)),unordered_pair(unordered_pair(esk70_0,esk70_0),unordered_pair(esk70_0,esk71_0))),esk72_0)
| in(unordered_pair(unordered_pair(esk70_0,esk70_0),unordered_pair(esk70_0,apply(esk72_0,esk70_0))),esk72_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_397,c_0_398]),c_0_399]),c_0_400])]) ).
cnf(c_0_403,negated_conjecture,
( apply(esk72_0,esk70_0) = esk71_0
| in(unordered_pair(unordered_pair(esk70_0,esk70_0),unordered_pair(esk70_0,esk71_0)),esk72_0) ),
inference(rw,[status(thm)],[c_0_401,c_0_393]) ).
cnf(c_0_404,negated_conjecture,
( apply(esk72_0,esk70_0) != esk71_0
| ~ in(esk70_0,relation_dom(esk72_0))
| ~ in(unordered_pair(unordered_pair(esk70_0,esk71_0),unordered_pair(esk70_0,esk70_0)),esk72_0) ),
i_0_378 ).
cnf(c_0_405,lemma,
( in(X1,X2)
| ~ subset(unordered_pair(X1,X3),X2) ),
i_0_316 ).
cnf(c_0_406,negated_conjecture,
subset(unordered_pair(unordered_pair(unordered_pair(esk70_0,esk70_0),unordered_pair(esk70_0,esk71_0)),unordered_pair(unordered_pair(esk70_0,esk70_0),unordered_pair(esk70_0,esk71_0))),esk72_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_402,c_0_403]),c_0_395]) ).
cnf(c_0_407,lemma,
( in(X1,relation_dom(X2))
| ~ relation(X2)
| ~ in(unordered_pair(unordered_pair(X1,X3),unordered_pair(X1,X1)),X2) ),
i_0_291 ).
cnf(c_0_408,plain,
( X1 = apply(X2,X3)
| ~ function(X2)
| ~ relation(X2)
| ~ in(X3,relation_dom(X2))
| ~ in(unordered_pair(unordered_pair(X3,X1),unordered_pair(X3,X3)),X2) ),
i_0_104 ).
cnf(c_0_409,negated_conjecture,
( apply(esk72_0,esk70_0) != esk71_0
| ~ in(unordered_pair(unordered_pair(esk70_0,esk70_0),unordered_pair(esk70_0,esk71_0)),esk72_0)
| ~ in(esk70_0,relation_dom(esk72_0)) ),
inference(rw,[status(thm)],[c_0_404,c_0_393]) ).
cnf(c_0_410,lemma,
in(unordered_pair(unordered_pair(esk70_0,esk70_0),unordered_pair(esk70_0,esk71_0)),esk72_0),
inference(spm,[status(thm)],[c_0_405,c_0_406]) ).
cnf(c_0_411,plain,
( in(X1,relation_dom(X2))
| ~ relation(X2)
| ~ in(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,X3)),X2) ),
inference(spm,[status(thm)],[c_0_407,c_0_393]) ).
cnf(c_0_412,plain,
( X1 = apply(X2,X3)
| ~ relation(X2)
| ~ function(X2)
| ~ in(unordered_pair(unordered_pair(X3,X1),unordered_pair(X3,X3)),X2) ),
inference(csr,[status(thm)],[c_0_408,c_0_407]) ).
cnf(c_0_413,negated_conjecture,
( apply(esk72_0,esk70_0) != esk71_0
| ~ in(esk70_0,relation_dom(esk72_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_409,c_0_410])]) ).
cnf(c_0_414,lemma,
in(esk70_0,relation_dom(esk72_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_411,c_0_410]),c_0_399])]) ).
cnf(c_0_415,plain,
( X1 = apply(X2,X3)
| ~ relation(X2)
| ~ function(X2)
| ~ in(unordered_pair(unordered_pair(X3,X3),unordered_pair(X3,X1)),X2) ),
inference(spm,[status(thm)],[c_0_412,c_0_393]) ).
cnf(c_0_416,negated_conjecture,
apply(esk72_0,esk70_0) != esk71_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_413,c_0_414])]) ).
cnf(c_0_417,lemma,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_415,c_0_410]),c_0_399]),c_0_400])]),c_0_416]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU212+2 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n011.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 Jun 20 03:28:41 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.45 # ENIGMATIC: Selected complete mode:
% 8.32/2.58 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.32/2.58 # No SInE strategy applied
% 8.32/2.58 # Trying AutoSched0 for 150 seconds
% 8.32/2.58 # AutoSched0-Mode selected heuristic G_E___200_B02_F1_SE_CS_SP_PI_S0S
% 8.32/2.58 # and selection function SelectComplexG.
% 8.32/2.58 #
% 8.32/2.58 # Preprocessing time : 0.024 s
% 8.32/2.58
% 8.32/2.58 # Proof found!
% 8.32/2.58 # SZS status Theorem
% 8.32/2.58 # SZS output start CNFRefutation
% See solution above
% 8.32/2.58 # Training examples: 0 positive, 0 negative
% 8.32/2.58
% 8.32/2.58 # -------------------------------------------------
% 8.32/2.58 # User time : 0.090 s
% 8.32/2.58 # System time : 0.008 s
% 8.32/2.58 # Total time : 0.097 s
% 8.32/2.58 # Maximum resident set size: 7124 pages
% 8.32/2.58
%------------------------------------------------------------------------------