TSTP Solution File: SEU225+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU225+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:46 EDT 2022
% Result : Theorem 8.74s 2.53s
% Output : CNFRefutation 8.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 25 ( 12 unt; 3 nHn; 20 RR)
% Number of literals : 57 ( 12 equ; 36 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 28 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_106,plain,
( X1 = empty_set
| in(X2,relation_dom(X3))
| X1 != apply(X3,X2)
| ~ function(X3)
| ~ relation(X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-25wch9th/lgb.p',i_0_106) ).
cnf(i_0_430,negated_conjecture,
apply(relation_dom_restriction(esk82_0,esk80_0),esk81_0) != apply(esk82_0,esk81_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-25wch9th/lgb.p',i_0_430) ).
cnf(i_0_427,lemma,
( apply(relation_dom_restriction(X1,X2),X3) = apply(X1,X3)
| ~ function(X1)
| ~ relation(X1)
| ~ in(X3,relation_dom(relation_dom_restriction(X1,X2))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-25wch9th/lgb.p',i_0_427) ).
cnf(i_0_433,negated_conjecture,
relation(esk82_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-25wch9th/lgb.p',i_0_433) ).
cnf(i_0_432,negated_conjecture,
function(esk82_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-25wch9th/lgb.p',i_0_432) ).
cnf(i_0_215,plain,
( function(relation_dom_restriction(X1,X2))
| ~ function(X1)
| ~ relation(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-25wch9th/lgb.p',i_0_215) ).
cnf(i_0_185,plain,
( relation(relation_dom_restriction(X1,X2))
| ~ relation(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-25wch9th/lgb.p',i_0_185) ).
cnf(i_0_441,lemma,
( in(X1,relation_dom(relation_dom_restriction(X2,X3)))
| ~ relation(X2)
| ~ in(X1,X3)
| ~ in(X1,relation_dom(X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-25wch9th/lgb.p',i_0_441) ).
cnf(i_0_431,negated_conjecture,
in(esk81_0,esk80_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-25wch9th/lgb.p',i_0_431) ).
cnf(c_0_451,plain,
( X1 = empty_set
| in(X2,relation_dom(X3))
| X1 != apply(X3,X2)
| ~ function(X3)
| ~ relation(X3) ),
i_0_106 ).
cnf(c_0_452,negated_conjecture,
apply(relation_dom_restriction(esk82_0,esk80_0),esk81_0) != apply(esk82_0,esk81_0),
i_0_430 ).
cnf(c_0_453,lemma,
( apply(relation_dom_restriction(X1,X2),X3) = apply(X1,X3)
| ~ function(X1)
| ~ relation(X1)
| ~ in(X3,relation_dom(relation_dom_restriction(X1,X2))) ),
i_0_427 ).
cnf(c_0_454,negated_conjecture,
relation(esk82_0),
i_0_433 ).
cnf(c_0_455,negated_conjecture,
function(esk82_0),
i_0_432 ).
cnf(c_0_456,plain,
( apply(X1,X2) = empty_set
| in(X2,relation_dom(X1))
| ~ relation(X1)
| ~ function(X1) ),
inference(er,[status(thm)],[c_0_451]) ).
cnf(c_0_457,negated_conjecture,
~ in(esk81_0,relation_dom(relation_dom_restriction(esk82_0,esk80_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_452,c_0_453]),c_0_454]),c_0_455])]) ).
cnf(c_0_458,negated_conjecture,
( apply(esk82_0,esk81_0) != empty_set
| ~ relation(relation_dom_restriction(esk82_0,esk80_0))
| ~ function(relation_dom_restriction(esk82_0,esk80_0)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_452,c_0_456]),c_0_457]) ).
cnf(c_0_459,plain,
( function(relation_dom_restriction(X1,X2))
| ~ function(X1)
| ~ relation(X1) ),
i_0_215 ).
cnf(c_0_460,plain,
( apply(esk82_0,esk81_0) != empty_set
| ~ relation(relation_dom_restriction(esk82_0,esk80_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_458,c_0_459]),c_0_454]),c_0_455])]) ).
cnf(c_0_461,plain,
( relation(relation_dom_restriction(X1,X2))
| ~ relation(X1) ),
i_0_185 ).
cnf(c_0_462,lemma,
( in(X1,relation_dom(relation_dom_restriction(X2,X3)))
| ~ relation(X2)
| ~ in(X1,X3)
| ~ in(X1,relation_dom(X2)) ),
i_0_441 ).
cnf(c_0_463,negated_conjecture,
in(esk81_0,esk80_0),
i_0_431 ).
cnf(c_0_464,plain,
apply(esk82_0,esk81_0) != empty_set,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_460,c_0_461]),c_0_454])]) ).
cnf(c_0_465,lemma,
~ in(esk81_0,relation_dom(esk82_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_457,c_0_462]),c_0_454]),c_0_463])]) ).
cnf(c_0_466,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_464,c_0_456]),c_0_454]),c_0_455])]),c_0_465]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU225+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.33 % Computer : n011.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 600
% 0.14/0.33 % DateTime : Sun Jun 19 15:48:10 EDT 2022
% 0.14/0.33 % CPUTime :
% 0.20/0.44 # ENIGMATIC: Selected complete mode:
% 8.74/2.53 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.74/2.53 # No SInE strategy applied
% 8.74/2.53 # Trying AutoSched0 for 150 seconds
% 8.74/2.53 # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S0Y
% 8.74/2.53 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.74/2.53 #
% 8.74/2.53 # Preprocessing time : 0.027 s
% 8.74/2.53
% 8.74/2.53 # Proof found!
% 8.74/2.53 # SZS status Theorem
% 8.74/2.53 # SZS output start CNFRefutation
% See solution above
% 8.74/2.53 # Training examples: 0 positive, 0 negative
% 8.74/2.53
% 8.74/2.53 # -------------------------------------------------
% 8.74/2.53 # User time : 0.043 s
% 8.74/2.53 # System time : 0.010 s
% 8.74/2.53 # Total time : 0.053 s
% 8.74/2.53 # Maximum resident set size: 7128 pages
% 8.74/2.53
%------------------------------------------------------------------------------