TSTP Solution File: SEU215+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU215+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n027.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:38 EDT 2022
% Result : Theorem 8.51s 2.42s
% Output : CNFRefutation 8.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 12
% Syntax : Number of clauses : 37 ( 16 unt; 10 nHn; 29 RR)
% Number of literals : 114 ( 20 equ; 70 neg)
% Maximal clause size : 7 ( 3 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 : 49 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_103,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-61bfwxer/lgb.p',i_0_103) ).
cnf(i_0_169,plain,
( relation(relation_composition(X1,X2))
| ~ relation(X2)
| ~ relation(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-61bfwxer/lgb.p',i_0_169) ).
cnf(i_0_185,plain,
( function(relation_composition(X1,X2))
| ~ function(X2)
| ~ function(X1)
| ~ relation(X2)
| ~ relation(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-61bfwxer/lgb.p',i_0_185) ).
cnf(i_0_302,negated_conjecture,
relation(esk67_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-61bfwxer/lgb.p',i_0_302) ).
cnf(i_0_301,negated_conjecture,
function(esk67_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-61bfwxer/lgb.p',i_0_301) ).
cnf(i_0_304,negated_conjecture,
relation(esk66_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-61bfwxer/lgb.p',i_0_304) ).
cnf(i_0_303,negated_conjecture,
function(esk66_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-61bfwxer/lgb.p',i_0_303) ).
cnf(i_0_298,lemma,
( apply(relation_composition(X1,X2),X3) = apply(X2,apply(X1,X3))
| ~ function(X1)
| ~ function(X2)
| ~ relation(X1)
| ~ relation(X2)
| ~ in(X3,relation_dom(relation_composition(X1,X2))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-61bfwxer/lgb.p',i_0_298) ).
cnf(i_0_295,lemma,
( in(apply(X1,X2),relation_dom(X3))
| ~ function(X3)
| ~ function(X1)
| ~ relation(X3)
| ~ relation(X1)
| ~ in(X2,relation_dom(relation_composition(X1,X3))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-61bfwxer/lgb.p',i_0_295) ).
cnf(i_0_299,negated_conjecture,
apply(relation_composition(esk66_0,esk67_0),esk65_0) != apply(esk67_0,apply(esk66_0,esk65_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-61bfwxer/lgb.p',i_0_299) ).
cnf(i_0_294,lemma,
( in(X1,relation_dom(relation_composition(X2,X3)))
| ~ function(X3)
| ~ function(X2)
| ~ relation(X3)
| ~ relation(X2)
| ~ in(X1,relation_dom(X2))
| ~ in(apply(X2,X1),relation_dom(X3)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-61bfwxer/lgb.p',i_0_294) ).
cnf(i_0_300,negated_conjecture,
in(esk65_0,relation_dom(esk66_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-61bfwxer/lgb.p',i_0_300) ).
cnf(c_0_317,plain,
( X1 = empty_set
| in(X2,relation_dom(X3))
| X1 != apply(X3,X2)
| ~ function(X3)
| ~ relation(X3) ),
i_0_103 ).
cnf(c_0_318,plain,
( apply(X1,X2) = empty_set
| in(X2,relation_dom(X1))
| ~ relation(X1)
| ~ function(X1) ),
inference(er,[status(thm)],[c_0_317]) ).
cnf(c_0_319,plain,
( relation(relation_composition(X1,X2))
| ~ relation(X2)
| ~ relation(X1) ),
i_0_169 ).
cnf(c_0_320,plain,
( apply(relation_composition(X1,X2),X3) = empty_set
| in(X3,relation_dom(relation_composition(X1,X2)))
| ~ relation(X2)
| ~ relation(X1)
| ~ function(relation_composition(X1,X2)) ),
inference(spm,[status(thm)],[c_0_318,c_0_319]) ).
cnf(c_0_321,plain,
( function(relation_composition(X1,X2))
| ~ function(X2)
| ~ function(X1)
| ~ relation(X2)
| ~ relation(X1) ),
i_0_185 ).
cnf(c_0_322,plain,
( apply(relation_composition(X1,X2),X3) = empty_set
| in(X3,relation_dom(relation_composition(X1,X2)))
| ~ relation(X2)
| ~ relation(X1)
| ~ function(X2)
| ~ function(X1) ),
inference(spm,[status(thm)],[c_0_320,c_0_321]) ).
cnf(c_0_323,negated_conjecture,
relation(esk67_0),
i_0_302 ).
cnf(c_0_324,negated_conjecture,
function(esk67_0),
i_0_301 ).
cnf(c_0_325,negated_conjecture,
( apply(relation_composition(X1,esk67_0),X2) = empty_set
| in(X2,relation_dom(relation_composition(X1,esk67_0)))
| ~ relation(X1)
| ~ function(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_322,c_0_323]),c_0_324])]) ).
cnf(c_0_326,negated_conjecture,
relation(esk66_0),
i_0_304 ).
cnf(c_0_327,negated_conjecture,
function(esk66_0),
i_0_303 ).
cnf(c_0_328,lemma,
( apply(relation_composition(X1,X2),X3) = apply(X2,apply(X1,X3))
| ~ function(X1)
| ~ function(X2)
| ~ relation(X1)
| ~ relation(X2)
| ~ in(X3,relation_dom(relation_composition(X1,X2))) ),
i_0_298 ).
cnf(c_0_329,negated_conjecture,
( apply(relation_composition(esk66_0,esk67_0),X1) = empty_set
| in(X1,relation_dom(relation_composition(esk66_0,esk67_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_325,c_0_326]),c_0_327])]) ).
cnf(c_0_330,lemma,
( in(apply(X1,X2),relation_dom(X3))
| ~ function(X3)
| ~ function(X1)
| ~ relation(X3)
| ~ relation(X1)
| ~ in(X2,relation_dom(relation_composition(X1,X3))) ),
i_0_295 ).
cnf(c_0_331,negated_conjecture,
apply(relation_composition(esk66_0,esk67_0),esk65_0) != apply(esk67_0,apply(esk66_0,esk65_0)),
i_0_299 ).
cnf(c_0_332,lemma,
( apply(relation_composition(esk66_0,esk67_0),X1) = apply(esk67_0,apply(esk66_0,X1))
| apply(relation_composition(esk66_0,esk67_0),X1) = empty_set ),
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_328,c_0_329]),c_0_323]),c_0_326]),c_0_324]),c_0_327])]) ).
cnf(c_0_333,lemma,
( in(X1,relation_dom(relation_composition(X2,X3)))
| ~ function(X3)
| ~ function(X2)
| ~ relation(X3)
| ~ relation(X2)
| ~ in(X1,relation_dom(X2))
| ~ in(apply(X2,X1),relation_dom(X3)) ),
i_0_294 ).
cnf(c_0_334,lemma,
( apply(relation_composition(esk66_0,esk67_0),X1) = empty_set
| in(apply(esk66_0,X1),relation_dom(esk67_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_330,c_0_329]),c_0_323]),c_0_326]),c_0_324]),c_0_327])]) ).
cnf(c_0_335,negated_conjecture,
( apply(esk67_0,X1) = empty_set
| in(X1,relation_dom(esk67_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_318,c_0_323]),c_0_324])]) ).
cnf(c_0_336,negated_conjecture,
apply(relation_composition(esk66_0,esk67_0),esk65_0) = empty_set,
inference(spm,[status(thm)],[c_0_331,c_0_332]) ).
cnf(c_0_337,lemma,
( apply(relation_composition(X1,X2),X3) = apply(X2,apply(X1,X3))
| ~ relation(X2)
| ~ relation(X1)
| ~ function(X2)
| ~ function(X1)
| ~ in(apply(X1,X3),relation_dom(X2))
| ~ in(X3,relation_dom(X1)) ),
inference(spm,[status(thm)],[c_0_328,c_0_333]) ).
cnf(c_0_338,negated_conjecture,
in(apply(esk66_0,esk65_0),relation_dom(esk67_0)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_331,c_0_334]),c_0_335]) ).
cnf(c_0_339,negated_conjecture,
in(esk65_0,relation_dom(esk66_0)),
i_0_300 ).
cnf(c_0_340,negated_conjecture,
apply(esk67_0,apply(esk66_0,esk65_0)) != empty_set,
inference(rw,[status(thm)],[c_0_331,c_0_336]) ).
cnf(c_0_341,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_336,c_0_337]),c_0_323]),c_0_326]),c_0_324]),c_0_327]),c_0_338]),c_0_339])]),c_0_340]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU215+2 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n027.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sun Jun 19 17:27:56 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.18/0.45 # ENIGMATIC: Selected complete mode:
% 8.51/2.42 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.51/2.42 # No SInE strategy applied
% 8.51/2.42 # Trying AutoSched0 for 150 seconds
% 8.51/2.42 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 8.51/2.42 # and selection function SelectComplexExceptUniqMaxHorn.
% 8.51/2.42 #
% 8.51/2.42 # Preprocessing time : 0.024 s
% 8.51/2.42 # Presaturation interreduction done
% 8.51/2.42
% 8.51/2.42 # Proof found!
% 8.51/2.42 # SZS status Theorem
% 8.51/2.42 # SZS output start CNFRefutation
% See solution above
% 8.51/2.42 # Training examples: 0 positive, 0 negative
% 8.51/2.42
% 8.51/2.42 # -------------------------------------------------
% 8.51/2.42 # User time : 0.052 s
% 8.51/2.42 # System time : 0.007 s
% 8.51/2.42 # Total time : 0.059 s
% 8.51/2.42 # Maximum resident set size: 7128 pages
% 8.51/2.42
%------------------------------------------------------------------------------