TSTP Solution File: SEU221+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU221+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n015.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:43 EDT 2022
% Result : Theorem 8.00s 2.42s
% Output : CNFRefutation 8.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of clauses : 37 ( 17 unt; 9 nHn; 37 RR)
% Number of literals : 93 ( 12 equ; 51 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 5 ( 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 : 21 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_141,plain,
( one_to_one(X1)
| in(esk48_1(X1),relation_dom(X1))
| ~ function(X1)
| ~ relation(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gabq280d/lgb.p',i_0_141) ).
cnf(i_0_167,plain,
( relation(function_inverse(X1))
| ~ function(X1)
| ~ relation(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gabq280d/lgb.p',i_0_167) ).
cnf(i_0_166,plain,
( function(function_inverse(X1))
| ~ function(X1)
| ~ relation(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gabq280d/lgb.p',i_0_166) ).
cnf(i_0_140,plain,
( apply(X1,esk47_1(X1)) = apply(X1,esk48_1(X1))
| one_to_one(X1)
| ~ function(X1)
| ~ relation(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gabq280d/lgb.p',i_0_140) ).
cnf(i_0_408,negated_conjecture,
relation(esk79_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gabq280d/lgb.p',i_0_408) ).
cnf(i_0_407,negated_conjecture,
function(esk79_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gabq280d/lgb.p',i_0_407) ).
cnf(i_0_405,negated_conjecture,
~ one_to_one(function_inverse(esk79_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gabq280d/lgb.p',i_0_405) ).
cnf(i_0_142,plain,
( one_to_one(X1)
| in(esk47_1(X1),relation_dom(X1))
| ~ function(X1)
| ~ relation(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gabq280d/lgb.p',i_0_142) ).
cnf(i_0_397,lemma,
( relation_dom(function_inverse(X1)) = relation_rng(X1)
| ~ function(X1)
| ~ relation(X1)
| ~ one_to_one(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gabq280d/lgb.p',i_0_397) ).
cnf(i_0_406,negated_conjecture,
one_to_one(esk79_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gabq280d/lgb.p',i_0_406) ).
cnf(i_0_400,lemma,
( apply(X1,apply(function_inverse(X1),X2)) = X2
| ~ function(X1)
| ~ relation(X1)
| ~ one_to_one(X1)
| ~ in(X2,relation_rng(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gabq280d/lgb.p',i_0_400) ).
cnf(i_0_139,plain,
( one_to_one(X1)
| esk47_1(X1) != esk48_1(X1)
| ~ function(X1)
| ~ relation(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gabq280d/lgb.p',i_0_139) ).
cnf(c_0_421,plain,
( one_to_one(X1)
| in(esk48_1(X1),relation_dom(X1))
| ~ function(X1)
| ~ relation(X1) ),
i_0_141 ).
cnf(c_0_422,plain,
( relation(function_inverse(X1))
| ~ function(X1)
| ~ relation(X1) ),
i_0_167 ).
cnf(c_0_423,plain,
( function(function_inverse(X1))
| ~ function(X1)
| ~ relation(X1) ),
i_0_166 ).
cnf(c_0_424,plain,
( apply(X1,esk47_1(X1)) = apply(X1,esk48_1(X1))
| one_to_one(X1)
| ~ function(X1)
| ~ relation(X1) ),
i_0_140 ).
cnf(c_0_425,plain,
( in(esk48_1(function_inverse(X1)),relation_dom(function_inverse(X1)))
| one_to_one(function_inverse(X1))
| ~ relation(X1)
| ~ function(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_421,c_0_422]),c_0_423]) ).
cnf(c_0_426,negated_conjecture,
relation(esk79_0),
i_0_408 ).
cnf(c_0_427,negated_conjecture,
function(esk79_0),
i_0_407 ).
cnf(c_0_428,negated_conjecture,
~ one_to_one(function_inverse(esk79_0)),
i_0_405 ).
cnf(c_0_429,plain,
( one_to_one(X1)
| in(esk47_1(X1),relation_dom(X1))
| ~ function(X1)
| ~ relation(X1) ),
i_0_142 ).
cnf(c_0_430,plain,
( apply(function_inverse(X1),esk48_1(function_inverse(X1))) = apply(function_inverse(X1),esk47_1(function_inverse(X1)))
| one_to_one(function_inverse(X1))
| ~ relation(X1)
| ~ function(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_424,c_0_422]),c_0_423]) ).
cnf(c_0_431,negated_conjecture,
in(esk48_1(function_inverse(esk79_0)),relation_dom(function_inverse(esk79_0))),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_425,c_0_426]),c_0_427])]),c_0_428]) ).
cnf(c_0_432,lemma,
( relation_dom(function_inverse(X1)) = relation_rng(X1)
| ~ function(X1)
| ~ relation(X1)
| ~ one_to_one(X1) ),
i_0_397 ).
cnf(c_0_433,negated_conjecture,
one_to_one(esk79_0),
i_0_406 ).
cnf(c_0_434,plain,
( in(esk47_1(function_inverse(X1)),relation_dom(function_inverse(X1)))
| one_to_one(function_inverse(X1))
| ~ relation(X1)
| ~ function(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_429,c_0_422]),c_0_423]) ).
cnf(c_0_435,lemma,
( apply(X1,apply(function_inverse(X1),X2)) = X2
| ~ function(X1)
| ~ relation(X1)
| ~ one_to_one(X1)
| ~ in(X2,relation_rng(X1)) ),
i_0_400 ).
cnf(c_0_436,negated_conjecture,
apply(function_inverse(esk79_0),esk48_1(function_inverse(esk79_0))) = apply(function_inverse(esk79_0),esk47_1(function_inverse(esk79_0))),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_430,c_0_426]),c_0_427])]),c_0_428]) ).
cnf(c_0_437,lemma,
in(esk48_1(function_inverse(esk79_0)),relation_rng(esk79_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_431,c_0_432]),c_0_426]),c_0_427]),c_0_433])]) ).
cnf(c_0_438,negated_conjecture,
in(esk47_1(function_inverse(esk79_0)),relation_dom(function_inverse(esk79_0))),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_434,c_0_426]),c_0_427])]),c_0_428]) ).
cnf(c_0_439,lemma,
apply(esk79_0,apply(function_inverse(esk79_0),esk47_1(function_inverse(esk79_0)))) = esk48_1(function_inverse(esk79_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_435,c_0_436]),c_0_437]),c_0_426]),c_0_427]),c_0_433])]) ).
cnf(c_0_440,lemma,
in(esk47_1(function_inverse(esk79_0)),relation_rng(esk79_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_438,c_0_432]),c_0_426]),c_0_427]),c_0_433])]) ).
cnf(c_0_441,plain,
( one_to_one(X1)
| esk47_1(X1) != esk48_1(X1)
| ~ function(X1)
| ~ relation(X1) ),
i_0_139 ).
cnf(c_0_442,lemma,
esk48_1(function_inverse(esk79_0)) = esk47_1(function_inverse(esk79_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_435,c_0_439]),c_0_440]),c_0_426]),c_0_427]),c_0_433])]) ).
cnf(c_0_443,plain,
( ~ relation(function_inverse(esk79_0))
| ~ function(function_inverse(esk79_0)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_441,c_0_442]),c_0_428]) ).
cnf(c_0_444,plain,
~ relation(function_inverse(esk79_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_443,c_0_423]),c_0_426]),c_0_427])]) ).
cnf(c_0_445,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_444,c_0_422]),c_0_426]),c_0_427])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SEU221+2 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n015.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jun 19 06:59:01 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 8.00/2.42 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.00/2.42 # No SInE strategy applied
% 8.00/2.42 # Trying AutoSched0 for 150 seconds
% 8.00/2.42 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 8.00/2.42 # and selection function SelectComplexExceptUniqMaxHorn.
% 8.00/2.42 #
% 8.00/2.42 # Preprocessing time : 0.024 s
% 8.00/2.42 # Presaturation interreduction done
% 8.00/2.42
% 8.00/2.42 # Proof found!
% 8.00/2.42 # SZS status Theorem
% 8.00/2.42 # SZS output start CNFRefutation
% See solution above
% 8.00/2.42 # Training examples: 0 positive, 0 negative
% 8.00/2.42
% 8.00/2.42 # -------------------------------------------------
% 8.00/2.42 # User time : 0.051 s
% 8.00/2.42 # System time : 0.007 s
% 8.00/2.42 # Total time : 0.058 s
% 8.00/2.42 # Maximum resident set size: 7124 pages
% 8.00/2.42
%------------------------------------------------------------------------------