TSTP Solution File: SEU215+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU215+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n007.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 7.83s 2.31s
% Output : CNFRefutation 7.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of clauses : 29 ( 15 unt; 5 nHn; 27 RR)
% Number of literals : 91 ( 16 equ; 60 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 : 37 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_51,plain,
( 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-mhv9h6nf/lgb.p',i_0_51) ).
cnf(i_0_48,plain,
( 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-mhv9h6nf/lgb.p',i_0_48) ).
cnf(i_0_6,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-mhv9h6nf/lgb.p',i_0_6) ).
cnf(i_0_52,negated_conjecture,
apply(relation_composition(esk9_0,esk10_0),esk8_0) != apply(esk10_0,apply(esk9_0,esk8_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mhv9h6nf/lgb.p',i_0_52) ).
cnf(i_0_55,negated_conjecture,
relation(esk10_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mhv9h6nf/lgb.p',i_0_55) ).
cnf(i_0_57,negated_conjecture,
relation(esk9_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mhv9h6nf/lgb.p',i_0_57) ).
cnf(i_0_54,negated_conjecture,
function(esk10_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mhv9h6nf/lgb.p',i_0_54) ).
cnf(i_0_56,negated_conjecture,
function(esk9_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mhv9h6nf/lgb.p',i_0_56) ).
cnf(i_0_53,negated_conjecture,
in(esk8_0,relation_dom(esk9_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mhv9h6nf/lgb.p',i_0_53) ).
cnf(i_0_24,plain,
( function(relation_composition(X1,X2))
| ~ function(X2)
| ~ function(X1)
| ~ relation(X2)
| ~ relation(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mhv9h6nf/lgb.p',i_0_24) ).
cnf(i_0_16,plain,
( relation(relation_composition(X1,X2))
| ~ relation(X2)
| ~ relation(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mhv9h6nf/lgb.p',i_0_16) ).
cnf(c_0_69,plain,
( 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_51 ).
cnf(c_0_70,plain,
( 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_48 ).
cnf(c_0_71,plain,
( X1 = empty_set
| in(X2,relation_dom(X3))
| X1 != apply(X3,X2)
| ~ function(X3)
| ~ relation(X3) ),
i_0_6 ).
cnf(c_0_72,plain,
( 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_69,c_0_70]) ).
cnf(c_0_73,plain,
( apply(X1,X2) = empty_set
| in(X2,relation_dom(X1))
| ~ relation(X1)
| ~ function(X1) ),
inference(er,[status(thm)],[c_0_71]) ).
cnf(c_0_74,negated_conjecture,
apply(relation_composition(esk9_0,esk10_0),esk8_0) != apply(esk10_0,apply(esk9_0,esk8_0)),
i_0_52 ).
cnf(c_0_75,plain,
( apply(relation_composition(X1,X2),X3) = apply(X2,apply(X1,X3))
| apply(X2,apply(X1,X3)) = empty_set
| ~ relation(X2)
| ~ relation(X1)
| ~ function(X2)
| ~ function(X1)
| ~ in(X3,relation_dom(X1)) ),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_76,negated_conjecture,
relation(esk10_0),
i_0_55 ).
cnf(c_0_77,negated_conjecture,
relation(esk9_0),
i_0_57 ).
cnf(c_0_78,negated_conjecture,
function(esk10_0),
i_0_54 ).
cnf(c_0_79,negated_conjecture,
function(esk9_0),
i_0_56 ).
cnf(c_0_80,negated_conjecture,
in(esk8_0,relation_dom(esk9_0)),
i_0_53 ).
cnf(c_0_81,negated_conjecture,
apply(esk10_0,apply(esk9_0,esk8_0)) = empty_set,
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(spm,[status(thm)],[c_0_74,c_0_75]),c_0_76]),c_0_77]),c_0_78]),c_0_79]),c_0_80])]) ).
cnf(c_0_82,plain,
( function(relation_composition(X1,X2))
| ~ function(X2)
| ~ function(X1)
| ~ relation(X2)
| ~ relation(X1) ),
i_0_24 ).
cnf(c_0_83,plain,
( relation(relation_composition(X1,X2))
| ~ relation(X2)
| ~ relation(X1) ),
i_0_16 ).
cnf(c_0_84,negated_conjecture,
apply(relation_composition(esk9_0,esk10_0),esk8_0) != empty_set,
inference(rw,[status(thm)],[c_0_74,c_0_81]) ).
cnf(c_0_85,plain,
( apply(relation_composition(X1,X2),X3) = apply(X2,apply(X1,X3))
| apply(relation_composition(X1,X2),X3) = empty_set
| ~ relation(X2)
| ~ relation(X1)
| ~ function(X2)
| ~ function(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_73]),c_0_82]),c_0_83]) ).
cnf(c_0_86,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(spm,[status(thm)],[c_0_84,c_0_85]),c_0_81]),c_0_76]),c_0_77]),c_0_78]),c_0_79])]),c_0_84]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU215+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n007.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 : Mon Jun 20 07:26:46 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.19/0.46 # ENIGMATIC: Selected complete mode:
% 7.83/2.31 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.83/2.31 # No SInE strategy applied
% 7.83/2.31 # Trying AutoSched0 for 150 seconds
% 7.83/2.31 # AutoSched0-Mode selected heuristic G_E___205_C45_F1_AE_CS_SP_PI_S0Y
% 7.83/2.31 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.83/2.31 #
% 7.83/2.31 # Preprocessing time : 0.023 s
% 7.83/2.31
% 7.83/2.31 # Proof found!
% 7.83/2.31 # SZS status Theorem
% 7.83/2.31 # SZS output start CNFRefutation
% See solution above
% 7.83/2.31 # Training examples: 0 positive, 0 negative
% 7.83/2.31
% 7.83/2.31 # -------------------------------------------------
% 7.83/2.31 # User time : 0.030 s
% 7.83/2.31 # System time : 0.007 s
% 7.83/2.31 # Total time : 0.037 s
% 7.83/2.31 # Maximum resident set size: 7124 pages
% 7.83/2.31
%------------------------------------------------------------------------------