TSTP Solution File: SEU042+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU042+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n017.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:09 EDT 2022
% Result : Theorem 15.45s 3.34s
% Output : CNFRefutation 15.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 14
% Syntax : Number of clauses : 42 ( 9 unt; 15 nHn; 29 RR)
% Number of literals : 151 ( 26 equ; 96 neg)
% Maximal clause size : 7 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-2 aty)
% Number of variables : 73 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_67,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/sandbox2/tmp/enigma-theBenchmark.p-n0uhte5l/input.p',i_0_67) ).
cnf(i_0_29,plain,
( function(relation_dom_restriction(X1,X2))
| ~ function(X1)
| ~ relation(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-n0uhte5l/input.p',i_0_29) ).
cnf(i_0_19,plain,
( relation(relation_dom_restriction(X1,X2))
| ~ relation(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-n0uhte5l/input.p',i_0_19) ).
cnf(i_0_15,plain,
( apply(X1,esk2_1(X1)) = apply(X1,esk3_1(X1))
| one_to_one(X1)
| ~ function(X1)
| ~ relation(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-n0uhte5l/input.p',i_0_15) ).
cnf(i_0_16,plain,
( one_to_one(X1)
| in(esk3_1(X1),relation_dom(X1))
| ~ function(X1)
| ~ relation(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-n0uhte5l/input.p',i_0_16) ).
cnf(i_0_68,plain,
( relation_dom(X1) = set_intersection2(relation_dom(X2),X3)
| X1 != relation_dom_restriction(X2,X3)
| ~ function(X2)
| ~ function(X1)
| ~ relation(X2)
| ~ relation(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-n0uhte5l/input.p',i_0_68) ).
cnf(i_0_17,plain,
( one_to_one(X1)
| in(esk2_1(X1),relation_dom(X1))
| ~ function(X1)
| ~ relation(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-n0uhte5l/input.p',i_0_17) ).
cnf(i_0_13,plain,
( in(X1,X2)
| X3 != set_intersection2(X2,X4)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-n0uhte5l/input.p',i_0_13) ).
cnf(i_0_18,plain,
( X1 = X2
| apply(X3,X1) != apply(X3,X2)
| ~ function(X3)
| ~ relation(X3)
| ~ one_to_one(X3)
| ~ in(X2,relation_dom(X3))
| ~ in(X1,relation_dom(X3)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-n0uhte5l/input.p',i_0_18) ).
cnf(i_0_14,plain,
( one_to_one(X1)
| esk2_1(X1) != esk3_1(X1)
| ~ function(X1)
| ~ relation(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-n0uhte5l/input.p',i_0_14) ).
cnf(i_0_71,negated_conjecture,
~ one_to_one(relation_dom_restriction(esk17_0,esk16_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-n0uhte5l/input.p',i_0_71) ).
cnf(i_0_72,negated_conjecture,
one_to_one(esk17_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-n0uhte5l/input.p',i_0_72) ).
cnf(i_0_74,negated_conjecture,
relation(esk17_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-n0uhte5l/input.p',i_0_74) ).
cnf(i_0_73,negated_conjecture,
function(esk17_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-n0uhte5l/input.p',i_0_73) ).
cnf(c_0_89,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_67 ).
cnf(c_0_90,plain,
( function(relation_dom_restriction(X1,X2))
| ~ function(X1)
| ~ relation(X1) ),
i_0_29 ).
cnf(c_0_91,plain,
( relation(relation_dom_restriction(X1,X2))
| ~ relation(X1) ),
i_0_19 ).
cnf(c_0_92,plain,
( apply(X1,esk2_1(X1)) = apply(X1,esk3_1(X1))
| one_to_one(X1)
| ~ function(X1)
| ~ relation(X1) ),
i_0_15 ).
cnf(c_0_93,plain,
( apply(relation_dom_restriction(X1,X2),X3) = apply(X1,X3)
| ~ in(X3,relation_dom(relation_dom_restriction(X1,X2)))
| ~ relation(X1)
| ~ function(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_89]),c_0_90]),c_0_91]) ).
cnf(c_0_94,plain,
( one_to_one(X1)
| in(esk3_1(X1),relation_dom(X1))
| ~ function(X1)
| ~ relation(X1) ),
i_0_16 ).
cnf(c_0_95,plain,
( relation_dom(X1) = set_intersection2(relation_dom(X2),X3)
| X1 != relation_dom_restriction(X2,X3)
| ~ function(X2)
| ~ function(X1)
| ~ relation(X2)
| ~ relation(X1) ),
i_0_68 ).
cnf(c_0_96,plain,
( apply(relation_dom_restriction(X1,X2),esk2_1(relation_dom_restriction(X1,X2))) = apply(X1,esk3_1(relation_dom_restriction(X1,X2)))
| one_to_one(relation_dom_restriction(X1,X2))
| ~ relation(X1)
| ~ function(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_93]),c_0_94]),c_0_90]),c_0_91]) ).
cnf(c_0_97,plain,
( one_to_one(X1)
| in(esk2_1(X1),relation_dom(X1))
| ~ function(X1)
| ~ relation(X1) ),
i_0_17 ).
cnf(c_0_98,plain,
( relation_dom(relation_dom_restriction(X1,X2)) = set_intersection2(relation_dom(X1),X2)
| ~ relation(X1)
| ~ function(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_95]),c_0_90]),c_0_91]) ).
cnf(c_0_99,plain,
( in(X1,X2)
| X3 != set_intersection2(X2,X4)
| ~ in(X1,X3) ),
i_0_13 ).
cnf(c_0_100,plain,
( apply(X1,esk3_1(relation_dom_restriction(X1,X2))) = apply(X1,esk2_1(relation_dom_restriction(X1,X2)))
| one_to_one(relation_dom_restriction(X1,X2))
| ~ in(esk2_1(relation_dom_restriction(X1,X2)),relation_dom(relation_dom_restriction(X1,X2)))
| ~ relation(X1)
| ~ function(X1) ),
inference(spm,[status(thm)],[c_0_93,c_0_96]) ).
cnf(c_0_101,plain,
( in(esk2_1(relation_dom_restriction(X1,X2)),set_intersection2(relation_dom(X1),X2))
| one_to_one(relation_dom_restriction(X1,X2))
| ~ relation(X1)
| ~ function(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_98]),c_0_90]),c_0_91]) ).
cnf(c_0_102,plain,
( in(X1,X2)
| ~ in(X1,set_intersection2(X2,X3)) ),
inference(er,[status(thm)],[c_0_99]) ).
cnf(c_0_103,plain,
( in(esk3_1(relation_dom_restriction(X1,X2)),set_intersection2(relation_dom(X1),X2))
| one_to_one(relation_dom_restriction(X1,X2))
| ~ relation(X1)
| ~ function(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_98]),c_0_90]),c_0_91]) ).
cnf(c_0_104,plain,
( X1 = X2
| apply(X3,X1) != apply(X3,X2)
| ~ function(X3)
| ~ relation(X3)
| ~ one_to_one(X3)
| ~ in(X2,relation_dom(X3))
| ~ in(X1,relation_dom(X3)) ),
i_0_18 ).
cnf(c_0_105,plain,
( apply(X1,esk3_1(relation_dom_restriction(X1,X2))) = apply(X1,esk2_1(relation_dom_restriction(X1,X2)))
| one_to_one(relation_dom_restriction(X1,X2))
| ~ relation(X1)
| ~ function(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_98]),c_0_101]) ).
cnf(c_0_106,plain,
( in(esk3_1(relation_dom_restriction(X1,X2)),relation_dom(X1))
| one_to_one(relation_dom_restriction(X1,X2))
| ~ relation(X1)
| ~ function(X1) ),
inference(spm,[status(thm)],[c_0_102,c_0_103]) ).
cnf(c_0_107,plain,
( X1 = esk3_1(relation_dom_restriction(X2,X3))
| one_to_one(relation_dom_restriction(X2,X3))
| apply(X2,X1) != apply(X2,esk2_1(relation_dom_restriction(X2,X3)))
| ~ in(X1,relation_dom(X2))
| ~ one_to_one(X2)
| ~ relation(X2)
| ~ function(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_105]),c_0_106]) ).
cnf(c_0_108,plain,
( in(esk2_1(relation_dom_restriction(X1,X2)),relation_dom(X1))
| one_to_one(relation_dom_restriction(X1,X2))
| ~ relation(X1)
| ~ function(X1) ),
inference(spm,[status(thm)],[c_0_102,c_0_101]) ).
cnf(c_0_109,plain,
( one_to_one(X1)
| esk2_1(X1) != esk3_1(X1)
| ~ function(X1)
| ~ relation(X1) ),
i_0_14 ).
cnf(c_0_110,plain,
( esk3_1(relation_dom_restriction(X1,X2)) = esk2_1(relation_dom_restriction(X1,X2))
| one_to_one(relation_dom_restriction(X1,X2))
| ~ one_to_one(X1)
| ~ relation(X1)
| ~ function(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_107]),c_0_108]) ).
cnf(c_0_111,negated_conjecture,
~ one_to_one(relation_dom_restriction(esk17_0,esk16_0)),
i_0_71 ).
cnf(c_0_112,plain,
( one_to_one(relation_dom_restriction(X1,X2))
| ~ one_to_one(X1)
| ~ relation(X1)
| ~ function(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_110]),c_0_90]),c_0_91]) ).
cnf(c_0_113,negated_conjecture,
one_to_one(esk17_0),
i_0_72 ).
cnf(c_0_114,negated_conjecture,
relation(esk17_0),
i_0_74 ).
cnf(c_0_115,negated_conjecture,
function(esk17_0),
i_0_73 ).
cnf(c_0_116,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_112]),c_0_113]),c_0_114]),c_0_115])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU042+1 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n017.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 : Mon Jun 20 03:07:46 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 15.45/3.34 # ENIGMATIC: Solved by Enigma+tptp-cade20-model02-h2e15+lgb-t150-d30-l6400-e0.15+coop-mzr02:
% 15.45/3.34 # ENIGMA: LightGBM model '/export/starexec/sandbox2/solver/bin/data/Enigma/tptp-cade20-model02-h2e15/lgb-t150-d30-l6400-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 29; version: 991; iters: 150)
% 15.45/3.34 # Preprocessing time : 0.911 s
% 15.45/3.34
% 15.45/3.34 # Proof found!
% 15.45/3.34 # SZS status Theorem
% 15.45/3.34 # SZS output start CNFRefutation
% See solution above
% 15.45/3.34 # Training examples: 0 positive, 0 negative
% 15.45/3.34
% 15.45/3.34 # -------------------------------------------------
% 15.45/3.34 # User time : 0.833 s
% 15.45/3.34 # System time : 0.102 s
% 15.45/3.34 # Total time : 0.935 s
% 15.45/3.34 # ...preprocessing : 0.911 s
% 15.45/3.34 # ...main loop : 0.024 s
% 15.45/3.34 # Maximum resident set size: 168380 pages
% 15.45/3.34
%------------------------------------------------------------------------------