TSTP Solution File: SEU225+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU225+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n021.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 7.66s 2.32s
% Output : CNFRefutation 7.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of clauses : 36 ( 13 unt; 9 nHn; 23 RR)
% Number of literals : 100 ( 22 equ; 57 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 57 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_9,plain,
( X1 = apply(X2,X3)
| in(X3,relation_dom(X2))
| X1 != empty_set
| ~ function(X2)
| ~ relation(X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-90bct8ei/lgb.p',i_0_9) ).
cnf(i_0_68,plain,
( X1 = empty_set
| ~ empty(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-90bct8ei/lgb.p',i_0_68) ).
cnf(i_0_51,plain,
empty(esk5_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-90bct8ei/lgb.p',i_0_51) ).
cnf(i_0_21,plain,
( relation(relation_dom_restriction(X1,X2))
| ~ relation(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-90bct8ei/lgb.p',i_0_21) ).
cnf(i_0_34,plain,
( function(relation_dom_restriction(X1,X2))
| ~ function(X1)
| ~ relation(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-90bct8ei/lgb.p',i_0_34) ).
cnf(i_0_72,negated_conjecture,
relation(esk13_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-90bct8ei/lgb.p',i_0_72) ).
cnf(i_0_71,negated_conjecture,
function(esk13_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-90bct8ei/lgb.p',i_0_71) ).
cnf(i_0_66,plain,
( apply(X1,X2) = apply(X3,X2)
| X1 != relation_dom_restriction(X3,X4)
| ~ function(X3)
| ~ function(X1)
| ~ relation(X3)
| ~ relation(X1)
| ~ in(X2,relation_dom(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-90bct8ei/lgb.p',i_0_66) ).
cnf(i_0_44,plain,
( in(X1,relation_dom(X2))
| ~ function(X2)
| ~ relation(X2)
| ~ in(X1,relation_dom(relation_dom_restriction(X2,X3))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-90bct8ei/lgb.p',i_0_44) ).
cnf(i_0_42,plain,
( in(X1,relation_dom(relation_dom_restriction(X2,X3)))
| ~ function(X2)
| ~ relation(X2)
| ~ in(X1,X3)
| ~ in(X1,relation_dom(X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-90bct8ei/lgb.p',i_0_42) ).
cnf(i_0_69,negated_conjecture,
apply(relation_dom_restriction(esk13_0,esk11_0),esk12_0) != apply(esk13_0,esk12_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-90bct8ei/lgb.p',i_0_69) ).
cnf(i_0_70,negated_conjecture,
in(esk12_0,esk11_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-90bct8ei/lgb.p',i_0_70) ).
cnf(c_0_85,plain,
( X1 = apply(X2,X3)
| in(X3,relation_dom(X2))
| X1 != empty_set
| ~ function(X2)
| ~ relation(X2) ),
i_0_9 ).
cnf(c_0_86,plain,
( X1 = empty_set
| ~ empty(X1) ),
i_0_68 ).
cnf(c_0_87,plain,
empty(esk5_0),
i_0_51 ).
cnf(c_0_88,plain,
( apply(X1,X2) = empty_set
| in(X2,relation_dom(X1))
| ~ relation(X1)
| ~ function(X1) ),
inference(er,[status(thm)],[c_0_85]) ).
cnf(c_0_89,plain,
empty_set = esk5_0,
inference(spm,[status(thm)],[c_0_86,c_0_87]) ).
cnf(c_0_90,plain,
( apply(X1,X2) = esk5_0
| in(X2,relation_dom(X1))
| ~ relation(X1)
| ~ function(X1) ),
inference(rw,[status(thm)],[c_0_88,c_0_89]) ).
cnf(c_0_91,plain,
( relation(relation_dom_restriction(X1,X2))
| ~ relation(X1) ),
i_0_21 ).
cnf(c_0_92,plain,
( apply(relation_dom_restriction(X1,X2),X3) = esk5_0
| in(X3,relation_dom(relation_dom_restriction(X1,X2)))
| ~ relation(X1)
| ~ function(relation_dom_restriction(X1,X2)) ),
inference(spm,[status(thm)],[c_0_90,c_0_91]) ).
cnf(c_0_93,plain,
( function(relation_dom_restriction(X1,X2))
| ~ function(X1)
| ~ relation(X1) ),
i_0_34 ).
cnf(c_0_94,plain,
( apply(relation_dom_restriction(X1,X2),X3) = esk5_0
| in(X3,relation_dom(relation_dom_restriction(X1,X2)))
| ~ relation(X1)
| ~ function(X1) ),
inference(spm,[status(thm)],[c_0_92,c_0_93]) ).
cnf(c_0_95,negated_conjecture,
relation(esk13_0),
i_0_72 ).
cnf(c_0_96,negated_conjecture,
function(esk13_0),
i_0_71 ).
cnf(c_0_97,plain,
( apply(X1,X2) = apply(X3,X2)
| X1 != relation_dom_restriction(X3,X4)
| ~ function(X3)
| ~ function(X1)
| ~ relation(X3)
| ~ relation(X1)
| ~ in(X2,relation_dom(X1)) ),
i_0_66 ).
cnf(c_0_98,plain,
( in(X1,relation_dom(X2))
| ~ function(X2)
| ~ relation(X2)
| ~ in(X1,relation_dom(relation_dom_restriction(X2,X3))) ),
i_0_44 ).
cnf(c_0_99,negated_conjecture,
( apply(relation_dom_restriction(esk13_0,X1),X2) = esk5_0
| in(X2,relation_dom(relation_dom_restriction(esk13_0,X1))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_95]),c_0_96])]) ).
cnf(c_0_100,plain,
( apply(relation_dom_restriction(X1,X2),X3) = apply(X1,X3)
| ~ relation(X1)
| ~ function(X1)
| ~ in(X3,relation_dom(relation_dom_restriction(X1,X2))) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_97]),c_0_93]),c_0_91]) ).
cnf(c_0_101,plain,
( in(X1,relation_dom(relation_dom_restriction(X2,X3)))
| ~ function(X2)
| ~ relation(X2)
| ~ in(X1,X3)
| ~ in(X1,relation_dom(X2)) ),
i_0_42 ).
cnf(c_0_102,negated_conjecture,
apply(relation_dom_restriction(esk13_0,esk11_0),esk12_0) != apply(esk13_0,esk12_0),
i_0_69 ).
cnf(c_0_103,plain,
( apply(relation_dom_restriction(esk13_0,X1),X2) = esk5_0
| in(X2,relation_dom(esk13_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_99]),c_0_95]),c_0_96])]) ).
cnf(c_0_104,negated_conjecture,
( apply(esk13_0,X1) = esk5_0
| in(X1,relation_dom(esk13_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_95]),c_0_96])]) ).
cnf(c_0_105,plain,
( apply(relation_dom_restriction(X1,X2),X3) = apply(X1,X3)
| ~ relation(X1)
| ~ function(X1)
| ~ in(X3,relation_dom(X1))
| ~ in(X3,X2) ),
inference(spm,[status(thm)],[c_0_100,c_0_101]) ).
cnf(c_0_106,negated_conjecture,
in(esk12_0,relation_dom(esk13_0)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_103]),c_0_104]) ).
cnf(c_0_107,negated_conjecture,
in(esk12_0,esk11_0),
i_0_70 ).
cnf(c_0_108,negated_conjecture,
$false,
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_102,c_0_105]),c_0_95]),c_0_96]),c_0_106]),c_0_107])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU225+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n021.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:43:49 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 7.66/2.32 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.66/2.32 # No SInE strategy applied
% 7.66/2.32 # Trying AutoSched0 for 150 seconds
% 7.66/2.32 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.66/2.32 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.66/2.32 #
% 7.66/2.32 # Preprocessing time : 0.015 s
% 7.66/2.32 # Presaturation interreduction done
% 7.66/2.32
% 7.66/2.32 # Proof found!
% 7.66/2.32 # SZS status Theorem
% 7.66/2.32 # SZS output start CNFRefutation
% See solution above
% 7.66/2.32 # Training examples: 0 positive, 0 negative
% 7.66/2.32
% 7.66/2.32 # -------------------------------------------------
% 7.66/2.32 # User time : 0.021 s
% 7.66/2.32 # System time : 0.004 s
% 7.66/2.32 # Total time : 0.025 s
% 7.66/2.32 # Maximum resident set size: 7128 pages
% 7.66/2.32
%------------------------------------------------------------------------------