TSTP Solution File: SEU131+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU131+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n012.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:41 EDT 2022
% Result : Theorem 9.22s 2.51s
% Output : CNFRefutation 9.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 25
% Syntax : Number of clauses : 83 ( 22 unt; 19 nHn; 52 RR)
% Number of literals : 161 ( 39 equ; 75 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 4 con; 0-2 aty)
% Number of variables : 151 ( 27 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_66,plain,
( X1 = empty_set
| ~ empty(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1yusq2q2/lgb.p',i_0_66) ).
cnf(i_0_43,plain,
empty(esk8_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1yusq2q2/lgb.p',i_0_43) ).
cnf(i_0_8,plain,
( X1 != empty_set
| ~ in(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1yusq2q2/lgb.p',i_0_8) ).
cnf(i_0_28,plain,
( X1 != set_difference(X2,X3)
| ~ in(X4,X1)
| ~ in(X4,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1yusq2q2/lgb.p',i_0_28) ).
cnf(i_0_27,plain,
( in(X1,X2)
| in(X1,X3)
| X2 != set_difference(X4,X3)
| ~ in(X1,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1yusq2q2/lgb.p',i_0_27) ).
cnf(i_0_41,negated_conjecture,
( set_difference(esk6_0,esk7_0) = empty_set
| subset(esk6_0,esk7_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1yusq2q2/lgb.p',i_0_41) ).
cnf(i_0_60,lemma,
( disjoint(X1,X2)
| in(esk11_2(X1,X2),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1yusq2q2/lgb.p',i_0_60) ).
cnf(i_0_47,lemma,
( set_union2(X1,X2) = X2
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1yusq2q2/lgb.p',i_0_47) ).
cnf(i_0_15,plain,
( subset(X1,X2)
| ~ in(esk3_2(X1,X2),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1yusq2q2/lgb.p',i_0_15) ).
cnf(i_0_17,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1yusq2q2/lgb.p',i_0_17) ).
cnf(i_0_31,plain,
( set_intersection2(X1,X2) = empty_set
| ~ disjoint(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1yusq2q2/lgb.p',i_0_31) ).
cnf(i_0_61,lemma,
( disjoint(X1,X2)
| in(esk11_2(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1yusq2q2/lgb.p',i_0_61) ).
cnf(i_0_16,plain,
( subset(X1,X2)
| in(esk3_2(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1yusq2q2/lgb.p',i_0_16) ).
cnf(i_0_4,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1yusq2q2/lgb.p',i_0_4) ).
cnf(i_0_52,lemma,
( subset(set_intersection2(X1,X2),set_intersection2(X3,X2))
| ~ subset(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1yusq2q2/lgb.p',i_0_52) ).
cnf(i_0_57,lemma,
subset(empty_set,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1yusq2q2/lgb.p',i_0_57) ).
cnf(i_0_68,lemma,
subset(X1,set_union2(X1,X2)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1yusq2q2/lgb.p',i_0_68) ).
cnf(i_0_29,plain,
( in(X1,X2)
| X3 != set_difference(X2,X4)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1yusq2q2/lgb.p',i_0_29) ).
cnf(i_0_59,lemma,
( ~ in(X1,X2)
| ~ in(X1,X3)
| ~ disjoint(X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1yusq2q2/lgb.p',i_0_59) ).
cnf(i_0_65,lemma,
( disjoint(X1,X2)
| in(esk12_2(X1,X2),set_intersection2(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1yusq2q2/lgb.p',i_0_65) ).
cnf(i_0_64,lemma,
( ~ disjoint(X1,X2)
| ~ in(X3,set_intersection2(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1yusq2q2/lgb.p',i_0_64) ).
cnf(i_0_40,plain,
set_intersection2(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1yusq2q2/lgb.p',i_0_40) ).
cnf(i_0_7,plain,
( X1 = empty_set
| in(esk1_1(X1),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1yusq2q2/lgb.p',i_0_7) ).
cnf(i_0_46,plain,
( disjoint(X1,X2)
| ~ disjoint(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1yusq2q2/lgb.p',i_0_46) ).
cnf(i_0_42,negated_conjecture,
( set_difference(esk6_0,esk7_0) != empty_set
| ~ subset(esk6_0,esk7_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1yusq2q2/lgb.p',i_0_42) ).
cnf(c_0_94,plain,
( X1 = empty_set
| ~ empty(X1) ),
i_0_66 ).
cnf(c_0_95,plain,
empty(esk8_0),
i_0_43 ).
cnf(c_0_96,plain,
( X1 != empty_set
| ~ in(X2,X1) ),
i_0_8 ).
cnf(c_0_97,plain,
( X1 != set_difference(X2,X3)
| ~ in(X4,X1)
| ~ in(X4,X3) ),
i_0_28 ).
cnf(c_0_98,plain,
( in(X1,X2)
| in(X1,X3)
| X2 != set_difference(X4,X3)
| ~ in(X1,X4) ),
i_0_27 ).
cnf(c_0_99,negated_conjecture,
( set_difference(esk6_0,esk7_0) = empty_set
| subset(esk6_0,esk7_0) ),
i_0_41 ).
cnf(c_0_100,plain,
empty_set = esk8_0,
inference(spm,[status(thm)],[c_0_94,c_0_95]) ).
cnf(c_0_101,plain,
~ in(X1,empty_set),
inference(er,[status(thm)],[c_0_96]) ).
cnf(c_0_102,plain,
( ~ in(X1,set_difference(X2,X3))
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_97]) ).
cnf(c_0_103,lemma,
( disjoint(X1,X2)
| in(esk11_2(X1,X2),X2) ),
i_0_60 ).
cnf(c_0_104,lemma,
( set_union2(X1,X2) = X2
| ~ subset(X1,X2) ),
i_0_47 ).
cnf(c_0_105,plain,
( subset(X1,X2)
| ~ in(esk3_2(X1,X2),X2) ),
i_0_15 ).
cnf(c_0_106,plain,
( in(X1,set_difference(X2,X3))
| in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_98]) ).
cnf(c_0_107,negated_conjecture,
( set_difference(esk6_0,esk7_0) = esk8_0
| subset(esk6_0,esk7_0) ),
inference(rw,[status(thm)],[c_0_99,c_0_100]) ).
cnf(c_0_108,plain,
~ in(X1,esk8_0),
inference(rw,[status(thm)],[c_0_101,c_0_100]) ).
cnf(c_0_109,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
i_0_17 ).
cnf(c_0_110,plain,
( set_intersection2(X1,X2) = empty_set
| ~ disjoint(X1,X2) ),
i_0_31 ).
cnf(c_0_111,plain,
( disjoint(X1,set_difference(X2,X3))
| ~ in(esk11_2(X1,set_difference(X2,X3)),X3) ),
inference(spm,[status(thm)],[c_0_102,c_0_103]) ).
cnf(c_0_112,lemma,
( disjoint(X1,X2)
| in(esk11_2(X1,X2),X1) ),
i_0_61 ).
cnf(c_0_113,lemma,
( set_union2(X1,X2) = X2
| ~ in(esk3_2(X1,X2),X2) ),
inference(spm,[status(thm)],[c_0_104,c_0_105]) ).
cnf(c_0_114,plain,
( in(X1,esk7_0)
| ~ in(X1,esk6_0) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_106,c_0_107]),c_0_108]),c_0_109]) ).
cnf(c_0_115,plain,
( subset(X1,X2)
| in(esk3_2(X1,X2),X1) ),
i_0_16 ).
cnf(c_0_116,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
i_0_4 ).
cnf(c_0_117,lemma,
( subset(set_intersection2(X1,X2),set_intersection2(X3,X2))
| ~ subset(X1,X3) ),
i_0_52 ).
cnf(c_0_118,plain,
( set_intersection2(X1,X2) = esk8_0
| ~ disjoint(X1,X2) ),
inference(rw,[status(thm)],[c_0_110,c_0_100]) ).
cnf(c_0_119,lemma,
disjoint(X1,set_difference(X2,X1)),
inference(spm,[status(thm)],[c_0_111,c_0_112]) ).
cnf(c_0_120,lemma,
subset(empty_set,X1),
i_0_57 ).
cnf(c_0_121,plain,
( set_union2(X1,esk7_0) = esk7_0
| ~ in(esk3_2(X1,esk7_0),esk6_0) ),
inference(spm,[status(thm)],[c_0_113,c_0_114]) ).
cnf(c_0_122,lemma,
( set_union2(X1,X2) = X2
| in(esk3_2(X1,X2),X1) ),
inference(spm,[status(thm)],[c_0_104,c_0_115]) ).
cnf(c_0_123,plain,
( set_intersection2(X1,X2) = set_intersection2(X3,X2)
| ~ subset(set_intersection2(X1,X2),set_intersection2(X3,X2))
| ~ subset(X3,X1) ),
inference(spm,[status(thm)],[c_0_116,c_0_117]) ).
cnf(c_0_124,plain,
set_intersection2(X1,set_difference(X2,X1)) = esk8_0,
inference(spm,[status(thm)],[c_0_118,c_0_119]) ).
cnf(c_0_125,lemma,
subset(esk8_0,X1),
inference(rw,[status(thm)],[c_0_120,c_0_100]) ).
cnf(c_0_126,lemma,
subset(X1,set_union2(X1,X2)),
i_0_68 ).
cnf(c_0_127,lemma,
set_union2(esk6_0,esk7_0) = esk7_0,
inference(spm,[status(thm)],[c_0_121,c_0_122]) ).
cnf(c_0_128,plain,
( in(X1,X2)
| X3 != set_difference(X2,X4)
| ~ in(X1,X3) ),
i_0_29 ).
cnf(c_0_129,plain,
( set_intersection2(X1,set_difference(X2,X3)) = esk8_0
| ~ subset(X1,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_123,c_0_124]),c_0_125])]) ).
cnf(c_0_130,lemma,
subset(esk6_0,esk7_0),
inference(spm,[status(thm)],[c_0_126,c_0_127]) ).
cnf(c_0_131,lemma,
( ~ in(X1,X2)
| ~ in(X1,X3)
| ~ disjoint(X3,X2) ),
i_0_59 ).
cnf(c_0_132,plain,
( in(X1,X2)
| ~ in(X1,set_difference(X2,X3)) ),
inference(er,[status(thm)],[c_0_128]) ).
cnf(c_0_133,lemma,
( disjoint(X1,X2)
| in(esk12_2(X1,X2),set_intersection2(X1,X2)) ),
i_0_65 ).
cnf(c_0_134,lemma,
set_intersection2(esk6_0,set_difference(X1,esk7_0)) = esk8_0,
inference(spm,[status(thm)],[c_0_129,c_0_130]) ).
cnf(c_0_135,lemma,
( ~ disjoint(X1,X2)
| ~ in(X3,set_intersection2(X1,X2)) ),
i_0_64 ).
cnf(c_0_136,plain,
set_intersection2(X1,X1) = X1,
i_0_40 ).
cnf(c_0_137,plain,
( X1 = empty_set
| in(esk1_1(X1),X1) ),
i_0_7 ).
cnf(c_0_138,lemma,
( disjoint(X1,X2)
| ~ in(esk11_2(X1,X2),X3)
| ~ disjoint(X2,X3) ),
inference(spm,[status(thm)],[c_0_131,c_0_103]) ).
cnf(c_0_139,plain,
( in(esk11_2(set_difference(X1,X2),X3),X1)
| disjoint(set_difference(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_132,c_0_112]) ).
cnf(c_0_140,plain,
( disjoint(X1,X2)
| ~ disjoint(X2,X1) ),
i_0_46 ).
cnf(c_0_141,lemma,
disjoint(esk6_0,set_difference(X1,esk7_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_133,c_0_134]),c_0_108]) ).
cnf(c_0_142,negated_conjecture,
( set_difference(esk6_0,esk7_0) != empty_set
| ~ subset(esk6_0,esk7_0) ),
i_0_42 ).
cnf(c_0_143,plain,
( ~ in(X1,X2)
| ~ disjoint(X2,X2) ),
inference(spm,[status(thm)],[c_0_135,c_0_136]) ).
cnf(c_0_144,plain,
( X1 = esk8_0
| in(esk1_1(X1),X1) ),
inference(rw,[status(thm)],[c_0_137,c_0_100]) ).
cnf(c_0_145,plain,
( disjoint(set_difference(X1,X2),X3)
| ~ disjoint(X3,X1) ),
inference(spm,[status(thm)],[c_0_138,c_0_139]) ).
cnf(c_0_146,plain,
disjoint(set_difference(X1,esk7_0),esk6_0),
inference(spm,[status(thm)],[c_0_140,c_0_141]) ).
cnf(c_0_147,negated_conjecture,
( set_difference(esk6_0,esk7_0) != esk8_0
| ~ subset(esk6_0,esk7_0) ),
inference(rw,[status(thm)],[c_0_142,c_0_100]) ).
cnf(c_0_148,plain,
( X1 = esk8_0
| ~ disjoint(X1,X1) ),
inference(spm,[status(thm)],[c_0_143,c_0_144]) ).
cnf(c_0_149,plain,
disjoint(set_difference(esk6_0,X1),set_difference(X2,esk7_0)),
inference(spm,[status(thm)],[c_0_145,c_0_146]) ).
cnf(c_0_150,negated_conjecture,
set_difference(esk6_0,esk7_0) != esk8_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_147,c_0_130])]) ).
cnf(c_0_151,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_148,c_0_149]),c_0_150]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SEU131+2 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n012.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:05:54 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected complete mode:
% 9.22/2.51 # ENIGMATIC: Solved by autoschedule-lgb:
% 9.22/2.51 # No SInE strategy applied
% 9.22/2.51 # Trying AutoSched0 for 150 seconds
% 9.22/2.51 # AutoSched0-Mode selected heuristic G_E___107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y
% 9.22/2.51 # and selection function SelectMaxLComplexAvoidPosPred.
% 9.22/2.51 #
% 9.22/2.51 # Preprocessing time : 0.020 s
% 9.22/2.51 # Presaturation interreduction done
% 9.22/2.51
% 9.22/2.51 # Proof found!
% 9.22/2.51 # SZS status Theorem
% 9.22/2.51 # SZS output start CNFRefutation
% See solution above
% 9.22/2.51 # Training examples: 0 positive, 0 negative
% 9.22/2.51
% 9.22/2.51 # -------------------------------------------------
% 9.22/2.51 # User time : 0.091 s
% 9.22/2.51 # System time : 0.005 s
% 9.22/2.51 # Total time : 0.096 s
% 9.22/2.51 # Maximum resident set size: 7120 pages
% 9.22/2.51
%------------------------------------------------------------------------------