TSTP Solution File: SEU225+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU225+3 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n028.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 5.72s 2.28s
% Output : CNFRefutation 5.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of clauses : 38 ( 15 unt; 9 nHn; 27 RR)
% Number of literals : 102 ( 24 equ; 59 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_10,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-qvr0dxfe/lgb.p',i_0_10) ).
cnf(i_0_70,plain,
( X1 = empty_set
| ~ empty(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qvr0dxfe/lgb.p',i_0_70) ).
cnf(i_0_46,plain,
empty(esk6_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qvr0dxfe/lgb.p',i_0_46) ).
cnf(i_0_68,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-qvr0dxfe/lgb.p',i_0_68) ).
cnf(i_0_27,plain,
( function(relation_dom_restriction(X1,X2))
| ~ function(X1)
| ~ relation(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qvr0dxfe/lgb.p',i_0_27) ).
cnf(i_0_14,plain,
( relation(relation_dom_restriction(X1,X2))
| ~ relation(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qvr0dxfe/lgb.p',i_0_14) ).
cnf(i_0_35,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-qvr0dxfe/lgb.p',i_0_35) ).
cnf(i_0_71,negated_conjecture,
apply(relation_dom_restriction(esk15_0,esk13_0),esk14_0) != apply(esk15_0,esk14_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qvr0dxfe/lgb.p',i_0_71) ).
cnf(i_0_74,negated_conjecture,
relation(esk15_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qvr0dxfe/lgb.p',i_0_74) ).
cnf(i_0_73,negated_conjecture,
function(esk15_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qvr0dxfe/lgb.p',i_0_73) ).
cnf(i_0_72,negated_conjecture,
in(esk14_0,esk13_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qvr0dxfe/lgb.p',i_0_72) ).
cnf(i_0_37,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-qvr0dxfe/lgb.p',i_0_37) ).
cnf(c_0_87,plain,
( X1 = empty_set
| in(X2,relation_dom(X3))
| X1 != apply(X3,X2)
| ~ function(X3)
| ~ relation(X3) ),
i_0_10 ).
cnf(c_0_88,plain,
( X1 = empty_set
| ~ empty(X1) ),
i_0_70 ).
cnf(c_0_89,plain,
empty(esk6_0),
i_0_46 ).
cnf(c_0_90,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_68 ).
cnf(c_0_91,plain,
( function(relation_dom_restriction(X1,X2))
| ~ function(X1)
| ~ relation(X1) ),
i_0_27 ).
cnf(c_0_92,plain,
( relation(relation_dom_restriction(X1,X2))
| ~ relation(X1) ),
i_0_14 ).
cnf(c_0_93,plain,
( apply(X1,X2) = empty_set
| in(X2,relation_dom(X1))
| ~ relation(X1)
| ~ function(X1) ),
inference(er,[status(thm)],[c_0_87]) ).
cnf(c_0_94,plain,
empty_set = esk6_0,
inference(spm,[status(thm)],[c_0_88,c_0_89]) ).
cnf(c_0_95,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_90]),c_0_91]),c_0_92]) ).
cnf(c_0_96,plain,
( in(X1,relation_dom(relation_dom_restriction(X2,X3)))
| ~ function(X2)
| ~ relation(X2)
| ~ in(X1,X3)
| ~ in(X1,relation_dom(X2)) ),
i_0_35 ).
cnf(c_0_97,plain,
( apply(X1,X2) = esk6_0
| in(X2,relation_dom(X1))
| ~ relation(X1)
| ~ function(X1) ),
inference(rw,[status(thm)],[c_0_93,c_0_94]) ).
cnf(c_0_98,negated_conjecture,
apply(relation_dom_restriction(esk15_0,esk13_0),esk14_0) != apply(esk15_0,esk14_0),
i_0_71 ).
cnf(c_0_99,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_95,c_0_96]) ).
cnf(c_0_100,negated_conjecture,
relation(esk15_0),
i_0_74 ).
cnf(c_0_101,negated_conjecture,
function(esk15_0),
i_0_73 ).
cnf(c_0_102,negated_conjecture,
in(esk14_0,esk13_0),
i_0_72 ).
cnf(c_0_103,plain,
( apply(relation_dom_restriction(X1,X2),X3) = esk6_0
| in(X3,relation_dom(relation_dom_restriction(X1,X2)))
| ~ relation(X1)
| ~ function(relation_dom_restriction(X1,X2)) ),
inference(spm,[status(thm)],[c_0_97,c_0_92]) ).
cnf(c_0_104,negated_conjecture,
~ in(esk14_0,relation_dom(esk15_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_99]),c_0_100]),c_0_101]),c_0_102])]) ).
cnf(c_0_105,negated_conjecture,
( apply(esk15_0,X1) = esk6_0
| in(X1,relation_dom(esk15_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_100]),c_0_101])]) ).
cnf(c_0_106,plain,
( apply(relation_dom_restriction(X1,X2),X3) = esk6_0
| in(X3,relation_dom(relation_dom_restriction(X1,X2)))
| ~ relation(X1)
| ~ function(X1) ),
inference(spm,[status(thm)],[c_0_103,c_0_91]) ).
cnf(c_0_107,negated_conjecture,
apply(esk15_0,esk14_0) = esk6_0,
inference(spm,[status(thm)],[c_0_104,c_0_105]) ).
cnf(c_0_108,plain,
( in(X1,relation_dom(X2))
| ~ function(X2)
| ~ relation(X2)
| ~ in(X1,relation_dom(relation_dom_restriction(X2,X3))) ),
i_0_37 ).
cnf(c_0_109,negated_conjecture,
( apply(relation_dom_restriction(esk15_0,X1),X2) = esk6_0
| in(X2,relation_dom(relation_dom_restriction(esk15_0,X1))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_106,c_0_100]),c_0_101])]) ).
cnf(c_0_110,negated_conjecture,
apply(relation_dom_restriction(esk15_0,esk13_0),esk14_0) != esk6_0,
inference(rw,[status(thm)],[c_0_98,c_0_107]) ).
cnf(c_0_111,plain,
( apply(relation_dom_restriction(esk15_0,X1),X2) = esk6_0
| in(X2,relation_dom(esk15_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_108,c_0_109]),c_0_100]),c_0_101])]) ).
cnf(c_0_112,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_111]),c_0_104]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU225+3 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.33 % Computer : n028.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Mon Jun 20 06:48:18 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 5.72/2.28 # ENIGMATIC: Solved by autoschedule-lgb:
% 5.72/2.28 # No SInE strategy applied
% 5.72/2.28 # Trying AutoSched0 for 150 seconds
% 5.72/2.28 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN
% 5.72/2.28 # and selection function SelectComplexExceptUniqMaxHorn.
% 5.72/2.28 #
% 5.72/2.28 # Preprocessing time : 0.024 s
% 5.72/2.28 # Presaturation interreduction done
% 5.72/2.28
% 5.72/2.28 # Proof found!
% 5.72/2.28 # SZS status Theorem
% 5.72/2.28 # SZS output start CNFRefutation
% See solution above
% 5.72/2.28 # Training examples: 0 positive, 0 negative
% 5.72/2.28
% 5.72/2.28 # -------------------------------------------------
% 5.72/2.28 # User time : 0.031 s
% 5.72/2.28 # System time : 0.006 s
% 5.72/2.28 # Total time : 0.037 s
% 5.72/2.28 # Maximum resident set size: 7128 pages
% 5.72/2.28
%------------------------------------------------------------------------------