TSTP Solution File: SEU012+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU012+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n013.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:00 EDT 2022
% Result : Theorem 8.64s 2.54s
% Output : CNFRefutation 8.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of clauses : 35 ( 17 unt; 3 nHn; 35 RR)
% Number of literals : 97 ( 33 equ; 61 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-3 aty)
% Number of variables : 38 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_8,plain,
( apply(X1,esk1_3(X1,X2,X3)) = X3
| X2 != relation_rng(X1)
| ~ function(X1)
| ~ relation(X1)
| ~ in(X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zfowe1d2/lgb.p',i_0_8) ).
cnf(i_0_9,plain,
( in(esk1_3(X1,X2,X3),relation_dom(X1))
| X2 != relation_rng(X1)
| ~ function(X1)
| ~ relation(X1)
| ~ in(X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zfowe1d2/lgb.p',i_0_9) ).
cnf(i_0_50,plain,
( apply(relation_composition(X1,X2),X3) = apply(X2,apply(X1,X3))
| ~ function(X2)
| ~ function(X1)
| ~ relation(X2)
| ~ relation(X1)
| ~ in(X3,relation_dom(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zfowe1d2/lgb.p',i_0_50) ).
cnf(i_0_60,negated_conjecture,
relation_rng(esk14_0) = relation_dom(esk15_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zfowe1d2/lgb.p',i_0_60) ).
cnf(i_0_64,negated_conjecture,
relation(esk14_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zfowe1d2/lgb.p',i_0_64) ).
cnf(i_0_63,negated_conjecture,
function(esk14_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zfowe1d2/lgb.p',i_0_63) ).
cnf(i_0_59,negated_conjecture,
relation_composition(esk14_0,esk15_0) = esk14_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zfowe1d2/lgb.p',i_0_59) ).
cnf(i_0_62,negated_conjecture,
relation(esk15_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zfowe1d2/lgb.p',i_0_62) ).
cnf(i_0_61,negated_conjecture,
function(esk15_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zfowe1d2/lgb.p',i_0_61) ).
cnf(i_0_53,plain,
( X1 = identity_relation(X2)
| in(esk13_2(X2,X1),X2)
| relation_dom(X1) != X2
| ~ function(X1)
| ~ relation(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zfowe1d2/lgb.p',i_0_53) ).
cnf(i_0_58,negated_conjecture,
identity_relation(relation_dom(esk15_0)) != esk15_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zfowe1d2/lgb.p',i_0_58) ).
cnf(i_0_52,plain,
( X1 = identity_relation(X2)
| relation_dom(X1) != X2
| apply(X1,esk13_2(X2,X1)) != esk13_2(X2,X1)
| ~ function(X1)
| ~ relation(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-zfowe1d2/lgb.p',i_0_52) ).
cnf(c_0_77,plain,
( apply(X1,esk1_3(X1,X2,X3)) = X3
| X2 != relation_rng(X1)
| ~ function(X1)
| ~ relation(X1)
| ~ in(X3,X2) ),
i_0_8 ).
cnf(c_0_78,plain,
( in(esk1_3(X1,X2,X3),relation_dom(X1))
| X2 != relation_rng(X1)
| ~ function(X1)
| ~ relation(X1)
| ~ in(X3,X2) ),
i_0_9 ).
cnf(c_0_79,plain,
( apply(relation_composition(X1,X2),X3) = apply(X2,apply(X1,X3))
| ~ function(X2)
| ~ function(X1)
| ~ relation(X2)
| ~ relation(X1)
| ~ in(X3,relation_dom(X1)) ),
i_0_50 ).
cnf(c_0_80,plain,
( apply(X1,esk1_3(X1,relation_rng(X1),X2)) = X2
| ~ in(X2,relation_rng(X1))
| ~ relation(X1)
| ~ function(X1) ),
inference(er,[status(thm)],[c_0_77]) ).
cnf(c_0_81,plain,
( in(esk1_3(X1,relation_rng(X1),X2),relation_dom(X1))
| ~ in(X2,relation_rng(X1))
| ~ relation(X1)
| ~ function(X1) ),
inference(er,[status(thm)],[c_0_78]) ).
cnf(c_0_82,negated_conjecture,
relation_rng(esk14_0) = relation_dom(esk15_0),
i_0_60 ).
cnf(c_0_83,negated_conjecture,
relation(esk14_0),
i_0_64 ).
cnf(c_0_84,negated_conjecture,
function(esk14_0),
i_0_63 ).
cnf(c_0_85,plain,
( apply(relation_composition(X1,X2),esk1_3(X1,relation_rng(X1),X3)) = apply(X2,X3)
| ~ in(X3,relation_rng(X1))
| ~ relation(X2)
| ~ relation(X1)
| ~ function(X2)
| ~ function(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_81]) ).
cnf(c_0_86,negated_conjecture,
relation_composition(esk14_0,esk15_0) = esk14_0,
i_0_59 ).
cnf(c_0_87,negated_conjecture,
relation(esk15_0),
i_0_62 ).
cnf(c_0_88,negated_conjecture,
function(esk15_0),
i_0_61 ).
cnf(c_0_89,plain,
( X1 = identity_relation(X2)
| in(esk13_2(X2,X1),X2)
| relation_dom(X1) != X2
| ~ function(X1)
| ~ relation(X1) ),
i_0_53 ).
cnf(c_0_90,negated_conjecture,
( apply(esk14_0,esk1_3(esk14_0,relation_dom(esk15_0),X1)) = X1
| ~ in(X1,relation_dom(esk15_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_82]),c_0_83]),c_0_84])]) ).
cnf(c_0_91,negated_conjecture,
( apply(esk14_0,esk1_3(esk14_0,relation_dom(esk15_0),X1)) = apply(esk15_0,X1)
| ~ in(X1,relation_dom(esk15_0)) ),
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_85,c_0_86]),c_0_82]),c_0_82]),c_0_87]),c_0_83]),c_0_88]),c_0_84])]) ).
cnf(c_0_92,plain,
( identity_relation(relation_dom(X1)) = X1
| in(esk13_2(relation_dom(X1),X1),relation_dom(X1))
| ~ relation(X1)
| ~ function(X1) ),
inference(er,[status(thm)],[c_0_89]) ).
cnf(c_0_93,negated_conjecture,
identity_relation(relation_dom(esk15_0)) != esk15_0,
i_0_58 ).
cnf(c_0_94,plain,
( X1 = identity_relation(X2)
| relation_dom(X1) != X2
| apply(X1,esk13_2(X2,X1)) != esk13_2(X2,X1)
| ~ function(X1)
| ~ relation(X1) ),
i_0_52 ).
cnf(c_0_95,negated_conjecture,
( apply(esk15_0,X1) = X1
| ~ in(X1,relation_dom(esk15_0)) ),
inference(spm,[status(thm)],[c_0_90,c_0_91]) ).
cnf(c_0_96,negated_conjecture,
in(esk13_2(relation_dom(esk15_0),esk15_0),relation_dom(esk15_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_87]),c_0_88])]),c_0_93]) ).
cnf(c_0_97,plain,
( identity_relation(relation_dom(X1)) = X1
| apply(X1,esk13_2(relation_dom(X1),X1)) != esk13_2(relation_dom(X1),X1)
| ~ relation(X1)
| ~ function(X1) ),
inference(er,[status(thm)],[c_0_94]) ).
cnf(c_0_98,negated_conjecture,
apply(esk15_0,esk13_2(relation_dom(esk15_0),esk15_0)) = esk13_2(relation_dom(esk15_0),esk15_0),
inference(spm,[status(thm)],[c_0_95,c_0_96]) ).
cnf(c_0_99,plain,
$false,
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_98]),c_0_87]),c_0_88])]),c_0_93]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : SEU012+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.36 % Computer : n013.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Sun Jun 19 19:53:15 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.21/0.47 # ENIGMATIC: Selected complete mode:
% 8.64/2.54 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.64/2.54 # No SInE strategy applied
% 8.64/2.54 # Trying AutoSched0 for 150 seconds
% 8.64/2.54 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN
% 8.64/2.54 # and selection function SelectComplexExceptUniqMaxHorn.
% 8.64/2.54 #
% 8.64/2.54 # Preprocessing time : 0.013 s
% 8.64/2.54 # Presaturation interreduction done
% 8.64/2.54
% 8.64/2.54 # Proof found!
% 8.64/2.54 # SZS status Theorem
% 8.64/2.54 # SZS output start CNFRefutation
% See solution above
% 8.64/2.54 # Training examples: 0 positive, 0 negative
% 8.64/2.54
% 8.64/2.54 # -------------------------------------------------
% 8.64/2.54 # User time : 0.017 s
% 8.64/2.54 # System time : 0.010 s
% 8.64/2.54 # Total time : 0.026 s
% 8.64/2.54 # Maximum resident set size: 7124 pages
% 8.64/2.54
%------------------------------------------------------------------------------