TSTP Solution File: SEU030+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU030+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n018.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:38:06 EDT 2022
% Result : Theorem 8.62s 2.56s
% Output : CNFRefutation 8.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 13
% Syntax : Number of clauses : 32 ( 19 unt; 0 nHn; 32 RR)
% Number of literals : 89 ( 29 equ; 60 neg)
% Maximal clause size : 10 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 22 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_33,plain,
( X1 = X2
| relation_rng(X1) != X3
| relation_composition(X4,X2) != identity_relation(X3)
| relation_composition(X1,X4) != identity_relation(relation_dom(X2))
| ~ function(X2)
| ~ function(X4)
| ~ function(X1)
| ~ relation(X2)
| ~ relation(X4)
| ~ relation(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2jt1jmyg/lgb.p',i_0_33) ).
cnf(i_0_63,plain,
( relation_composition(function_inverse(X1),X1) = identity_relation(relation_rng(X1))
| ~ function(X1)
| ~ relation(X1)
| ~ one_to_one(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2jt1jmyg/lgb.p',i_0_63) ).
cnf(i_0_7,plain,
( function(function_inverse(X1))
| ~ function(X1)
| ~ relation(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2jt1jmyg/lgb.p',i_0_7) ).
cnf(i_0_8,plain,
( relation(function_inverse(X1))
| ~ function(X1)
| ~ relation(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2jt1jmyg/lgb.p',i_0_8) ).
cnf(i_0_67,negated_conjecture,
relation_dom(esk13_0) = relation_rng(esk12_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2jt1jmyg/lgb.p',i_0_67) ).
cnf(i_0_68,negated_conjecture,
one_to_one(esk12_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2jt1jmyg/lgb.p',i_0_68) ).
cnf(i_0_72,negated_conjecture,
relation(esk12_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2jt1jmyg/lgb.p',i_0_72) ).
cnf(i_0_71,negated_conjecture,
function(esk12_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2jt1jmyg/lgb.p',i_0_71) ).
cnf(i_0_70,negated_conjecture,
relation(esk13_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2jt1jmyg/lgb.p',i_0_70) ).
cnf(i_0_69,negated_conjecture,
function(esk13_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2jt1jmyg/lgb.p',i_0_69) ).
cnf(i_0_65,negated_conjecture,
function_inverse(esk12_0) != esk13_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2jt1jmyg/lgb.p',i_0_65) ).
cnf(i_0_60,plain,
( relation_dom(X1) = relation_rng(function_inverse(X1))
| ~ function(X1)
| ~ relation(X1)
| ~ one_to_one(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2jt1jmyg/lgb.p',i_0_60) ).
cnf(i_0_66,negated_conjecture,
identity_relation(relation_dom(esk12_0)) = relation_composition(esk12_0,esk13_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2jt1jmyg/lgb.p',i_0_66) ).
cnf(c_0_86,plain,
( X1 = X2
| relation_rng(X1) != X3
| relation_composition(X4,X2) != identity_relation(X3)
| relation_composition(X1,X4) != identity_relation(relation_dom(X2))
| ~ function(X2)
| ~ function(X4)
| ~ function(X1)
| ~ relation(X2)
| ~ relation(X4)
| ~ relation(X1) ),
i_0_33 ).
cnf(c_0_87,plain,
( X1 = X2
| relation_composition(X1,X3) != identity_relation(relation_dom(X2))
| relation_composition(X3,X2) != identity_relation(relation_rng(X1))
| ~ relation(X3)
| ~ relation(X2)
| ~ relation(X1)
| ~ function(X3)
| ~ function(X2)
| ~ function(X1) ),
inference(er,[status(thm)],[c_0_86]) ).
cnf(c_0_88,plain,
( relation_composition(function_inverse(X1),X1) = identity_relation(relation_rng(X1))
| ~ function(X1)
| ~ relation(X1)
| ~ one_to_one(X1) ),
i_0_63 ).
cnf(c_0_89,plain,
( function(function_inverse(X1))
| ~ function(X1)
| ~ relation(X1) ),
i_0_7 ).
cnf(c_0_90,plain,
( relation(function_inverse(X1))
| ~ function(X1)
| ~ relation(X1) ),
i_0_8 ).
cnf(c_0_91,negated_conjecture,
relation_dom(esk13_0) = relation_rng(esk12_0),
i_0_67 ).
cnf(c_0_92,negated_conjecture,
one_to_one(esk12_0),
i_0_68 ).
cnf(c_0_93,negated_conjecture,
relation(esk12_0),
i_0_72 ).
cnf(c_0_94,negated_conjecture,
function(esk12_0),
i_0_71 ).
cnf(c_0_95,plain,
( function_inverse(X1) = X2
| relation_composition(X1,X2) != identity_relation(relation_rng(function_inverse(X1)))
| identity_relation(relation_rng(X1)) != identity_relation(relation_dom(X2))
| ~ one_to_one(X1)
| ~ relation(X1)
| ~ relation(X2)
| ~ function(X1)
| ~ function(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_89]),c_0_90]) ).
cnf(c_0_96,negated_conjecture,
identity_relation(relation_dom(esk13_0)) = relation_composition(function_inverse(esk12_0),esk12_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_91]),c_0_92]),c_0_93]),c_0_94])]) ).
cnf(c_0_97,negated_conjecture,
( function_inverse(esk12_0) = X1
| relation_composition(esk12_0,X1) != identity_relation(relation_rng(function_inverse(esk12_0)))
| identity_relation(relation_dom(X1)) != relation_composition(function_inverse(esk12_0),esk12_0)
| ~ relation(X1)
| ~ function(X1) ),
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_95,c_0_91]),c_0_96]),c_0_92]),c_0_93]),c_0_94])]) ).
cnf(c_0_98,negated_conjecture,
relation(esk13_0),
i_0_70 ).
cnf(c_0_99,negated_conjecture,
function(esk13_0),
i_0_69 ).
cnf(c_0_100,negated_conjecture,
function_inverse(esk12_0) != esk13_0,
i_0_65 ).
cnf(c_0_101,negated_conjecture,
identity_relation(relation_rng(function_inverse(esk12_0))) != relation_composition(esk12_0,esk13_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_96]),c_0_98]),c_0_99])]),c_0_100]) ).
cnf(c_0_102,plain,
( relation_dom(X1) = relation_rng(function_inverse(X1))
| ~ function(X1)
| ~ relation(X1)
| ~ one_to_one(X1) ),
i_0_60 ).
cnf(c_0_103,negated_conjecture,
identity_relation(relation_dom(esk12_0)) = relation_composition(esk12_0,esk13_0),
i_0_66 ).
cnf(c_0_104,plain,
$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_101,c_0_102]),c_0_103]),c_0_92]),c_0_93]),c_0_94])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU030+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n018.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sat Jun 18 23:31:20 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 8.62/2.56 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.62/2.56 # No SInE strategy applied
% 8.62/2.56 # Trying AutoSched0 for 150 seconds
% 8.62/2.56 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2S
% 8.62/2.56 # and selection function SelectNewComplexAHP.
% 8.62/2.56 #
% 8.62/2.56 # Preprocessing time : 0.027 s
% 8.62/2.56 # Presaturation interreduction done
% 8.62/2.56
% 8.62/2.56 # Proof found!
% 8.62/2.56 # SZS status Theorem
% 8.62/2.56 # SZS output start CNFRefutation
% See solution above
% 8.62/2.56 # Training examples: 0 positive, 0 negative
% 8.62/2.56
% 8.62/2.56 # -------------------------------------------------
% 8.62/2.56 # User time : 0.032 s
% 8.62/2.56 # System time : 0.007 s
% 8.62/2.56 # Total time : 0.039 s
% 8.62/2.56 # Maximum resident set size: 7124 pages
% 8.62/2.56
%------------------------------------------------------------------------------