%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU269+1 : TPTP v8.1.0. Released v3.3.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:40:15 EDT 2022
% Result : Theorem 7.85s 2.34s
% Output : CNFRefutation 7.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 13
% Syntax : Number of clauses : 58 ( 16 unt; 20 nHn; 35 RR)
% Number of literals : 141 ( 9 equ; 65 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 1 con; 0-2 aty)
% Number of variables : 81 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_28,plain,
( is_transitive_in(X1,X2)
| in(esk5_2(X1,X2),X2)
| ~ relation(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-b8shbuxa/lgb.p',i_0_28) ).
cnf(i_0_34,plain,
relation(inclusion_relation(X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-b8shbuxa/lgb.p',i_0_34) ).
cnf(i_0_22,plain,
( relation_field(X1) = X2
| X1 != inclusion_relation(X2)
| ~ relation(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-b8shbuxa/lgb.p',i_0_22) ).
cnf(i_0_14,plain,
( transitive(X1)
| ~ relation(X1)
| ~ is_transitive_in(X1,relation_field(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-b8shbuxa/lgb.p',i_0_14) ).
cnf(i_0_29,plain,
( is_transitive_in(X1,X2)
| in(esk4_2(X1,X2),X2)
| ~ relation(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-b8shbuxa/lgb.p',i_0_29) ).
cnf(i_0_21,plain,
( subset(X1,X2)
| X3 != inclusion_relation(X4)
| ~ relation(X3)
| ~ in(X2,X4)
| ~ in(X1,X4)
| ~ in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-b8shbuxa/lgb.p',i_0_21) ).
cnf(i_0_91,negated_conjecture,
~ transitive(inclusion_relation(esk16_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-b8shbuxa/lgb.p',i_0_91) ).
cnf(i_0_26,plain,
( is_transitive_in(X1,X2)
| in(unordered_pair(unordered_pair(esk4_2(X1,X2),esk5_2(X1,X2)),singleton(esk4_2(X1,X2))),X1)
| ~ relation(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-b8shbuxa/lgb.p',i_0_26) ).
cnf(i_0_30,plain,
( is_transitive_in(X1,X2)
| in(esk3_2(X1,X2),X2)
| ~ relation(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-b8shbuxa/lgb.p',i_0_30) ).
cnf(i_0_27,plain,
( is_transitive_in(X1,X2)
| in(unordered_pair(unordered_pair(esk3_2(X1,X2),esk4_2(X1,X2)),singleton(esk3_2(X1,X2))),X1)
| ~ relation(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-b8shbuxa/lgb.p',i_0_27) ).
cnf(i_0_20,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/sandbox2/tmp/enigma-theBenchmark.p-b8shbuxa/lgb.p',i_0_20) ).
cnf(i_0_87,plain,
( subset(X1,X2)
| ~ subset(X3,X2)
| ~ subset(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-b8shbuxa/lgb.p',i_0_87) ).
cnf(i_0_25,plain,
( is_transitive_in(X1,X2)
| ~ relation(X1)
| ~ in(unordered_pair(unordered_pair(esk3_2(X1,X2),esk5_2(X1,X2)),singleton(esk3_2(X1,X2))),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-b8shbuxa/lgb.p',i_0_25) ).
cnf(c_0_105,plain,
( is_transitive_in(X1,X2)
| in(esk5_2(X1,X2),X2)
| ~ relation(X1) ),
i_0_28 ).
cnf(c_0_106,plain,
relation(inclusion_relation(X1)),
i_0_34 ).
cnf(c_0_107,plain,
( relation_field(X1) = X2
| X1 != inclusion_relation(X2)
| ~ relation(X1) ),
i_0_22 ).
cnf(c_0_108,plain,
( transitive(X1)
| ~ relation(X1)
| ~ is_transitive_in(X1,relation_field(X1)) ),
i_0_14 ).
cnf(c_0_109,plain,
( in(esk5_2(inclusion_relation(X1),X2),X2)
| is_transitive_in(inclusion_relation(X1),X2) ),
inference(spm,[status(thm)],[c_0_105,c_0_106]) ).
cnf(c_0_110,plain,
relation_field(inclusion_relation(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_107]),c_0_106])]) ).
cnf(c_0_111,plain,
( is_transitive_in(X1,X2)
| in(esk4_2(X1,X2),X2)
| ~ relation(X1) ),
i_0_29 ).
cnf(c_0_112,plain,
( subset(X1,X2)
| X3 != inclusion_relation(X4)
| ~ relation(X3)
| ~ in(X2,X4)
| ~ in(X1,X4)
| ~ in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3) ),
i_0_21 ).
cnf(c_0_113,negated_conjecture,
~ transitive(inclusion_relation(esk16_0)),
i_0_91 ).
cnf(c_0_114,plain,
( in(esk5_2(inclusion_relation(X1),X1),X1)
| transitive(inclusion_relation(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_108,c_0_109]),c_0_110]),c_0_110]),c_0_106])]) ).
cnf(c_0_115,plain,
( in(esk4_2(inclusion_relation(X1),X2),X2)
| is_transitive_in(inclusion_relation(X1),X2) ),
inference(spm,[status(thm)],[c_0_111,c_0_106]) ).
cnf(c_0_116,plain,
( is_transitive_in(X1,X2)
| in(unordered_pair(unordered_pair(esk4_2(X1,X2),esk5_2(X1,X2)),singleton(esk4_2(X1,X2))),X1)
| ~ relation(X1) ),
i_0_26 ).
cnf(c_0_117,plain,
( is_transitive_in(X1,X2)
| in(esk3_2(X1,X2),X2)
| ~ relation(X1) ),
i_0_30 ).
cnf(c_0_118,plain,
( subset(X1,X2)
| ~ in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),inclusion_relation(X3))
| ~ in(X2,X3)
| ~ in(X1,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_112]),c_0_106])]) ).
cnf(c_0_119,negated_conjecture,
in(esk5_2(inclusion_relation(esk16_0),esk16_0),esk16_0),
inference(spm,[status(thm)],[c_0_113,c_0_114]) ).
cnf(c_0_120,plain,
( in(esk4_2(inclusion_relation(X1),X1),X1)
| transitive(inclusion_relation(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_108,c_0_115]),c_0_110]),c_0_110]),c_0_106])]) ).
cnf(c_0_121,plain,
( in(unordered_pair(unordered_pair(esk4_2(inclusion_relation(X1),X2),esk5_2(inclusion_relation(X1),X2)),singleton(esk4_2(inclusion_relation(X1),X2))),inclusion_relation(X1))
| is_transitive_in(inclusion_relation(X1),X2) ),
inference(spm,[status(thm)],[c_0_116,c_0_106]) ).
cnf(c_0_122,plain,
( in(esk3_2(inclusion_relation(X1),X2),X2)
| is_transitive_in(inclusion_relation(X1),X2) ),
inference(spm,[status(thm)],[c_0_117,c_0_106]) ).
cnf(c_0_123,plain,
( is_transitive_in(X1,X2)
| in(unordered_pair(unordered_pair(esk3_2(X1,X2),esk4_2(X1,X2)),singleton(esk3_2(X1,X2))),X1)
| ~ relation(X1) ),
i_0_27 ).
cnf(c_0_124,plain,
( subset(X1,esk5_2(inclusion_relation(esk16_0),esk16_0))
| ~ in(unordered_pair(unordered_pair(X1,esk5_2(inclusion_relation(esk16_0),esk16_0)),singleton(X1)),inclusion_relation(esk16_0))
| ~ in(X1,esk16_0) ),
inference(spm,[status(thm)],[c_0_118,c_0_119]) ).
cnf(c_0_125,negated_conjecture,
in(esk4_2(inclusion_relation(esk16_0),esk16_0),esk16_0),
inference(spm,[status(thm)],[c_0_113,c_0_120]) ).
cnf(c_0_126,plain,
( in(unordered_pair(unordered_pair(esk4_2(inclusion_relation(X1),X1),esk5_2(inclusion_relation(X1),X1)),singleton(esk4_2(inclusion_relation(X1),X1))),inclusion_relation(X1))
| transitive(inclusion_relation(X1)) ),
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_108,c_0_121]),c_0_110]),c_0_110]),c_0_110]),c_0_106])]) ).
cnf(c_0_127,plain,
( in(esk3_2(inclusion_relation(X1),X1),X1)
| transitive(inclusion_relation(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_108,c_0_122]),c_0_110]),c_0_110]),c_0_106])]) ).
cnf(c_0_128,plain,
( in(unordered_pair(unordered_pair(esk3_2(inclusion_relation(X1),X2),esk4_2(inclusion_relation(X1),X2)),singleton(esk3_2(inclusion_relation(X1),X2))),inclusion_relation(X1))
| is_transitive_in(inclusion_relation(X1),X2) ),
inference(spm,[status(thm)],[c_0_123,c_0_106]) ).
cnf(c_0_129,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_20 ).
cnf(c_0_130,negated_conjecture,
( subset(esk4_2(inclusion_relation(esk16_0),esk16_0),esk5_2(inclusion_relation(esk16_0),esk16_0))
| ~ in(unordered_pair(unordered_pair(esk4_2(inclusion_relation(esk16_0),esk16_0),esk5_2(inclusion_relation(esk16_0),esk16_0)),singleton(esk4_2(inclusion_relation(esk16_0),esk16_0))),inclusion_relation(esk16_0)) ),
inference(spm,[status(thm)],[c_0_124,c_0_125]) ).
cnf(c_0_131,negated_conjecture,
in(unordered_pair(unordered_pair(esk4_2(inclusion_relation(esk16_0),esk16_0),esk5_2(inclusion_relation(esk16_0),esk16_0)),singleton(esk4_2(inclusion_relation(esk16_0),esk16_0))),inclusion_relation(esk16_0)),
inference(spm,[status(thm)],[c_0_113,c_0_126]) ).
cnf(c_0_132,plain,
( subset(X1,esk4_2(inclusion_relation(esk16_0),esk16_0))
| ~ in(unordered_pair(unordered_pair(X1,esk4_2(inclusion_relation(esk16_0),esk16_0)),singleton(X1)),inclusion_relation(esk16_0))
| ~ in(X1,esk16_0) ),
inference(spm,[status(thm)],[c_0_118,c_0_125]) ).
cnf(c_0_133,negated_conjecture,
in(esk3_2(inclusion_relation(esk16_0),esk16_0),esk16_0),
inference(spm,[status(thm)],[c_0_113,c_0_127]) ).
cnf(c_0_134,plain,
( in(unordered_pair(unordered_pair(esk3_2(inclusion_relation(X1),X1),esk4_2(inclusion_relation(X1),X1)),singleton(esk3_2(inclusion_relation(X1),X1))),inclusion_relation(X1))
| transitive(inclusion_relation(X1)) ),
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_108,c_0_128]),c_0_110]),c_0_110]),c_0_110]),c_0_106])]) ).
cnf(c_0_135,plain,
( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),inclusion_relation(X3))
| ~ subset(X1,X2)
| ~ in(X2,X3)
| ~ in(X1,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_129]),c_0_106])]) ).
cnf(c_0_136,plain,
( subset(X1,X2)
| ~ subset(X3,X2)
| ~ subset(X1,X3) ),
i_0_87 ).
cnf(c_0_137,negated_conjecture,
subset(esk4_2(inclusion_relation(esk16_0),esk16_0),esk5_2(inclusion_relation(esk16_0),esk16_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_130,c_0_131])]) ).
cnf(c_0_138,negated_conjecture,
( subset(esk3_2(inclusion_relation(esk16_0),esk16_0),esk4_2(inclusion_relation(esk16_0),esk16_0))
| ~ in(unordered_pair(unordered_pair(esk3_2(inclusion_relation(esk16_0),esk16_0),esk4_2(inclusion_relation(esk16_0),esk16_0)),singleton(esk3_2(inclusion_relation(esk16_0),esk16_0))),inclusion_relation(esk16_0)) ),
inference(spm,[status(thm)],[c_0_132,c_0_133]) ).
cnf(c_0_139,negated_conjecture,
in(unordered_pair(unordered_pair(esk3_2(inclusion_relation(esk16_0),esk16_0),esk4_2(inclusion_relation(esk16_0),esk16_0)),singleton(esk3_2(inclusion_relation(esk16_0),esk16_0))),inclusion_relation(esk16_0)),
inference(spm,[status(thm)],[c_0_113,c_0_134]) ).
cnf(c_0_140,plain,
( in(unordered_pair(unordered_pair(X1,esk5_2(inclusion_relation(esk16_0),esk16_0)),singleton(X1)),inclusion_relation(esk16_0))
| ~ subset(X1,esk5_2(inclusion_relation(esk16_0),esk16_0))
| ~ in(X1,esk16_0) ),
inference(spm,[status(thm)],[c_0_135,c_0_119]) ).
cnf(c_0_141,plain,
( subset(X1,esk5_2(inclusion_relation(esk16_0),esk16_0))
| ~ subset(X1,esk4_2(inclusion_relation(esk16_0),esk16_0)) ),
inference(spm,[status(thm)],[c_0_136,c_0_137]) ).
cnf(c_0_142,negated_conjecture,
subset(esk3_2(inclusion_relation(esk16_0),esk16_0),esk4_2(inclusion_relation(esk16_0),esk16_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_138,c_0_139])]) ).
cnf(c_0_143,negated_conjecture,
( in(unordered_pair(unordered_pair(esk3_2(inclusion_relation(esk16_0),esk16_0),esk5_2(inclusion_relation(esk16_0),esk16_0)),singleton(esk3_2(inclusion_relation(esk16_0),esk16_0))),inclusion_relation(esk16_0))
| ~ subset(esk3_2(inclusion_relation(esk16_0),esk16_0),esk5_2(inclusion_relation(esk16_0),esk16_0)) ),
inference(spm,[status(thm)],[c_0_140,c_0_133]) ).
cnf(c_0_144,negated_conjecture,
subset(esk3_2(inclusion_relation(esk16_0),esk16_0),esk5_2(inclusion_relation(esk16_0),esk16_0)),
inference(spm,[status(thm)],[c_0_141,c_0_142]) ).
cnf(c_0_145,plain,
( is_transitive_in(X1,X2)
| ~ relation(X1)
| ~ in(unordered_pair(unordered_pair(esk3_2(X1,X2),esk5_2(X1,X2)),singleton(esk3_2(X1,X2))),X1) ),
i_0_25 ).
cnf(c_0_146,negated_conjecture,
in(unordered_pair(unordered_pair(esk3_2(inclusion_relation(esk16_0),esk16_0),esk5_2(inclusion_relation(esk16_0),esk16_0)),singleton(esk3_2(inclusion_relation(esk16_0),esk16_0))),inclusion_relation(esk16_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_143,c_0_144])]) ).
cnf(c_0_147,plain,
( transitive(inclusion_relation(X1))
| ~ is_transitive_in(inclusion_relation(X1),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_108,c_0_110]),c_0_106])]) ).
cnf(c_0_148,plain,
is_transitive_in(inclusion_relation(esk16_0),esk16_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_145,c_0_146]),c_0_106])]) ).
cnf(c_0_149,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_147,c_0_148]),c_0_113]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SEU269+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n017.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 : Sun Jun 19 10:59:30 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.85/2.34 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.85/2.34 # No SInE strategy applied
% 7.85/2.34 # Trying AutoSched0 for 150 seconds
% 7.85/2.34 # AutoSched0-Mode selected heuristic G_E___208_B00_00_F1_SE_CS_SP_PS_S071I
% 7.85/2.34 # and selection function SelectCQArEqLast.
% 7.85/2.34 #
% 7.85/2.34 # Preprocessing time : 0.021 s
% 7.85/2.34 # Presaturation interreduction done
% 7.85/2.34
% 7.85/2.34 # Proof found!
% 7.85/2.34 # SZS status Theorem
% 7.85/2.34 # SZS output start CNFRefutation
% See solution above
% 7.85/2.34 # Training examples: 0 positive, 0 negative
% 7.85/2.34
% 7.85/2.34 # -------------------------------------------------
% 7.85/2.34 # User time : 0.029 s
% 7.85/2.34 # System time : 0.007 s
% 7.85/2.34 # Total time : 0.035 s
% 7.85/2.34 # Maximum resident set size: 7120 pages
% 7.85/2.34
%------------------------------------------------------------------------------