TSTP Solution File: SEU053+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU053+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n011.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:13 EDT 2022
% Result : Theorem 14.50s 3.11s
% Output : CNFRefutation 14.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 17
% Syntax : Number of clauses : 49 ( 23 unt; 15 nHn; 34 RR)
% Number of literals : 99 ( 38 equ; 39 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-2 aty)
% Number of variables : 50 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_12,plain,
( disjoint(X1,X2)
| set_intersection2(X1,X2) != empty_set ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1wx0fl39/input.p',i_0_12) ).
cnf(i_0_61,negated_conjecture,
set_intersection2(relation_image(esk15_0,X1),relation_image(esk15_0,X2)) = relation_image(esk15_0,set_intersection2(X1,X2)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1wx0fl39/input.p',i_0_61) ).
cnf(i_0_13,plain,
( set_intersection2(X1,X2) = empty_set
| ~ disjoint(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1wx0fl39/input.p',i_0_13) ).
cnf(i_0_65,plain,
( X1 = X2
| disjoint(singleton(X1),singleton(X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1wx0fl39/input.p',i_0_65) ).
cnf(i_0_64,plain,
( relation_image(X1,empty_set) = empty_set
| ~ relation(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1wx0fl39/input.p',i_0_64) ).
cnf(i_0_67,plain,
set_intersection2(X1,empty_set) = empty_set,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1wx0fl39/input.p',i_0_67) ).
cnf(i_0_63,negated_conjecture,
relation(esk15_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1wx0fl39/input.p',i_0_63) ).
cnf(i_0_59,plain,
( singleton(apply(X1,X2)) = relation_image(X1,singleton(X2))
| ~ function(X1)
| ~ relation(X1)
| ~ in(X2,relation_dom(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1wx0fl39/input.p',i_0_59) ).
cnf(i_0_16,plain,
( one_to_one(X1)
| in(esk3_1(X1),relation_dom(X1))
| ~ function(X1)
| ~ relation(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1wx0fl39/input.p',i_0_16) ).
cnf(i_0_17,plain,
( one_to_one(X1)
| in(esk2_1(X1),relation_dom(X1))
| ~ function(X1)
| ~ relation(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1wx0fl39/input.p',i_0_17) ).
cnf(i_0_62,negated_conjecture,
function(esk15_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1wx0fl39/input.p',i_0_62) ).
cnf(i_0_60,negated_conjecture,
~ one_to_one(esk15_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1wx0fl39/input.p',i_0_60) ).
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/sandbox/tmp/enigma-theBenchmark.p-1wx0fl39/input.p',i_0_15) ).
cnf(i_0_32,plain,
set_intersection2(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1wx0fl39/input.p',i_0_32) ).
cnf(i_0_26,plain,
~ empty(singleton(X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1wx0fl39/input.p',i_0_26) ).
cnf(i_0_22,plain,
empty(empty_set),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1wx0fl39/input.p',i_0_22) ).
cnf(i_0_14,plain,
( one_to_one(X1)
| esk2_1(X1) != esk3_1(X1)
| ~ function(X1)
| ~ relation(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1wx0fl39/input.p',i_0_14) ).
cnf(c_0_85,plain,
( disjoint(X1,X2)
| set_intersection2(X1,X2) != empty_set ),
i_0_12 ).
cnf(c_0_86,negated_conjecture,
set_intersection2(relation_image(esk15_0,X1),relation_image(esk15_0,X2)) = relation_image(esk15_0,set_intersection2(X1,X2)),
i_0_61 ).
cnf(c_0_87,plain,
( set_intersection2(X1,X2) = empty_set
| ~ disjoint(X1,X2) ),
i_0_13 ).
cnf(c_0_88,plain,
( X1 = X2
| disjoint(singleton(X1),singleton(X2)) ),
i_0_65 ).
cnf(c_0_89,plain,
( relation_image(X1,empty_set) = empty_set
| ~ relation(X1) ),
i_0_64 ).
cnf(c_0_90,plain,
set_intersection2(X1,empty_set) = empty_set,
i_0_67 ).
cnf(c_0_91,negated_conjecture,
relation(esk15_0),
i_0_63 ).
cnf(c_0_92,plain,
( singleton(apply(X1,X2)) = relation_image(X1,singleton(X2))
| ~ function(X1)
| ~ relation(X1)
| ~ in(X2,relation_dom(X1)) ),
i_0_59 ).
cnf(c_0_93,plain,
( one_to_one(X1)
| in(esk3_1(X1),relation_dom(X1))
| ~ function(X1)
| ~ relation(X1) ),
i_0_16 ).
cnf(c_0_94,plain,
( one_to_one(X1)
| in(esk2_1(X1),relation_dom(X1))
| ~ function(X1)
| ~ relation(X1) ),
i_0_17 ).
cnf(c_0_95,negated_conjecture,
( disjoint(relation_image(esk15_0,X1),relation_image(esk15_0,X2))
| relation_image(esk15_0,set_intersection2(X1,X2)) != empty_set ),
inference(spm,[status(thm)],[c_0_85,c_0_86]) ).
cnf(c_0_96,plain,
( set_intersection2(singleton(X1),singleton(X2)) = empty_set
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_87,c_0_88]) ).
cnf(c_0_97,negated_conjecture,
relation_image(esk15_0,empty_set) = empty_set,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_89]),c_0_90]),c_0_90]),c_0_91])]) ).
cnf(c_0_98,plain,
( relation_image(X1,singleton(esk3_1(X1))) = singleton(apply(X1,esk3_1(X1)))
| one_to_one(X1)
| ~ relation(X1)
| ~ function(X1) ),
inference(spm,[status(thm)],[c_0_92,c_0_93]) ).
cnf(c_0_99,negated_conjecture,
function(esk15_0),
i_0_62 ).
cnf(c_0_100,negated_conjecture,
~ one_to_one(esk15_0),
i_0_60 ).
cnf(c_0_101,plain,
( relation_image(X1,singleton(esk2_1(X1))) = singleton(apply(X1,esk2_1(X1)))
| one_to_one(X1)
| ~ relation(X1)
| ~ function(X1) ),
inference(spm,[status(thm)],[c_0_92,c_0_94]) ).
cnf(c_0_102,plain,
( X1 = X2
| disjoint(relation_image(esk15_0,singleton(X1)),relation_image(esk15_0,singleton(X2))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_96]),c_0_97])]) ).
cnf(c_0_103,negated_conjecture,
set_intersection2(singleton(apply(esk15_0,esk3_1(esk15_0))),relation_image(esk15_0,X1)) = relation_image(esk15_0,set_intersection2(singleton(esk3_1(esk15_0)),X1)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_98]),c_0_91]),c_0_99])]),c_0_100]) ).
cnf(c_0_104,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_105,negated_conjecture,
set_intersection2(singleton(apply(esk15_0,esk2_1(esk15_0))),relation_image(esk15_0,X1)) = relation_image(esk15_0,set_intersection2(singleton(esk2_1(esk15_0)),X1)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_101]),c_0_91]),c_0_99])]),c_0_100]) ).
cnf(c_0_106,plain,
( relation_image(esk15_0,set_intersection2(singleton(X1),singleton(X2))) = empty_set
| X1 = X2 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_102]),c_0_86]) ).
cnf(c_0_107,plain,
relation_image(esk15_0,set_intersection2(singleton(esk3_1(esk15_0)),X1)) = relation_image(esk15_0,set_intersection2(singleton(esk2_1(esk15_0)),X1)),
inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_104]),c_0_91]),c_0_99])]),c_0_100]),c_0_105]) ).
cnf(c_0_108,plain,
set_intersection2(X1,X1) = X1,
i_0_32 ).
cnf(c_0_109,plain,
( relation_image(esk15_0,set_intersection2(singleton(esk2_1(esk15_0)),singleton(X1))) = empty_set
| esk3_1(esk15_0) = X1 ),
inference(spm,[status(thm)],[c_0_106,c_0_107]) ).
cnf(c_0_110,plain,
relation_image(esk15_0,singleton(esk2_1(esk15_0))) = singleton(apply(esk15_0,esk2_1(esk15_0))),
inference(sr,[status(thm)],[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_105,c_0_101]),c_0_108]),c_0_108]),c_0_91]),c_0_99])]),c_0_100]) ).
cnf(c_0_111,plain,
~ empty(singleton(X1)),
i_0_26 ).
cnf(c_0_112,plain,
( singleton(apply(esk15_0,esk2_1(esk15_0))) = empty_set
| esk3_1(esk15_0) = esk2_1(esk15_0) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_108]),c_0_110]) ).
cnf(c_0_113,plain,
empty(empty_set),
i_0_22 ).
cnf(c_0_114,plain,
( one_to_one(X1)
| esk2_1(X1) != esk3_1(X1)
| ~ function(X1)
| ~ relation(X1) ),
i_0_14 ).
cnf(c_0_115,plain,
esk3_1(esk15_0) = esk2_1(esk15_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_112]),c_0_113])]) ).
cnf(c_0_116,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_114,c_0_115]),c_0_91]),c_0_99])]),c_0_100]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU053+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n011.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jun 19 01:46:25 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 14.50/3.11 # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d30-l6400-e0.15+coop-eprover66:
% 14.50/3.11 # ENIGMA: LightGBM model '/export/starexec/sandbox/solver/bin/data/Enigma/tptp-cade20-model03-h2e15/lgb-t150-d30-l6400-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 43; version: 991; iters: 150)
% 14.50/3.11 # Preprocessing time : 0.800 s
% 14.50/3.11 # Presaturation interreduction done
% 14.50/3.11
% 14.50/3.11 # Proof found!
% 14.50/3.11 # SZS status Theorem
% 14.50/3.11 # SZS output start CNFRefutation
% See solution above
% 14.50/3.11 # Training examples: 0 positive, 0 negative
% 14.50/3.11
% 14.50/3.11 # -------------------------------------------------
% 14.50/3.11 # User time : 0.752 s
% 14.50/3.11 # System time : 0.104 s
% 14.50/3.11 # Total time : 0.856 s
% 14.50/3.11 # ...preprocessing : 0.800 s
% 14.50/3.11 # ...main loop : 0.056 s
% 14.50/3.11 # Maximum resident set size: 166640 pages
% 14.50/3.11
%------------------------------------------------------------------------------