%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU343+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n029.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:41:00 EDT 2022
% Result : Theorem 14.52s 4.50s
% Output : CNFRefutation 14.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 24
% Syntax : Number of clauses : 85 ( 34 unt; 6 nHn; 70 RR)
% Number of literals : 190 ( 51 equ; 105 neg)
% Maximal clause size : 8 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 13 ( 11 usr; 1 prp; 0-3 aty)
% Number of functors : 17 ( 17 usr; 3 con; 0-6 aty)
% Number of variables : 123 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_503,plain,
( join_semilatt_str(X1)
| ~ latt_str(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y1w1uqxy/lgb.p',i_0_503) ).
cnf(i_0_468,plain,
latt_str(boole_lattice(X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y1w1uqxy/lgb.p',i_0_468) ).
cnf(i_0_175,plain,
( powerset(X1) = the_carrier(X2)
| X2 != boole_lattice(X1)
| ~ latt_str(X2)
| ~ strict_latt_str(X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y1w1uqxy/lgb.p',i_0_175) ).
cnf(i_0_546,plain,
strict_latt_str(boole_lattice(X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y1w1uqxy/lgb.p',i_0_546) ).
cnf(i_0_512,plain,
( relation_of2_as_subset(the_L_join(X1),cartesian_product2(the_carrier(X1),the_carrier(X1)),the_carrier(X1))
| ~ join_semilatt_str(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y1w1uqxy/lgb.p',i_0_512) ).
cnf(i_0_2248,negated_conjecture,
element(esk395_0,the_carrier(boole_lattice(esk393_0))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y1w1uqxy/lgb.p',i_0_2248) ).
cnf(i_0_504,plain,
( meet_semilatt_str(X1)
| ~ latt_str(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y1w1uqxy/lgb.p',i_0_504) ).
cnf(i_0_841,plain,
( relation_of2(X1,X2,X3)
| ~ relation_of2_as_subset(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y1w1uqxy/lgb.p',i_0_841) ).
cnf(i_0_514,plain,
( function(the_L_join(X1))
| ~ join_semilatt_str(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y1w1uqxy/lgb.p',i_0_514) ).
cnf(i_0_513,plain,
( quasi_total(the_L_join(X1),cartesian_product2(the_carrier(X1),the_carrier(X1)),the_carrier(X1))
| ~ join_semilatt_str(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y1w1uqxy/lgb.p',i_0_513) ).
cnf(i_0_176,plain,
( apply_binary_as_element(the_carrier(X1),the_carrier(X1),the_carrier(X1),the_L_join(X1),X2,X3) = join(X1,X2,X3)
| empty_carrier(X1)
| ~ join_semilatt_str(X1)
| ~ element(X3,the_carrier(X1))
| ~ element(X2,the_carrier(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y1w1uqxy/lgb.p',i_0_176) ).
cnf(i_0_547,plain,
~ empty_carrier(boole_lattice(X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y1w1uqxy/lgb.p',i_0_547) ).
cnf(i_0_174,plain,
( apply_binary(the_L_join(X1),X2,X3) = subset_union2(X4,X2,X3)
| X1 != boole_lattice(X4)
| ~ latt_str(X1)
| ~ strict_latt_str(X1)
| ~ element(X3,powerset(X4))
| ~ element(X2,powerset(X4)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y1w1uqxy/lgb.p',i_0_174) ).
cnf(i_0_834,plain,
( subset_union2(X1,X2,X3) = set_union2(X2,X3)
| ~ element(X3,powerset(X1))
| ~ element(X2,powerset(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y1w1uqxy/lgb.p',i_0_834) ).
cnf(i_0_2249,negated_conjecture,
element(esk394_0,the_carrier(boole_lattice(esk393_0))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y1w1uqxy/lgb.p',i_0_2249) ).
cnf(i_0_507,plain,
( relation_of2_as_subset(the_L_meet(X1),cartesian_product2(the_carrier(X1),the_carrier(X1)),the_carrier(X1))
| ~ meet_semilatt_str(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y1w1uqxy/lgb.p',i_0_507) ).
cnf(i_0_837,plain,
( subset_intersection2(X1,X2,X3) = set_difference(X2,set_difference(X2,X3))
| ~ element(X3,powerset(X1))
| ~ element(X2,powerset(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y1w1uqxy/lgb.p',i_0_837) ).
cnf(i_0_830,plain,
( apply_binary_as_element(X1,X2,X3,X4,X5,X6) = apply_binary(X4,X5,X6)
| empty(X2)
| empty(X1)
| ~ function(X4)
| ~ element(X6,X2)
| ~ element(X5,X1)
| ~ quasi_total(X4,cartesian_product2(X1,X2),X3)
| ~ relation_of2(X4,cartesian_product2(X1,X2),X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y1w1uqxy/lgb.p',i_0_830) ).
cnf(i_0_561,plain,
~ empty(powerset(X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y1w1uqxy/lgb.p',i_0_561) ).
cnf(i_0_509,plain,
( function(the_L_meet(X1))
| ~ meet_semilatt_str(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y1w1uqxy/lgb.p',i_0_509) ).
cnf(i_0_508,plain,
( quasi_total(the_L_meet(X1),cartesian_product2(the_carrier(X1),the_carrier(X1)),the_carrier(X1))
| ~ meet_semilatt_str(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y1w1uqxy/lgb.p',i_0_508) ).
cnf(i_0_248,plain,
( apply_binary_as_element(the_carrier(X1),the_carrier(X1),the_carrier(X1),the_L_meet(X1),X2,X3) = meet(X1,X2,X3)
| empty_carrier(X1)
| ~ meet_semilatt_str(X1)
| ~ element(X3,the_carrier(X1))
| ~ element(X2,the_carrier(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y1w1uqxy/lgb.p',i_0_248) ).
cnf(i_0_173,plain,
( apply_binary(the_L_meet(X1),X2,X3) = subset_intersection2(X4,X2,X3)
| X1 != boole_lattice(X4)
| ~ latt_str(X1)
| ~ strict_latt_str(X1)
| ~ element(X3,powerset(X4))
| ~ element(X2,powerset(X4)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y1w1uqxy/lgb.p',i_0_173) ).
cnf(i_0_2247,negated_conjecture,
( join(boole_lattice(esk393_0),esk394_0,esk395_0) != set_union2(esk394_0,esk395_0)
| meet(boole_lattice(esk393_0),esk394_0,esk395_0) != set_difference(esk394_0,set_difference(esk394_0,esk395_0)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y1w1uqxy/lgb.p',i_0_2247) ).
cnf(c_0_2274,plain,
( join_semilatt_str(X1)
| ~ latt_str(X1) ),
i_0_503 ).
cnf(c_0_2275,plain,
latt_str(boole_lattice(X1)),
i_0_468 ).
cnf(c_0_2276,plain,
( powerset(X1) = the_carrier(X2)
| X2 != boole_lattice(X1)
| ~ latt_str(X2)
| ~ strict_latt_str(X2) ),
i_0_175 ).
cnf(c_0_2277,plain,
strict_latt_str(boole_lattice(X1)),
i_0_546 ).
cnf(c_0_2278,plain,
( relation_of2_as_subset(the_L_join(X1),cartesian_product2(the_carrier(X1),the_carrier(X1)),the_carrier(X1))
| ~ join_semilatt_str(X1) ),
i_0_512 ).
cnf(c_0_2279,plain,
join_semilatt_str(boole_lattice(X1)),
inference(spm,[status(thm)],[c_0_2274,c_0_2275]) ).
cnf(c_0_2280,plain,
the_carrier(boole_lattice(X1)) = powerset(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_2276]),c_0_2277]),c_0_2275])]) ).
cnf(c_0_2281,negated_conjecture,
element(esk395_0,the_carrier(boole_lattice(esk393_0))),
i_0_2248 ).
cnf(c_0_2282,plain,
( meet_semilatt_str(X1)
| ~ latt_str(X1) ),
i_0_504 ).
cnf(c_0_2283,plain,
( relation_of2(X1,X2,X3)
| ~ relation_of2_as_subset(X1,X2,X3) ),
i_0_841 ).
cnf(c_0_2284,plain,
relation_of2_as_subset(the_L_join(boole_lattice(X1)),cartesian_product2(powerset(X1),powerset(X1)),powerset(X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2278,c_0_2279]),c_0_2280]),c_0_2280]),c_0_2280]) ).
cnf(c_0_2285,plain,
( function(the_L_join(X1))
| ~ join_semilatt_str(X1) ),
i_0_514 ).
cnf(c_0_2286,plain,
( quasi_total(the_L_join(X1),cartesian_product2(the_carrier(X1),the_carrier(X1)),the_carrier(X1))
| ~ join_semilatt_str(X1) ),
i_0_513 ).
cnf(c_0_2287,plain,
( apply_binary_as_element(the_carrier(X1),the_carrier(X1),the_carrier(X1),the_L_join(X1),X2,X3) = join(X1,X2,X3)
| empty_carrier(X1)
| ~ join_semilatt_str(X1)
| ~ element(X3,the_carrier(X1))
| ~ element(X2,the_carrier(X1)) ),
i_0_176 ).
cnf(c_0_2288,plain,
~ empty_carrier(boole_lattice(X1)),
i_0_547 ).
cnf(c_0_2289,plain,
( apply_binary(the_L_join(X1),X2,X3) = subset_union2(X4,X2,X3)
| X1 != boole_lattice(X4)
| ~ latt_str(X1)
| ~ strict_latt_str(X1)
| ~ element(X3,powerset(X4))
| ~ element(X2,powerset(X4)) ),
i_0_174 ).
cnf(c_0_2290,plain,
( subset_union2(X1,X2,X3) = set_union2(X2,X3)
| ~ element(X3,powerset(X1))
| ~ element(X2,powerset(X1)) ),
i_0_834 ).
cnf(c_0_2291,negated_conjecture,
element(esk395_0,powerset(esk393_0)),
inference(rw,[status(thm)],[c_0_2281,c_0_2280]) ).
cnf(c_0_2292,negated_conjecture,
element(esk394_0,the_carrier(boole_lattice(esk393_0))),
i_0_2249 ).
cnf(c_0_2293,plain,
( relation_of2_as_subset(the_L_meet(X1),cartesian_product2(the_carrier(X1),the_carrier(X1)),the_carrier(X1))
| ~ meet_semilatt_str(X1) ),
i_0_507 ).
cnf(c_0_2294,plain,
meet_semilatt_str(boole_lattice(X1)),
inference(spm,[status(thm)],[c_0_2282,c_0_2275]) ).
cnf(c_0_2295,plain,
( subset_intersection2(X1,X2,X3) = set_difference(X2,set_difference(X2,X3))
| ~ element(X3,powerset(X1))
| ~ element(X2,powerset(X1)) ),
i_0_837 ).
cnf(c_0_2296,plain,
( apply_binary_as_element(X1,X2,X3,X4,X5,X6) = apply_binary(X4,X5,X6)
| empty(X2)
| empty(X1)
| ~ function(X4)
| ~ element(X6,X2)
| ~ element(X5,X1)
| ~ quasi_total(X4,cartesian_product2(X1,X2),X3)
| ~ relation_of2(X4,cartesian_product2(X1,X2),X3) ),
i_0_830 ).
cnf(c_0_2297,plain,
relation_of2(the_L_join(boole_lattice(X1)),cartesian_product2(powerset(X1),powerset(X1)),powerset(X1)),
inference(spm,[status(thm)],[c_0_2283,c_0_2284]) ).
cnf(c_0_2298,plain,
function(the_L_join(boole_lattice(X1))),
inference(spm,[status(thm)],[c_0_2285,c_0_2279]) ).
cnf(c_0_2299,plain,
quasi_total(the_L_join(boole_lattice(X1)),cartesian_product2(powerset(X1),powerset(X1)),powerset(X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2286,c_0_2279]),c_0_2280]),c_0_2280]),c_0_2280]) ).
cnf(c_0_2300,plain,
~ empty(powerset(X1)),
i_0_561 ).
cnf(c_0_2301,plain,
( apply_binary_as_element(powerset(X1),powerset(X1),powerset(X1),the_L_join(boole_lattice(X1)),X2,X3) = join(boole_lattice(X1),X2,X3)
| ~ element(X3,powerset(X1))
| ~ element(X2,powerset(X1)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2287,c_0_2280]),c_0_2279])]),c_0_2288]) ).
cnf(c_0_2302,plain,
( apply_binary(the_L_join(boole_lattice(X1)),X2,X3) = subset_union2(X1,X2,X3)
| ~ element(X3,powerset(X1))
| ~ element(X2,powerset(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_2289]),c_0_2277]),c_0_2275])]) ).
cnf(c_0_2303,negated_conjecture,
( subset_union2(esk393_0,X1,esk395_0) = set_union2(X1,esk395_0)
| ~ element(X1,powerset(esk393_0)) ),
inference(spm,[status(thm)],[c_0_2290,c_0_2291]) ).
cnf(c_0_2304,negated_conjecture,
element(esk394_0,powerset(esk393_0)),
inference(rw,[status(thm)],[c_0_2292,c_0_2280]) ).
cnf(c_0_2305,plain,
relation_of2_as_subset(the_L_meet(boole_lattice(X1)),cartesian_product2(powerset(X1),powerset(X1)),powerset(X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2293,c_0_2294]),c_0_2280]),c_0_2280]),c_0_2280]) ).
cnf(c_0_2306,plain,
( function(the_L_meet(X1))
| ~ meet_semilatt_str(X1) ),
i_0_509 ).
cnf(c_0_2307,plain,
( quasi_total(the_L_meet(X1),cartesian_product2(the_carrier(X1),the_carrier(X1)),the_carrier(X1))
| ~ meet_semilatt_str(X1) ),
i_0_508 ).
cnf(c_0_2308,plain,
( apply_binary_as_element(the_carrier(X1),the_carrier(X1),the_carrier(X1),the_L_meet(X1),X2,X3) = meet(X1,X2,X3)
| empty_carrier(X1)
| ~ meet_semilatt_str(X1)
| ~ element(X3,the_carrier(X1))
| ~ element(X2,the_carrier(X1)) ),
i_0_248 ).
cnf(c_0_2309,plain,
( apply_binary(the_L_meet(X1),X2,X3) = subset_intersection2(X4,X2,X3)
| X1 != boole_lattice(X4)
| ~ latt_str(X1)
| ~ strict_latt_str(X1)
| ~ element(X3,powerset(X4))
| ~ element(X2,powerset(X4)) ),
i_0_173 ).
cnf(c_0_2310,negated_conjecture,
( set_difference(X1,set_difference(X1,esk395_0)) = subset_intersection2(esk393_0,X1,esk395_0)
| ~ element(X1,powerset(esk393_0)) ),
inference(spm,[status(thm)],[c_0_2295,c_0_2291]) ).
cnf(c_0_2311,plain,
( apply_binary_as_element(powerset(X1),powerset(X1),powerset(X1),the_L_join(boole_lattice(X1)),X2,X3) = apply_binary(the_L_join(boole_lattice(X1)),X2,X3)
| ~ element(X3,powerset(X1))
| ~ element(X2,powerset(X1)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2296,c_0_2297]),c_0_2298]),c_0_2299])]),c_0_2300]) ).
cnf(c_0_2312,negated_conjecture,
( apply_binary_as_element(powerset(esk393_0),powerset(esk393_0),powerset(esk393_0),the_L_join(boole_lattice(esk393_0)),X1,esk395_0) = join(boole_lattice(esk393_0),X1,esk395_0)
| ~ element(X1,powerset(esk393_0)) ),
inference(spm,[status(thm)],[c_0_2301,c_0_2291]) ).
cnf(c_0_2313,negated_conjecture,
( apply_binary(the_L_join(boole_lattice(esk393_0)),X1,esk395_0) = subset_union2(esk393_0,X1,esk395_0)
| ~ element(X1,powerset(esk393_0)) ),
inference(spm,[status(thm)],[c_0_2302,c_0_2291]) ).
cnf(c_0_2314,negated_conjecture,
subset_union2(esk393_0,esk394_0,esk395_0) = set_union2(esk394_0,esk395_0),
inference(spm,[status(thm)],[c_0_2303,c_0_2304]) ).
cnf(c_0_2315,plain,
relation_of2(the_L_meet(boole_lattice(X1)),cartesian_product2(powerset(X1),powerset(X1)),powerset(X1)),
inference(spm,[status(thm)],[c_0_2283,c_0_2305]) ).
cnf(c_0_2316,plain,
function(the_L_meet(boole_lattice(X1))),
inference(spm,[status(thm)],[c_0_2306,c_0_2294]) ).
cnf(c_0_2317,plain,
quasi_total(the_L_meet(boole_lattice(X1)),cartesian_product2(powerset(X1),powerset(X1)),powerset(X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2307,c_0_2294]),c_0_2280]),c_0_2280]),c_0_2280]) ).
cnf(c_0_2318,plain,
( apply_binary_as_element(powerset(X1),powerset(X1),powerset(X1),the_L_meet(boole_lattice(X1)),X2,X3) = meet(boole_lattice(X1),X2,X3)
| ~ element(X3,powerset(X1))
| ~ element(X2,powerset(X1)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2308,c_0_2280]),c_0_2294])]),c_0_2288]) ).
cnf(c_0_2319,plain,
( apply_binary(the_L_meet(boole_lattice(X1)),X2,X3) = subset_intersection2(X1,X2,X3)
| ~ element(X3,powerset(X1))
| ~ element(X2,powerset(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_2309]),c_0_2277]),c_0_2275])]) ).
cnf(c_0_2320,negated_conjecture,
( join(boole_lattice(esk393_0),esk394_0,esk395_0) != set_union2(esk394_0,esk395_0)
| meet(boole_lattice(esk393_0),esk394_0,esk395_0) != set_difference(esk394_0,set_difference(esk394_0,esk395_0)) ),
i_0_2247 ).
cnf(c_0_2321,negated_conjecture,
set_difference(esk394_0,set_difference(esk394_0,esk395_0)) = subset_intersection2(esk393_0,esk394_0,esk395_0),
inference(spm,[status(thm)],[c_0_2310,c_0_2304]) ).
cnf(c_0_2322,negated_conjecture,
( apply_binary_as_element(powerset(esk393_0),powerset(esk393_0),powerset(esk393_0),the_L_join(boole_lattice(esk393_0)),X1,esk395_0) = apply_binary(the_L_join(boole_lattice(esk393_0)),X1,esk395_0)
| ~ element(X1,powerset(esk393_0)) ),
inference(spm,[status(thm)],[c_0_2311,c_0_2291]) ).
cnf(c_0_2323,negated_conjecture,
apply_binary_as_element(powerset(esk393_0),powerset(esk393_0),powerset(esk393_0),the_L_join(boole_lattice(esk393_0)),esk394_0,esk395_0) = join(boole_lattice(esk393_0),esk394_0,esk395_0),
inference(spm,[status(thm)],[c_0_2312,c_0_2304]) ).
cnf(c_0_2324,negated_conjecture,
apply_binary(the_L_join(boole_lattice(esk393_0)),esk394_0,esk395_0) = set_union2(esk394_0,esk395_0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2313,c_0_2304]),c_0_2314]) ).
cnf(c_0_2325,plain,
( apply_binary_as_element(powerset(X1),powerset(X1),powerset(X1),the_L_meet(boole_lattice(X1)),X2,X3) = apply_binary(the_L_meet(boole_lattice(X1)),X2,X3)
| ~ element(X3,powerset(X1))
| ~ element(X2,powerset(X1)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2296,c_0_2315]),c_0_2316]),c_0_2317])]),c_0_2300]) ).
cnf(c_0_2326,negated_conjecture,
( apply_binary_as_element(powerset(esk393_0),powerset(esk393_0),powerset(esk393_0),the_L_meet(boole_lattice(esk393_0)),X1,esk395_0) = meet(boole_lattice(esk393_0),X1,esk395_0)
| ~ element(X1,powerset(esk393_0)) ),
inference(spm,[status(thm)],[c_0_2318,c_0_2291]) ).
cnf(c_0_2327,negated_conjecture,
( apply_binary(the_L_meet(boole_lattice(esk393_0)),X1,esk395_0) = subset_intersection2(esk393_0,X1,esk395_0)
| ~ element(X1,powerset(esk393_0)) ),
inference(spm,[status(thm)],[c_0_2319,c_0_2291]) ).
cnf(c_0_2328,negated_conjecture,
( meet(boole_lattice(esk393_0),esk394_0,esk395_0) != subset_intersection2(esk393_0,esk394_0,esk395_0)
| join(boole_lattice(esk393_0),esk394_0,esk395_0) != set_union2(esk394_0,esk395_0) ),
inference(rw,[status(thm)],[c_0_2320,c_0_2321]) ).
cnf(c_0_2329,negated_conjecture,
join(boole_lattice(esk393_0),esk394_0,esk395_0) = set_union2(esk394_0,esk395_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2322,c_0_2304]),c_0_2323]),c_0_2324]) ).
cnf(c_0_2330,negated_conjecture,
( apply_binary_as_element(powerset(esk393_0),powerset(esk393_0),powerset(esk393_0),the_L_meet(boole_lattice(esk393_0)),X1,esk395_0) = apply_binary(the_L_meet(boole_lattice(esk393_0)),X1,esk395_0)
| ~ element(X1,powerset(esk393_0)) ),
inference(spm,[status(thm)],[c_0_2325,c_0_2291]) ).
cnf(c_0_2331,negated_conjecture,
apply_binary_as_element(powerset(esk393_0),powerset(esk393_0),powerset(esk393_0),the_L_meet(boole_lattice(esk393_0)),esk394_0,esk395_0) = meet(boole_lattice(esk393_0),esk394_0,esk395_0),
inference(spm,[status(thm)],[c_0_2326,c_0_2304]) ).
cnf(c_0_2332,negated_conjecture,
apply_binary(the_L_meet(boole_lattice(esk393_0)),esk394_0,esk395_0) = subset_intersection2(esk393_0,esk394_0,esk395_0),
inference(spm,[status(thm)],[c_0_2327,c_0_2304]) ).
cnf(c_0_2333,negated_conjecture,
meet(boole_lattice(esk393_0),esk394_0,esk395_0) != subset_intersection2(esk393_0,esk394_0,esk395_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_2328,c_0_2329])]) ).
cnf(c_0_2334,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2330,c_0_2304]),c_0_2331]),c_0_2332]),c_0_2333]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : SEU343+2 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.11 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.31 % Computer : n029.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 600
% 0.11/0.31 % DateTime : Sun Jun 19 05:16:46 EDT 2022
% 0.16/0.31 % CPUTime :
% 0.16/0.43 # ENIGMATIC: Selected SinE mode:
% 0.16/0.46 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.16/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.16/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.16/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 14.52/4.50 # ENIGMATIC: Solved by autoschedule-lgb:
% 14.52/4.50 # No SInE strategy applied
% 14.52/4.50 # Trying AutoSched0 for 150 seconds
% 14.52/4.50 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S02CN
% 14.52/4.50 # and selection function SelectAntiRROptimalLit.
% 14.52/4.50 #
% 14.52/4.50 # Preprocessing time : 0.024 s
% 14.52/4.50 # Presaturation interreduction done
% 14.52/4.50
% 14.52/4.50 # Proof found!
% 14.52/4.50 # SZS status Theorem
% 14.52/4.50 # SZS output start CNFRefutation
% See solution above
% 14.52/4.50 # Training examples: 0 positive, 0 negative
% 14.52/4.50
% 14.52/4.50 # -------------------------------------------------
% 14.52/4.50 # User time : 0.040 s
% 14.52/4.50 # System time : 0.002 s
% 14.52/4.50 # Total time : 0.042 s
% 14.52/4.50 # Maximum resident set size: 7248 pages
% 14.52/4.50
%------------------------------------------------------------------------------