TSTP Solution File: SEU270+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU270+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n032.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:40:16 EDT 2022
% Result : Theorem 7.65s 2.26s
% Output : CNFRefutation 7.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 14
% Syntax : Number of clauses : 52 ( 10 unt; 22 nHn; 39 RR)
% Number of literals : 187 ( 16 equ; 96 neg)
% Maximal clause size : 8 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 1 con; 0-2 aty)
% Number of variables : 100 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_90,plain,
( ordinal(X1)
| ~ ordinal(X2)
| ~ in(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-311ca0b0/lgb.p',i_0_90) ).
cnf(i_0_30,plain,
( is_connected_in(X1,X2)
| in(esk3_2(X1,X2),X2)
| ~ relation(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-311ca0b0/lgb.p',i_0_30) ).
cnf(i_0_14,plain,
( ordinal_subset(X1,X2)
| ordinal_subset(X2,X1)
| ~ ordinal(X1)
| ~ ordinal(X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-311ca0b0/lgb.p',i_0_14) ).
cnf(i_0_29,plain,
( is_connected_in(X1,X2)
| in(esk4_2(X1,X2),X2)
| ~ relation(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-311ca0b0/lgb.p',i_0_29) ).
cnf(i_0_96,negated_conjecture,
ordinal(esk15_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-311ca0b0/lgb.p',i_0_96) ).
cnf(i_0_34,plain,
relation(inclusion_relation(X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-311ca0b0/lgb.p',i_0_34) ).
cnf(i_0_85,plain,
( subset(X1,X2)
| ~ ordinal(X2)
| ~ ordinal(X1)
| ~ ordinal_subset(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-311ca0b0/lgb.p',i_0_85) ).
cnf(i_0_21,plain,
( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3)
| X3 != inclusion_relation(X4)
| ~ relation(X3)
| ~ in(X2,X4)
| ~ in(X1,X4)
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-311ca0b0/lgb.p',i_0_21) ).
cnf(i_0_12,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-311ca0b0/lgb.p',i_0_12) ).
cnf(i_0_26,plain,
( is_connected_in(X1,X2)
| ~ relation(X1)
| ~ in(unordered_pair(unordered_pair(esk4_2(X1,X2),esk3_2(X1,X2)),singleton(esk4_2(X1,X2))),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-311ca0b0/lgb.p',i_0_26) ).
cnf(i_0_27,plain,
( is_connected_in(X1,X2)
| ~ relation(X1)
| ~ in(unordered_pair(unordered_pair(esk3_2(X1,X2),esk4_2(X1,X2)),singleton(esk3_2(X1,X2))),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-311ca0b0/lgb.p',i_0_27) ).
cnf(i_0_23,plain,
( relation_field(X1) = X2
| X1 != inclusion_relation(X2)
| ~ relation(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-311ca0b0/lgb.p',i_0_23) ).
cnf(i_0_15,plain,
( connected(X1)
| ~ relation(X1)
| ~ is_connected_in(X1,relation_field(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-311ca0b0/lgb.p',i_0_15) ).
cnf(i_0_95,negated_conjecture,
~ connected(inclusion_relation(esk15_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-311ca0b0/lgb.p',i_0_95) ).
cnf(c_0_111,plain,
( ordinal(X1)
| ~ ordinal(X2)
| ~ in(X1,X2) ),
i_0_90 ).
cnf(c_0_112,plain,
( is_connected_in(X1,X2)
| in(esk3_2(X1,X2),X2)
| ~ relation(X1) ),
i_0_30 ).
cnf(c_0_113,plain,
( ordinal_subset(X1,X2)
| ordinal_subset(X2,X1)
| ~ ordinal(X1)
| ~ ordinal(X2) ),
i_0_14 ).
cnf(c_0_114,plain,
( ordinal(esk3_2(X1,X2))
| is_connected_in(X1,X2)
| ~ ordinal(X2)
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_111,c_0_112]) ).
cnf(c_0_115,plain,
( is_connected_in(X1,X2)
| in(esk4_2(X1,X2),X2)
| ~ relation(X1) ),
i_0_29 ).
cnf(c_0_116,plain,
( ordinal_subset(esk3_2(X1,X2),X3)
| ordinal_subset(X3,esk3_2(X1,X2))
| is_connected_in(X1,X2)
| ~ ordinal(X3)
| ~ ordinal(X2)
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_113,c_0_114]) ).
cnf(c_0_117,plain,
( ordinal(esk4_2(X1,X2))
| is_connected_in(X1,X2)
| ~ ordinal(X2)
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_111,c_0_115]) ).
cnf(c_0_118,plain,
( ordinal_subset(esk4_2(X1,X2),esk3_2(X3,X4))
| ordinal_subset(esk3_2(X3,X4),esk4_2(X1,X2))
| is_connected_in(X1,X2)
| is_connected_in(X3,X4)
| ~ ordinal(X4)
| ~ ordinal(X2)
| ~ relation(X3)
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_116,c_0_117]) ).
cnf(c_0_119,negated_conjecture,
ordinal(esk15_0),
i_0_96 ).
cnf(c_0_120,negated_conjecture,
( ordinal_subset(esk3_2(X1,esk15_0),esk4_2(X2,X3))
| ordinal_subset(esk4_2(X2,X3),esk3_2(X1,esk15_0))
| is_connected_in(X1,esk15_0)
| is_connected_in(X2,X3)
| ~ ordinal(X3)
| ~ relation(X1)
| ~ relation(X2) ),
inference(spm,[status(thm)],[c_0_118,c_0_119]) ).
cnf(c_0_121,negated_conjecture,
( ordinal_subset(esk4_2(X1,esk15_0),esk3_2(X2,esk15_0))
| ordinal_subset(esk3_2(X2,esk15_0),esk4_2(X1,esk15_0))
| is_connected_in(X1,esk15_0)
| is_connected_in(X2,esk15_0)
| ~ relation(X2)
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_120,c_0_119]) ).
cnf(c_0_122,plain,
relation(inclusion_relation(X1)),
i_0_34 ).
cnf(c_0_123,plain,
( ordinal_subset(esk3_2(inclusion_relation(X1),esk15_0),esk4_2(X2,esk15_0))
| ordinal_subset(esk4_2(X2,esk15_0),esk3_2(inclusion_relation(X1),esk15_0))
| is_connected_in(inclusion_relation(X1),esk15_0)
| is_connected_in(X2,esk15_0)
| ~ relation(X2) ),
inference(spm,[status(thm)],[c_0_121,c_0_122]) ).
cnf(c_0_124,plain,
( subset(X1,X2)
| ~ ordinal(X2)
| ~ ordinal(X1)
| ~ ordinal_subset(X1,X2) ),
i_0_85 ).
cnf(c_0_125,plain,
( ordinal_subset(esk4_2(inclusion_relation(X1),esk15_0),esk3_2(inclusion_relation(X2),esk15_0))
| ordinal_subset(esk3_2(inclusion_relation(X2),esk15_0),esk4_2(inclusion_relation(X1),esk15_0))
| is_connected_in(inclusion_relation(X1),esk15_0)
| is_connected_in(inclusion_relation(X2),esk15_0) ),
inference(spm,[status(thm)],[c_0_123,c_0_122]) ).
cnf(c_0_126,plain,
( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3)
| X3 != inclusion_relation(X4)
| ~ relation(X3)
| ~ in(X2,X4)
| ~ in(X1,X4)
| ~ subset(X1,X2) ),
i_0_21 ).
cnf(c_0_127,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
i_0_12 ).
cnf(c_0_128,plain,
( ordinal_subset(esk4_2(inclusion_relation(X1),esk15_0),esk3_2(inclusion_relation(X2),esk15_0))
| subset(esk3_2(inclusion_relation(X2),esk15_0),esk4_2(inclusion_relation(X1),esk15_0))
| is_connected_in(inclusion_relation(X2),esk15_0)
| is_connected_in(inclusion_relation(X1),esk15_0)
| ~ ordinal(esk4_2(inclusion_relation(X1),esk15_0))
| ~ ordinal(esk3_2(inclusion_relation(X2),esk15_0)) ),
inference(spm,[status(thm)],[c_0_124,c_0_125]) ).
cnf(c_0_129,plain,
( is_connected_in(X1,X2)
| ~ relation(X1)
| ~ in(unordered_pair(unordered_pair(esk4_2(X1,X2),esk3_2(X1,X2)),singleton(esk4_2(X1,X2))),X1) ),
i_0_26 ).
cnf(c_0_130,plain,
( in(unordered_pair(singleton(X1),unordered_pair(X1,esk3_2(X2,X3))),X4)
| is_connected_in(X2,X3)
| X4 != inclusion_relation(X3)
| ~ subset(X1,esk3_2(X2,X3))
| ~ in(X1,X3)
| ~ relation(X4)
| ~ relation(X2) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_126,c_0_112]),c_0_127]) ).
cnf(c_0_131,plain,
( subset(esk3_2(inclusion_relation(X1),esk15_0),esk4_2(inclusion_relation(X2),esk15_0))
| subset(esk4_2(inclusion_relation(X2),esk15_0),esk3_2(inclusion_relation(X1),esk15_0))
| is_connected_in(inclusion_relation(X2),esk15_0)
| is_connected_in(inclusion_relation(X1),esk15_0)
| ~ ordinal(esk3_2(inclusion_relation(X1),esk15_0))
| ~ ordinal(esk4_2(inclusion_relation(X2),esk15_0)) ),
inference(spm,[status(thm)],[c_0_124,c_0_128]) ).
cnf(c_0_132,plain,
( is_connected_in(X1,X2)
| ~ relation(X1)
| ~ in(unordered_pair(unordered_pair(esk3_2(X1,X2),esk4_2(X1,X2)),singleton(esk3_2(X1,X2))),X1) ),
i_0_27 ).
cnf(c_0_133,plain,
( is_connected_in(X1,X2)
| ~ in(unordered_pair(singleton(esk4_2(X1,X2)),unordered_pair(esk3_2(X1,X2),esk4_2(X1,X2))),X1)
| ~ relation(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_129,c_0_127]),c_0_127]) ).
cnf(c_0_134,plain,
( in(unordered_pair(singleton(X1),unordered_pair(esk3_2(X2,X3),X1)),X4)
| is_connected_in(X2,X3)
| X4 != inclusion_relation(X3)
| ~ subset(X1,esk3_2(X2,X3))
| ~ in(X1,X3)
| ~ relation(X4)
| ~ relation(X2) ),
inference(spm,[status(thm)],[c_0_130,c_0_127]) ).
cnf(c_0_135,plain,
( subset(esk4_2(inclusion_relation(X1),esk15_0),esk3_2(inclusion_relation(X2),esk15_0))
| subset(esk3_2(inclusion_relation(X2),esk15_0),esk4_2(inclusion_relation(X1),esk15_0))
| is_connected_in(inclusion_relation(X2),esk15_0)
| is_connected_in(inclusion_relation(X1),esk15_0)
| ~ ordinal(esk4_2(inclusion_relation(X1),esk15_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_131,c_0_114]),c_0_119]),c_0_122])]) ).
cnf(c_0_136,plain,
( relation_field(X1) = X2
| X1 != inclusion_relation(X2)
| ~ relation(X1) ),
i_0_23 ).
cnf(c_0_137,plain,
( is_connected_in(X1,X2)
| ~ in(unordered_pair(singleton(esk3_2(X1,X2)),unordered_pair(esk3_2(X1,X2),esk4_2(X1,X2))),X1)
| ~ relation(X1) ),
inference(rw,[status(thm)],[c_0_132,c_0_127]) ).
cnf(c_0_138,plain,
( in(unordered_pair(singleton(X1),unordered_pair(X1,esk4_2(X2,X3))),X4)
| is_connected_in(X2,X3)
| X4 != inclusion_relation(X3)
| ~ subset(X1,esk4_2(X2,X3))
| ~ in(X1,X3)
| ~ relation(X4)
| ~ relation(X2) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_126,c_0_115]),c_0_127]) ).
cnf(c_0_139,plain,
( is_connected_in(X1,X2)
| X1 != inclusion_relation(X2)
| ~ subset(esk4_2(X1,X2),esk3_2(X1,X2))
| ~ relation(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_133,c_0_134]),c_0_115]) ).
cnf(c_0_140,plain,
( subset(esk3_2(inclusion_relation(X1),esk15_0),esk4_2(inclusion_relation(X2),esk15_0))
| subset(esk4_2(inclusion_relation(X2),esk15_0),esk3_2(inclusion_relation(X1),esk15_0))
| is_connected_in(inclusion_relation(X2),esk15_0)
| is_connected_in(inclusion_relation(X1),esk15_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_135,c_0_117]),c_0_119]),c_0_122])]) ).
cnf(c_0_141,plain,
( connected(X1)
| ~ relation(X1)
| ~ is_connected_in(X1,relation_field(X1)) ),
i_0_15 ).
cnf(c_0_142,plain,
relation_field(inclusion_relation(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_136]),c_0_122])]) ).
cnf(c_0_143,plain,
( is_connected_in(X1,X2)
| X1 != inclusion_relation(X2)
| ~ subset(esk3_2(X1,X2),esk4_2(X1,X2))
| ~ relation(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_137,c_0_138]),c_0_112]) ).
cnf(c_0_144,plain,
( subset(esk3_2(inclusion_relation(X1),esk15_0),esk4_2(inclusion_relation(X1),esk15_0))
| is_connected_in(inclusion_relation(X1),esk15_0)
| inclusion_relation(X1) != inclusion_relation(esk15_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_139,c_0_140]),c_0_122])]) ).
cnf(c_0_145,plain,
( connected(inclusion_relation(X1))
| ~ is_connected_in(inclusion_relation(X1),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_141,c_0_142]),c_0_122])]) ).
cnf(c_0_146,plain,
( is_connected_in(inclusion_relation(X1),esk15_0)
| inclusion_relation(X1) != inclusion_relation(esk15_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_143,c_0_144]),c_0_122])]) ).
cnf(c_0_147,negated_conjecture,
~ connected(inclusion_relation(esk15_0)),
i_0_95 ).
cnf(c_0_148,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_145,c_0_146]),c_0_147]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : SEU270+1 : TPTP v8.1.0. Released v3.3.0.
% 0.09/0.10 % Command : enigmatic-eprover.py %s %d 1
% 0.10/0.29 % Computer : n032.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29 % CPULimit : 300
% 0.10/0.29 % WCLimit : 600
% 0.10/0.29 % DateTime : Mon Jun 20 06:31:35 EDT 2022
% 0.10/0.29 % CPUTime :
% 0.14/0.37 # ENIGMATIC: Selected complete mode:
% 7.65/2.26 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.65/2.26 # No SInE strategy applied
% 7.65/2.26 # Trying AutoSched0 for 150 seconds
% 7.65/2.26 # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S0Y
% 7.65/2.26 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.65/2.26 #
% 7.65/2.26 # Preprocessing time : 0.014 s
% 7.65/2.26
% 7.65/2.26 # Proof found!
% 7.65/2.26 # SZS status Theorem
% 7.65/2.26 # SZS output start CNFRefutation
% See solution above
% 7.65/2.26 # Training examples: 0 positive, 0 negative
% 7.65/2.26
% 7.65/2.26 # -------------------------------------------------
% 7.65/2.26 # User time : 0.142 s
% 7.65/2.26 # System time : 0.006 s
% 7.65/2.26 # Total time : 0.148 s
% 7.65/2.26 # Maximum resident set size: 7128 pages
% 7.65/2.26
%------------------------------------------------------------------------------