TSTP Solution File: SEU055+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU055+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n007.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 8.34s 2.48s
% Output : CNFRefutation 8.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 13
% Syntax : Number of clauses : 39 ( 21 unt; 10 nHn; 30 RR)
% Number of literals : 77 ( 30 equ; 36 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-2 aty)
% Number of variables : 36 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_14,plain,
( one_to_one(X1)
| in(esk2_1(X1),relation_dom(X1))
| ~ function(X1)
| ~ relation(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-so6uuyns/input.p',i_0_14) ).
cnf(i_0_54,negated_conjecture,
relation(esk15_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-so6uuyns/input.p',i_0_54) ).
cnf(i_0_53,negated_conjecture,
function(esk15_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-so6uuyns/input.p',i_0_53) ).
cnf(i_0_51,negated_conjecture,
~ one_to_one(esk15_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-so6uuyns/input.p',i_0_51) ).
cnf(i_0_13,plain,
( one_to_one(X1)
| in(esk3_1(X1),relation_dom(X1))
| ~ function(X1)
| ~ relation(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-so6uuyns/input.p',i_0_13) ).
cnf(i_0_12,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-so6uuyns/input.p',i_0_12) ).
cnf(i_0_50,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-so6uuyns/input.p',i_0_50) ).
cnf(i_0_57,plain,
( X1 != X2
| set_difference(singleton(X1),singleton(X2)) != singleton(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-so6uuyns/input.p',i_0_57) ).
cnf(i_0_59,plain,
( set_difference(X1,X2) = empty_set
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-so6uuyns/input.p',i_0_59) ).
cnf(i_0_49,plain,
subset(X1,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-so6uuyns/input.p',i_0_49) ).
cnf(i_0_52,negated_conjecture,
set_difference(relation_image(esk15_0,X1),relation_image(esk15_0,X2)) = relation_image(esk15_0,set_difference(X1,X2)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-so6uuyns/input.p',i_0_52) ).
cnf(i_0_56,plain,
( X1 = X2
| set_difference(singleton(X1),singleton(X2)) = singleton(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-so6uuyns/input.p',i_0_56) ).
cnf(i_0_11,plain,
( one_to_one(X1)
| esk2_1(X1) != esk3_1(X1)
| ~ function(X1)
| ~ relation(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-so6uuyns/input.p',i_0_11) ).
cnf(c_0_73,plain,
( one_to_one(X1)
| in(esk2_1(X1),relation_dom(X1))
| ~ function(X1)
| ~ relation(X1) ),
i_0_14 ).
cnf(c_0_74,negated_conjecture,
relation(esk15_0),
i_0_54 ).
cnf(c_0_75,negated_conjecture,
function(esk15_0),
i_0_53 ).
cnf(c_0_76,negated_conjecture,
~ one_to_one(esk15_0),
i_0_51 ).
cnf(c_0_77,plain,
( one_to_one(X1)
| in(esk3_1(X1),relation_dom(X1))
| ~ function(X1)
| ~ relation(X1) ),
i_0_13 ).
cnf(c_0_78,plain,
( apply(X1,esk2_1(X1)) = apply(X1,esk3_1(X1))
| one_to_one(X1)
| ~ function(X1)
| ~ relation(X1) ),
i_0_12 ).
cnf(c_0_79,plain,
( singleton(apply(X1,X2)) = relation_image(X1,singleton(X2))
| ~ function(X1)
| ~ relation(X1)
| ~ in(X2,relation_dom(X1)) ),
i_0_50 ).
cnf(c_0_80,negated_conjecture,
in(esk2_1(esk15_0),relation_dom(esk15_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_75])]),c_0_76]) ).
cnf(c_0_81,plain,
( X1 != X2
| set_difference(singleton(X1),singleton(X2)) != singleton(X1) ),
i_0_57 ).
cnf(c_0_82,plain,
( set_difference(X1,X2) = empty_set
| ~ subset(X1,X2) ),
i_0_59 ).
cnf(c_0_83,plain,
subset(X1,X1),
i_0_49 ).
cnf(c_0_84,negated_conjecture,
set_difference(relation_image(esk15_0,X1),relation_image(esk15_0,X2)) = relation_image(esk15_0,set_difference(X1,X2)),
i_0_52 ).
cnf(c_0_85,plain,
( X1 = X2
| set_difference(singleton(X1),singleton(X2)) = singleton(X1) ),
i_0_56 ).
cnf(c_0_86,negated_conjecture,
in(esk3_1(esk15_0),relation_dom(esk15_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_74]),c_0_75])]),c_0_76]) ).
cnf(c_0_87,negated_conjecture,
apply(esk15_0,esk3_1(esk15_0)) = apply(esk15_0,esk2_1(esk15_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_74]),c_0_75])]),c_0_76]) ).
cnf(c_0_88,plain,
singleton(apply(esk15_0,esk2_1(esk15_0))) = relation_image(esk15_0,singleton(esk2_1(esk15_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_74]),c_0_75])]) ).
cnf(c_0_89,plain,
set_difference(singleton(X1),singleton(X1)) != singleton(X1),
inference(er,[status(thm)],[c_0_81]) ).
cnf(c_0_90,plain,
set_difference(X1,X1) = empty_set,
inference(spm,[status(thm)],[c_0_82,c_0_83]) ).
cnf(c_0_91,negated_conjecture,
( set_difference(relation_image(esk15_0,singleton(X1)),relation_image(esk15_0,singleton(X2))) = relation_image(esk15_0,singleton(X1))
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_84,c_0_85]) ).
cnf(c_0_92,plain,
relation_image(esk15_0,singleton(esk3_1(esk15_0))) = relation_image(esk15_0,singleton(esk2_1(esk15_0))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_86]),c_0_74]),c_0_75])]),c_0_87]),c_0_88]) ).
cnf(c_0_93,plain,
singleton(X1) != empty_set,
inference(rw,[status(thm)],[c_0_89,c_0_90]) ).
cnf(c_0_94,plain,
( one_to_one(X1)
| esk2_1(X1) != esk3_1(X1)
| ~ function(X1)
| ~ relation(X1) ),
i_0_11 ).
cnf(c_0_95,plain,
( set_difference(relation_image(esk15_0,singleton(X1)),relation_image(esk15_0,singleton(esk2_1(esk15_0)))) = relation_image(esk15_0,singleton(X1))
| X1 = esk3_1(esk15_0) ),
inference(spm,[status(thm)],[c_0_91,c_0_92]) ).
cnf(c_0_96,plain,
relation_image(esk15_0,singleton(esk2_1(esk15_0))) != empty_set,
inference(spm,[status(thm)],[c_0_93,c_0_88]) ).
cnf(c_0_97,negated_conjecture,
esk3_1(esk15_0) != esk2_1(esk15_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_74]),c_0_75])]),c_0_76]) ).
cnf(c_0_98,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_95]),c_0_96]),c_0_97]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SEU055+1 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n007.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jun 20 05:14:16 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 8.34/2.48 # ENIGMATIC: Solved by autoschedule:
% 8.34/2.48 # No SInE strategy applied
% 8.34/2.48 # Trying AutoSched0 for 150 seconds
% 8.34/2.48 # AutoSched0-Mode selected heuristic G_E___200_B02_F1_SE_CS_SP_PI_S0S
% 8.34/2.48 # and selection function SelectComplexG.
% 8.34/2.48 #
% 8.34/2.48 # Preprocessing time : 0.024 s
% 8.34/2.48
% 8.34/2.48 # Proof found!
% 8.34/2.48 # SZS status Theorem
% 8.34/2.48 # SZS output start CNFRefutation
% See solution above
% 8.34/2.48 # Training examples: 0 positive, 0 negative
% 8.34/2.48
% 8.34/2.48 # -------------------------------------------------
% 8.34/2.48 # User time : 0.048 s
% 8.34/2.48 # System time : 0.011 s
% 8.34/2.48 # Total time : 0.059 s
% 8.34/2.48 # Maximum resident set size: 7124 pages
% 8.34/2.48
%------------------------------------------------------------------------------