TSTP Solution File: SEU141+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU141+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n006.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:47 EDT 2022
% Result : Theorem 9.60s 2.64s
% Output : CNFRefutation 9.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 22
% Syntax : Number of formulae : 73 ( 14 unt; 0 def)
% Number of atoms : 158 ( 45 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 153 ( 68 ~; 83 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-3 aty)
% Number of variables : 133 ( 19 sgn 2 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_35,plain,
( ~ disjoint(X1,X2)
| ~ in(X3,set_intersection2(X1,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_9myudbl/lgb.p',i_0_35) ).
cnf(i_0_32,plain,
set_intersection2(X1,empty_set) = empty_set,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_9myudbl/lgb.p',i_0_32) ).
cnf(i_0_21,plain,
( disjoint(X1,X2)
| set_intersection2(X1,X2) != empty_set ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_9myudbl/lgb.p',i_0_21) ).
cnf(i_0_20,plain,
( in(X1,X2)
| X3 != set_difference(X2,X4)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_9myudbl/lgb.p',i_0_20) ).
cnf(i_0_7,plain,
( subset(X1,X2)
| in(esk1_2(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_9myudbl/lgb.p',i_0_7) ).
cnf(i_0_19,plain,
( X1 != set_difference(X2,X3)
| ~ in(X4,X1)
| ~ in(X4,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_9myudbl/lgb.p',i_0_19) ).
cnf(i_0_6,plain,
( subset(X1,X2)
| ~ in(esk1_2(X1,X2),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_9myudbl/lgb.p',i_0_6) ).
cnf(i_0_31,plain,
( disjoint(X1,X2)
| ~ disjoint(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_9myudbl/lgb.p',i_0_31) ).
cnf(i_0_39,negated_conjecture,
( set_difference(esk7_0,esk8_0) = esk7_0
| disjoint(esk7_0,esk8_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_9myudbl/lgb.p',i_0_39) ).
cnf(i_0_10,plain,
( X1 = set_intersection2(X2,X3)
| in(esk2_3(X2,X3,X1),X1)
| in(esk2_3(X2,X3,X1),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_9myudbl/lgb.p',i_0_10) ).
cnf(i_0_9,plain,
( X1 = set_intersection2(X2,X3)
| in(esk2_3(X2,X3,X1),X1)
| in(esk2_3(X2,X3,X1),X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_9myudbl/lgb.p',i_0_9) ).
cnf(i_0_3,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_9myudbl/lgb.p',i_0_3) ).
cnf(i_0_2,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_9myudbl/lgb.p',i_0_2) ).
cnf(i_0_40,negated_conjecture,
( set_difference(esk7_0,esk8_0) != esk7_0
| ~ disjoint(esk7_0,esk8_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_9myudbl/lgb.p',i_0_40) ).
cnf(i_0_36,plain,
( disjoint(X1,X2)
| in(esk6_2(X1,X2),set_intersection2(X1,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_9myudbl/lgb.p',i_0_36) ).
cnf(i_0_22,plain,
( set_intersection2(X1,X2) = empty_set
| ~ disjoint(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_9myudbl/lgb.p',i_0_22) ).
cnf(i_0_8,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_9myudbl/lgb.p',i_0_8) ).
cnf(i_0_16,plain,
( X1 = set_difference(X2,X3)
| in(esk3_3(X2,X3,X1),X1)
| in(esk3_3(X2,X3,X1),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_9myudbl/lgb.p',i_0_16) ).
cnf(i_0_12,plain,
( in(X1,X2)
| X2 != set_intersection2(X3,X4)
| ~ in(X1,X4)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_9myudbl/lgb.p',i_0_12) ).
cnf(i_0_17,plain,
( X1 = set_difference(X2,X3)
| in(esk3_3(X2,X3,X1),X3)
| ~ in(esk3_3(X2,X3,X1),X1)
| ~ in(esk3_3(X2,X3,X1),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_9myudbl/lgb.p',i_0_17) ).
fof(c_0_61,plain,
( ~ epred2_0
<=> ! [X2] : ~ disjoint(X2,empty_set) ),
introduced(definition) ).
fof(c_0_62,plain,
( ~ epred1_0
<=> ! [X1] : ~ in(X1,empty_set) ),
introduced(definition) ).
cnf(c_0_63,plain,
( ~ disjoint(X1,X2)
| ~ in(X3,set_intersection2(X1,X2)) ),
i_0_35 ).
cnf(c_0_64,plain,
set_intersection2(X1,empty_set) = empty_set,
i_0_32 ).
cnf(c_0_65,plain,
( epred2_0
| ~ disjoint(X1,empty_set) ),
inference(split_equiv,[status(thm)],[c_0_61]) ).
cnf(c_0_66,plain,
( disjoint(X1,X2)
| set_intersection2(X1,X2) != empty_set ),
i_0_21 ).
cnf(c_0_67,plain,
( in(X1,X2)
| X3 != set_difference(X2,X4)
| ~ in(X1,X3) ),
i_0_20 ).
cnf(c_0_68,plain,
( ~ epred2_0
| ~ epred1_0 ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_62]),c_0_61]) ).
cnf(c_0_69,plain,
epred2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_64])]) ).
cnf(c_0_70,plain,
( in(X1,X2)
| ~ in(X1,set_difference(X2,X3)) ),
inference(er,[status(thm)],[c_0_67]) ).
cnf(c_0_71,plain,
( subset(X1,X2)
| in(esk1_2(X1,X2),X1) ),
i_0_7 ).
cnf(c_0_72,plain,
( X1 != set_difference(X2,X3)
| ~ in(X4,X1)
| ~ in(X4,X3) ),
i_0_19 ).
cnf(c_0_73,plain,
~ epred1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_68,c_0_69])]) ).
cnf(c_0_74,plain,
( subset(X1,X2)
| ~ in(esk1_2(X1,X2),X2) ),
i_0_6 ).
cnf(c_0_75,plain,
( subset(set_difference(X1,X2),X3)
| in(esk1_2(set_difference(X1,X2),X3),X1) ),
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_76,plain,
( disjoint(X1,X2)
| ~ disjoint(X2,X1) ),
i_0_31 ).
cnf(c_0_77,negated_conjecture,
( set_difference(esk7_0,esk8_0) = esk7_0
| disjoint(esk7_0,esk8_0) ),
i_0_39 ).
cnf(c_0_78,plain,
( ~ in(X1,set_difference(X2,X3))
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_72]) ).
cnf(c_0_79,plain,
( X1 = set_intersection2(X2,X3)
| in(esk2_3(X2,X3,X1),X1)
| in(esk2_3(X2,X3,X1),X2) ),
i_0_10 ).
cnf(c_0_80,plain,
~ in(X1,empty_set),
inference(sr,[status(thm)],[inference(split_equiv,[status(thm)],[c_0_62]),c_0_73]) ).
cnf(c_0_81,plain,
( X1 = set_intersection2(X2,X3)
| in(esk2_3(X2,X3,X1),X1)
| in(esk2_3(X2,X3,X1),X3) ),
i_0_9 ).
cnf(c_0_82,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
i_0_3 ).
cnf(c_0_83,plain,
subset(set_difference(X1,X2),X1),
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_84,plain,
( subset(set_intersection2(X1,X2),X3)
| ~ disjoint(X1,X2) ),
inference(spm,[status(thm)],[c_0_63,c_0_71]) ).
cnf(c_0_85,negated_conjecture,
( set_difference(esk7_0,esk8_0) = esk7_0
| disjoint(esk8_0,esk7_0) ),
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_86,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
i_0_2 ).
cnf(c_0_87,negated_conjecture,
( set_difference(esk7_0,esk8_0) != esk7_0
| ~ disjoint(esk7_0,esk8_0) ),
i_0_40 ).
cnf(c_0_88,plain,
( disjoint(X1,X2)
| in(esk6_2(X1,X2),set_intersection2(X1,X2)) ),
i_0_36 ).
cnf(c_0_89,plain,
( X1 = set_intersection2(set_difference(X2,X3),X4)
| in(esk2_3(set_difference(X2,X3),X4,X1),X1)
| ~ in(esk2_3(set_difference(X2,X3),X4,X1),X3) ),
inference(spm,[status(thm)],[c_0_78,c_0_79]) ).
cnf(c_0_90,plain,
( empty_set = set_intersection2(X1,X2)
| in(esk2_3(X1,X2,empty_set),X2) ),
inference(spm,[status(thm)],[c_0_80,c_0_81]) ).
cnf(c_0_91,plain,
( set_intersection2(X1,X2) = empty_set
| ~ disjoint(X1,X2) ),
i_0_22 ).
cnf(c_0_92,plain,
( set_difference(X1,X2) = X1
| ~ subset(X1,set_difference(X1,X2)) ),
inference(spm,[status(thm)],[c_0_82,c_0_83]) ).
cnf(c_0_93,negated_conjecture,
( set_difference(esk7_0,esk8_0) = esk7_0
| subset(set_intersection2(esk7_0,esk8_0),X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_86]) ).
cnf(c_0_94,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
i_0_8 ).
cnf(c_0_95,negated_conjecture,
( in(esk6_2(esk7_0,esk8_0),set_intersection2(esk7_0,esk8_0))
| set_difference(esk7_0,esk8_0) != esk7_0 ),
inference(spm,[status(thm)],[c_0_87,c_0_88]) ).
cnf(c_0_96,plain,
( X1 = set_difference(X2,X3)
| in(esk3_3(X2,X3,X1),X1)
| in(esk3_3(X2,X3,X1),X2) ),
i_0_16 ).
cnf(c_0_97,plain,
set_intersection2(X1,set_difference(X2,X1)) = empty_set,
inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_90]),c_0_80]),c_0_86]) ).
cnf(c_0_98,negated_conjecture,
( set_difference(esk7_0,esk8_0) = esk7_0
| set_intersection2(esk7_0,esk8_0) = empty_set ),
inference(spm,[status(thm)],[c_0_91,c_0_77]) ).
cnf(c_0_99,plain,
( in(esk6_2(X1,X2),set_intersection2(X1,X2))
| disjoint(X2,X1) ),
inference(spm,[status(thm)],[c_0_76,c_0_88]) ).
cnf(c_0_100,negated_conjecture,
( set_difference(set_intersection2(esk7_0,esk8_0),X1) = set_intersection2(esk7_0,esk8_0)
| set_difference(esk7_0,esk8_0) = esk7_0 ),
inference(spm,[status(thm)],[c_0_92,c_0_93]) ).
cnf(c_0_101,plain,
( set_difference(esk7_0,esk8_0) = esk7_0
| in(X1,X2)
| ~ in(X1,set_intersection2(esk7_0,esk8_0)) ),
inference(spm,[status(thm)],[c_0_94,c_0_93]) ).
cnf(c_0_102,plain,
( in(X1,X2)
| X2 != set_intersection2(X3,X4)
| ~ in(X1,X4)
| ~ in(X1,X3) ),
i_0_12 ).
cnf(c_0_103,plain,
( in(esk6_2(esk7_0,esk8_0),set_intersection2(esk7_0,esk8_0))
| in(esk3_3(esk7_0,esk8_0,esk7_0),esk7_0) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_96])]) ).
cnf(c_0_104,negated_conjecture,
set_intersection2(esk7_0,esk8_0) = empty_set,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_98]),c_0_86])]) ).
cnf(c_0_105,negated_conjecture,
( in(esk6_2(esk8_0,esk7_0),set_intersection2(esk7_0,esk8_0))
| set_difference(esk7_0,esk8_0) != esk7_0 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_99]),c_0_86]) ).
cnf(c_0_106,plain,
( set_difference(esk7_0,esk8_0) = esk7_0
| ~ in(X1,set_intersection2(esk7_0,esk8_0)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_100]),c_0_101]) ).
cnf(c_0_107,plain,
( in(X1,set_intersection2(X2,X3))
| ~ in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_102]) ).
cnf(c_0_108,plain,
( X1 = set_difference(X2,X3)
| in(esk3_3(X2,X3,X1),X3)
| ~ in(esk3_3(X2,X3,X1),X1)
| ~ in(esk3_3(X2,X3,X1),X2) ),
i_0_17 ).
cnf(c_0_109,plain,
in(esk3_3(esk7_0,esk8_0,esk7_0),esk7_0),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_103,c_0_104]),c_0_80]) ).
cnf(c_0_110,negated_conjecture,
set_difference(esk7_0,esk8_0) != esk7_0,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_105,c_0_104]),c_0_80]) ).
cnf(c_0_111,plain,
( set_difference(esk7_0,esk8_0) = esk7_0
| ~ in(X1,esk8_0)
| ~ in(X1,esk7_0) ),
inference(spm,[status(thm)],[c_0_106,c_0_107]) ).
cnf(c_0_112,plain,
in(esk3_3(esk7_0,esk8_0,esk7_0),esk8_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_108,c_0_109]),c_0_109])]),c_0_110]) ).
cnf(c_0_113,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_112]),c_0_109])]),c_0_110]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU141+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n006.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sun Jun 19 04:04:42 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected complete mode:
% 9.60/2.64 # ENIGMATIC: Solved by autoschedule-lgb:
% 9.60/2.64 # No SInE strategy applied
% 9.60/2.64 # Trying AutoSched0 for 150 seconds
% 9.60/2.64 # AutoSched0-Mode selected heuristic G_E___107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y
% 9.60/2.64 # and selection function SelectMaxLComplexAvoidPosPred.
% 9.60/2.64 #
% 9.60/2.64 # Preprocessing time : 0.017 s
% 9.60/2.64 # Presaturation interreduction done
% 9.60/2.64
% 9.60/2.64 # Proof found!
% 9.60/2.64 # SZS status Theorem
% 9.60/2.64 # SZS output start CNFRefutation
% See solution above
% 9.60/2.64 # Training examples: 0 positive, 0 negative
% 9.60/2.64
% 9.60/2.64 # -------------------------------------------------
% 9.60/2.64 # User time : 0.216 s
% 9.60/2.64 # System time : 0.013 s
% 9.60/2.64 # Total time : 0.229 s
% 9.60/2.64 # Maximum resident set size: 7128 pages
% 9.60/2.64
%------------------------------------------------------------------------------