%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET973+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n011.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 00:15:37 EDT 2022
% Result : Theorem 17.71s 3.56s
% Output : CNFRefutation 17.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 16
% Syntax : Number of clauses : 58 ( 31 unt; 12 nHn; 25 RR)
% Number of literals : 101 ( 45 equ; 38 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 4 con; 0-4 aty)
% Number of variables : 153 ( 15 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_29,plain,
( X1 != set_difference(X2,X3)
| ~ in(X4,X1)
| ~ in(X4,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-az5iou70/input.p',i_0_29) ).
cnf(i_0_21,plain,
( in(esk2_4(X1,X2,X3,X4),X1)
| X3 != cartesian_product2(X1,X2)
| ~ in(X4,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-az5iou70/input.p',i_0_21) ).
cnf(i_0_30,plain,
( in(X1,X2)
| X3 != set_difference(X2,X4)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-az5iou70/input.p',i_0_30) ).
cnf(i_0_25,plain,
( X1 = set_difference(X2,X3)
| in(esk8_3(X2,X3,X1),X1)
| ~ in(esk8_3(X2,X3,X1),X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-az5iou70/input.p',i_0_25) ).
cnf(i_0_26,plain,
( X1 = set_difference(X2,X3)
| in(esk8_3(X2,X3,X1),X1)
| in(esk8_3(X2,X3,X1),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-az5iou70/input.p',i_0_26) ).
cnf(i_0_45,plain,
set_difference(cartesian_product2(X1,X2),cartesian_product2(X1,X3)) = cartesian_product2(X1,set_difference(X2,X3)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-az5iou70/input.p',i_0_45) ).
cnf(i_0_5,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-az5iou70/input.p',i_0_5) ).
cnf(i_0_48,plain,
subset(set_intersection2(X1,X2),X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-az5iou70/input.p',i_0_48) ).
cnf(i_0_27,plain,
( X1 = set_difference(X2,X3)
| in(esk8_3(X2,X3,X1),X3)
| ~ in(esk8_3(X2,X3,X1),X1)
| ~ in(esk8_3(X2,X3,X1),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-az5iou70/input.p',i_0_27) ).
cnf(i_0_23,plain,
( subset(X1,X2)
| in(esk7_2(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-az5iou70/input.p',i_0_23) ).
cnf(i_0_50,plain,
set_union2(set_difference(X1,X2),set_difference(X1,X3)) = set_difference(X1,set_intersection2(X2,X3)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-az5iou70/input.p',i_0_50) ).
cnf(i_0_46,plain,
set_difference(cartesian_product2(X1,X2),cartesian_product2(X3,X2)) = cartesian_product2(set_difference(X1,X3),X2),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-az5iou70/input.p',i_0_46) ).
cnf(i_0_3,plain,
set_union2(X1,X2) = set_union2(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-az5iou70/input.p',i_0_3) ).
cnf(i_0_47,negated_conjecture,
set_union2(cartesian_product2(set_difference(esk11_0,esk13_0),esk12_0),cartesian_product2(esk11_0,set_difference(esk12_0,esk14_0))) != set_difference(cartesian_product2(esk11_0,esk12_0),cartesian_product2(esk13_0,esk14_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-az5iou70/input.p',i_0_47) ).
cnf(i_0_44,plain,
cartesian_product2(set_intersection2(X1,X2),set_intersection2(X3,X4)) = set_intersection2(cartesian_product2(X1,X3),cartesian_product2(X2,X4)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-az5iou70/input.p',i_0_44) ).
cnf(i_0_4,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-az5iou70/input.p',i_0_4) ).
cnf(c_0_67,plain,
( X1 != set_difference(X2,X3)
| ~ in(X4,X1)
| ~ in(X4,X3) ),
i_0_29 ).
cnf(c_0_68,plain,
( in(esk2_4(X1,X2,X3,X4),X1)
| X3 != cartesian_product2(X1,X2)
| ~ in(X4,X3) ),
i_0_21 ).
cnf(c_0_69,plain,
( in(X1,X2)
| X3 != set_difference(X2,X4)
| ~ in(X1,X3) ),
i_0_30 ).
cnf(c_0_70,plain,
( ~ in(X1,set_difference(X2,X3))
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_67]) ).
cnf(c_0_71,plain,
( in(esk2_4(X1,X2,cartesian_product2(X1,X2),X3),X1)
| ~ in(X3,cartesian_product2(X1,X2)) ),
inference(er,[status(thm)],[c_0_68]) ).
cnf(c_0_72,plain,
( in(X1,X2)
| ~ in(X1,set_difference(X2,X3)) ),
inference(er,[status(thm)],[c_0_69]) ).
cnf(c_0_73,plain,
( ~ in(esk2_4(set_difference(X1,X2),X3,cartesian_product2(set_difference(X1,X2),X3),X4),X2)
| ~ in(X4,cartesian_product2(set_difference(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_74,plain,
( in(esk2_4(set_difference(X1,X2),X3,cartesian_product2(set_difference(X1,X2),X3),X4),X1)
| ~ in(X4,cartesian_product2(set_difference(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_72,c_0_71]) ).
cnf(c_0_75,plain,
( X1 = set_difference(X2,X3)
| in(esk8_3(X2,X3,X1),X1)
| ~ in(esk8_3(X2,X3,X1),X3) ),
i_0_25 ).
cnf(c_0_76,plain,
( X1 = set_difference(X2,X3)
| in(esk8_3(X2,X3,X1),X1)
| in(esk8_3(X2,X3,X1),X2) ),
i_0_26 ).
cnf(c_0_77,plain,
set_difference(cartesian_product2(X1,X2),cartesian_product2(X1,X3)) = cartesian_product2(X1,set_difference(X2,X3)),
i_0_45 ).
cnf(c_0_78,plain,
~ in(X1,cartesian_product2(set_difference(X2,X2),X3)),
inference(spm,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_79,plain,
( X1 = set_difference(X2,X2)
| in(esk8_3(X2,X2,X1),X1) ),
inference(spm,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_80,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
i_0_5 ).
cnf(c_0_81,plain,
subset(set_intersection2(X1,X2),X1),
i_0_48 ).
cnf(c_0_82,plain,
( in(X1,cartesian_product2(X2,X3))
| ~ in(X1,cartesian_product2(X2,set_difference(X3,X4))) ),
inference(spm,[status(thm)],[c_0_72,c_0_77]) ).
cnf(c_0_83,plain,
cartesian_product2(set_difference(X1,X1),X2) = set_difference(X3,X3),
inference(spm,[status(thm)],[c_0_78,c_0_79]) ).
cnf(c_0_84,plain,
( X1 = set_difference(X2,X3)
| in(esk8_3(X2,X3,X1),X3)
| ~ in(esk8_3(X2,X3,X1),X1)
| ~ in(esk8_3(X2,X3,X1),X2) ),
i_0_27 ).
cnf(c_0_85,plain,
( set_difference(X1,X2) = X1
| in(esk8_3(X1,X2,X1),X1) ),
inference(ef,[status(thm)],[c_0_76]) ).
cnf(c_0_86,plain,
( set_intersection2(X1,X2) = X1
| ~ subset(X1,set_intersection2(X1,X2)) ),
inference(spm,[status(thm)],[c_0_80,c_0_81]) ).
cnf(c_0_87,plain,
( subset(X1,X2)
| in(esk7_2(X1,X2),X1) ),
i_0_23 ).
cnf(c_0_88,plain,
~ in(X1,set_difference(X2,X2)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_78]) ).
cnf(c_0_89,plain,
( set_difference(X1,X2) = X1
| in(esk8_3(X1,X2,X1),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_85]) ).
cnf(c_0_90,plain,
( set_intersection2(X1,X2) = X1
| in(esk7_2(X1,set_intersection2(X1,X2)),X1) ),
inference(spm,[status(thm)],[c_0_86,c_0_87]) ).
cnf(c_0_91,plain,
set_union2(set_difference(X1,X2),set_difference(X1,X3)) = set_difference(X1,set_intersection2(X2,X3)),
i_0_50 ).
cnf(c_0_92,plain,
set_difference(X1,set_difference(X2,X2)) = X1,
inference(spm,[status(thm)],[c_0_88,c_0_89]) ).
cnf(c_0_93,plain,
set_intersection2(set_difference(X1,X1),X2) = set_difference(X1,X1),
inference(spm,[status(thm)],[c_0_88,c_0_90]) ).
cnf(c_0_94,plain,
set_union2(X1,set_difference(X1,X2)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_92]),c_0_93]),c_0_92]) ).
cnf(c_0_95,plain,
set_difference(X1,X1) = set_difference(X2,X2),
inference(spm,[status(thm)],[c_0_83,c_0_83]) ).
cnf(c_0_96,plain,
set_difference(cartesian_product2(X1,X2),cartesian_product2(X3,X2)) = cartesian_product2(set_difference(X1,X3),X2),
i_0_46 ).
cnf(c_0_97,plain,
set_union2(X1,X2) = set_union2(X2,X1),
i_0_3 ).
cnf(c_0_98,plain,
set_union2(X1,set_difference(X2,X2)) = X1,
inference(spm,[status(thm)],[c_0_94,c_0_95]) ).
cnf(c_0_99,negated_conjecture,
set_union2(cartesian_product2(set_difference(esk11_0,esk13_0),esk12_0),cartesian_product2(esk11_0,set_difference(esk12_0,esk14_0))) != set_difference(cartesian_product2(esk11_0,esk12_0),cartesian_product2(esk13_0,esk14_0)),
i_0_47 ).
cnf(c_0_100,plain,
set_union2(set_difference(cartesian_product2(X1,X2),X3),cartesian_product2(set_difference(X1,X4),X2)) = set_difference(cartesian_product2(X1,X2),set_intersection2(X3,cartesian_product2(X4,X2))),
inference(spm,[status(thm)],[c_0_91,c_0_96]) ).
cnf(c_0_101,plain,
cartesian_product2(set_intersection2(X1,X2),set_intersection2(X3,X4)) = set_intersection2(cartesian_product2(X1,X3),cartesian_product2(X2,X4)),
i_0_44 ).
cnf(c_0_102,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
i_0_4 ).
cnf(c_0_103,plain,
set_union2(set_difference(X1,X1),X2) = X2,
inference(spm,[status(thm)],[c_0_97,c_0_98]) ).
cnf(c_0_104,negated_conjecture,
set_union2(cartesian_product2(esk11_0,set_difference(esk12_0,esk14_0)),cartesian_product2(set_difference(esk11_0,esk13_0),esk12_0)) != set_difference(cartesian_product2(esk11_0,esk12_0),cartesian_product2(esk13_0,esk14_0)),
inference(rw,[status(thm)],[c_0_99,c_0_97]) ).
cnf(c_0_105,plain,
set_union2(cartesian_product2(X1,set_difference(X2,X3)),cartesian_product2(set_difference(X1,X4),X2)) = set_difference(cartesian_product2(X1,X2),set_intersection2(cartesian_product2(X1,X3),cartesian_product2(X4,X2))),
inference(spm,[status(thm)],[c_0_100,c_0_77]) ).
cnf(c_0_106,plain,
set_intersection2(cartesian_product2(X1,X2),cartesian_product2(X3,X4)) = set_intersection2(cartesian_product2(X1,X4),cartesian_product2(X3,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_101,c_0_102]),c_0_101]) ).
cnf(c_0_107,plain,
set_difference(X1,set_intersection2(X1,X2)) = set_difference(X1,X2),
inference(spm,[status(thm)],[c_0_91,c_0_103]) ).
cnf(c_0_108,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_104,c_0_105]),c_0_106]),c_0_107])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SET973+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n011.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 : Sat Jul 9 23:57:42 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 17.71/3.56 # ENIGMATIC: Solved by autoschedule:
% 17.71/3.56 # No SInE strategy applied
% 17.71/3.56 # Trying AutoSched0 for 150 seconds
% 17.71/3.56 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S032I
% 17.71/3.56 # and selection function SelectUnlessUniqMax.
% 17.71/3.56 #
% 17.71/3.56 # Preprocessing time : 0.025 s
% 17.71/3.56 # Presaturation interreduction done
% 17.71/3.56
% 17.71/3.56 # Proof found!
% 17.71/3.56 # SZS status Theorem
% 17.71/3.56 # SZS output start CNFRefutation
% See solution above
% 17.71/3.56 # Training examples: 0 positive, 0 negative
% 17.71/3.56
% 17.71/3.56 # -------------------------------------------------
% 17.71/3.56 # User time : 1.250 s
% 17.71/3.56 # System time : 0.083 s
% 17.71/3.56 # Total time : 1.333 s
% 17.71/3.56 # Maximum resident set size: 7116 pages
% 17.71/3.56
%------------------------------------------------------------------------------