TSTP Solution File: SEU206+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU206+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n025.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:39:31 EDT 2022
% Result : Theorem 8.59s 2.32s
% Output : CNFRefutation 8.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of clauses : 33 ( 7 unt; 3 nHn; 26 RR)
% Number of literals : 103 ( 32 equ; 69 neg)
% Maximal clause size : 6 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 1 con; 0-3 aty)
% Number of variables : 86 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_10,plain,
( in(X1,X2)
| X2 != relation_image(X3,X4)
| ~ relation(X3)
| ~ in(X5,X4)
| ~ in(unordered_pair(unordered_pair(X5,X1),singleton(X5)),X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8dnwsn7a/lgb.p',i_0_10) ).
cnf(i_0_3,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8dnwsn7a/lgb.p',i_0_3) ).
cnf(i_0_23,plain,
( in(unordered_pair(unordered_pair(esk8_3(X1,X2,X3),X3),singleton(esk8_3(X1,X2,X3))),X1)
| X2 != relation_rng(X1)
| ~ relation(X1)
| ~ in(X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8dnwsn7a/lgb.p',i_0_23) ).
cnf(i_0_18,plain,
( in(X1,X2)
| X2 != relation_dom(X3)
| ~ relation(X3)
| ~ in(unordered_pair(unordered_pair(X1,X4),singleton(X1)),X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8dnwsn7a/lgb.p',i_0_18) ).
cnf(i_0_14,plain,
( subset(X1,X2)
| in(esk4_2(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8dnwsn7a/lgb.p',i_0_14) ).
cnf(i_0_4,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8dnwsn7a/lgb.p',i_0_4) ).
cnf(i_0_59,plain,
( subset(relation_image(X1,X2),relation_rng(X1))
| ~ relation(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8dnwsn7a/lgb.p',i_0_59) ).
cnf(i_0_13,plain,
( subset(X1,X2)
| ~ in(esk4_2(X1,X2),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8dnwsn7a/lgb.p',i_0_13) ).
cnf(i_0_60,negated_conjecture,
relation_image(esk18_0,relation_dom(esk18_0)) != relation_rng(esk18_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8dnwsn7a/lgb.p',i_0_60) ).
cnf(i_0_61,negated_conjecture,
relation(esk18_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8dnwsn7a/lgb.p',i_0_61) ).
cnf(c_0_72,plain,
( in(X1,X2)
| X2 != relation_image(X3,X4)
| ~ relation(X3)
| ~ in(X5,X4)
| ~ in(unordered_pair(unordered_pair(X5,X1),singleton(X5)),X3) ),
i_0_10 ).
cnf(c_0_73,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
i_0_3 ).
cnf(c_0_74,plain,
( in(unordered_pair(unordered_pair(esk8_3(X1,X2,X3),X3),singleton(esk8_3(X1,X2,X3))),X1)
| X2 != relation_rng(X1)
| ~ relation(X1)
| ~ in(X3,X2) ),
i_0_23 ).
cnf(c_0_75,plain,
( in(X1,X2)
| X2 != relation_dom(X3)
| ~ relation(X3)
| ~ in(unordered_pair(unordered_pair(X1,X4),singleton(X1)),X3) ),
i_0_18 ).
cnf(c_0_76,plain,
( in(X1,X2)
| X2 != relation_image(X3,X4)
| ~ relation(X3)
| ~ in(unordered_pair(unordered_pair(X1,X5),singleton(X5)),X3)
| ~ in(X5,X4) ),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_77,plain,
( in(unordered_pair(unordered_pair(X1,esk8_3(X2,X3,X1)),singleton(esk8_3(X2,X3,X1))),X2)
| X3 != relation_rng(X2)
| ~ relation(X2)
| ~ in(X1,X3) ),
inference(rw,[status(thm)],[c_0_74,c_0_73]) ).
cnf(c_0_78,plain,
( in(X1,X2)
| X2 != relation_dom(X3)
| ~ relation(X3)
| ~ in(unordered_pair(unordered_pair(X4,X1),singleton(X1)),X3) ),
inference(spm,[status(thm)],[c_0_75,c_0_73]) ).
cnf(c_0_79,plain,
( in(X1,X2)
| X2 != relation_image(X3,X4)
| X5 != relation_rng(X3)
| ~ relation(X3)
| ~ in(esk8_3(X3,X5,X1),X4)
| ~ in(X1,X5) ),
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_80,plain,
( in(esk8_3(X1,X2,X3),X4)
| X4 != relation_dom(X1)
| X2 != relation_rng(X1)
| ~ relation(X1)
| ~ in(X3,X2) ),
inference(spm,[status(thm)],[c_0_78,c_0_77]) ).
cnf(c_0_81,plain,
( in(X1,X2)
| X2 != relation_image(X3,X4)
| X5 != relation_rng(X3)
| X4 != relation_dom(X3)
| ~ relation(X3)
| ~ in(X1,X5) ),
inference(spm,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_82,plain,
( in(X1,relation_image(X2,X3))
| X4 != relation_rng(X2)
| X3 != relation_dom(X2)
| ~ relation(X2)
| ~ in(X1,X4) ),
inference(er,[status(thm)],[c_0_81]) ).
cnf(c_0_83,plain,
( subset(X1,X2)
| in(esk4_2(X1,X2),X1) ),
i_0_14 ).
cnf(c_0_84,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
i_0_4 ).
cnf(c_0_85,plain,
( subset(relation_image(X1,X2),relation_rng(X1))
| ~ relation(X1) ),
i_0_59 ).
cnf(c_0_86,plain,
( subset(X1,X2)
| ~ in(esk4_2(X1,X2),X2) ),
i_0_13 ).
cnf(c_0_87,plain,
( subset(X1,X2)
| in(esk4_2(X1,X2),relation_image(X3,X4))
| X1 != relation_rng(X3)
| X4 != relation_dom(X3)
| ~ relation(X3) ),
inference(spm,[status(thm)],[c_0_82,c_0_83]) ).
cnf(c_0_88,plain,
( relation_rng(X1) = relation_image(X1,X2)
| ~ subset(relation_rng(X1),relation_image(X1,X2))
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_84,c_0_85]) ).
cnf(c_0_89,plain,
( subset(X1,relation_image(X2,X3))
| X1 != relation_rng(X2)
| X3 != relation_dom(X2)
| ~ relation(X2) ),
inference(spm,[status(thm)],[c_0_86,c_0_87]) ).
cnf(c_0_90,plain,
( relation_rng(X1) = relation_image(X1,X2)
| X2 != relation_dom(X1)
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_88,c_0_89]) ).
cnf(c_0_91,negated_conjecture,
relation_image(esk18_0,relation_dom(esk18_0)) != relation_rng(esk18_0),
i_0_60 ).
cnf(c_0_92,plain,
( relation_image(X1,relation_dom(X1)) = relation_rng(X1)
| ~ relation(X1) ),
inference(er,[status(thm)],[c_0_90]) ).
cnf(c_0_93,negated_conjecture,
relation(esk18_0),
i_0_61 ).
cnf(c_0_94,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_92]),c_0_93])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : SEU206+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.10 % Command : enigmatic-eprover.py %s %d 1
% 0.10/0.31 % Computer : n025.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 600
% 0.10/0.31 % DateTime : Sun Jun 19 06:19:00 EDT 2022
% 0.10/0.31 % CPUTime :
% 0.16/0.42 # ENIGMATIC: Selected complete mode:
% 8.59/2.32 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.59/2.32 # No SInE strategy applied
% 8.59/2.32 # Trying AutoSched0 for 150 seconds
% 8.59/2.32 # AutoSched0-Mode selected heuristic G_E___300_C18_F1_URBAN_S0Y
% 8.59/2.32 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.59/2.32 #
% 8.59/2.32 # Preprocessing time : 0.025 s
% 8.59/2.32
% 8.59/2.32 # Proof found!
% 8.59/2.32 # SZS status Theorem
% 8.59/2.32 # SZS output start CNFRefutation
% See solution above
% 8.59/2.32 # Training examples: 0 positive, 0 negative
% 8.59/2.32
% 8.59/2.32 # -------------------------------------------------
% 8.59/2.32 # User time : 0.150 s
% 8.59/2.32 # System time : 0.007 s
% 8.59/2.32 # Total time : 0.157 s
% 8.59/2.32 # Maximum resident set size: 7132 pages
% 8.59/2.32
%------------------------------------------------------------------------------